YES Ultimate: Cannot open display: This is Ultimate 0.1.24-8dc7c08-m [2020-06-22 02:52:41,120 INFO L170 SettingsManager]: Resetting all preferences to default values... [2020-06-22 02:52:41,122 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2020-06-22 02:52:41,133 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-06-22 02:52:41,134 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-06-22 02:52:41,135 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-06-22 02:52:41,136 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-06-22 02:52:41,138 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2020-06-22 02:52:41,139 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-06-22 02:52:41,140 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-06-22 02:52:41,141 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-06-22 02:52:41,141 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-06-22 02:52:41,142 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-06-22 02:52:41,143 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-06-22 02:52:41,144 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-06-22 02:52:41,144 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-06-22 02:52:41,145 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-06-22 02:52:41,147 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-06-22 02:52:41,149 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2020-06-22 02:52:41,150 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-06-22 02:52:41,151 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-06-22 02:52:41,152 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-06-22 02:52:41,154 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-06-22 02:52:41,155 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-06-22 02:52:41,155 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-06-22 02:52:41,156 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-06-22 02:52:41,156 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-06-22 02:52:41,157 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-06-22 02:52:41,157 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-06-22 02:52:41,158 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-06-22 02:52:41,159 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-06-22 02:52:41,159 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2020-06-22 02:52:41,160 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-06-22 02:52:41,160 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2020-06-22 02:52:41,161 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-06-22 02:52:41,161 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-06-22 02:52:41,161 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2020-06-22 02:52:41,162 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2020-06-22 02:52:41,163 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2020-06-22 02:52:41,163 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox2/solver/bin/./../termcomp2017.epf [2020-06-22 02:52:41,177 INFO L110 SettingsManager]: Loading preferences was successful [2020-06-22 02:52:41,177 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2020-06-22 02:52:41,178 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-06-22 02:52:41,179 INFO L133 SettingsManager]: * Rewrite not-equals=true [2020-06-22 02:52:41,179 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2020-06-22 02:52:41,179 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE [2020-06-22 02:52:41,179 INFO L133 SettingsManager]: * Use SBE=true [2020-06-22 02:52:41,179 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-06-22 02:52:41,179 INFO L133 SettingsManager]: * Use old map elimination=false [2020-06-22 02:52:41,180 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2020-06-22 02:52:41,180 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION [2020-06-22 02:52:41,180 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2020-06-22 02:52:41,180 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-06-22 02:52:41,180 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true [2020-06-22 02:52:41,180 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 02:52:41,181 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-06-22 02:52:41,181 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-06-22 02:52:41,181 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2020-06-22 02:52:41,181 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2020-06-22 02:52:41,181 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-06-22 02:52:41,181 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE [2020-06-22 02:52:41,182 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-06-22 02:52:41,182 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-06-22 02:52:41,182 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-06-22 02:52:41,182 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-06-22 02:52:41,182 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-06-22 02:52:41,183 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-06-22 02:52:41,183 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2020-06-22 02:52:41,183 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-06-22 02:52:41,208 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-06-22 02:52:41,222 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-06-22 02:52:41,225 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-06-22 02:52:41,227 INFO L271 PluginConnector]: Initializing CDTParser... [2020-06-22 02:52:41,227 INFO L276 PluginConnector]: CDTParser initialized [2020-06-22 02:52:41,228 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox2/benchmark/theBenchmark.c [2020-06-22 02:52:41,296 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox2/tmp/21cbb0c328fd4d5982d8cc36caca1beb/FLAG2ff3ad480 [2020-06-22 02:52:41,637 INFO L307 CDTParser]: Found 1 translation units. [2020-06-22 02:52:41,637 INFO L161 CDTParser]: Scanning /export/starexec/sandbox2/benchmark/theBenchmark.c [2020-06-22 02:52:41,638 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. [2020-06-22 02:52:41,645 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox2/tmp/21cbb0c328fd4d5982d8cc36caca1beb/FLAG2ff3ad480 [2020-06-22 02:52:42,036 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox2/tmp/21cbb0c328fd4d5982d8cc36caca1beb [2020-06-22 02:52:42,048 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-06-22 02:52:42,049 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. [2020-06-22 02:52:42,050 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-06-22 02:52:42,050 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-06-22 02:52:42,054 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2020-06-22 02:52:42,055 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.06 02:52:42" (1/1) ... [2020-06-22 02:52:42,058 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4cbdf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 02:52:42, skipping insertion in model container [2020-06-22 02:52:42,058 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.06 02:52:42" (1/1) ... [2020-06-22 02:52:42,066 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-06-22 02:52:42,083 INFO L176 MainTranslator]: Built tables and reachable declarations [2020-06-22 02:52:42,246 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-06-22 02:52:42,312 INFO L191 MainTranslator]: Completed pre-run [2020-06-22 02:52:42,331 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-06-22 02:52:42,347 INFO L195 MainTranslator]: Completed translation [2020-06-22 02:52:42,347 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 02:52:42 WrapperNode [2020-06-22 02:52:42,347 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-06-22 02:52:42,348 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-06-22 02:52:42,348 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-06-22 02:52:42,349 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2020-06-22 02:52:42,358 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 02:52:42" (1/1) ... [2020-06-22 02:52:42,367 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 02:52:42" (1/1) ... [2020-06-22 02:52:42,391 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-06-22 02:52:42,391 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-06-22 02:52:42,391 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-06-22 02:52:42,391 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2020-06-22 02:52:42,401 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 02:52:42" (1/1) ... [2020-06-22 02:52:42,401 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 02:52:42" (1/1) ... [2020-06-22 02:52:42,403 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 02:52:42" (1/1) ... [2020-06-22 02:52:42,403 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 02:52:42" (1/1) ... [2020-06-22 02:52:42,409 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 02:52:42" (1/1) ... [2020-06-22 02:52:42,413 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 02:52:42" (1/1) ... [2020-06-22 02:52:42,414 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 02:52:42" (1/1) ... [2020-06-22 02:52:42,417 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-06-22 02:52:42,417 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-06-22 02:52:42,417 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-06-22 02:52:42,417 INFO L276 PluginConnector]: RCFGBuilder initialized [2020-06-22 02:52:42,418 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 02:52:42" (1/1) ... No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-06-22 02:52:42,484 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-06-22 02:52:42,484 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-06-22 02:52:42,484 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-06-22 02:52:42,485 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-06-22 02:52:42,485 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-06-22 02:52:42,779 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-06-22 02:52:42,779 INFO L286 CfgBuilder]: Removed 11 assue(true) statements. [2020-06-22 02:52:42,780 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 02:52:42 BoogieIcfgContainer [2020-06-22 02:52:42,781 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-06-22 02:52:42,781 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- [2020-06-22 02:52:42,781 INFO L271 PluginConnector]: Initializing BlockEncodingV2... [2020-06-22 02:52:42,784 INFO L276 PluginConnector]: BlockEncodingV2 initialized [2020-06-22 02:52:42,785 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 02:52:42" (1/1) ... [2020-06-22 02:52:42,806 INFO L313 BlockEncoder]: Initial Icfg 43 locations, 48 edges [2020-06-22 02:52:42,808 INFO L258 BlockEncoder]: Using Remove infeasible edges [2020-06-22 02:52:42,808 INFO L263 BlockEncoder]: Using Maximize final states [2020-06-22 02:52:42,809 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false [2020-06-22 02:52:42,809 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE [2020-06-22 02:52:42,811 INFO L296 BlockEncoder]: Using Remove sink states [2020-06-22 02:52:42,812 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true [2020-06-22 02:52:42,812 INFO L179 BlockEncoder]: Using Rewrite not-equals [2020-06-22 02:52:42,838 INFO L185 BlockEncoder]: Using Use SBE [2020-06-22 02:52:42,869 INFO L200 BlockEncoder]: SBE split 19 edges [2020-06-22 02:52:42,874 INFO L70 emoveInfeasibleEdges]: Removed 1 edges and 0 locations because of local infeasibility [2020-06-22 02:52:42,876 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-22 02:52:42,916 INFO L100 BaseMinimizeStates]: Removed 20 edges and 10 locations by large block encoding [2020-06-22 02:52:42,918 INFO L70 RemoveSinkStates]: Removed 5 edges and 3 locations by removing sink states [2020-06-22 02:52:42,920 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-06-22 02:52:42,920 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-22 02:52:42,920 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding [2020-06-22 02:52:42,921 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-06-22 02:52:42,921 INFO L313 BlockEncoder]: Encoded RCFG 30 locations, 53 edges [2020-06-22 02:52:42,922 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 02:52:42 BasicIcfg [2020-06-22 02:52:42,922 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- [2020-06-22 02:52:42,923 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-06-22 02:52:42,923 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-06-22 02:52:42,926 INFO L276 PluginConnector]: TraceAbstraction initialized [2020-06-22 02:52:42,927 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.06 02:52:42" (1/4) ... [2020-06-22 02:52:42,927 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3eb7382 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 02:52:42, skipping insertion in model container [2020-06-22 02:52:42,928 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 02:52:42" (2/4) ... [2020-06-22 02:52:42,928 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3eb7382 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 02:52:42, skipping insertion in model container [2020-06-22 02:52:42,928 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 02:52:42" (3/4) ... [2020-06-22 02:52:42,929 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3eb7382 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 02:52:42, skipping insertion in model container [2020-06-22 02:52:42,929 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 02:52:42" (4/4) ... [2020-06-22 02:52:42,930 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-06-22 02:52:42,940 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2020-06-22 02:52:42,948 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 14 error locations. [2020-06-22 02:52:42,965 INFO L257 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2020-06-22 02:52:42,994 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2020-06-22 02:52:42,995 INFO L382 AbstractCegarLoop]: Interprodecural is true [2020-06-22 02:52:42,995 INFO L383 AbstractCegarLoop]: Hoare is true [2020-06-22 02:52:42,995 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2020-06-22 02:52:42,995 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-06-22 02:52:42,995 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-06-22 02:52:42,996 INFO L387 AbstractCegarLoop]: Difference is false [2020-06-22 02:52:42,996 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-06-22 02:52:42,996 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-06-22 02:52:43,011 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states. [2020-06-22 02:52:43,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-06-22 02:52:43,016 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 02:52:43,017 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-06-22 02:52:43,018 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-06-22 02:52:43,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 02:52:43,023 INFO L82 PathProgramCache]: Analyzing trace with hash 6584673, now seen corresponding path program 1 times [2020-06-22 02:52:43,025 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 02:52:43,025 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 02:52:43,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:52:43,078 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 02:52:43,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:52:43,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 02:52:43,177 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 02:52:43,180 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 02:52:43,180 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 02:52:43,184 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 02:52:43,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 02:52:43,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 02:52:43,201 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 3 states. [2020-06-22 02:52:43,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 02:52:43,337 INFO L93 Difference]: Finished difference Result 30 states and 53 transitions. [2020-06-22 02:52:43,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 02:52:43,339 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-06-22 02:52:43,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 02:52:43,352 INFO L225 Difference]: With dead ends: 30 [2020-06-22 02:52:43,352 INFO L226 Difference]: Without dead ends: 28 [2020-06-22 02:52:43,356 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 02:52:43,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2020-06-22 02:52:43,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2020-06-22 02:52:43,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-06-22 02:52:43,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 49 transitions. [2020-06-22 02:52:43,395 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 49 transitions. Word has length 4 [2020-06-22 02:52:43,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 02:52:43,395 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 49 transitions. [2020-06-22 02:52:43,395 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 02:52:43,395 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 49 transitions. [2020-06-22 02:52:43,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-06-22 02:52:43,396 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 02:52:43,396 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-06-22 02:52:43,396 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-06-22 02:52:43,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 02:52:43,397 INFO L82 PathProgramCache]: Analyzing trace with hash 6584675, now seen corresponding path program 1 times [2020-06-22 02:52:43,397 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 02:52:43,397 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 02:52:43,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:52:43,398 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 02:52:43,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:52:43,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 02:52:43,428 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 02:52:43,428 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 02:52:43,428 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 02:52:43,430 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 02:52:43,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 02:52:43,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 02:52:43,431 INFO L87 Difference]: Start difference. First operand 28 states and 49 transitions. Second operand 3 states. [2020-06-22 02:52:43,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 02:52:43,512 INFO L93 Difference]: Finished difference Result 30 states and 49 transitions. [2020-06-22 02:52:43,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 02:52:43,513 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-06-22 02:52:43,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 02:52:43,514 INFO L225 Difference]: With dead ends: 30 [2020-06-22 02:52:43,514 INFO L226 Difference]: Without dead ends: 28 [2020-06-22 02:52:43,515 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 02:52:43,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2020-06-22 02:52:43,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2020-06-22 02:52:43,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-06-22 02:52:43,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 47 transitions. [2020-06-22 02:52:43,520 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 47 transitions. Word has length 4 [2020-06-22 02:52:43,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 02:52:43,520 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 47 transitions. [2020-06-22 02:52:43,520 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 02:52:43,521 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 47 transitions. [2020-06-22 02:52:43,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-06-22 02:52:43,521 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 02:52:43,521 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-06-22 02:52:43,521 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-06-22 02:52:43,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 02:52:43,522 INFO L82 PathProgramCache]: Analyzing trace with hash 6584676, now seen corresponding path program 1 times [2020-06-22 02:52:43,522 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 02:52:43,522 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 02:52:43,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:52:43,523 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 02:52:43,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:52:43,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 02:52:43,553 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 02:52:43,553 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 02:52:43,554 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-06-22 02:52:43,554 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-06-22 02:52:43,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-06-22 02:52:43,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-06-22 02:52:43,555 INFO L87 Difference]: Start difference. First operand 28 states and 47 transitions. Second operand 4 states. [2020-06-22 02:52:43,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 02:52:43,643 INFO L93 Difference]: Finished difference Result 28 states and 47 transitions. [2020-06-22 02:52:43,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-06-22 02:52:43,644 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2020-06-22 02:52:43,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 02:52:43,645 INFO L225 Difference]: With dead ends: 28 [2020-06-22 02:52:43,645 INFO L226 Difference]: Without dead ends: 26 [2020-06-22 02:52:43,646 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-06-22 02:52:43,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2020-06-22 02:52:43,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2020-06-22 02:52:43,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2020-06-22 02:52:43,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 45 transitions. [2020-06-22 02:52:43,650 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 45 transitions. Word has length 4 [2020-06-22 02:52:43,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 02:52:43,650 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 45 transitions. [2020-06-22 02:52:43,651 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-06-22 02:52:43,651 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 45 transitions. [2020-06-22 02:52:43,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-06-22 02:52:43,651 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 02:52:43,651 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 02:52:43,651 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-06-22 02:52:43,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 02:52:43,652 INFO L82 PathProgramCache]: Analyzing trace with hash -549407375, now seen corresponding path program 1 times [2020-06-22 02:52:43,652 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 02:52:43,652 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 02:52:43,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:52:43,653 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 02:52:43,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:52:43,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 02:52:43,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 02:52:43,735 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 02:52:43,735 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-06-22 02:52:43,736 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-06-22 02:52:43,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-06-22 02:52:43,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-06-22 02:52:43,736 INFO L87 Difference]: Start difference. First operand 26 states and 45 transitions. Second operand 6 states. [2020-06-22 02:52:44,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 02:52:44,081 INFO L93 Difference]: Finished difference Result 80 states and 155 transitions. [2020-06-22 02:52:44,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-06-22 02:52:44,082 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 8 [2020-06-22 02:52:44,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 02:52:44,084 INFO L225 Difference]: With dead ends: 80 [2020-06-22 02:52:44,084 INFO L226 Difference]: Without dead ends: 77 [2020-06-22 02:52:44,084 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2020-06-22 02:52:44,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2020-06-22 02:52:44,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 23. [2020-06-22 02:52:44,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-06-22 02:52:44,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 39 transitions. [2020-06-22 02:52:44,091 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 39 transitions. Word has length 8 [2020-06-22 02:52:44,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 02:52:44,091 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 39 transitions. [2020-06-22 02:52:44,091 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-06-22 02:52:44,091 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 39 transitions. [2020-06-22 02:52:44,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-06-22 02:52:44,092 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 02:52:44,092 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 02:52:44,092 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-06-22 02:52:44,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 02:52:44,092 INFO L82 PathProgramCache]: Analyzing trace with hash -549407374, now seen corresponding path program 1 times [2020-06-22 02:52:44,092 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 02:52:44,093 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 02:52:44,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:52:44,094 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 02:52:44,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:52:44,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 02:52:44,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 02:52:44,139 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 02:52:44,139 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-06-22 02:52:44,140 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-06-22 02:52:44,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-06-22 02:52:44,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-06-22 02:52:44,140 INFO L87 Difference]: Start difference. First operand 23 states and 39 transitions. Second operand 5 states. [2020-06-22 02:52:44,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 02:52:44,253 INFO L93 Difference]: Finished difference Result 42 states and 67 transitions. [2020-06-22 02:52:44,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-06-22 02:52:44,271 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2020-06-22 02:52:44,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 02:52:44,272 INFO L225 Difference]: With dead ends: 42 [2020-06-22 02:52:44,272 INFO L226 Difference]: Without dead ends: 39 [2020-06-22 02:52:44,272 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-06-22 02:52:44,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2020-06-22 02:52:44,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 31. [2020-06-22 02:52:44,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-06-22 02:52:44,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 60 transitions. [2020-06-22 02:52:44,279 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 60 transitions. Word has length 8 [2020-06-22 02:52:44,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 02:52:44,280 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 60 transitions. [2020-06-22 02:52:44,280 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-06-22 02:52:44,280 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 60 transitions. [2020-06-22 02:52:44,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-06-22 02:52:44,280 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 02:52:44,280 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 02:52:44,280 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-06-22 02:52:44,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 02:52:44,281 INFO L82 PathProgramCache]: Analyzing trace with hash -549407373, now seen corresponding path program 1 times [2020-06-22 02:52:44,281 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 02:52:44,281 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 02:52:44,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:52:44,282 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 02:52:44,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:52:44,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 02:52:44,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 02:52:44,368 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 02:52:44,368 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-06-22 02:52:44,368 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-06-22 02:52:44,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-06-22 02:52:44,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-06-22 02:52:44,369 INFO L87 Difference]: Start difference. First operand 31 states and 60 transitions. Second operand 7 states. [2020-06-22 02:52:44,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 02:52:44,807 INFO L93 Difference]: Finished difference Result 122 states and 223 transitions. [2020-06-22 02:52:44,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-06-22 02:52:44,808 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2020-06-22 02:52:44,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 02:52:44,809 INFO L225 Difference]: With dead ends: 122 [2020-06-22 02:52:44,810 INFO L226 Difference]: Without dead ends: 119 [2020-06-22 02:52:44,810 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2020-06-22 02:52:44,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2020-06-22 02:52:44,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 43. [2020-06-22 02:52:44,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2020-06-22 02:52:44,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 84 transitions. [2020-06-22 02:52:44,830 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 84 transitions. Word has length 8 [2020-06-22 02:52:44,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 02:52:44,831 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 84 transitions. [2020-06-22 02:52:44,831 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-06-22 02:52:44,831 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 84 transitions. [2020-06-22 02:52:44,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-06-22 02:52:44,831 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 02:52:44,832 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 02:52:44,832 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-06-22 02:52:44,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 02:52:44,832 INFO L82 PathProgramCache]: Analyzing trace with hash -520778222, now seen corresponding path program 1 times [2020-06-22 02:52:44,832 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 02:52:44,833 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 02:52:44,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:52:44,834 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 02:52:44,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:52:44,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 02:52:44,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 02:52:44,909 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 02:52:44,909 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-06-22 02:52:44,909 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-06-22 02:52:44,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-06-22 02:52:44,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-06-22 02:52:44,910 INFO L87 Difference]: Start difference. First operand 43 states and 84 transitions. Second operand 7 states. [2020-06-22 02:52:45,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 02:52:45,045 INFO L93 Difference]: Finished difference Result 51 states and 88 transitions. [2020-06-22 02:52:45,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-06-22 02:52:45,045 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2020-06-22 02:52:45,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 02:52:45,046 INFO L225 Difference]: With dead ends: 51 [2020-06-22 02:52:45,046 INFO L226 Difference]: Without dead ends: 48 [2020-06-22 02:52:45,047 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2020-06-22 02:52:45,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2020-06-22 02:52:45,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 31. [2020-06-22 02:52:45,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-06-22 02:52:45,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 57 transitions. [2020-06-22 02:52:45,052 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 57 transitions. Word has length 8 [2020-06-22 02:52:45,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 02:52:45,052 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 57 transitions. [2020-06-22 02:52:45,052 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-06-22 02:52:45,052 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 57 transitions. [2020-06-22 02:52:45,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-06-22 02:52:45,053 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 02:52:45,053 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 02:52:45,053 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-06-22 02:52:45,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 02:52:45,054 INFO L82 PathProgramCache]: Analyzing trace with hash 974409270, now seen corresponding path program 1 times [2020-06-22 02:52:45,054 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 02:52:45,054 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 02:52:45,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:52:45,055 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 02:52:45,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:52:45,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 02:52:45,090 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 02:52:45,091 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 02:52:45,091 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 02:52:45,091 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 02:52:45,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 02:52:45,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 02:52:45,092 INFO L87 Difference]: Start difference. First operand 31 states and 57 transitions. Second operand 3 states. [2020-06-22 02:52:45,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 02:52:45,156 INFO L93 Difference]: Finished difference Result 31 states and 57 transitions. [2020-06-22 02:52:45,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 02:52:45,158 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2020-06-22 02:52:45,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 02:52:45,159 INFO L225 Difference]: With dead ends: 31 [2020-06-22 02:52:45,159 INFO L226 Difference]: Without dead ends: 29 [2020-06-22 02:52:45,160 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 02:52:45,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2020-06-22 02:52:45,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2020-06-22 02:52:45,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2020-06-22 02:52:45,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 51 transitions. [2020-06-22 02:52:45,164 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 51 transitions. Word has length 12 [2020-06-22 02:52:45,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 02:52:45,164 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 51 transitions. [2020-06-22 02:52:45,164 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 02:52:45,165 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 51 transitions. [2020-06-22 02:52:45,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-06-22 02:52:45,165 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 02:52:45,165 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 02:52:45,165 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-06-22 02:52:45,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 02:52:45,166 INFO L82 PathProgramCache]: Analyzing trace with hash 974409272, now seen corresponding path program 1 times [2020-06-22 02:52:45,166 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 02:52:45,166 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 02:52:45,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:52:45,167 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 02:52:45,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:52:45,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 02:52:45,203 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 02:52:45,203 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 02:52:45,203 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-06-22 02:52:45,203 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-06-22 02:52:45,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-06-22 02:52:45,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-06-22 02:52:45,204 INFO L87 Difference]: Start difference. First operand 29 states and 51 transitions. Second operand 4 states. [2020-06-22 02:52:45,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 02:52:45,269 INFO L93 Difference]: Finished difference Result 34 states and 53 transitions. [2020-06-22 02:52:45,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-06-22 02:52:45,270 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2020-06-22 02:52:45,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 02:52:45,270 INFO L225 Difference]: With dead ends: 34 [2020-06-22 02:52:45,270 INFO L226 Difference]: Without dead ends: 32 [2020-06-22 02:52:45,271 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-06-22 02:52:45,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2020-06-22 02:52:45,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2020-06-22 02:52:45,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-06-22 02:52:45,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 51 transitions. [2020-06-22 02:52:45,276 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 51 transitions. Word has length 12 [2020-06-22 02:52:45,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 02:52:45,276 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 51 transitions. [2020-06-22 02:52:45,276 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-06-22 02:52:45,276 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 51 transitions. [2020-06-22 02:52:45,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-06-22 02:52:45,277 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 02:52:45,277 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 02:52:45,277 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-06-22 02:52:45,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 02:52:45,277 INFO L82 PathProgramCache]: Analyzing trace with hash 974409273, now seen corresponding path program 1 times [2020-06-22 02:52:45,277 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 02:52:45,278 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 02:52:45,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:52:45,278 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 02:52:45,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:52:45,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 02:52:45,318 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 02:52:45,319 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 02:52:45,319 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-06-22 02:52:45,319 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-06-22 02:52:45,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-06-22 02:52:45,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-06-22 02:52:45,320 INFO L87 Difference]: Start difference. First operand 30 states and 51 transitions. Second operand 4 states. [2020-06-22 02:52:45,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 02:52:45,400 INFO L93 Difference]: Finished difference Result 32 states and 51 transitions. [2020-06-22 02:52:45,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-06-22 02:52:45,401 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2020-06-22 02:52:45,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 02:52:45,402 INFO L225 Difference]: With dead ends: 32 [2020-06-22 02:52:45,402 INFO L226 Difference]: Without dead ends: 28 [2020-06-22 02:52:45,402 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-06-22 02:52:45,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2020-06-22 02:52:45,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2020-06-22 02:52:45,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-06-22 02:52:45,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 47 transitions. [2020-06-22 02:52:45,406 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 47 transitions. Word has length 12 [2020-06-22 02:52:45,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 02:52:45,406 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 47 transitions. [2020-06-22 02:52:45,406 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-06-22 02:52:45,407 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 47 transitions. [2020-06-22 02:52:45,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-06-22 02:52:45,407 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 02:52:45,407 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 02:52:45,407 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-06-22 02:52:45,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 02:52:45,408 INFO L82 PathProgramCache]: Analyzing trace with hash 974410741, now seen corresponding path program 1 times [2020-06-22 02:52:45,408 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 02:52:45,408 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 02:52:45,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:52:45,409 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 02:52:45,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:52:45,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 02:52:45,434 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 02:52:45,435 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 02:52:45,435 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-06-22 02:52:45,435 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 02:52:45,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 02:52:45,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 02:52:45,436 INFO L87 Difference]: Start difference. First operand 28 states and 47 transitions. Second operand 3 states. [2020-06-22 02:52:45,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 02:52:45,475 INFO L93 Difference]: Finished difference Result 47 states and 79 transitions. [2020-06-22 02:52:45,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 02:52:45,475 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2020-06-22 02:52:45,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 02:52:45,476 INFO L225 Difference]: With dead ends: 47 [2020-06-22 02:52:45,476 INFO L226 Difference]: Without dead ends: 32 [2020-06-22 02:52:45,476 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 02:52:45,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2020-06-22 02:52:45,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2020-06-22 02:52:45,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-06-22 02:52:45,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 49 transitions. [2020-06-22 02:52:45,480 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 49 transitions. Word has length 12 [2020-06-22 02:52:45,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 02:52:45,480 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 49 transitions. [2020-06-22 02:52:45,481 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 02:52:45,481 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 49 transitions. [2020-06-22 02:52:45,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-06-22 02:52:45,481 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 02:52:45,481 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 02:52:45,481 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-06-22 02:52:45,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 02:52:45,482 INFO L82 PathProgramCache]: Analyzing trace with hash 974440532, now seen corresponding path program 1 times [2020-06-22 02:52:45,482 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 02:52:45,482 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 02:52:45,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:52:45,483 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 02:52:45,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:52:45,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 02:52:45,506 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 02:52:45,507 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 02:52:45,507 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-06-22 02:52:45,507 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 02:52:45,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 02:52:45,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 02:52:45,508 INFO L87 Difference]: Start difference. First operand 30 states and 49 transitions. Second operand 3 states. [2020-06-22 02:52:45,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 02:52:45,554 INFO L93 Difference]: Finished difference Result 50 states and 81 transitions. [2020-06-22 02:52:45,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 02:52:45,554 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2020-06-22 02:52:45,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 02:52:45,555 INFO L225 Difference]: With dead ends: 50 [2020-06-22 02:52:45,555 INFO L226 Difference]: Without dead ends: 29 [2020-06-22 02:52:45,556 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 02:52:45,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2020-06-22 02:52:45,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2020-06-22 02:52:45,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2020-06-22 02:52:45,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 42 transitions. [2020-06-22 02:52:45,559 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 42 transitions. Word has length 12 [2020-06-22 02:52:45,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 02:52:45,559 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 42 transitions. [2020-06-22 02:52:45,560 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 02:52:45,560 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 42 transitions. [2020-06-22 02:52:45,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-06-22 02:52:45,560 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 02:52:45,560 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 02:52:45,560 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-06-22 02:52:45,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 02:52:45,561 INFO L82 PathProgramCache]: Analyzing trace with hash -1059563785, now seen corresponding path program 1 times [2020-06-22 02:52:45,561 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 02:52:45,561 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 02:52:45,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:52:45,562 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 02:52:45,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:52:45,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 02:52:45,602 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 02:52:45,602 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 02:52:45,603 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2020-06-22 02:52:45,615 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 02:52:45,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 02:52:45,647 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 3 conjunts are in the unsatisfiable core [2020-06-22 02:52:45,654 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 02:52:45,680 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 02:52:45,708 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-06-22 02:52:45,708 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2020-06-22 02:52:45,708 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-06-22 02:52:45,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-06-22 02:52:45,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-06-22 02:52:45,709 INFO L87 Difference]: Start difference. First operand 29 states and 42 transitions. Second operand 7 states. [2020-06-22 02:52:45,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 02:52:45,830 INFO L93 Difference]: Finished difference Result 33 states and 43 transitions. [2020-06-22 02:52:45,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-06-22 02:52:45,830 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2020-06-22 02:52:45,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 02:52:45,831 INFO L225 Difference]: With dead ends: 33 [2020-06-22 02:52:45,831 INFO L226 Difference]: Without dead ends: 30 [2020-06-22 02:52:45,831 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2020-06-22 02:52:45,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2020-06-22 02:52:45,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2020-06-22 02:52:45,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2020-06-22 02:52:45,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 39 transitions. [2020-06-22 02:52:45,835 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 39 transitions. Word has length 15 [2020-06-22 02:52:45,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 02:52:45,836 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 39 transitions. [2020-06-22 02:52:45,836 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-06-22 02:52:45,836 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 39 transitions. [2020-06-22 02:52:45,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-06-22 02:52:45,836 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 02:52:45,836 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 02:52:45,837 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-06-22 02:52:45,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 02:52:45,837 INFO L82 PathProgramCache]: Analyzing trace with hash -1059563784, now seen corresponding path program 1 times [2020-06-22 02:52:45,837 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 02:52:45,837 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 02:52:45,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:52:45,838 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 02:52:45,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:52:45,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 02:52:45,943 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 02:52:45,943 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 02:52:45,944 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-06-22 02:52:45,944 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-06-22 02:52:45,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-06-22 02:52:45,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-06-22 02:52:45,944 INFO L87 Difference]: Start difference. First operand 29 states and 39 transitions. Second operand 8 states. [2020-06-22 02:52:46,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 02:52:46,297 INFO L93 Difference]: Finished difference Result 116 states and 153 transitions. [2020-06-22 02:52:46,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-06-22 02:52:46,297 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2020-06-22 02:52:46,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 02:52:46,298 INFO L225 Difference]: With dead ends: 116 [2020-06-22 02:52:46,298 INFO L226 Difference]: Without dead ends: 83 [2020-06-22 02:52:46,299 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=97, Invalid=209, Unknown=0, NotChecked=0, Total=306 [2020-06-22 02:52:46,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2020-06-22 02:52:46,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 30. [2020-06-22 02:52:46,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-06-22 02:52:46,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 40 transitions. [2020-06-22 02:52:46,303 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 40 transitions. Word has length 15 [2020-06-22 02:52:46,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 02:52:46,303 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 40 transitions. [2020-06-22 02:52:46,303 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-06-22 02:52:46,303 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 40 transitions. [2020-06-22 02:52:46,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-06-22 02:52:46,304 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 02:52:46,304 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 02:52:46,304 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-06-22 02:52:46,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 02:52:46,305 INFO L82 PathProgramCache]: Analyzing trace with hash -1352966791, now seen corresponding path program 1 times [2020-06-22 02:52:46,305 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 02:52:46,305 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 02:52:46,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:52:46,306 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 02:52:46,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:52:46,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 02:52:46,404 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 02:52:46,405 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 02:52:46,405 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-06-22 02:52:46,405 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-06-22 02:52:46,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-06-22 02:52:46,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-06-22 02:52:46,406 INFO L87 Difference]: Start difference. First operand 30 states and 40 transitions. Second operand 8 states. [2020-06-22 02:52:46,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 02:52:46,656 INFO L93 Difference]: Finished difference Result 86 states and 113 transitions. [2020-06-22 02:52:46,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-06-22 02:52:46,656 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2020-06-22 02:52:46,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 02:52:46,657 INFO L225 Difference]: With dead ends: 86 [2020-06-22 02:52:46,657 INFO L226 Difference]: Without dead ends: 55 [2020-06-22 02:52:46,658 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2020-06-22 02:52:46,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2020-06-22 02:52:46,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 29. [2020-06-22 02:52:46,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2020-06-22 02:52:46,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 38 transitions. [2020-06-22 02:52:46,661 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 38 transitions. Word has length 15 [2020-06-22 02:52:46,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 02:52:46,662 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 38 transitions. [2020-06-22 02:52:46,662 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-06-22 02:52:46,662 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 38 transitions. [2020-06-22 02:52:46,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-06-22 02:52:46,662 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 02:52:46,663 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 02:52:46,663 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-06-22 02:52:46,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 02:52:46,663 INFO L82 PathProgramCache]: Analyzing trace with hash 1709603571, now seen corresponding path program 1 times [2020-06-22 02:52:46,663 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 02:52:46,663 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 02:52:46,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:52:46,664 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 02:52:46,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:52:46,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 02:52:46,769 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 02:52:46,769 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 02:52:46,769 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-06-22 02:52:46,769 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-06-22 02:52:46,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-06-22 02:52:46,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2020-06-22 02:52:46,770 INFO L87 Difference]: Start difference. First operand 29 states and 38 transitions. Second operand 9 states. [2020-06-22 02:52:47,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 02:52:47,001 INFO L93 Difference]: Finished difference Result 54 states and 70 transitions. [2020-06-22 02:52:47,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-06-22 02:52:47,002 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2020-06-22 02:52:47,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 02:52:47,002 INFO L225 Difference]: With dead ends: 54 [2020-06-22 02:52:47,002 INFO L226 Difference]: Without dead ends: 30 [2020-06-22 02:52:47,003 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2020-06-22 02:52:47,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2020-06-22 02:52:47,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2020-06-22 02:52:47,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2020-06-22 02:52:47,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 37 transitions. [2020-06-22 02:52:47,006 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 37 transitions. Word has length 15 [2020-06-22 02:52:47,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 02:52:47,007 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 37 transitions. [2020-06-22 02:52:47,007 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-06-22 02:52:47,007 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 37 transitions. [2020-06-22 02:52:47,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-06-22 02:52:47,007 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 02:52:47,007 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 02:52:47,008 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-06-22 02:52:47,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 02:52:47,008 INFO L82 PathProgramCache]: Analyzing trace with hash -1271814397, now seen corresponding path program 1 times [2020-06-22 02:52:47,008 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 02:52:47,008 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 02:52:47,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:52:47,009 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 02:52:47,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:52:47,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 02:52:47,183 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 02:52:47,184 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 02:52:47,184 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2020-06-22 02:52:47,196 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 02:52:47,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 02:52:47,217 INFO L256 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 27 conjunts are in the unsatisfiable core [2020-06-22 02:52:47,219 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 02:52:47,260 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-06-22 02:52:47,261 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 02:52:47,270 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 02:52:47,271 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-06-22 02:52:47,271 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2020-06-22 02:52:47,297 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2020-06-22 02:52:47,297 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 02:52:47,307 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 02:52:47,308 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-06-22 02:52:47,308 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:31, output treesize:27 [2020-06-22 02:52:47,365 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-06-22 02:52:47,368 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 24 [2020-06-22 02:52:47,368 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 02:52:47,384 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 02:52:47,385 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-06-22 02:52:47,385 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:39, output treesize:38 [2020-06-22 02:52:47,432 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-06-22 02:52:47,434 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 28 [2020-06-22 02:52:47,434 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 02:52:47,455 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 02:52:47,457 INFO L427 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2020-06-22 02:52:47,457 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:49, output treesize:45 [2020-06-22 02:52:47,505 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-06-22 02:52:47,512 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 02:52:47,513 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 23 [2020-06-22 02:52:47,516 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-06-22 02:52:47,541 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 02:52:47,545 INFO L427 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 02:52:47,545 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:37 [2020-06-22 02:52:47,670 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 02:52:47,696 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-06-22 02:52:47,698 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2020-06-22 02:52:47,698 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-06-22 02:52:47,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-06-22 02:52:47,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2020-06-22 02:52:47,699 INFO L87 Difference]: Start difference. First operand 29 states and 37 transitions. Second operand 17 states. [2020-06-22 02:52:48,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 02:52:48,941 INFO L93 Difference]: Finished difference Result 112 states and 153 transitions. [2020-06-22 02:52:48,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-06-22 02:52:48,943 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 15 [2020-06-22 02:52:48,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 02:52:48,944 INFO L225 Difference]: With dead ends: 112 [2020-06-22 02:52:48,944 INFO L226 Difference]: Without dead ends: 109 [2020-06-22 02:52:48,945 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=219, Invalid=773, Unknown=0, NotChecked=0, Total=992 [2020-06-22 02:52:48,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2020-06-22 02:52:48,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 39. [2020-06-22 02:52:48,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-06-22 02:52:48,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 49 transitions. [2020-06-22 02:52:48,952 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 49 transitions. Word has length 15 [2020-06-22 02:52:48,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 02:52:48,952 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 49 transitions. [2020-06-22 02:52:48,953 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-06-22 02:52:48,953 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 49 transitions. [2020-06-22 02:52:48,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-06-22 02:52:48,953 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 02:52:48,953 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 02:52:48,954 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-06-22 02:52:48,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 02:52:48,954 INFO L82 PathProgramCache]: Analyzing trace with hash -1565217404, now seen corresponding path program 1 times [2020-06-22 02:52:48,954 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 02:52:48,954 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 02:52:48,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:52:48,955 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 02:52:48,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:52:48,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 02:52:49,140 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 02:52:49,141 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 02:52:49,141 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2020-06-22 02:52:49,153 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 02:52:49,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 02:52:49,184 INFO L256 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 30 conjunts are in the unsatisfiable core [2020-06-22 02:52:49,185 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 02:52:49,192 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-06-22 02:52:49,192 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 02:52:49,198 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 02:52:49,200 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-06-22 02:52:49,201 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-06-22 02:52:49,206 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 02:52:49,206 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-06-22 02:52:49,206 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2020-06-22 02:52:49,229 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2020-06-22 02:52:49,229 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 02:52:49,239 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 02:52:49,239 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-06-22 02:52:49,240 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:35, output treesize:31 [2020-06-22 02:52:49,271 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-06-22 02:52:49,294 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 26 [2020-06-22 02:52:49,295 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 02:52:49,310 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 02:52:49,318 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 02:52:49,319 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2020-06-22 02:52:49,319 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-06-22 02:52:49,330 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 02:52:49,331 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-06-22 02:52:49,331 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:42, output treesize:35 [2020-06-22 02:52:49,370 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 28 [2020-06-22 02:52:49,371 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 02:52:49,383 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 02:52:49,384 INFO L427 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2020-06-22 02:52:49,384 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:46, output treesize:42 [2020-06-22 02:52:49,432 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 02:52:49,432 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 23 [2020-06-22 02:52:49,434 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-06-22 02:52:49,449 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 02:52:49,452 INFO L427 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2020-06-22 02:52:49,452 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:49, output treesize:46 [2020-06-22 02:52:49,553 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 02:52:49,580 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-06-22 02:52:49,580 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 16 [2020-06-22 02:52:49,581 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-06-22 02:52:49,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-06-22 02:52:49,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2020-06-22 02:52:49,581 INFO L87 Difference]: Start difference. First operand 39 states and 49 transitions. Second operand 17 states. [2020-06-22 02:52:50,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 02:52:50,245 INFO L93 Difference]: Finished difference Result 54 states and 69 transitions. [2020-06-22 02:52:50,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-06-22 02:52:50,245 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 15 [2020-06-22 02:52:50,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 02:52:50,246 INFO L225 Difference]: With dead ends: 54 [2020-06-22 02:52:50,246 INFO L226 Difference]: Without dead ends: 53 [2020-06-22 02:52:50,247 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=149, Invalid=451, Unknown=0, NotChecked=0, Total=600 [2020-06-22 02:52:50,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2020-06-22 02:52:50,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 29. [2020-06-22 02:52:50,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2020-06-22 02:52:50,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 37 transitions. [2020-06-22 02:52:50,252 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 37 transitions. Word has length 15 [2020-06-22 02:52:50,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 02:52:50,253 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 37 transitions. [2020-06-22 02:52:50,253 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-06-22 02:52:50,253 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 37 transitions. [2020-06-22 02:52:50,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-06-22 02:52:50,253 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 02:52:50,254 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 02:52:50,254 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-06-22 02:52:50,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 02:52:50,254 INFO L82 PathProgramCache]: Analyzing trace with hash 1662121928, now seen corresponding path program 1 times [2020-06-22 02:52:50,254 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 02:52:50,254 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 02:52:50,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:52:50,255 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 02:52:50,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:52:50,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 02:52:50,290 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 02:52:50,291 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 02:52:50,291 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2020-06-22 02:52:50,307 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 02:52:50,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 02:52:50,334 INFO L256 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 3 conjunts are in the unsatisfiable core [2020-06-22 02:52:50,336 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 02:52:50,347 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 02:52:50,373 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-06-22 02:52:50,373 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2020-06-22 02:52:50,374 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-06-22 02:52:50,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-06-22 02:52:50,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-06-22 02:52:50,374 INFO L87 Difference]: Start difference. First operand 29 states and 37 transitions. Second operand 6 states. [2020-06-22 02:52:50,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 02:52:50,469 INFO L93 Difference]: Finished difference Result 31 states and 37 transitions. [2020-06-22 02:52:50,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-06-22 02:52:50,470 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2020-06-22 02:52:50,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 02:52:50,470 INFO L225 Difference]: With dead ends: 31 [2020-06-22 02:52:50,471 INFO L226 Difference]: Without dead ends: 29 [2020-06-22 02:52:50,471 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2020-06-22 02:52:50,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2020-06-22 02:52:50,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2020-06-22 02:52:50,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2020-06-22 02:52:50,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2020-06-22 02:52:50,476 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 35 transitions. Word has length 19 [2020-06-22 02:52:50,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 02:52:50,476 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 35 transitions. [2020-06-22 02:52:50,476 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-06-22 02:52:50,476 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2020-06-22 02:52:50,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-06-22 02:52:50,477 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 02:52:50,477 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 02:52:50,477 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-06-22 02:52:50,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 02:52:50,477 INFO L82 PathProgramCache]: Analyzing trace with hash 1662121929, now seen corresponding path program 1 times [2020-06-22 02:52:50,477 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 02:52:50,478 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 02:52:50,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:52:50,478 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 02:52:50,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:52:50,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 02:52:50,644 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 02:52:50,645 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 02:52:50,645 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2020-06-22 02:52:50,658 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 02:52:50,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 02:52:50,681 INFO L256 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 26 conjunts are in the unsatisfiable core [2020-06-22 02:52:50,683 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 02:52:50,691 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2020-06-22 02:52:50,692 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 02:52:50,711 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 02:52:50,711 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-06-22 02:52:50,712 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:24 [2020-06-22 02:52:50,866 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 02:52:50,867 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 32 treesize of output 51 [2020-06-22 02:52:50,876 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-06-22 02:52:50,933 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 02:52:50,936 INFO L427 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2020-06-22 02:52:50,936 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:45, output treesize:74 [2020-06-22 02:52:51,072 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 02:52:51,099 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-06-22 02:52:51,099 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 16 [2020-06-22 02:52:51,099 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-06-22 02:52:51,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-06-22 02:52:51,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2020-06-22 02:52:51,100 INFO L87 Difference]: Start difference. First operand 29 states and 35 transitions. Second operand 17 states. [2020-06-22 02:52:53,317 WARN L188 SmtUtils]: Spent 1.56 s on a formula simplification that was a NOOP. DAG size: 57 [2020-06-22 02:52:53,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 02:52:53,550 INFO L93 Difference]: Finished difference Result 45 states and 52 transitions. [2020-06-22 02:52:53,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-06-22 02:52:53,550 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 19 [2020-06-22 02:52:53,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 02:52:53,551 INFO L225 Difference]: With dead ends: 45 [2020-06-22 02:52:53,551 INFO L226 Difference]: Without dead ends: 38 [2020-06-22 02:52:53,551 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=264, Invalid=666, Unknown=0, NotChecked=0, Total=930 [2020-06-22 02:52:53,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2020-06-22 02:52:53,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 33. [2020-06-22 02:52:53,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2020-06-22 02:52:53,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 38 transitions. [2020-06-22 02:52:53,556 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 38 transitions. Word has length 19 [2020-06-22 02:52:53,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 02:52:53,556 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 38 transitions. [2020-06-22 02:52:53,556 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-06-22 02:52:53,556 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2020-06-22 02:52:53,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-06-22 02:52:53,557 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 02:52:53,557 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 02:52:53,557 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-06-22 02:52:53,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 02:52:53,558 INFO L82 PathProgramCache]: Analyzing trace with hash -405830808, now seen corresponding path program 2 times [2020-06-22 02:52:53,558 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 02:52:53,558 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 02:52:53,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:52:53,559 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 02:52:53,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:52:53,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 02:52:53,820 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 02:52:53,820 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 02:52:53,820 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2020-06-22 02:52:53,835 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2020-06-22 02:52:53,869 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-06-22 02:52:53,869 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-06-22 02:52:53,871 INFO L256 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 36 conjunts are in the unsatisfiable core [2020-06-22 02:52:53,873 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 02:52:53,878 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-06-22 02:52:53,879 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 02:52:53,886 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 02:52:53,886 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-06-22 02:52:53,886 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2020-06-22 02:52:53,908 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2020-06-22 02:52:53,908 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 02:52:53,912 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 02:52:53,913 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 02:52:53,913 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:15 [2020-06-22 02:52:53,934 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-06-22 02:52:53,935 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2020-06-22 02:52:53,936 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 02:52:53,942 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 02:52:53,943 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-06-22 02:52:53,943 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:23 [2020-06-22 02:52:53,968 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-06-22 02:52:53,969 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2020-06-22 02:52:53,969 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 02:52:53,977 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 02:52:53,978 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-06-22 02:52:53,978 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:30 [2020-06-22 02:52:54,126 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-06-22 02:52:54,154 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 02:52:54,155 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 45 treesize of output 73 [2020-06-22 02:52:54,155 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 02:52:54,223 INFO L497 ElimStorePlain]: treesize reduction 4, result has 94.6 percent of original size [2020-06-22 02:52:54,227 INFO L427 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2020-06-22 02:52:54,227 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:58, output treesize:70 [2020-06-22 02:52:54,333 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-06-22 02:52:54,360 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-06-22 02:52:54,360 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 19 [2020-06-22 02:52:54,361 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2020-06-22 02:52:54,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2020-06-22 02:52:54,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=306, Unknown=0, NotChecked=0, Total=380 [2020-06-22 02:52:54,361 INFO L87 Difference]: Start difference. First operand 33 states and 38 transitions. Second operand 20 states. [2020-06-22 02:52:55,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 02:52:55,966 INFO L93 Difference]: Finished difference Result 134 states and 150 transitions. [2020-06-22 02:52:55,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2020-06-22 02:52:55,967 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 22 [2020-06-22 02:52:55,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 02:52:55,968 INFO L225 Difference]: With dead ends: 134 [2020-06-22 02:52:55,968 INFO L226 Difference]: Without dead ends: 133 [2020-06-22 02:52:55,969 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 407 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=392, Invalid=1414, Unknown=0, NotChecked=0, Total=1806 [2020-06-22 02:52:55,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2020-06-22 02:52:55,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 72. [2020-06-22 02:52:55,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2020-06-22 02:52:55,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 85 transitions. [2020-06-22 02:52:55,979 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 85 transitions. Word has length 22 [2020-06-22 02:52:55,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 02:52:55,979 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 85 transitions. [2020-06-22 02:52:55,980 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2020-06-22 02:52:55,980 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 85 transitions. [2020-06-22 02:52:55,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-06-22 02:52:55,980 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 02:52:55,980 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 02:52:55,981 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-06-22 02:52:55,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 02:52:55,981 INFO L82 PathProgramCache]: Analyzing trace with hash -814655033, now seen corresponding path program 2 times [2020-06-22 02:52:55,981 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 02:52:55,981 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 02:52:55,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:52:55,982 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 02:52:55,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:52:55,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 02:52:56,171 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 02:52:56,172 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 02:52:56,172 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2020-06-22 02:52:56,182 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2020-06-22 02:52:56,208 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-06-22 02:52:56,208 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-06-22 02:52:56,210 INFO L256 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 30 conjunts are in the unsatisfiable core [2020-06-22 02:52:56,211 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 02:52:56,218 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-06-22 02:52:56,219 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 02:52:56,225 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 02:52:56,228 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-06-22 02:52:56,229 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-06-22 02:52:56,234 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 02:52:56,234 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-06-22 02:52:56,234 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2020-06-22 02:52:56,255 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2020-06-22 02:52:56,256 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 02:52:56,261 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 02:52:56,261 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 02:52:56,261 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:17 [2020-06-22 02:52:56,282 INFO L189 IndexEqualityManager]: detected not equals via solver [2020-06-22 02:52:56,283 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2020-06-22 02:52:56,283 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 02:52:56,291 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 02:52:56,298 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 02:52:56,298 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2020-06-22 02:52:56,298 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-06-22 02:52:56,304 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 02:52:56,304 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-06-22 02:52:56,305 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:21 [2020-06-22 02:52:56,330 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2020-06-22 02:52:56,330 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 02:52:56,337 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 02:52:56,338 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-06-22 02:52:56,338 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:28 [2020-06-22 02:52:56,377 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 02:52:56,377 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 22 [2020-06-22 02:52:56,378 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-06-22 02:52:56,385 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 02:52:56,386 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 02:52:56,386 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:20 [2020-06-22 02:52:56,446 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-06-22 02:52:56,472 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-06-22 02:52:56,472 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 15 [2020-06-22 02:52:56,473 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-06-22 02:52:56,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-06-22 02:52:56,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2020-06-22 02:52:56,473 INFO L87 Difference]: Start difference. First operand 72 states and 85 transitions. Second operand 16 states. [2020-06-22 02:52:57,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 02:52:57,477 INFO L93 Difference]: Finished difference Result 108 states and 122 transitions. [2020-06-22 02:52:57,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-06-22 02:52:57,477 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 22 [2020-06-22 02:52:57,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 02:52:57,478 INFO L225 Difference]: With dead ends: 108 [2020-06-22 02:52:57,478 INFO L226 Difference]: Without dead ends: 107 [2020-06-22 02:52:57,479 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=234, Invalid=578, Unknown=0, NotChecked=0, Total=812 [2020-06-22 02:52:57,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2020-06-22 02:52:57,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 62. [2020-06-22 02:52:57,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2020-06-22 02:52:57,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 74 transitions. [2020-06-22 02:52:57,487 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 74 transitions. Word has length 22 [2020-06-22 02:52:57,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 02:52:57,487 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 74 transitions. [2020-06-22 02:52:57,487 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-06-22 02:52:57,488 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 74 transitions. [2020-06-22 02:52:57,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-06-22 02:52:57,488 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 02:52:57,488 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 02:52:57,489 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-06-22 02:52:57,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 02:52:57,489 INFO L82 PathProgramCache]: Analyzing trace with hash -1578034770, now seen corresponding path program 2 times [2020-06-22 02:52:57,489 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 02:52:57,489 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 02:52:57,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:52:57,490 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 02:52:57,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:52:57,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 02:52:57,822 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 02:52:57,822 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 02:52:57,822 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2020-06-22 02:52:57,834 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2020-06-22 02:52:57,862 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-06-22 02:52:57,863 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-06-22 02:52:57,864 INFO L256 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 29 conjunts are in the unsatisfiable core [2020-06-22 02:52:57,866 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 02:52:57,871 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-06-22 02:52:57,871 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 02:52:57,875 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 02:52:57,875 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-06-22 02:52:57,876 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2020-06-22 02:52:57,896 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2020-06-22 02:52:57,897 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 02:52:57,902 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 02:52:57,903 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-06-22 02:52:57,903 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:19 [2020-06-22 02:52:58,045 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 02:52:58,046 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 55 [2020-06-22 02:52:58,052 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-06-22 02:52:58,106 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 02:52:58,108 INFO L427 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2020-06-22 02:52:58,108 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:47, output treesize:82 [2020-06-22 02:52:58,211 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-06-22 02:52:58,242 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-06-22 02:52:58,242 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 17 [2020-06-22 02:52:58,242 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-06-22 02:52:58,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-06-22 02:52:58,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2020-06-22 02:52:58,243 INFO L87 Difference]: Start difference. First operand 62 states and 74 transitions. Second operand 18 states. [2020-06-22 02:53:00,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 02:53:00,702 INFO L93 Difference]: Finished difference Result 129 states and 149 transitions. [2020-06-22 02:53:00,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2020-06-22 02:53:00,703 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 26 [2020-06-22 02:53:00,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 02:53:00,704 INFO L225 Difference]: With dead ends: 129 [2020-06-22 02:53:00,704 INFO L226 Difference]: Without dead ends: 123 [2020-06-22 02:53:00,705 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 620 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=610, Invalid=1840, Unknown=0, NotChecked=0, Total=2450 [2020-06-22 02:53:00,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2020-06-22 02:53:00,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 76. [2020-06-22 02:53:00,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2020-06-22 02:53:00,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 91 transitions. [2020-06-22 02:53:00,715 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 91 transitions. Word has length 26 [2020-06-22 02:53:00,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 02:53:00,715 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 91 transitions. [2020-06-22 02:53:00,715 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-06-22 02:53:00,715 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 91 transitions. [2020-06-22 02:53:00,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-06-22 02:53:00,716 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 02:53:00,716 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 02:53:00,716 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-06-22 02:53:00,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 02:53:00,717 INFO L82 PathProgramCache]: Analyzing trace with hash -1111039804, now seen corresponding path program 1 times [2020-06-22 02:53:00,717 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 02:53:00,717 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 02:53:00,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:53:00,718 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 02:53:00,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:53:00,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 02:53:00,871 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-06-22 02:53:00,871 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 02:53:00,871 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2020-06-22 02:53:00,882 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 02:53:00,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 02:53:00,911 INFO L256 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 39 conjunts are in the unsatisfiable core [2020-06-22 02:53:00,914 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 02:53:00,919 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-06-22 02:53:00,920 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 02:53:00,925 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 02:53:00,928 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-06-22 02:53:00,928 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-06-22 02:53:00,934 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 02:53:00,934 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-06-22 02:53:00,934 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2020-06-22 02:53:00,952 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2020-06-22 02:53:00,952 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 02:53:00,956 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 02:53:00,957 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 02:53:00,957 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:17 [2020-06-22 02:53:00,966 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 02:53:00,966 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2020-06-22 02:53:00,966 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 02:53:00,973 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 02:53:00,975 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2020-06-22 02:53:00,975 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-06-22 02:53:00,983 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 02:53:00,983 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-06-22 02:53:00,984 INFO L217 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:21 [2020-06-22 02:53:01,003 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2020-06-22 02:53:01,004 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 02:53:01,010 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 02:53:01,010 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-06-22 02:53:01,010 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:28 [2020-06-22 02:53:01,166 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 02:53:01,167 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 45 treesize of output 73 [2020-06-22 02:53:01,167 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 02:53:01,230 INFO L497 ElimStorePlain]: treesize reduction 4, result has 94.4 percent of original size [2020-06-22 02:53:01,233 INFO L427 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2020-06-22 02:53:01,233 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:68 [2020-06-22 02:53:06,289 WARN L188 SmtUtils]: Spent 5.02 s on a formula simplification that was a NOOP. DAG size: 41 [2020-06-22 02:53:06,307 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2020-06-22 02:53:06,333 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-06-22 02:53:06,333 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 16 [2020-06-22 02:53:06,333 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-06-22 02:53:06,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-06-22 02:53:06,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2020-06-22 02:53:06,334 INFO L87 Difference]: Start difference. First operand 76 states and 91 transitions. Second operand 17 states. [2020-06-22 02:53:06,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 02:53:06,729 INFO L93 Difference]: Finished difference Result 97 states and 111 transitions. [2020-06-22 02:53:06,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-06-22 02:53:06,729 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 29 [2020-06-22 02:53:06,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 02:53:06,730 INFO L225 Difference]: With dead ends: 97 [2020-06-22 02:53:06,730 INFO L226 Difference]: Without dead ends: 96 [2020-06-22 02:53:06,730 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=171, Invalid=381, Unknown=0, NotChecked=0, Total=552 [2020-06-22 02:53:06,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2020-06-22 02:53:06,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 42. [2020-06-22 02:53:06,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-06-22 02:53:06,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 49 transitions. [2020-06-22 02:53:06,736 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 49 transitions. Word has length 29 [2020-06-22 02:53:06,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 02:53:06,736 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 49 transitions. [2020-06-22 02:53:06,736 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-06-22 02:53:06,737 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 49 transitions. [2020-06-22 02:53:06,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-06-22 02:53:06,737 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 02:53:06,737 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 02:53:06,738 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION]=== [2020-06-22 02:53:06,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 02:53:06,738 INFO L82 PathProgramCache]: Analyzing trace with hash -684629589, now seen corresponding path program 1 times [2020-06-22 02:53:06,738 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 02:53:06,738 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 02:53:06,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:53:06,739 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 02:53:06,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:53:06,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 02:53:07,061 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 02:53:07,062 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 02:53:07,062 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2020-06-22 02:53:07,072 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 02:53:07,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 02:53:07,101 INFO L256 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 32 conjunts are in the unsatisfiable core [2020-06-22 02:53:07,103 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 02:53:07,107 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-06-22 02:53:07,108 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 02:53:07,112 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 02:53:07,112 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-06-22 02:53:07,112 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2020-06-22 02:53:07,132 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2020-06-22 02:53:07,132 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 02:53:07,134 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 02:53:07,134 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 02:53:07,135 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2020-06-22 02:53:07,246 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 02:53:07,246 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 55 [2020-06-22 02:53:07,251 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-06-22 02:53:07,283 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 02:53:07,284 INFO L427 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2020-06-22 02:53:07,285 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:76 [2020-06-22 02:53:07,551 WARN L188 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 18 [2020-06-22 02:53:07,591 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 8 proven. 19 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2020-06-22 02:53:07,617 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-06-22 02:53:07,618 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9] total 20 [2020-06-22 02:53:07,618 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2020-06-22 02:53:07,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2020-06-22 02:53:07,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=359, Unknown=0, NotChecked=0, Total=420 [2020-06-22 02:53:07,619 INFO L87 Difference]: Start difference. First operand 42 states and 49 transitions. Second operand 21 states. [2020-06-22 02:53:08,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 02:53:08,950 INFO L93 Difference]: Finished difference Result 52 states and 59 transitions. [2020-06-22 02:53:08,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2020-06-22 02:53:08,950 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 33 [2020-06-22 02:53:08,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 02:53:08,951 INFO L225 Difference]: With dead ends: 52 [2020-06-22 02:53:08,951 INFO L226 Difference]: Without dead ends: 0 [2020-06-22 02:53:08,952 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 262 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=496, Invalid=1144, Unknown=0, NotChecked=0, Total=1640 [2020-06-22 02:53:08,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-06-22 02:53:08,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-06-22 02:53:08,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-06-22 02:53:08,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-06-22 02:53:08,953 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 33 [2020-06-22 02:53:08,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 02:53:08,953 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 02:53:08,953 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2020-06-22 02:53:08,953 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-06-22 02:53:08,953 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-06-22 02:53:08,959 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-06-22 02:53:09,094 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2020-06-22 02:53:09,097 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2020-06-22 02:53:09,147 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2020-06-22 02:53:09,152 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2020-06-22 02:53:09,163 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2020-06-22 02:53:09,208 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2020-06-22 02:53:09,219 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2020-06-22 02:53:09,226 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2020-06-22 02:53:09,226 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2020-06-22 02:53:09,270 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2020-06-22 02:53:09,310 WARN L188 SmtUtils]: Spent 347.00 ms on a formula simplification. DAG size of input: 279 DAG size of output: 239 [2020-06-22 02:53:09,329 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2020-06-22 02:53:09,376 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2020-06-22 02:53:09,380 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2020-06-22 02:53:09,382 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2020-06-22 02:53:12,252 WARN L188 SmtUtils]: Spent 2.87 s on a formula simplification. DAG size of input: 230 DAG size of output: 90 [2020-06-22 02:53:12,459 WARN L188 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 43 [2020-06-22 02:53:12,462 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr13REQUIRES_VIOLATION(line 37) no Hoare annotation was computed. [2020-06-22 02:53:12,462 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr11REQUIRES_VIOLATION(line 36) no Hoare annotation was computed. [2020-06-22 02:53:12,462 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr12REQUIRES_VIOLATION(line 37) no Hoare annotation was computed. [2020-06-22 02:53:12,462 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr9REQUIRES_VIOLATION(line 30) no Hoare annotation was computed. [2020-06-22 02:53:12,463 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr10REQUIRES_VIOLATION(line 36) no Hoare annotation was computed. [2020-06-22 02:53:12,463 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr7REQUIRES_VIOLATION(line 30) no Hoare annotation was computed. [2020-06-22 02:53:12,463 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr8REQUIRES_VIOLATION(line 30) no Hoare annotation was computed. [2020-06-22 02:53:12,463 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr5REQUIRES_VIOLATION(line 30) no Hoare annotation was computed. [2020-06-22 02:53:12,463 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr6REQUIRES_VIOLATION(line 30) no Hoare annotation was computed. [2020-06-22 02:53:12,463 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr3REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-06-22 02:53:12,463 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr4REQUIRES_VIOLATION(line 30) no Hoare annotation was computed. [2020-06-22 02:53:12,463 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-06-22 02:53:12,463 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-06-22 02:53:12,463 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-06-22 02:53:12,464 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-06-22 02:53:12,464 INFO L448 ceAbstractionStarter]: For program point L30-1(line 30) no Hoare annotation was computed. [2020-06-22 02:53:12,464 INFO L448 ceAbstractionStarter]: For program point L30-2(line 30) no Hoare annotation was computed. [2020-06-22 02:53:12,464 INFO L448 ceAbstractionStarter]: For program point L30-3(line 30) no Hoare annotation was computed. [2020-06-22 02:53:12,464 INFO L448 ceAbstractionStarter]: For program point L30-4(line 30) no Hoare annotation was computed. [2020-06-22 02:53:12,464 INFO L448 ceAbstractionStarter]: For program point L30-5(line 30) no Hoare annotation was computed. [2020-06-22 02:53:12,464 INFO L448 ceAbstractionStarter]: For program point L30-7(lines 30 33) no Hoare annotation was computed. [2020-06-22 02:53:12,465 INFO L444 ceAbstractionStarter]: At program point L30-9(lines 30 33) the Hoare annotation is: (let ((.cse22 (select |#length| ULTIMATE.start_cstrcmp_~s2.base)) (.cse20 (select |#length| ULTIMATE.start_cstrcmp_~s1.base)) (.cse23 (select |#length| |ULTIMATE.start_main_#t~ret11.base|))) (let ((.cse0 (= (select |#valid| ULTIMATE.start_cstrcmp_~s2.base) 1)) (.cse1 (<= 1 ULTIMATE.start___VERIFIER_nondet_String_~length~0)) (.cse2 (= ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset 0)) (.cse3 (<= 1 .cse23)) (.cse4 (= ULTIMATE.start_cstrcmp_~s1.offset 0)) (.cse6 (= (select |#length| ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base) ULTIMATE.start___VERIFIER_nondet_String_~length~0)) (.cse7 (= (select |#valid| ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base) 1)) (.cse8 (<= 1 .cse20)) (.cse9 (= ULTIMATE.start_cstrcmp_~s2.offset 0)) (.cse11 (= 1 (select |#valid| |ULTIMATE.start_main_#t~ret11.base|))) (.cse12 (<= 1 .cse22)) (.cse13 (= 0 |ULTIMATE.start_main_#t~ret11.offset|)) (.cse14 (= (select |#valid| ULTIMATE.start_cstrcmp_~s1.base) 1)) (.cse10 (select |#memory_int| ULTIMATE.start_cstrcmp_~s1.base)) (.cse5 (select |#memory_int| |ULTIMATE.start_main_#t~ret11.base|))) (let ((.cse15 (exists ((ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset Int) (ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base Int)) (and (not (= ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base ULTIMATE.start_cstrcmp_~s1.base)) (= 0 (select (select |#memory_int| ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base) (+ ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset (select |#length| ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base) (- 1))))))) (.cse17 (not (= ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base |ULTIMATE.start_main_#t~ret11.base|))) (.cse18 (= (select .cse5 (+ .cse23 (- 1))) 0)) (.cse19 (= 0 (select .cse10 (+ .cse20 (- 1))))) (.cse16 (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse11 .cse12 .cse13 .cse14)) (.cse21 (select |#memory_int| ULTIMATE.start_cstrcmp_~s2.base))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= (select .cse5 |ULTIMATE.start_main_#t~ret11.offset|) 0) .cse6 .cse7 .cse8 .cse9 (= 0 (select .cse10 ULTIMATE.start_cstrcmp_~s1.offset)) .cse11 .cse12 .cse13 .cse14) (and (and .cse15 .cse16) .cse17 .cse18 .cse19 (exists ((ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset Int)) (and (<= ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset 0) (<= 0 ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset) (= (select (select |#memory_int| ULTIMATE.start_cstrcmp_~s2.base) (+ ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset (select |#length| ULTIMATE.start_cstrcmp_~s2.base) (- 1))) 0)))) (and (<= ULTIMATE.start_cstrcmp_~s1.offset ULTIMATE.start_cstrcmp_~s2.offset) (and (and (and .cse0 .cse1 .cse2 .cse11 .cse3 .cse6 .cse14 (<= 1 ULTIMATE.start_cstrcmp_~s1.offset) .cse7) .cse15 .cse17 (<= (+ ULTIMATE.start_cstrcmp_~s1.offset 1) .cse20) .cse18) .cse19) .cse13 (= (select .cse21 (+ ULTIMATE.start_cstrcmp_~s1.offset (* (- 1) ULTIMATE.start_cstrcmp_~s2.offset) .cse22 (- 1))) 0) (<= (+ ULTIMATE.start_cstrcmp_~s2.offset 1) .cse22) (<= ULTIMATE.start_cstrcmp_~s2.offset ULTIMATE.start_cstrcmp_~s1.offset)) (and (= 1 ULTIMATE.start___VERIFIER_nondet_String_~length~0) .cse16 (= 0 (select .cse21 ULTIMATE.start_cstrcmp_~s2.offset))))))) [2020-06-22 02:53:12,465 INFO L448 ceAbstractionStarter]: For program point L30-10(lines 30 33) no Hoare annotation was computed. [2020-06-22 02:53:12,465 INFO L444 ceAbstractionStarter]: At program point L16(line 16) the Hoare annotation is: (and (<= 1 ULTIMATE.start___VERIFIER_nondet_String_~length~0) (= ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset 0) (= (select |#length| ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base) ULTIMATE.start___VERIFIER_nondet_String_~length~0) (= (select |#valid| ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base) 1)) [2020-06-22 02:53:12,465 INFO L444 ceAbstractionStarter]: At program point L16-2(line 16) the Hoare annotation is: (let ((.cse0 (and (<= 1 ULTIMATE.start___VERIFIER_nondet_String_~length~0) (= ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset 0) (= 1 (select |#valid| |ULTIMATE.start_main_#t~ret11.base|)) (<= 1 (select |#length| |ULTIMATE.start_main_#t~ret11.base|)) (= 0 |ULTIMATE.start_main_#t~ret11.offset|) (= (select |#length| ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base) ULTIMATE.start___VERIFIER_nondet_String_~length~0) (= (select |#valid| ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base) 1)))) (or (and (not (= ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base |ULTIMATE.start_main_#t~ret11.base|)) .cse0 (exists ((v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18 Int)) (let ((.cse1 (select |#length| |ULTIMATE.start_main_#t~ret11.base|))) (and (= 0 (select (select |#memory_int| |ULTIMATE.start_main_#t~ret11.base|) (+ .cse1 v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18 (- 1)))) (<= |ULTIMATE.start_main_#t~ret11.offset| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18) (<= v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18 0) (<= 1 (+ .cse1 v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18)))))) (and (= 1 ULTIMATE.start___VERIFIER_nondet_String_~length~0) .cse0) (and .cse0 (= (select (select |#memory_int| |ULTIMATE.start_main_#t~ret11.base|) |ULTIMATE.start_main_#t~ret11.offset|) 0)))) [2020-06-22 02:53:12,465 INFO L448 ceAbstractionStarter]: For program point L12(lines 12 14) no Hoare annotation was computed. [2020-06-22 02:53:12,465 INFO L448 ceAbstractionStarter]: For program point L12-2(lines 12 14) no Hoare annotation was computed. [2020-06-22 02:53:12,465 INFO L448 ceAbstractionStarter]: For program point L12-3(lines 12 14) no Hoare annotation was computed. [2020-06-22 02:53:12,466 INFO L448 ceAbstractionStarter]: For program point L12-5(lines 12 14) no Hoare annotation was computed. [2020-06-22 02:53:12,466 INFO L448 ceAbstractionStarter]: For program point L37(line 37) no Hoare annotation was computed. [2020-06-22 02:53:12,466 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2020-06-22 02:53:12,476 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base,QUANTIFIED] [2020-06-22 02:53:12,477 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base,QUANTIFIED] [2020-06-22 02:53:12,477 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] [2020-06-22 02:53:12,477 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base,QUANTIFIED] [2020-06-22 02:53:12,478 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] [2020-06-22 02:53:12,478 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] [2020-06-22 02:53:12,478 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] [2020-06-22 02:53:12,479 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base,QUANTIFIED] [2020-06-22 02:53:12,479 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base,QUANTIFIED] [2020-06-22 02:53:12,479 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] [2020-06-22 02:53:12,479 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base,QUANTIFIED] [2020-06-22 02:53:12,484 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 02:53:12,485 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 02:53:12,485 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 02:53:12,485 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 02:53:12,486 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 02:53:12,486 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 02:53:12,486 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 02:53:12,486 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 02:53:12,487 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 02:53:12,487 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 02:53:12,487 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 02:53:12,487 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 02:53:12,488 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 02:53:12,488 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 02:53:12,488 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 02:53:12,488 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 02:53:12,488 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 02:53:12,489 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 02:53:12,489 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 02:53:12,489 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 02:53:12,489 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 02:53:12,490 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 02:53:12,490 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 02:53:12,490 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 02:53:12,490 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 02:53:12,491 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 02:53:12,491 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 02:53:12,491 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 02:53:12,491 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 02:53:12,491 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 02:53:12,492 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 02:53:12,492 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 02:53:12,492 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 02:53:12,492 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 02:53:12,493 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 02:53:12,502 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base,QUANTIFIED] [2020-06-22 02:53:12,502 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base,QUANTIFIED] [2020-06-22 02:53:12,503 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] [2020-06-22 02:53:12,503 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base,QUANTIFIED] [2020-06-22 02:53:12,503 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] [2020-06-22 02:53:12,504 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] [2020-06-22 02:53:12,504 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] [2020-06-22 02:53:12,504 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base,QUANTIFIED] [2020-06-22 02:53:12,504 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base,QUANTIFIED] [2020-06-22 02:53:12,505 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] [2020-06-22 02:53:12,505 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base,QUANTIFIED] [2020-06-22 02:53:12,507 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 02:53:12,508 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 02:53:12,508 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 02:53:12,508 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 02:53:12,508 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 02:53:12,509 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 02:53:12,509 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 02:53:12,509 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 02:53:12,509 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 02:53:12,510 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 02:53:12,510 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 02:53:12,510 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 02:53:12,510 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 02:53:12,510 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 02:53:12,511 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 02:53:12,511 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 02:53:12,511 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 02:53:12,511 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 02:53:12,511 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 02:53:12,512 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 02:53:12,512 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 02:53:12,512 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 02:53:12,513 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 02:53:12,513 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 02:53:12,513 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 02:53:12,513 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 02:53:12,513 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 02:53:12,514 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 02:53:12,514 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 02:53:12,514 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 02:53:12,514 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 02:53:12,514 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 02:53:12,515 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 02:53:12,515 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 02:53:12,515 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 02:53:12,517 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 02:53:12,518 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 02:53:12,519 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18,QUANTIFIED] [2020-06-22 02:53:12,520 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18,QUANTIFIED] [2020-06-22 02:53:12,520 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18,QUANTIFIED] [2020-06-22 02:53:12,520 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18,QUANTIFIED] [2020-06-22 02:53:12,521 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 02:53:12,521 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 02:53:12,521 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 02:53:12,522 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 02:53:12,522 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 02:53:12,522 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 02:53:12,522 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 02:53:12,522 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 02:53:12,523 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 02:53:12,523 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 02:53:12,524 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18,QUANTIFIED] [2020-06-22 02:53:12,524 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18,QUANTIFIED] [2020-06-22 02:53:12,524 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18,QUANTIFIED] [2020-06-22 02:53:12,525 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18,QUANTIFIED] [2020-06-22 02:53:12,525 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 02:53:12,526 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 02:53:12,526 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 02:53:12,526 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 02:53:12,526 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 02:53:12,526 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 02:53:12,527 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 02:53:12,527 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 02:53:12,527 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 02:53:12,527 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 02:53:12,530 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 02:53:12 BasicIcfg [2020-06-22 02:53:12,530 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-06-22 02:53:12,531 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-06-22 02:53:12,531 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-06-22 02:53:12,534 INFO L276 PluginConnector]: BuchiAutomizer initialized [2020-06-22 02:53:12,535 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 02:53:12,535 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.06 02:52:42" (1/5) ... [2020-06-22 02:53:12,536 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@55512e07 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.06 02:53:12, skipping insertion in model container [2020-06-22 02:53:12,536 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 02:53:12,536 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 02:52:42" (2/5) ... [2020-06-22 02:53:12,536 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@55512e07 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.06 02:53:12, skipping insertion in model container [2020-06-22 02:53:12,536 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 02:53:12,536 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 02:52:42" (3/5) ... [2020-06-22 02:53:12,537 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@55512e07 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 02:53:12, skipping insertion in model container [2020-06-22 02:53:12,537 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 02:53:12,537 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 02:52:42" (4/5) ... [2020-06-22 02:53:12,537 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@55512e07 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 02:53:12, skipping insertion in model container [2020-06-22 02:53:12,537 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 02:53:12,537 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 02:53:12" (5/5) ... [2020-06-22 02:53:12,539 INFO L375 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-06-22 02:53:12,563 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2020-06-22 02:53:12,563 INFO L374 BuchiCegarLoop]: Interprodecural is true [2020-06-22 02:53:12,563 INFO L375 BuchiCegarLoop]: Hoare is true [2020-06-22 02:53:12,563 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-06-22 02:53:12,564 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-06-22 02:53:12,564 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-06-22 02:53:12,564 INFO L379 BuchiCegarLoop]: Difference is false [2020-06-22 02:53:12,564 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-06-22 02:53:12,564 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-06-22 02:53:12,567 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states. [2020-06-22 02:53:12,572 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2020-06-22 02:53:12,572 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 02:53:12,572 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 02:53:12,577 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2020-06-22 02:53:12,577 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-06-22 02:53:12,577 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2020-06-22 02:53:12,577 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states. [2020-06-22 02:53:12,578 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2020-06-22 02:53:12,578 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 02:53:12,579 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 02:53:12,579 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2020-06-22 02:53:12,579 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-06-22 02:53:12,584 INFO L794 eck$LassoCheckResult]: Stem: 26#ULTIMATE.startENTRYtrue [187] ULTIMATE.startENTRY-->L12: Formula: (and (= (store |v_#valid_22| 0 0) |v_#valid_21|) (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|)) InVars {#valid=|v_#valid_22|} OutVars{ULTIMATE.start___VERIFIER_nondet_String_#res.offset=|v_ULTIMATE.start___VERIFIER_nondet_String_#res.offset_7|, ULTIMATE.start_main_#t~ret11.offset=|v_ULTIMATE.start_main_#t~ret11.offset_5|, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset_5|, ULTIMATE.start_main_#t~ret11.base=|v_ULTIMATE.start_main_#t~ret11.base_5|, ULTIMATE.start_main_#t~ret12.offset=|v_ULTIMATE.start_main_#t~ret12.offset_4|, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~ret12.base=|v_ULTIMATE.start_main_#t~ret12.base_4|, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~ret13=|v_ULTIMATE.start_main_#t~ret13_4|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_11, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, #valid=|v_#valid_21|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_18, ULTIMATE.start___VERIFIER_nondet_String_#t~nondet0=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~nondet0_8|, ULTIMATE.start___VERIFIER_nondet_String_#res.base=|v_ULTIMATE.start___VERIFIER_nondet_String_#res.base_7|, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_5|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_13} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_nondet_String_#res.offset, ULTIMATE.start_main_#t~ret11.offset, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset, ULTIMATE.start_main_#t~ret11.base, ULTIMATE.start_main_#t~ret12.offset, #NULL.offset, ULTIMATE.start_main_#t~ret12.base, #NULL.base, ULTIMATE.start_main_#t~ret13, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset, ULTIMATE.start_main_#res, #valid, ULTIMATE.start___VERIFIER_nondet_String_~length~0, ULTIMATE.start___VERIFIER_nondet_String_#t~nondet0, ULTIMATE.start___VERIFIER_nondet_String_#res.base, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base] 9#L12true [126] L12-->L12-2: Formula: (>= v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_6 1) InVars {ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_6} OutVars{ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_6} AuxVars[] AssignedVars[] 7#L12-2true [148] L12-2-->L16: Formula: (and (= v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_2 |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_2|) (< 0 |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_2|) (= (store |v_#length_3| |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_2| v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_7) |v_#length_2|) (= (select |v_#valid_4| |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_2|) 0) (= v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_2 |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset_2|) (= 0 |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset_2|) (= |v_#valid_3| (store |v_#valid_4| |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_2| 1)) (< |v_#StackHeapBarrier_1| |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_2|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_7, #length=|v_#length_3|, #valid=|v_#valid_4|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset_2|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_2, #valid=|v_#valid_3|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_7, #length=|v_#length_2|, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_2|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_2} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset, #valid, #length, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base] 3#L16true [189] L16-->L12-3: Formula: (let ((.cse0 (+ v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_14 v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_21))) (and (<= 1 .cse0) (= |v_ULTIMATE.start_main_#t~ret11.offset_6| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_14) (= (store |v_#memory_int_13| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_16 (store (select |v_#memory_int_13| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_16) (+ v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_14 v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_21 (- 1)) 0)) |v_#memory_int_12|) (= 1 (select |v_#valid_24| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_16)) (<= .cse0 (select |v_#length_20| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_16)) (= |v_ULTIMATE.start_main_#t~ret11.base_6| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_16))) InVars {ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_14, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_13|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_21, #length=|v_#length_20|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_16} OutVars{ULTIMATE.start___VERIFIER_nondet_String_#res.offset=|v_ULTIMATE.start___VERIFIER_nondet_String_#res.offset_9|, ULTIMATE.start_main_#t~ret11.offset=|v_ULTIMATE.start_main_#t~ret11.offset_6|, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset_6|, ULTIMATE.start_main_#t~ret11.base=|v_ULTIMATE.start_main_#t~ret11.base_6|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_13, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_12|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_20, #length=|v_#length_20|, ULTIMATE.start___VERIFIER_nondet_String_#t~nondet0=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~nondet0_10|, ULTIMATE.start___VERIFIER_nondet_String_#res.base=|v_ULTIMATE.start___VERIFIER_nondet_String_#res.base_9|, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_6|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_15} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_nondet_String_#res.offset, ULTIMATE.start_main_#t~ret11.offset, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset, ULTIMATE.start_main_#t~ret11.base, #memory_int, ULTIMATE.start___VERIFIER_nondet_String_~length~0, ULTIMATE.start___VERIFIER_nondet_String_#t~nondet0, ULTIMATE.start___VERIFIER_nondet_String_#res.base, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base] 22#L12-3true [130] L12-3-->L12-5: Formula: (>= v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_14 1) InVars {ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_14} OutVars{ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_14} AuxVars[] AssignedVars[] 19#L12-5true [154] L12-5-->L16-2: Formula: (and (= |v_#length_6| (store |v_#length_7| |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_4| v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_15)) (= v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_7 |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset_4|) (= (store |v_#valid_8| |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_4| 1) |v_#valid_7|) (= (select |v_#valid_8| |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_4|) 0) (= v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_8 |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_4|) (> 0 |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_4|) (= 0 |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset_4|) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_4|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_15, #length=|v_#length_7|, #valid=|v_#valid_8|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset_4|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_7, #valid=|v_#valid_7|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_15, #length=|v_#length_6|, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_4|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_8} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset, #valid, #length, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base] 11#L16-2true [191] L16-2-->L30-9: Formula: (let ((.cse0 (+ v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_16 v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_23))) (and (= |v_ULTIMATE.start_cstrcmp_#in~s2.base_2| v_ULTIMATE.start_cstrcmp_~s2.base_11) (= |v_ULTIMATE.start_main_#t~ret11.base_7| |v_ULTIMATE.start_cstrcmp_#in~s1.base_2|) (= |v_ULTIMATE.start_cstrcmp_#in~s2.offset_2| v_ULTIMATE.start_cstrcmp_~s2.offset_9) (<= 1 .cse0) (= |v_ULTIMATE.start_cstrcmp_#in~s1.offset_2| v_ULTIMATE.start_cstrcmp_~s1.offset_11) (= |v_ULTIMATE.start___VERIFIER_nondet_String_#res.offset_12| |v_ULTIMATE.start_main_#t~ret12.offset_5|) (= |v_ULTIMATE.start___VERIFIER_nondet_String_#res.base_12| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_18) (= |v_ULTIMATE.start_cstrcmp_#in~s2.base_2| |v_ULTIMATE.start_main_#t~ret12.base_5|) (= |v_ULTIMATE.start___VERIFIER_nondet_String_#res.offset_12| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_16) (<= .cse0 (select |v_#length_22| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_18)) (= |v_ULTIMATE.start___VERIFIER_nondet_String_#res.base_12| |v_ULTIMATE.start_main_#t~ret12.base_5|) (= |v_ULTIMATE.start_main_#t~ret11.offset_7| |v_ULTIMATE.start_cstrcmp_#in~s1.offset_2|) (= 1 (select |v_#valid_26| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_18)) (= v_ULTIMATE.start_cstrcmp_~s1.base_14 |v_ULTIMATE.start_cstrcmp_#in~s1.base_2|) (= |v_ULTIMATE.start_main_#t~ret12.offset_5| |v_ULTIMATE.start_cstrcmp_#in~s2.offset_2|) (= (store |v_#memory_int_17| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_18 (store (select |v_#memory_int_17| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_18) (+ v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_16 v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_23 (- 1)) 0)) |v_#memory_int_16|))) InVars {ULTIMATE.start_main_#t~ret11.offset=|v_ULTIMATE.start_main_#t~ret11.offset_7|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_16, #valid=|v_#valid_26|, ULTIMATE.start_main_#t~ret11.base=|v_ULTIMATE.start_main_#t~ret11.base_7|, #memory_int=|v_#memory_int_17|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_23, #length=|v_#length_22|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_18} OutVars{ULTIMATE.start_cstrcmp_#t~mem9=|v_ULTIMATE.start_cstrcmp_#t~mem9_5|, ULTIMATE.start_cstrcmp_#t~short5=|v_ULTIMATE.start_cstrcmp_#t~short5_10|, ULTIMATE.start_cstrcmp_#t~mem8=|v_ULTIMATE.start_cstrcmp_#t~mem8_5|, ULTIMATE.start_cstrcmp_#in~s2.offset=|v_ULTIMATE.start_cstrcmp_#in~s2.offset_2|, ULTIMATE.start_cstrcmp_#t~post7.offset=|v_ULTIMATE.start_cstrcmp_#t~post7.offset_4|, ULTIMATE.start_main_#t~ret11.offset=|v_ULTIMATE.start_main_#t~ret11.offset_7|, ULTIMATE.start_cstrcmp_#t~post7.base=|v_ULTIMATE.start_cstrcmp_#t~post7.base_4|, ULTIMATE.start_cstrcmp_#t~post6.base=|v_ULTIMATE.start_cstrcmp_#t~post6.base_4|, ULTIMATE.start_cstrcmp_#t~mem3=|v_ULTIMATE.start_cstrcmp_#t~mem3_6|, ULTIMATE.start_cstrcmp_~s1.offset=v_ULTIMATE.start_cstrcmp_~s1.offset_11, ULTIMATE.start_cstrcmp_#t~mem2=|v_ULTIMATE.start_cstrcmp_#t~mem2_6|, ULTIMATE.start_cstrcmp_#t~mem4=|v_ULTIMATE.start_cstrcmp_#t~mem4_6|, ULTIMATE.start_cstrcmp_#t~post6.offset=|v_ULTIMATE.start_cstrcmp_#t~post6.offset_4|, ULTIMATE.start_cstrcmp_~s1.base=v_ULTIMATE.start_cstrcmp_~s1.base_14, ULTIMATE.start_cstrcmp_~s2.base=v_ULTIMATE.start_cstrcmp_~s2.base_11, #length=|v_#length_22|, ULTIMATE.start___VERIFIER_nondet_String_#res.base=|v_ULTIMATE.start___VERIFIER_nondet_String_#res.base_12|, ULTIMATE.start_cstrcmp_~uc1~0=v_ULTIMATE.start_cstrcmp_~uc1~0_6, ULTIMATE.start___VERIFIER_nondet_String_#res.offset=|v_ULTIMATE.start___VERIFIER_nondet_String_#res.offset_12|, ULTIMATE.start_cstrcmp_~s2.offset=v_ULTIMATE.start_cstrcmp_~s2.offset_9, ULTIMATE.start_main_#t~ret11.base=|v_ULTIMATE.start_main_#t~ret11.base_7|, ULTIMATE.start_main_#t~ret12.offset=|v_ULTIMATE.start_main_#t~ret12.offset_5|, ULTIMATE.start_cstrcmp_~uc2~0=v_ULTIMATE.start_cstrcmp_~uc2~0_6, ULTIMATE.start_main_#t~ret12.base=|v_ULTIMATE.start_main_#t~ret12.base_5|, ULTIMATE.start_cstrcmp_#res=|v_ULTIMATE.start_cstrcmp_#res_4|, ULTIMATE.start_cstrcmp_#t~ite10=|v_ULTIMATE.start_cstrcmp_#t~ite10_6|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_16, #valid=|v_#valid_26|, ULTIMATE.start_cstrcmp_#in~s1.offset=|v_ULTIMATE.start_cstrcmp_#in~s1.offset_2|, #memory_int=|v_#memory_int_16|, ULTIMATE.start_cstrcmp_#in~s2.base=|v_ULTIMATE.start_cstrcmp_#in~s2.base_2|, ULTIMATE.start_cstrcmp_#in~s1.base=|v_ULTIMATE.start_cstrcmp_#in~s1.base_2|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_23, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_18} AuxVars[] AssignedVars[ULTIMATE.start_cstrcmp_#t~mem9, ULTIMATE.start_cstrcmp_#t~short5, ULTIMATE.start_cstrcmp_#t~mem8, ULTIMATE.start_cstrcmp_#in~s2.offset, ULTIMATE.start_cstrcmp_#t~post7.offset, ULTIMATE.start_cstrcmp_#t~post7.base, ULTIMATE.start_cstrcmp_#t~post6.base, ULTIMATE.start_cstrcmp_#t~mem3, ULTIMATE.start_cstrcmp_~s1.offset, ULTIMATE.start_cstrcmp_#t~mem2, ULTIMATE.start_cstrcmp_#t~mem4, ULTIMATE.start_cstrcmp_#t~post6.offset, ULTIMATE.start_cstrcmp_~s1.base, ULTIMATE.start_cstrcmp_~s2.base, ULTIMATE.start___VERIFIER_nondet_String_#res.base, ULTIMATE.start_cstrcmp_~uc1~0, ULTIMATE.start___VERIFIER_nondet_String_#res.offset, ULTIMATE.start_cstrcmp_~s2.offset, ULTIMATE.start_main_#t~ret12.offset, ULTIMATE.start_cstrcmp_~uc2~0, ULTIMATE.start_main_#t~ret12.base, ULTIMATE.start_cstrcmp_#res, ULTIMATE.start_cstrcmp_#t~ite10, ULTIMATE.start_cstrcmp_#in~s1.offset, #memory_int, ULTIMATE.start_cstrcmp_#in~s2.base, ULTIMATE.start_cstrcmp_#in~s1.base] 25#L30-9true [2020-06-22 02:53:12,585 INFO L796 eck$LassoCheckResult]: Loop: 25#L30-9true [118] L30-9-->L30-1: Formula: (and (<= (+ v_ULTIMATE.start_cstrcmp_~s1.offset_3 1) (select |v_#length_10| v_ULTIMATE.start_cstrcmp_~s1.base_3)) (= (select (select |v_#memory_int_5| v_ULTIMATE.start_cstrcmp_~s1.base_3) v_ULTIMATE.start_cstrcmp_~s1.offset_3) |v_ULTIMATE.start_cstrcmp_#t~mem2_2|) (<= 0 v_ULTIMATE.start_cstrcmp_~s1.offset_3) (= (select |v_#valid_11| v_ULTIMATE.start_cstrcmp_~s1.base_3) 1)) InVars {#memory_int=|v_#memory_int_5|, #length=|v_#length_10|, ULTIMATE.start_cstrcmp_~s1.offset=v_ULTIMATE.start_cstrcmp_~s1.offset_3, ULTIMATE.start_cstrcmp_~s1.base=v_ULTIMATE.start_cstrcmp_~s1.base_3, #valid=|v_#valid_11|} OutVars{ULTIMATE.start_cstrcmp_~s1.base=v_ULTIMATE.start_cstrcmp_~s1.base_3, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_5|, #length=|v_#length_10|, ULTIMATE.start_cstrcmp_#t~mem2=|v_ULTIMATE.start_cstrcmp_#t~mem2_2|, ULTIMATE.start_cstrcmp_~s1.offset=v_ULTIMATE.start_cstrcmp_~s1.offset_3} AuxVars[] AssignedVars[ULTIMATE.start_cstrcmp_#t~mem2] 21#L30-1true [167] L30-1-->L30-2: Formula: (and |v_ULTIMATE.start_cstrcmp_#t~short5_2| (< 0 |v_ULTIMATE.start_cstrcmp_#t~mem2_3|)) InVars {ULTIMATE.start_cstrcmp_#t~mem2=|v_ULTIMATE.start_cstrcmp_#t~mem2_3|} OutVars{ULTIMATE.start_cstrcmp_#t~short5=|v_ULTIMATE.start_cstrcmp_#t~short5_2|, ULTIMATE.start_cstrcmp_#t~mem2=|v_ULTIMATE.start_cstrcmp_#t~mem2_3|} AuxVars[] AssignedVars[ULTIMATE.start_cstrcmp_#t~short5] 18#L30-2true [111] L30-2-->L30-7: Formula: (not |v_ULTIMATE.start_cstrcmp_#t~short5_5|) InVars {ULTIMATE.start_cstrcmp_#t~short5=|v_ULTIMATE.start_cstrcmp_#t~short5_5|} OutVars{ULTIMATE.start_cstrcmp_#t~short5=|v_ULTIMATE.start_cstrcmp_#t~short5_5|} AuxVars[] AssignedVars[] 28#L30-7true [123] L30-7-->L30-9: Formula: (and (= v_ULTIMATE.start_cstrcmp_~s1.offset_7 (+ v_ULTIMATE.start_cstrcmp_~s1.offset_8 1)) (= (+ v_ULTIMATE.start_cstrcmp_~s2.offset_7 1) v_ULTIMATE.start_cstrcmp_~s2.offset_6) (= v_ULTIMATE.start_cstrcmp_~s2.base_8 v_ULTIMATE.start_cstrcmp_~s2.base_7) |v_ULTIMATE.start_cstrcmp_#t~short5_9| (= v_ULTIMATE.start_cstrcmp_~s1.base_9 v_ULTIMATE.start_cstrcmp_~s1.base_10)) InVars {ULTIMATE.start_cstrcmp_#t~short5=|v_ULTIMATE.start_cstrcmp_#t~short5_9|, ULTIMATE.start_cstrcmp_~s2.offset=v_ULTIMATE.start_cstrcmp_~s2.offset_7, ULTIMATE.start_cstrcmp_~s1.offset=v_ULTIMATE.start_cstrcmp_~s1.offset_8, ULTIMATE.start_cstrcmp_~s1.base=v_ULTIMATE.start_cstrcmp_~s1.base_10, ULTIMATE.start_cstrcmp_~s2.base=v_ULTIMATE.start_cstrcmp_~s2.base_8} OutVars{ULTIMATE.start_cstrcmp_#t~short5=|v_ULTIMATE.start_cstrcmp_#t~short5_8|, ULTIMATE.start_cstrcmp_#t~post7.offset=|v_ULTIMATE.start_cstrcmp_#t~post7.offset_2|, ULTIMATE.start_cstrcmp_~s2.offset=v_ULTIMATE.start_cstrcmp_~s2.offset_6, ULTIMATE.start_cstrcmp_#t~post7.base=|v_ULTIMATE.start_cstrcmp_#t~post7.base_2|, ULTIMATE.start_cstrcmp_#t~post6.base=|v_ULTIMATE.start_cstrcmp_#t~post6.base_2|, ULTIMATE.start_cstrcmp_#t~mem3=|v_ULTIMATE.start_cstrcmp_#t~mem3_5|, ULTIMATE.start_cstrcmp_~s1.offset=v_ULTIMATE.start_cstrcmp_~s1.offset_7, ULTIMATE.start_cstrcmp_#t~mem2=|v_ULTIMATE.start_cstrcmp_#t~mem2_5|, ULTIMATE.start_cstrcmp_#t~mem4=|v_ULTIMATE.start_cstrcmp_#t~mem4_5|, ULTIMATE.start_cstrcmp_#t~post6.offset=|v_ULTIMATE.start_cstrcmp_#t~post6.offset_2|, ULTIMATE.start_cstrcmp_~s1.base=v_ULTIMATE.start_cstrcmp_~s1.base_9, ULTIMATE.start_cstrcmp_~s2.base=v_ULTIMATE.start_cstrcmp_~s2.base_7} AuxVars[] AssignedVars[ULTIMATE.start_cstrcmp_#t~short5, ULTIMATE.start_cstrcmp_#t~post7.offset, ULTIMATE.start_cstrcmp_~s2.offset, ULTIMATE.start_cstrcmp_#t~post6.offset, ULTIMATE.start_cstrcmp_~s1.base, ULTIMATE.start_cstrcmp_#t~post7.base, ULTIMATE.start_cstrcmp_~s2.base, ULTIMATE.start_cstrcmp_#t~post6.base, ULTIMATE.start_cstrcmp_#t~mem3, ULTIMATE.start_cstrcmp_~s1.offset, ULTIMATE.start_cstrcmp_#t~mem2, ULTIMATE.start_cstrcmp_#t~mem4] 25#L30-9true [2020-06-22 02:53:12,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 02:53:12,585 INFO L82 PathProgramCache]: Analyzing trace with hash -342978630, now seen corresponding path program 1 times [2020-06-22 02:53:12,586 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 02:53:12,586 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 02:53:12,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:53:12,587 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 02:53:12,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:53:12,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 02:53:12,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 02:53:12,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 02:53:12,617 INFO L82 PathProgramCache]: Analyzing trace with hash 4602910, now seen corresponding path program 1 times [2020-06-22 02:53:12,617 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 02:53:12,617 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 02:53:12,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:53:12,618 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 02:53:12,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:53:12,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 02:53:12,629 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 02:53:12,630 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 02:53:12,630 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-06-22 02:53:12,630 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-06-22 02:53:12,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 02:53:12,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 02:53:12,632 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 3 states. [2020-06-22 02:53:12,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 02:53:12,703 INFO L93 Difference]: Finished difference Result 32 states and 55 transitions. [2020-06-22 02:53:12,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 02:53:12,706 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 55 transitions. [2020-06-22 02:53:12,708 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2020-06-22 02:53:12,708 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 16 states and 25 transitions. [2020-06-22 02:53:12,709 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2020-06-22 02:53:12,709 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2020-06-22 02:53:12,710 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 25 transitions. [2020-06-22 02:53:12,710 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 02:53:12,710 INFO L706 BuchiCegarLoop]: Abstraction has 16 states and 25 transitions. [2020-06-22 02:53:12,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 25 transitions. [2020-06-22 02:53:12,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2020-06-22 02:53:12,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-06-22 02:53:12,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 24 transitions. [2020-06-22 02:53:12,713 INFO L729 BuchiCegarLoop]: Abstraction has 15 states and 24 transitions. [2020-06-22 02:53:12,713 INFO L609 BuchiCegarLoop]: Abstraction has 15 states and 24 transitions. [2020-06-22 02:53:12,714 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2020-06-22 02:53:12,714 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 24 transitions. [2020-06-22 02:53:12,714 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2020-06-22 02:53:12,714 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 02:53:12,714 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 02:53:12,715 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2020-06-22 02:53:12,715 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-06-22 02:53:12,716 INFO L794 eck$LassoCheckResult]: Stem: 83#ULTIMATE.startENTRY [187] ULTIMATE.startENTRY-->L12: Formula: (and (= (store |v_#valid_22| 0 0) |v_#valid_21|) (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|)) InVars {#valid=|v_#valid_22|} OutVars{ULTIMATE.start___VERIFIER_nondet_String_#res.offset=|v_ULTIMATE.start___VERIFIER_nondet_String_#res.offset_7|, ULTIMATE.start_main_#t~ret11.offset=|v_ULTIMATE.start_main_#t~ret11.offset_5|, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset_5|, ULTIMATE.start_main_#t~ret11.base=|v_ULTIMATE.start_main_#t~ret11.base_5|, ULTIMATE.start_main_#t~ret12.offset=|v_ULTIMATE.start_main_#t~ret12.offset_4|, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~ret12.base=|v_ULTIMATE.start_main_#t~ret12.base_4|, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~ret13=|v_ULTIMATE.start_main_#t~ret13_4|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_11, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, #valid=|v_#valid_21|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_18, ULTIMATE.start___VERIFIER_nondet_String_#t~nondet0=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~nondet0_8|, ULTIMATE.start___VERIFIER_nondet_String_#res.base=|v_ULTIMATE.start___VERIFIER_nondet_String_#res.base_7|, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_5|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_13} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_nondet_String_#res.offset, ULTIMATE.start_main_#t~ret11.offset, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset, ULTIMATE.start_main_#t~ret11.base, ULTIMATE.start_main_#t~ret12.offset, #NULL.offset, ULTIMATE.start_main_#t~ret12.base, #NULL.base, ULTIMATE.start_main_#t~ret13, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset, ULTIMATE.start_main_#res, #valid, ULTIMATE.start___VERIFIER_nondet_String_~length~0, ULTIMATE.start___VERIFIER_nondet_String_#t~nondet0, ULTIMATE.start___VERIFIER_nondet_String_#res.base, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base] 84#L12 [126] L12-->L12-2: Formula: (>= v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_6 1) InVars {ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_6} OutVars{ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_6} AuxVars[] AssignedVars[] 81#L12-2 [148] L12-2-->L16: Formula: (and (= v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_2 |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_2|) (< 0 |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_2|) (= (store |v_#length_3| |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_2| v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_7) |v_#length_2|) (= (select |v_#valid_4| |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_2|) 0) (= v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_2 |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset_2|) (= 0 |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset_2|) (= |v_#valid_3| (store |v_#valid_4| |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_2| 1)) (< |v_#StackHeapBarrier_1| |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_2|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_7, #length=|v_#length_3|, #valid=|v_#valid_4|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset_2|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_2, #valid=|v_#valid_3|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_7, #length=|v_#length_2|, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_2|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_2} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset, #valid, #length, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base] 73#L16 [189] L16-->L12-3: Formula: (let ((.cse0 (+ v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_14 v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_21))) (and (<= 1 .cse0) (= |v_ULTIMATE.start_main_#t~ret11.offset_6| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_14) (= (store |v_#memory_int_13| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_16 (store (select |v_#memory_int_13| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_16) (+ v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_14 v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_21 (- 1)) 0)) |v_#memory_int_12|) (= 1 (select |v_#valid_24| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_16)) (<= .cse0 (select |v_#length_20| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_16)) (= |v_ULTIMATE.start_main_#t~ret11.base_6| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_16))) InVars {ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_14, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_13|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_21, #length=|v_#length_20|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_16} OutVars{ULTIMATE.start___VERIFIER_nondet_String_#res.offset=|v_ULTIMATE.start___VERIFIER_nondet_String_#res.offset_9|, ULTIMATE.start_main_#t~ret11.offset=|v_ULTIMATE.start_main_#t~ret11.offset_6|, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset_6|, ULTIMATE.start_main_#t~ret11.base=|v_ULTIMATE.start_main_#t~ret11.base_6|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_13, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_12|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_20, #length=|v_#length_20|, ULTIMATE.start___VERIFIER_nondet_String_#t~nondet0=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~nondet0_10|, ULTIMATE.start___VERIFIER_nondet_String_#res.base=|v_ULTIMATE.start___VERIFIER_nondet_String_#res.base_9|, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_6|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_15} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_nondet_String_#res.offset, ULTIMATE.start_main_#t~ret11.offset, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset, ULTIMATE.start_main_#t~ret11.base, #memory_int, ULTIMATE.start___VERIFIER_nondet_String_~length~0, ULTIMATE.start___VERIFIER_nondet_String_#t~nondet0, ULTIMATE.start___VERIFIER_nondet_String_#res.base, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base] 74#L12-3 [130] L12-3-->L12-5: Formula: (>= v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_14 1) InVars {ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_14} OutVars{ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_14} AuxVars[] AssignedVars[] 77#L12-5 [154] L12-5-->L16-2: Formula: (and (= |v_#length_6| (store |v_#length_7| |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_4| v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_15)) (= v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_7 |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset_4|) (= (store |v_#valid_8| |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_4| 1) |v_#valid_7|) (= (select |v_#valid_8| |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_4|) 0) (= v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_8 |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_4|) (> 0 |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_4|) (= 0 |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset_4|) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_4|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_15, #length=|v_#length_7|, #valid=|v_#valid_8|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset_4|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_7, #valid=|v_#valid_7|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_15, #length=|v_#length_6|, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_4|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_8} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset, #valid, #length, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base] 78#L16-2 [191] L16-2-->L30-9: Formula: (let ((.cse0 (+ v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_16 v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_23))) (and (= |v_ULTIMATE.start_cstrcmp_#in~s2.base_2| v_ULTIMATE.start_cstrcmp_~s2.base_11) (= |v_ULTIMATE.start_main_#t~ret11.base_7| |v_ULTIMATE.start_cstrcmp_#in~s1.base_2|) (= |v_ULTIMATE.start_cstrcmp_#in~s2.offset_2| v_ULTIMATE.start_cstrcmp_~s2.offset_9) (<= 1 .cse0) (= |v_ULTIMATE.start_cstrcmp_#in~s1.offset_2| v_ULTIMATE.start_cstrcmp_~s1.offset_11) (= |v_ULTIMATE.start___VERIFIER_nondet_String_#res.offset_12| |v_ULTIMATE.start_main_#t~ret12.offset_5|) (= |v_ULTIMATE.start___VERIFIER_nondet_String_#res.base_12| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_18) (= |v_ULTIMATE.start_cstrcmp_#in~s2.base_2| |v_ULTIMATE.start_main_#t~ret12.base_5|) (= |v_ULTIMATE.start___VERIFIER_nondet_String_#res.offset_12| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_16) (<= .cse0 (select |v_#length_22| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_18)) (= |v_ULTIMATE.start___VERIFIER_nondet_String_#res.base_12| |v_ULTIMATE.start_main_#t~ret12.base_5|) (= |v_ULTIMATE.start_main_#t~ret11.offset_7| |v_ULTIMATE.start_cstrcmp_#in~s1.offset_2|) (= 1 (select |v_#valid_26| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_18)) (= v_ULTIMATE.start_cstrcmp_~s1.base_14 |v_ULTIMATE.start_cstrcmp_#in~s1.base_2|) (= |v_ULTIMATE.start_main_#t~ret12.offset_5| |v_ULTIMATE.start_cstrcmp_#in~s2.offset_2|) (= (store |v_#memory_int_17| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_18 (store (select |v_#memory_int_17| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_18) (+ v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_16 v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_23 (- 1)) 0)) |v_#memory_int_16|))) InVars {ULTIMATE.start_main_#t~ret11.offset=|v_ULTIMATE.start_main_#t~ret11.offset_7|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_16, #valid=|v_#valid_26|, ULTIMATE.start_main_#t~ret11.base=|v_ULTIMATE.start_main_#t~ret11.base_7|, #memory_int=|v_#memory_int_17|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_23, #length=|v_#length_22|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_18} OutVars{ULTIMATE.start_cstrcmp_#t~mem9=|v_ULTIMATE.start_cstrcmp_#t~mem9_5|, ULTIMATE.start_cstrcmp_#t~short5=|v_ULTIMATE.start_cstrcmp_#t~short5_10|, ULTIMATE.start_cstrcmp_#t~mem8=|v_ULTIMATE.start_cstrcmp_#t~mem8_5|, ULTIMATE.start_cstrcmp_#in~s2.offset=|v_ULTIMATE.start_cstrcmp_#in~s2.offset_2|, ULTIMATE.start_cstrcmp_#t~post7.offset=|v_ULTIMATE.start_cstrcmp_#t~post7.offset_4|, ULTIMATE.start_main_#t~ret11.offset=|v_ULTIMATE.start_main_#t~ret11.offset_7|, ULTIMATE.start_cstrcmp_#t~post7.base=|v_ULTIMATE.start_cstrcmp_#t~post7.base_4|, ULTIMATE.start_cstrcmp_#t~post6.base=|v_ULTIMATE.start_cstrcmp_#t~post6.base_4|, ULTIMATE.start_cstrcmp_#t~mem3=|v_ULTIMATE.start_cstrcmp_#t~mem3_6|, ULTIMATE.start_cstrcmp_~s1.offset=v_ULTIMATE.start_cstrcmp_~s1.offset_11, ULTIMATE.start_cstrcmp_#t~mem2=|v_ULTIMATE.start_cstrcmp_#t~mem2_6|, ULTIMATE.start_cstrcmp_#t~mem4=|v_ULTIMATE.start_cstrcmp_#t~mem4_6|, ULTIMATE.start_cstrcmp_#t~post6.offset=|v_ULTIMATE.start_cstrcmp_#t~post6.offset_4|, ULTIMATE.start_cstrcmp_~s1.base=v_ULTIMATE.start_cstrcmp_~s1.base_14, ULTIMATE.start_cstrcmp_~s2.base=v_ULTIMATE.start_cstrcmp_~s2.base_11, #length=|v_#length_22|, ULTIMATE.start___VERIFIER_nondet_String_#res.base=|v_ULTIMATE.start___VERIFIER_nondet_String_#res.base_12|, ULTIMATE.start_cstrcmp_~uc1~0=v_ULTIMATE.start_cstrcmp_~uc1~0_6, ULTIMATE.start___VERIFIER_nondet_String_#res.offset=|v_ULTIMATE.start___VERIFIER_nondet_String_#res.offset_12|, ULTIMATE.start_cstrcmp_~s2.offset=v_ULTIMATE.start_cstrcmp_~s2.offset_9, ULTIMATE.start_main_#t~ret11.base=|v_ULTIMATE.start_main_#t~ret11.base_7|, ULTIMATE.start_main_#t~ret12.offset=|v_ULTIMATE.start_main_#t~ret12.offset_5|, ULTIMATE.start_cstrcmp_~uc2~0=v_ULTIMATE.start_cstrcmp_~uc2~0_6, ULTIMATE.start_main_#t~ret12.base=|v_ULTIMATE.start_main_#t~ret12.base_5|, ULTIMATE.start_cstrcmp_#res=|v_ULTIMATE.start_cstrcmp_#res_4|, ULTIMATE.start_cstrcmp_#t~ite10=|v_ULTIMATE.start_cstrcmp_#t~ite10_6|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_16, #valid=|v_#valid_26|, ULTIMATE.start_cstrcmp_#in~s1.offset=|v_ULTIMATE.start_cstrcmp_#in~s1.offset_2|, #memory_int=|v_#memory_int_16|, ULTIMATE.start_cstrcmp_#in~s2.base=|v_ULTIMATE.start_cstrcmp_#in~s2.base_2|, ULTIMATE.start_cstrcmp_#in~s1.base=|v_ULTIMATE.start_cstrcmp_#in~s1.base_2|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_23, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_18} AuxVars[] AssignedVars[ULTIMATE.start_cstrcmp_#t~mem9, ULTIMATE.start_cstrcmp_#t~short5, ULTIMATE.start_cstrcmp_#t~mem8, ULTIMATE.start_cstrcmp_#in~s2.offset, ULTIMATE.start_cstrcmp_#t~post7.offset, ULTIMATE.start_cstrcmp_#t~post7.base, ULTIMATE.start_cstrcmp_#t~post6.base, ULTIMATE.start_cstrcmp_#t~mem3, ULTIMATE.start_cstrcmp_~s1.offset, ULTIMATE.start_cstrcmp_#t~mem2, ULTIMATE.start_cstrcmp_#t~mem4, ULTIMATE.start_cstrcmp_#t~post6.offset, ULTIMATE.start_cstrcmp_~s1.base, ULTIMATE.start_cstrcmp_~s2.base, ULTIMATE.start___VERIFIER_nondet_String_#res.base, ULTIMATE.start_cstrcmp_~uc1~0, ULTIMATE.start___VERIFIER_nondet_String_#res.offset, ULTIMATE.start_cstrcmp_~s2.offset, ULTIMATE.start_main_#t~ret12.offset, ULTIMATE.start_cstrcmp_~uc2~0, ULTIMATE.start_main_#t~ret12.base, ULTIMATE.start_cstrcmp_#res, ULTIMATE.start_cstrcmp_#t~ite10, ULTIMATE.start_cstrcmp_#in~s1.offset, #memory_int, ULTIMATE.start_cstrcmp_#in~s2.base, ULTIMATE.start_cstrcmp_#in~s1.base] 82#L30-9 [2020-06-22 02:53:12,716 INFO L796 eck$LassoCheckResult]: Loop: 82#L30-9 [118] L30-9-->L30-1: Formula: (and (<= (+ v_ULTIMATE.start_cstrcmp_~s1.offset_3 1) (select |v_#length_10| v_ULTIMATE.start_cstrcmp_~s1.base_3)) (= (select (select |v_#memory_int_5| v_ULTIMATE.start_cstrcmp_~s1.base_3) v_ULTIMATE.start_cstrcmp_~s1.offset_3) |v_ULTIMATE.start_cstrcmp_#t~mem2_2|) (<= 0 v_ULTIMATE.start_cstrcmp_~s1.offset_3) (= (select |v_#valid_11| v_ULTIMATE.start_cstrcmp_~s1.base_3) 1)) InVars {#memory_int=|v_#memory_int_5|, #length=|v_#length_10|, ULTIMATE.start_cstrcmp_~s1.offset=v_ULTIMATE.start_cstrcmp_~s1.offset_3, ULTIMATE.start_cstrcmp_~s1.base=v_ULTIMATE.start_cstrcmp_~s1.base_3, #valid=|v_#valid_11|} OutVars{ULTIMATE.start_cstrcmp_~s1.base=v_ULTIMATE.start_cstrcmp_~s1.base_3, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_5|, #length=|v_#length_10|, ULTIMATE.start_cstrcmp_#t~mem2=|v_ULTIMATE.start_cstrcmp_#t~mem2_2|, ULTIMATE.start_cstrcmp_~s1.offset=v_ULTIMATE.start_cstrcmp_~s1.offset_3} AuxVars[] AssignedVars[ULTIMATE.start_cstrcmp_#t~mem2] 79#L30-1 [168] L30-1-->L30-2: Formula: (and (not |v_ULTIMATE.start_cstrcmp_#t~short5_2|) (= 0 |v_ULTIMATE.start_cstrcmp_#t~mem2_3|)) InVars {ULTIMATE.start_cstrcmp_#t~mem2=|v_ULTIMATE.start_cstrcmp_#t~mem2_3|} OutVars{ULTIMATE.start_cstrcmp_#t~short5=|v_ULTIMATE.start_cstrcmp_#t~short5_2|, ULTIMATE.start_cstrcmp_#t~mem2=|v_ULTIMATE.start_cstrcmp_#t~mem2_3|} AuxVars[] AssignedVars[ULTIMATE.start_cstrcmp_#t~short5] 80#L30-2 [111] L30-2-->L30-7: Formula: (not |v_ULTIMATE.start_cstrcmp_#t~short5_5|) InVars {ULTIMATE.start_cstrcmp_#t~short5=|v_ULTIMATE.start_cstrcmp_#t~short5_5|} OutVars{ULTIMATE.start_cstrcmp_#t~short5=|v_ULTIMATE.start_cstrcmp_#t~short5_5|} AuxVars[] AssignedVars[] 85#L30-7 [123] L30-7-->L30-9: Formula: (and (= v_ULTIMATE.start_cstrcmp_~s1.offset_7 (+ v_ULTIMATE.start_cstrcmp_~s1.offset_8 1)) (= (+ v_ULTIMATE.start_cstrcmp_~s2.offset_7 1) v_ULTIMATE.start_cstrcmp_~s2.offset_6) (= v_ULTIMATE.start_cstrcmp_~s2.base_8 v_ULTIMATE.start_cstrcmp_~s2.base_7) |v_ULTIMATE.start_cstrcmp_#t~short5_9| (= v_ULTIMATE.start_cstrcmp_~s1.base_9 v_ULTIMATE.start_cstrcmp_~s1.base_10)) InVars {ULTIMATE.start_cstrcmp_#t~short5=|v_ULTIMATE.start_cstrcmp_#t~short5_9|, ULTIMATE.start_cstrcmp_~s2.offset=v_ULTIMATE.start_cstrcmp_~s2.offset_7, ULTIMATE.start_cstrcmp_~s1.offset=v_ULTIMATE.start_cstrcmp_~s1.offset_8, ULTIMATE.start_cstrcmp_~s1.base=v_ULTIMATE.start_cstrcmp_~s1.base_10, ULTIMATE.start_cstrcmp_~s2.base=v_ULTIMATE.start_cstrcmp_~s2.base_8} OutVars{ULTIMATE.start_cstrcmp_#t~short5=|v_ULTIMATE.start_cstrcmp_#t~short5_8|, ULTIMATE.start_cstrcmp_#t~post7.offset=|v_ULTIMATE.start_cstrcmp_#t~post7.offset_2|, ULTIMATE.start_cstrcmp_~s2.offset=v_ULTIMATE.start_cstrcmp_~s2.offset_6, ULTIMATE.start_cstrcmp_#t~post7.base=|v_ULTIMATE.start_cstrcmp_#t~post7.base_2|, ULTIMATE.start_cstrcmp_#t~post6.base=|v_ULTIMATE.start_cstrcmp_#t~post6.base_2|, ULTIMATE.start_cstrcmp_#t~mem3=|v_ULTIMATE.start_cstrcmp_#t~mem3_5|, ULTIMATE.start_cstrcmp_~s1.offset=v_ULTIMATE.start_cstrcmp_~s1.offset_7, ULTIMATE.start_cstrcmp_#t~mem2=|v_ULTIMATE.start_cstrcmp_#t~mem2_5|, ULTIMATE.start_cstrcmp_#t~mem4=|v_ULTIMATE.start_cstrcmp_#t~mem4_5|, ULTIMATE.start_cstrcmp_#t~post6.offset=|v_ULTIMATE.start_cstrcmp_#t~post6.offset_2|, ULTIMATE.start_cstrcmp_~s1.base=v_ULTIMATE.start_cstrcmp_~s1.base_9, ULTIMATE.start_cstrcmp_~s2.base=v_ULTIMATE.start_cstrcmp_~s2.base_7} AuxVars[] AssignedVars[ULTIMATE.start_cstrcmp_#t~short5, ULTIMATE.start_cstrcmp_#t~post7.offset, ULTIMATE.start_cstrcmp_~s2.offset, ULTIMATE.start_cstrcmp_#t~post6.offset, ULTIMATE.start_cstrcmp_~s1.base, ULTIMATE.start_cstrcmp_#t~post7.base, ULTIMATE.start_cstrcmp_~s2.base, ULTIMATE.start_cstrcmp_#t~post6.base, ULTIMATE.start_cstrcmp_#t~mem3, ULTIMATE.start_cstrcmp_~s1.offset, ULTIMATE.start_cstrcmp_#t~mem2, ULTIMATE.start_cstrcmp_#t~mem4] 82#L30-9 [2020-06-22 02:53:12,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 02:53:12,716 INFO L82 PathProgramCache]: Analyzing trace with hash -342978630, now seen corresponding path program 2 times [2020-06-22 02:53:12,716 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 02:53:12,717 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 02:53:12,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:53:12,717 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 02:53:12,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:53:12,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 02:53:12,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 02:53:12,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 02:53:12,729 INFO L82 PathProgramCache]: Analyzing trace with hash 4603871, now seen corresponding path program 1 times [2020-06-22 02:53:12,729 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 02:53:12,729 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 02:53:12,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:53:12,730 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 02:53:12,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:53:12,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 02:53:12,736 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 02:53:12,736 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 02:53:12,736 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 02:53:12,737 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-06-22 02:53:12,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 02:53:12,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 02:53:12,737 INFO L87 Difference]: Start difference. First operand 15 states and 24 transitions. cyclomatic complexity: 10 Second operand 3 states. [2020-06-22 02:53:12,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 02:53:12,764 INFO L93 Difference]: Finished difference Result 16 states and 23 transitions. [2020-06-22 02:53:12,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 02:53:12,765 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 23 transitions. [2020-06-22 02:53:12,766 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2020-06-22 02:53:12,766 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 14 states and 19 transitions. [2020-06-22 02:53:12,766 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2020-06-22 02:53:12,766 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2020-06-22 02:53:12,766 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 19 transitions. [2020-06-22 02:53:12,767 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 02:53:12,767 INFO L706 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2020-06-22 02:53:12,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 19 transitions. [2020-06-22 02:53:12,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2020-06-22 02:53:12,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-06-22 02:53:12,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 19 transitions. [2020-06-22 02:53:12,768 INFO L729 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2020-06-22 02:53:12,768 INFO L609 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2020-06-22 02:53:12,768 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2020-06-22 02:53:12,768 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 19 transitions. [2020-06-22 02:53:12,769 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2020-06-22 02:53:12,769 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 02:53:12,769 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 02:53:12,769 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2020-06-22 02:53:12,769 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2020-06-22 02:53:12,770 INFO L794 eck$LassoCheckResult]: Stem: 119#ULTIMATE.startENTRY [187] ULTIMATE.startENTRY-->L12: Formula: (and (= (store |v_#valid_22| 0 0) |v_#valid_21|) (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|)) InVars {#valid=|v_#valid_22|} OutVars{ULTIMATE.start___VERIFIER_nondet_String_#res.offset=|v_ULTIMATE.start___VERIFIER_nondet_String_#res.offset_7|, ULTIMATE.start_main_#t~ret11.offset=|v_ULTIMATE.start_main_#t~ret11.offset_5|, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset_5|, ULTIMATE.start_main_#t~ret11.base=|v_ULTIMATE.start_main_#t~ret11.base_5|, ULTIMATE.start_main_#t~ret12.offset=|v_ULTIMATE.start_main_#t~ret12.offset_4|, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~ret12.base=|v_ULTIMATE.start_main_#t~ret12.base_4|, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~ret13=|v_ULTIMATE.start_main_#t~ret13_4|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_11, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, #valid=|v_#valid_21|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_18, ULTIMATE.start___VERIFIER_nondet_String_#t~nondet0=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~nondet0_8|, ULTIMATE.start___VERIFIER_nondet_String_#res.base=|v_ULTIMATE.start___VERIFIER_nondet_String_#res.base_7|, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_5|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_13} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_nondet_String_#res.offset, ULTIMATE.start_main_#t~ret11.offset, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset, ULTIMATE.start_main_#t~ret11.base, ULTIMATE.start_main_#t~ret12.offset, #NULL.offset, ULTIMATE.start_main_#t~ret12.base, #NULL.base, ULTIMATE.start_main_#t~ret13, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset, ULTIMATE.start_main_#res, #valid, ULTIMATE.start___VERIFIER_nondet_String_~length~0, ULTIMATE.start___VERIFIER_nondet_String_#t~nondet0, ULTIMATE.start___VERIFIER_nondet_String_#res.base, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base] 120#L12 [126] L12-->L12-2: Formula: (>= v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_6 1) InVars {ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_6} OutVars{ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_6} AuxVars[] AssignedVars[] 117#L12-2 [148] L12-2-->L16: Formula: (and (= v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_2 |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_2|) (< 0 |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_2|) (= (store |v_#length_3| |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_2| v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_7) |v_#length_2|) (= (select |v_#valid_4| |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_2|) 0) (= v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_2 |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset_2|) (= 0 |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset_2|) (= |v_#valid_3| (store |v_#valid_4| |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_2| 1)) (< |v_#StackHeapBarrier_1| |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_2|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_7, #length=|v_#length_3|, #valid=|v_#valid_4|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset_2|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_2, #valid=|v_#valid_3|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_7, #length=|v_#length_2|, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_2|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_2} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset, #valid, #length, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base] 110#L16 [189] L16-->L12-3: Formula: (let ((.cse0 (+ v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_14 v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_21))) (and (<= 1 .cse0) (= |v_ULTIMATE.start_main_#t~ret11.offset_6| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_14) (= (store |v_#memory_int_13| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_16 (store (select |v_#memory_int_13| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_16) (+ v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_14 v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_21 (- 1)) 0)) |v_#memory_int_12|) (= 1 (select |v_#valid_24| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_16)) (<= .cse0 (select |v_#length_20| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_16)) (= |v_ULTIMATE.start_main_#t~ret11.base_6| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_16))) InVars {ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_14, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_13|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_21, #length=|v_#length_20|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_16} OutVars{ULTIMATE.start___VERIFIER_nondet_String_#res.offset=|v_ULTIMATE.start___VERIFIER_nondet_String_#res.offset_9|, ULTIMATE.start_main_#t~ret11.offset=|v_ULTIMATE.start_main_#t~ret11.offset_6|, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset_6|, ULTIMATE.start_main_#t~ret11.base=|v_ULTIMATE.start_main_#t~ret11.base_6|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_13, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_12|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_20, #length=|v_#length_20|, ULTIMATE.start___VERIFIER_nondet_String_#t~nondet0=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~nondet0_10|, ULTIMATE.start___VERIFIER_nondet_String_#res.base=|v_ULTIMATE.start___VERIFIER_nondet_String_#res.base_9|, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_6|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_15} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_nondet_String_#res.offset, ULTIMATE.start_main_#t~ret11.offset, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset, ULTIMATE.start_main_#t~ret11.base, #memory_int, ULTIMATE.start___VERIFIER_nondet_String_~length~0, ULTIMATE.start___VERIFIER_nondet_String_#t~nondet0, ULTIMATE.start___VERIFIER_nondet_String_#res.base, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base] 111#L12-3 [130] L12-3-->L12-5: Formula: (>= v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_14 1) InVars {ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_14} OutVars{ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_14} AuxVars[] AssignedVars[] 114#L12-5 [154] L12-5-->L16-2: Formula: (and (= |v_#length_6| (store |v_#length_7| |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_4| v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_15)) (= v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_7 |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset_4|) (= (store |v_#valid_8| |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_4| 1) |v_#valid_7|) (= (select |v_#valid_8| |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_4|) 0) (= v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_8 |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_4|) (> 0 |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_4|) (= 0 |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset_4|) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_4|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_15, #length=|v_#length_7|, #valid=|v_#valid_8|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset_4|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_7, #valid=|v_#valid_7|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_15, #length=|v_#length_6|, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_4|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_8} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset, #valid, #length, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base] 115#L16-2 [191] L16-2-->L30-9: Formula: (let ((.cse0 (+ v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_16 v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_23))) (and (= |v_ULTIMATE.start_cstrcmp_#in~s2.base_2| v_ULTIMATE.start_cstrcmp_~s2.base_11) (= |v_ULTIMATE.start_main_#t~ret11.base_7| |v_ULTIMATE.start_cstrcmp_#in~s1.base_2|) (= |v_ULTIMATE.start_cstrcmp_#in~s2.offset_2| v_ULTIMATE.start_cstrcmp_~s2.offset_9) (<= 1 .cse0) (= |v_ULTIMATE.start_cstrcmp_#in~s1.offset_2| v_ULTIMATE.start_cstrcmp_~s1.offset_11) (= |v_ULTIMATE.start___VERIFIER_nondet_String_#res.offset_12| |v_ULTIMATE.start_main_#t~ret12.offset_5|) (= |v_ULTIMATE.start___VERIFIER_nondet_String_#res.base_12| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_18) (= |v_ULTIMATE.start_cstrcmp_#in~s2.base_2| |v_ULTIMATE.start_main_#t~ret12.base_5|) (= |v_ULTIMATE.start___VERIFIER_nondet_String_#res.offset_12| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_16) (<= .cse0 (select |v_#length_22| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_18)) (= |v_ULTIMATE.start___VERIFIER_nondet_String_#res.base_12| |v_ULTIMATE.start_main_#t~ret12.base_5|) (= |v_ULTIMATE.start_main_#t~ret11.offset_7| |v_ULTIMATE.start_cstrcmp_#in~s1.offset_2|) (= 1 (select |v_#valid_26| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_18)) (= v_ULTIMATE.start_cstrcmp_~s1.base_14 |v_ULTIMATE.start_cstrcmp_#in~s1.base_2|) (= |v_ULTIMATE.start_main_#t~ret12.offset_5| |v_ULTIMATE.start_cstrcmp_#in~s2.offset_2|) (= (store |v_#memory_int_17| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_18 (store (select |v_#memory_int_17| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_18) (+ v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_16 v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_23 (- 1)) 0)) |v_#memory_int_16|))) InVars {ULTIMATE.start_main_#t~ret11.offset=|v_ULTIMATE.start_main_#t~ret11.offset_7|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_16, #valid=|v_#valid_26|, ULTIMATE.start_main_#t~ret11.base=|v_ULTIMATE.start_main_#t~ret11.base_7|, #memory_int=|v_#memory_int_17|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_23, #length=|v_#length_22|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_18} OutVars{ULTIMATE.start_cstrcmp_#t~mem9=|v_ULTIMATE.start_cstrcmp_#t~mem9_5|, ULTIMATE.start_cstrcmp_#t~short5=|v_ULTIMATE.start_cstrcmp_#t~short5_10|, ULTIMATE.start_cstrcmp_#t~mem8=|v_ULTIMATE.start_cstrcmp_#t~mem8_5|, ULTIMATE.start_cstrcmp_#in~s2.offset=|v_ULTIMATE.start_cstrcmp_#in~s2.offset_2|, ULTIMATE.start_cstrcmp_#t~post7.offset=|v_ULTIMATE.start_cstrcmp_#t~post7.offset_4|, ULTIMATE.start_main_#t~ret11.offset=|v_ULTIMATE.start_main_#t~ret11.offset_7|, ULTIMATE.start_cstrcmp_#t~post7.base=|v_ULTIMATE.start_cstrcmp_#t~post7.base_4|, ULTIMATE.start_cstrcmp_#t~post6.base=|v_ULTIMATE.start_cstrcmp_#t~post6.base_4|, ULTIMATE.start_cstrcmp_#t~mem3=|v_ULTIMATE.start_cstrcmp_#t~mem3_6|, ULTIMATE.start_cstrcmp_~s1.offset=v_ULTIMATE.start_cstrcmp_~s1.offset_11, ULTIMATE.start_cstrcmp_#t~mem2=|v_ULTIMATE.start_cstrcmp_#t~mem2_6|, ULTIMATE.start_cstrcmp_#t~mem4=|v_ULTIMATE.start_cstrcmp_#t~mem4_6|, ULTIMATE.start_cstrcmp_#t~post6.offset=|v_ULTIMATE.start_cstrcmp_#t~post6.offset_4|, ULTIMATE.start_cstrcmp_~s1.base=v_ULTIMATE.start_cstrcmp_~s1.base_14, ULTIMATE.start_cstrcmp_~s2.base=v_ULTIMATE.start_cstrcmp_~s2.base_11, #length=|v_#length_22|, ULTIMATE.start___VERIFIER_nondet_String_#res.base=|v_ULTIMATE.start___VERIFIER_nondet_String_#res.base_12|, ULTIMATE.start_cstrcmp_~uc1~0=v_ULTIMATE.start_cstrcmp_~uc1~0_6, ULTIMATE.start___VERIFIER_nondet_String_#res.offset=|v_ULTIMATE.start___VERIFIER_nondet_String_#res.offset_12|, ULTIMATE.start_cstrcmp_~s2.offset=v_ULTIMATE.start_cstrcmp_~s2.offset_9, ULTIMATE.start_main_#t~ret11.base=|v_ULTIMATE.start_main_#t~ret11.base_7|, ULTIMATE.start_main_#t~ret12.offset=|v_ULTIMATE.start_main_#t~ret12.offset_5|, ULTIMATE.start_cstrcmp_~uc2~0=v_ULTIMATE.start_cstrcmp_~uc2~0_6, ULTIMATE.start_main_#t~ret12.base=|v_ULTIMATE.start_main_#t~ret12.base_5|, ULTIMATE.start_cstrcmp_#res=|v_ULTIMATE.start_cstrcmp_#res_4|, ULTIMATE.start_cstrcmp_#t~ite10=|v_ULTIMATE.start_cstrcmp_#t~ite10_6|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_16, #valid=|v_#valid_26|, ULTIMATE.start_cstrcmp_#in~s1.offset=|v_ULTIMATE.start_cstrcmp_#in~s1.offset_2|, #memory_int=|v_#memory_int_16|, ULTIMATE.start_cstrcmp_#in~s2.base=|v_ULTIMATE.start_cstrcmp_#in~s2.base_2|, ULTIMATE.start_cstrcmp_#in~s1.base=|v_ULTIMATE.start_cstrcmp_#in~s1.base_2|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_23, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_18} AuxVars[] AssignedVars[ULTIMATE.start_cstrcmp_#t~mem9, ULTIMATE.start_cstrcmp_#t~short5, ULTIMATE.start_cstrcmp_#t~mem8, ULTIMATE.start_cstrcmp_#in~s2.offset, ULTIMATE.start_cstrcmp_#t~post7.offset, ULTIMATE.start_cstrcmp_#t~post7.base, ULTIMATE.start_cstrcmp_#t~post6.base, ULTIMATE.start_cstrcmp_#t~mem3, ULTIMATE.start_cstrcmp_~s1.offset, ULTIMATE.start_cstrcmp_#t~mem2, ULTIMATE.start_cstrcmp_#t~mem4, ULTIMATE.start_cstrcmp_#t~post6.offset, ULTIMATE.start_cstrcmp_~s1.base, ULTIMATE.start_cstrcmp_~s2.base, ULTIMATE.start___VERIFIER_nondet_String_#res.base, ULTIMATE.start_cstrcmp_~uc1~0, ULTIMATE.start___VERIFIER_nondet_String_#res.offset, ULTIMATE.start_cstrcmp_~s2.offset, ULTIMATE.start_main_#t~ret12.offset, ULTIMATE.start_cstrcmp_~uc2~0, ULTIMATE.start_main_#t~ret12.base, ULTIMATE.start_cstrcmp_#res, ULTIMATE.start_cstrcmp_#t~ite10, ULTIMATE.start_cstrcmp_#in~s1.offset, #memory_int, ULTIMATE.start_cstrcmp_#in~s2.base, ULTIMATE.start_cstrcmp_#in~s1.base] 118#L30-9 [2020-06-22 02:53:12,770 INFO L796 eck$LassoCheckResult]: Loop: 118#L30-9 [118] L30-9-->L30-1: Formula: (and (<= (+ v_ULTIMATE.start_cstrcmp_~s1.offset_3 1) (select |v_#length_10| v_ULTIMATE.start_cstrcmp_~s1.base_3)) (= (select (select |v_#memory_int_5| v_ULTIMATE.start_cstrcmp_~s1.base_3) v_ULTIMATE.start_cstrcmp_~s1.offset_3) |v_ULTIMATE.start_cstrcmp_#t~mem2_2|) (<= 0 v_ULTIMATE.start_cstrcmp_~s1.offset_3) (= (select |v_#valid_11| v_ULTIMATE.start_cstrcmp_~s1.base_3) 1)) InVars {#memory_int=|v_#memory_int_5|, #length=|v_#length_10|, ULTIMATE.start_cstrcmp_~s1.offset=v_ULTIMATE.start_cstrcmp_~s1.offset_3, ULTIMATE.start_cstrcmp_~s1.base=v_ULTIMATE.start_cstrcmp_~s1.base_3, #valid=|v_#valid_11|} OutVars{ULTIMATE.start_cstrcmp_~s1.base=v_ULTIMATE.start_cstrcmp_~s1.base_3, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_5|, #length=|v_#length_10|, ULTIMATE.start_cstrcmp_#t~mem2=|v_ULTIMATE.start_cstrcmp_#t~mem2_2|, ULTIMATE.start_cstrcmp_~s1.offset=v_ULTIMATE.start_cstrcmp_~s1.offset_3} AuxVars[] AssignedVars[ULTIMATE.start_cstrcmp_#t~mem2] 116#L30-1 [167] L30-1-->L30-2: Formula: (and |v_ULTIMATE.start_cstrcmp_#t~short5_2| (< 0 |v_ULTIMATE.start_cstrcmp_#t~mem2_3|)) InVars {ULTIMATE.start_cstrcmp_#t~mem2=|v_ULTIMATE.start_cstrcmp_#t~mem2_3|} OutVars{ULTIMATE.start_cstrcmp_#t~short5=|v_ULTIMATE.start_cstrcmp_#t~short5_2|, ULTIMATE.start_cstrcmp_#t~mem2=|v_ULTIMATE.start_cstrcmp_#t~mem2_3|} AuxVars[] AssignedVars[ULTIMATE.start_cstrcmp_#t~short5] 113#L30-2 [110] L30-2-->L30-3: Formula: |v_ULTIMATE.start_cstrcmp_#t~short5_3| InVars {ULTIMATE.start_cstrcmp_#t~short5=|v_ULTIMATE.start_cstrcmp_#t~short5_3|} OutVars{ULTIMATE.start_cstrcmp_#t~short5=|v_ULTIMATE.start_cstrcmp_#t~short5_3|} AuxVars[] AssignedVars[] 112#L30-3 [106] L30-3-->L30-4: Formula: (and (<= (+ v_ULTIMATE.start_cstrcmp_~s1.offset_5 1) (select |v_#length_12| v_ULTIMATE.start_cstrcmp_~s1.base_6)) (<= 0 v_ULTIMATE.start_cstrcmp_~s1.offset_5) (= 1 (select |v_#valid_13| v_ULTIMATE.start_cstrcmp_~s1.base_6)) (= (select (select |v_#memory_int_6| v_ULTIMATE.start_cstrcmp_~s1.base_6) v_ULTIMATE.start_cstrcmp_~s1.offset_5) |v_ULTIMATE.start_cstrcmp_#t~mem3_2|)) InVars {#memory_int=|v_#memory_int_6|, #length=|v_#length_12|, ULTIMATE.start_cstrcmp_~s1.offset=v_ULTIMATE.start_cstrcmp_~s1.offset_5, ULTIMATE.start_cstrcmp_~s1.base=v_ULTIMATE.start_cstrcmp_~s1.base_6, #valid=|v_#valid_13|} OutVars{ULTIMATE.start_cstrcmp_~s1.base=v_ULTIMATE.start_cstrcmp_~s1.base_6, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_6|, ULTIMATE.start_cstrcmp_#t~mem3=|v_ULTIMATE.start_cstrcmp_#t~mem3_2|, #length=|v_#length_12|, ULTIMATE.start_cstrcmp_~s1.offset=v_ULTIMATE.start_cstrcmp_~s1.offset_5} AuxVars[] AssignedVars[ULTIMATE.start_cstrcmp_#t~mem3] 108#L30-4 [99] L30-4-->L30-5: Formula: (and (<= (+ v_ULTIMATE.start_cstrcmp_~s2.offset_4 1) (select |v_#length_14| v_ULTIMATE.start_cstrcmp_~s2.base_4)) (= (select (select |v_#memory_int_7| v_ULTIMATE.start_cstrcmp_~s2.base_4) v_ULTIMATE.start_cstrcmp_~s2.offset_4) |v_ULTIMATE.start_cstrcmp_#t~mem4_2|) (<= 0 v_ULTIMATE.start_cstrcmp_~s2.offset_4) (= (select |v_#valid_15| v_ULTIMATE.start_cstrcmp_~s2.base_4) 1)) InVars {#memory_int=|v_#memory_int_7|, #length=|v_#length_14|, ULTIMATE.start_cstrcmp_~s2.offset=v_ULTIMATE.start_cstrcmp_~s2.offset_4, ULTIMATE.start_cstrcmp_~s2.base=v_ULTIMATE.start_cstrcmp_~s2.base_4, #valid=|v_#valid_15|} OutVars{ULTIMATE.start_cstrcmp_~s2.offset=v_ULTIMATE.start_cstrcmp_~s2.offset_4, ULTIMATE.start_cstrcmp_~s2.base=v_ULTIMATE.start_cstrcmp_~s2.base_4, #valid=|v_#valid_15|, #memory_int=|v_#memory_int_7|, #length=|v_#length_14|, ULTIMATE.start_cstrcmp_#t~mem4=|v_ULTIMATE.start_cstrcmp_#t~mem4_2|} AuxVars[] AssignedVars[ULTIMATE.start_cstrcmp_#t~mem4] 109#L30-5 [184] L30-5-->L30-7: Formula: (and (= |v_ULTIMATE.start_cstrcmp_#t~mem4_3| |v_ULTIMATE.start_cstrcmp_#t~mem3_3|) |v_ULTIMATE.start_cstrcmp_#t~short5_4|) InVars {ULTIMATE.start_cstrcmp_#t~mem4=|v_ULTIMATE.start_cstrcmp_#t~mem4_3|, ULTIMATE.start_cstrcmp_#t~mem3=|v_ULTIMATE.start_cstrcmp_#t~mem3_3|} OutVars{ULTIMATE.start_cstrcmp_#t~short5=|v_ULTIMATE.start_cstrcmp_#t~short5_4|, ULTIMATE.start_cstrcmp_#t~mem3=|v_ULTIMATE.start_cstrcmp_#t~mem3_3|, ULTIMATE.start_cstrcmp_#t~mem4=|v_ULTIMATE.start_cstrcmp_#t~mem4_3|} AuxVars[] AssignedVars[ULTIMATE.start_cstrcmp_#t~short5] 121#L30-7 [123] L30-7-->L30-9: Formula: (and (= v_ULTIMATE.start_cstrcmp_~s1.offset_7 (+ v_ULTIMATE.start_cstrcmp_~s1.offset_8 1)) (= (+ v_ULTIMATE.start_cstrcmp_~s2.offset_7 1) v_ULTIMATE.start_cstrcmp_~s2.offset_6) (= v_ULTIMATE.start_cstrcmp_~s2.base_8 v_ULTIMATE.start_cstrcmp_~s2.base_7) |v_ULTIMATE.start_cstrcmp_#t~short5_9| (= v_ULTIMATE.start_cstrcmp_~s1.base_9 v_ULTIMATE.start_cstrcmp_~s1.base_10)) InVars {ULTIMATE.start_cstrcmp_#t~short5=|v_ULTIMATE.start_cstrcmp_#t~short5_9|, ULTIMATE.start_cstrcmp_~s2.offset=v_ULTIMATE.start_cstrcmp_~s2.offset_7, ULTIMATE.start_cstrcmp_~s1.offset=v_ULTIMATE.start_cstrcmp_~s1.offset_8, ULTIMATE.start_cstrcmp_~s1.base=v_ULTIMATE.start_cstrcmp_~s1.base_10, ULTIMATE.start_cstrcmp_~s2.base=v_ULTIMATE.start_cstrcmp_~s2.base_8} OutVars{ULTIMATE.start_cstrcmp_#t~short5=|v_ULTIMATE.start_cstrcmp_#t~short5_8|, ULTIMATE.start_cstrcmp_#t~post7.offset=|v_ULTIMATE.start_cstrcmp_#t~post7.offset_2|, ULTIMATE.start_cstrcmp_~s2.offset=v_ULTIMATE.start_cstrcmp_~s2.offset_6, ULTIMATE.start_cstrcmp_#t~post7.base=|v_ULTIMATE.start_cstrcmp_#t~post7.base_2|, ULTIMATE.start_cstrcmp_#t~post6.base=|v_ULTIMATE.start_cstrcmp_#t~post6.base_2|, ULTIMATE.start_cstrcmp_#t~mem3=|v_ULTIMATE.start_cstrcmp_#t~mem3_5|, ULTIMATE.start_cstrcmp_~s1.offset=v_ULTIMATE.start_cstrcmp_~s1.offset_7, ULTIMATE.start_cstrcmp_#t~mem2=|v_ULTIMATE.start_cstrcmp_#t~mem2_5|, ULTIMATE.start_cstrcmp_#t~mem4=|v_ULTIMATE.start_cstrcmp_#t~mem4_5|, ULTIMATE.start_cstrcmp_#t~post6.offset=|v_ULTIMATE.start_cstrcmp_#t~post6.offset_2|, ULTIMATE.start_cstrcmp_~s1.base=v_ULTIMATE.start_cstrcmp_~s1.base_9, ULTIMATE.start_cstrcmp_~s2.base=v_ULTIMATE.start_cstrcmp_~s2.base_7} AuxVars[] AssignedVars[ULTIMATE.start_cstrcmp_#t~short5, ULTIMATE.start_cstrcmp_#t~post7.offset, ULTIMATE.start_cstrcmp_~s2.offset, ULTIMATE.start_cstrcmp_#t~post6.offset, ULTIMATE.start_cstrcmp_~s1.base, ULTIMATE.start_cstrcmp_#t~post7.base, ULTIMATE.start_cstrcmp_~s2.base, ULTIMATE.start_cstrcmp_#t~post6.base, ULTIMATE.start_cstrcmp_#t~mem3, ULTIMATE.start_cstrcmp_~s1.offset, ULTIMATE.start_cstrcmp_#t~mem2, ULTIMATE.start_cstrcmp_#t~mem4] 118#L30-9 [2020-06-22 02:53:12,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 02:53:12,771 INFO L82 PathProgramCache]: Analyzing trace with hash -342978630, now seen corresponding path program 3 times [2020-06-22 02:53:12,771 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 02:53:12,771 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 02:53:12,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:53:12,772 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 02:53:12,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:53:12,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 02:53:12,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 02:53:12,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 02:53:12,783 INFO L82 PathProgramCache]: Analyzing trace with hash -314990664, now seen corresponding path program 1 times [2020-06-22 02:53:12,784 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 02:53:12,784 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 02:53:12,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:53:12,784 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 02:53:12,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:53:12,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 02:53:12,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 02:53:12,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 02:53:12,791 INFO L82 PathProgramCache]: Analyzing trace with hash 1605737951, now seen corresponding path program 1 times [2020-06-22 02:53:12,791 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 02:53:12,791 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 02:53:12,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:53:12,792 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 02:53:12,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 02:53:12,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 02:53:12,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 02:53:13,201 WARN L188 SmtUtils]: Spent 306.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 92 [2020-06-22 02:53:13,303 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 02:53:13,304 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 02:53:13,304 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 02:53:13,304 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 02:53:13,304 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 02:53:13,305 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 02:53:13,305 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 02:53:13,305 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 02:53:13,305 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration3_Lasso [2020-06-22 02:53:13,305 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 02:53:13,305 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 02:53:13,321 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 02:53:13,326 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 02:53:13,327 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 02:53:13,329 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 02:53:13,331 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 02:53:13,333 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 02:53:13,334 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 02:53:13,336 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 02:53:13,337 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 02:53:13,339 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 02:53:13,340 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 02:53:13,343 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 02:53:13,344 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 02:53:13,345 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 02:53:13,347 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 02:53:13,349 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 02:53:13,350 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 02:53:13,608 WARN L188 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 65 [2020-06-22 02:53:13,719 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 02:53:13,721 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 02:53:13,722 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 02:53:14,158 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 02:53:14,164 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 02:53:14,166 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 02:53:14,168 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 02:53:14,168 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 02:53:14,168 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 02:53:14,169 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 02:53:14,169 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 02:53:14,171 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 02:53:14,171 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 02:53:14,173 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 02:53:14,173 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 02:53:14,173 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 02:53:14,173 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 02:53:14,173 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 02:53:14,174 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 02:53:14,174 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 02:53:14,174 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 02:53:14,174 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 02:53:14,175 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 02:53:14,175 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 02:53:14,175 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 02:53:14,176 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 02:53:14,176 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 02:53:14,176 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 02:53:14,176 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 02:53:14,176 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 02:53:14,177 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 02:53:14,177 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 02:53:14,178 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 02:53:14,178 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 02:53:14,178 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 02:53:14,178 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 02:53:14,178 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 02:53:14,180 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 02:53:14,181 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 02:53:14,183 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 02:53:14,183 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 02:53:14,183 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 02:53:14,183 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 02:53:14,184 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 02:53:14,184 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 02:53:14,184 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 02:53:14,184 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 02:53:14,184 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 02:53:14,185 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 02:53:14,186 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 02:53:14,186 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 02:53:14,186 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 02:53:14,186 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 02:53:14,186 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 02:53:14,186 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 02:53:14,187 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 02:53:14,187 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 02:53:14,187 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 02:53:14,188 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 02:53:14,188 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 02:53:14,188 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 02:53:14,188 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 02:53:14,188 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 02:53:14,188 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 02:53:14,189 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 02:53:14,189 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 02:53:14,190 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 02:53:14,190 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 02:53:14,190 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 02:53:14,190 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 02:53:14,190 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 02:53:14,191 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 02:53:14,191 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 02:53:14,191 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 02:53:14,191 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 02:53:14,192 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 02:53:14,192 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 02:53:14,192 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 02:53:14,193 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 02:53:14,193 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 02:53:14,193 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 02:53:14,193 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 02:53:14,193 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 02:53:14,193 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 02:53:14,194 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 02:53:14,194 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 02:53:14,195 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 02:53:14,195 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 02:53:14,195 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 02:53:14,195 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 02:53:14,195 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 02:53:14,195 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 02:53:14,196 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 02:53:14,196 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 02:53:14,197 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 02:53:14,197 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 02:53:14,197 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 02:53:14,197 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 02:53:14,197 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 02:53:14,199 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 02:53:14,199 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 02:53:14,201 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 02:53:14,201 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 02:53:14,201 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 02:53:14,201 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 02:53:14,202 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 02:53:14,202 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 02:53:14,202 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 02:53:14,202 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 02:53:14,202 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 02:53:14,203 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 02:53:14,203 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 02:53:14,203 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 02:53:14,204 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 02:53:14,204 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 02:53:14,204 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 02:53:14,204 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 02:53:14,204 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 02:53:14,204 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 02:53:14,205 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 02:53:14,205 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 02:53:14,205 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 02:53:14,206 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 02:53:14,206 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 02:53:14,206 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 02:53:14,206 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 02:53:14,206 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 02:53:14,206 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 02:53:14,207 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 02:53:14,207 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 02:53:14,208 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 02:53:14,208 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 02:53:14,208 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 02:53:14,208 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 02:53:14,208 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 02:53:14,208 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 02:53:14,209 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 02:53:14,209 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 02:53:14,209 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 02:53:14,210 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 02:53:14,210 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 02:53:14,210 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 02:53:14,210 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 02:53:14,210 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 02:53:14,211 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 02:53:14,211 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 02:53:14,211 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 02:53:14,212 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 02:53:14,212 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 02:53:14,212 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 02:53:14,212 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 02:53:14,212 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 02:53:14,214 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 02:53:14,214 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 02:53:14,215 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 02:53:14,216 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 02:53:14,216 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 02:53:14,216 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 02:53:14,216 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 02:53:14,216 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 02:53:14,218 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 02:53:14,218 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 02:53:14,224 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 02:53:14,225 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 02:53:14,225 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 02:53:14,226 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 02:53:14,226 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 02:53:14,226 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 02:53:14,229 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 02:53:14,229 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 02:53:14,238 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 02:53:14,239 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 02:53:14,239 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 02:53:14,239 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 02:53:14,239 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 02:53:14,240 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 02:53:14,241 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 02:53:14,241 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 02:53:14,247 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 02:53:14,247 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 02:53:14,248 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 02:53:14,248 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 02:53:14,248 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 02:53:14,248 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 02:53:14,249 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 02:53:14,249 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 02:53:14,251 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 02:53:14,252 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 02:53:14,252 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 02:53:14,252 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 02:53:14,253 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 02:53:14,253 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 02:53:14,254 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 02:53:14,254 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 02:53:14,271 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 02:53:14,271 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 02:53:14,272 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 02:53:14,272 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 02:53:14,272 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 02:53:14,272 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 02:53:14,272 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 02:53:14,273 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 02:53:14,273 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 02:53:14,274 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 02:53:14,275 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 02:53:14,275 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 02:53:14,275 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 02:53:14,276 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 02:53:14,276 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 02:53:14,280 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 02:53:14,280 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 02:53:14,312 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 02:53:14,343 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2020-06-22 02:53:14,344 INFO L444 ModelExtractionUtils]: 38 out of 43 variables were initially zero. Simplification set additionally 2 variables to zero. [2020-06-22 02:53:14,346 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 02:53:14,347 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-06-22 02:53:14,348 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 02:53:14,348 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrcmp_~s2.offset, v_rep(select #length ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base)_1) = -1*ULTIMATE.start_cstrcmp_~s2.offset + 1*v_rep(select #length ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base)_1 Supporting invariants [] [2020-06-22 02:53:14,388 INFO L297 tatePredicateManager]: 12 out of 13 supporting invariants were superfluous and have been removed [2020-06-22 02:53:14,392 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 02:53:14,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 02:53:14,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 02:53:14,440 INFO L256 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 12 conjunts are in the unsatisfiable core [2020-06-22 02:53:14,441 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 02:53:14,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 02:53:14,467 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 02:53:14,468 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 02:53:14,485 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 02:53:14,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 02:53:14,532 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 02:53:14,532 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 02:53:14,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 02:53:14,586 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 8 conjunts are in the unsatisfiable core [2020-06-22 02:53:14,587 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 02:53:14,607 INFO L98 LoopCannibalizer]: 3 predicates before loop cannibalization 5 predicates after loop cannibalization [2020-06-22 02:53:14,611 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 5 loop predicates [2020-06-22 02:53:14,612 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 14 states and 19 transitions. cyclomatic complexity: 6 Second operand 5 states. [2020-06-22 02:53:14,702 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 14 states and 19 transitions. cyclomatic complexity: 6. Second operand 5 states. Result 21 states and 28 transitions. Complement of second has 7 states. [2020-06-22 02:53:14,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2020-06-22 02:53:14,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-06-22 02:53:14,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 28 transitions. [2020-06-22 02:53:14,704 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 28 transitions. Stem has 7 letters. Loop has 7 letters. [2020-06-22 02:53:14,705 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 02:53:14,706 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 28 transitions. Stem has 14 letters. Loop has 7 letters. [2020-06-22 02:53:14,706 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 02:53:14,706 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 28 transitions. Stem has 7 letters. Loop has 14 letters. [2020-06-22 02:53:14,706 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 02:53:14,712 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 28 transitions. [2020-06-22 02:53:14,713 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-06-22 02:53:14,713 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 0 states and 0 transitions. [2020-06-22 02:53:14,713 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-06-22 02:53:14,713 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-06-22 02:53:14,713 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-06-22 02:53:14,713 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 02:53:14,714 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 02:53:14,714 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 02:53:14,714 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 02:53:14,714 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2020-06-22 02:53:14,714 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-06-22 02:53:14,714 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-06-22 02:53:14,714 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-06-22 02:53:14,720 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 02:53:14 BasicIcfg [2020-06-22 02:53:14,720 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-06-22 02:53:14,721 INFO L168 Benchmark]: Toolchain (without parser) took 32672.61 ms. Allocated memory was 649.6 MB in the beginning and 978.8 MB in the end (delta: 329.3 MB). Free memory was 564.2 MB in the beginning and 681.4 MB in the end (delta: -117.2 MB). Peak memory consumption was 212.1 MB. Max. memory is 50.3 GB. [2020-06-22 02:53:14,721 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 649.6 MB. Free memory is still 592.2 MB. There was no memory consumed. Max. memory is 50.3 GB. [2020-06-22 02:53:14,722 INFO L168 Benchmark]: CACSL2BoogieTranslator took 297.66 ms. Allocated memory was 649.6 MB in the beginning and 688.4 MB in the end (delta: 38.8 MB). Free memory was 564.2 MB in the beginning and 652.9 MB in the end (delta: -88.7 MB). Peak memory consumption was 30.0 MB. Max. memory is 50.3 GB. [2020-06-22 02:53:14,722 INFO L168 Benchmark]: Boogie Procedure Inliner took 42.44 ms. Allocated memory is still 688.4 MB. Free memory was 652.9 MB in the beginning and 650.2 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 50.3 GB. [2020-06-22 02:53:14,723 INFO L168 Benchmark]: Boogie Preprocessor took 25.71 ms. Allocated memory is still 688.4 MB. Free memory was 650.2 MB in the beginning and 648.9 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. [2020-06-22 02:53:14,723 INFO L168 Benchmark]: RCFGBuilder took 363.71 ms. Allocated memory is still 688.4 MB. Free memory was 648.9 MB in the beginning and 623.9 MB in the end (delta: 25.0 MB). Peak memory consumption was 25.0 MB. Max. memory is 50.3 GB. [2020-06-22 02:53:14,723 INFO L168 Benchmark]: BlockEncodingV2 took 141.10 ms. Allocated memory is still 688.4 MB. Free memory was 623.9 MB in the beginning and 613.1 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 50.3 GB. [2020-06-22 02:53:14,724 INFO L168 Benchmark]: TraceAbstraction took 29606.92 ms. Allocated memory was 688.4 MB in the beginning and 948.4 MB in the end (delta: 260.0 MB). Free memory was 611.8 MB in the beginning and 574.8 MB in the end (delta: 37.0 MB). Peak memory consumption was 486.2 MB. Max. memory is 50.3 GB. [2020-06-22 02:53:14,724 INFO L168 Benchmark]: BuchiAutomizer took 2189.90 ms. Allocated memory was 948.4 MB in the beginning and 978.8 MB in the end (delta: 30.4 MB). Free memory was 574.8 MB in the beginning and 681.4 MB in the end (delta: -106.6 MB). There was no memory consumed. Max. memory is 50.3 GB. [2020-06-22 02:53:14,728 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 43 locations, 48 edges - StatisticsResult: Encoded RCFG 30 locations, 53 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 649.6 MB. Free memory is still 592.2 MB. There was no memory consumed. Max. memory is 50.3 GB. * CACSL2BoogieTranslator took 297.66 ms. Allocated memory was 649.6 MB in the beginning and 688.4 MB in the end (delta: 38.8 MB). Free memory was 564.2 MB in the beginning and 652.9 MB in the end (delta: -88.7 MB). Peak memory consumption was 30.0 MB. Max. memory is 50.3 GB. * Boogie Procedure Inliner took 42.44 ms. Allocated memory is still 688.4 MB. Free memory was 652.9 MB in the beginning and 650.2 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 50.3 GB. * Boogie Preprocessor took 25.71 ms. Allocated memory is still 688.4 MB. Free memory was 650.2 MB in the beginning and 648.9 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. * RCFGBuilder took 363.71 ms. Allocated memory is still 688.4 MB. Free memory was 648.9 MB in the beginning and 623.9 MB in the end (delta: 25.0 MB). Peak memory consumption was 25.0 MB. Max. memory is 50.3 GB. * BlockEncodingV2 took 141.10 ms. Allocated memory is still 688.4 MB. Free memory was 623.9 MB in the beginning and 613.1 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 50.3 GB. * TraceAbstraction took 29606.92 ms. Allocated memory was 688.4 MB in the beginning and 948.4 MB in the end (delta: 260.0 MB). Free memory was 611.8 MB in the beginning and 574.8 MB in the end (delta: 37.0 MB). Peak memory consumption was 486.2 MB. Max. memory is 50.3 GB. * BuchiAutomizer took 2189.90 ms. Allocated memory was 948.4 MB in the beginning and 978.8 MB in the end (delta: 30.4 MB). Free memory was 574.8 MB in the beginning and 681.4 MB in the end (delta: -106.6 MB). There was no memory consumed. Max. memory is 50.3 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 30]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 30]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 30]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 37]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 37]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 36]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 36]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 30]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 30]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 30]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 14 specifications checked. All of them hold - InvariantResult [Line: 30]: Loop Invariant [2020-06-22 02:53:14,737 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base,QUANTIFIED] [2020-06-22 02:53:14,738 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base,QUANTIFIED] [2020-06-22 02:53:14,738 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] [2020-06-22 02:53:14,738 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base,QUANTIFIED] [2020-06-22 02:53:14,738 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] [2020-06-22 02:53:14,739 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] [2020-06-22 02:53:14,739 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] [2020-06-22 02:53:14,739 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base,QUANTIFIED] [2020-06-22 02:53:14,739 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base,QUANTIFIED] [2020-06-22 02:53:14,740 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] [2020-06-22 02:53:14,740 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base,QUANTIFIED] [2020-06-22 02:53:14,741 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 02:53:14,742 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 02:53:14,742 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 02:53:14,742 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 02:53:14,742 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 02:53:14,742 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 02:53:14,742 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 02:53:14,743 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 02:53:14,743 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 02:53:14,743 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 02:53:14,743 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 02:53:14,743 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 02:53:14,744 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 02:53:14,744 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 02:53:14,744 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 02:53:14,744 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 02:53:14,744 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 02:53:14,745 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 02:53:14,745 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 02:53:14,745 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 02:53:14,745 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 02:53:14,745 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 02:53:14,746 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 02:53:14,746 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 02:53:14,746 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 02:53:14,746 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 02:53:14,746 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 02:53:14,747 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 02:53:14,747 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 02:53:14,747 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 02:53:14,747 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 02:53:14,747 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 02:53:14,747 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 02:53:14,748 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 02:53:14,748 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 02:53:14,749 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base,QUANTIFIED] [2020-06-22 02:53:14,749 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base,QUANTIFIED] [2020-06-22 02:53:14,749 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] [2020-06-22 02:53:14,749 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base,QUANTIFIED] [2020-06-22 02:53:14,750 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] [2020-06-22 02:53:14,750 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] [2020-06-22 02:53:14,750 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] [2020-06-22 02:53:14,750 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base,QUANTIFIED] [2020-06-22 02:53:14,751 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base,QUANTIFIED] [2020-06-22 02:53:14,751 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] [2020-06-22 02:53:14,751 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base,QUANTIFIED] [2020-06-22 02:53:14,752 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 02:53:14,753 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 02:53:14,753 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 02:53:14,753 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 02:53:14,753 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 02:53:14,753 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 02:53:14,753 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 02:53:14,754 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 02:53:14,754 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 02:53:14,754 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 02:53:14,754 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 02:53:14,755 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 02:53:14,755 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 02:53:14,755 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 02:53:14,755 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 02:53:14,755 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 02:53:14,755 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 02:53:14,756 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 02:53:14,756 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 02:53:14,756 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 02:53:14,756 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 02:53:14,756 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 02:53:14,757 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 02:53:14,757 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 02:53:14,757 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 02:53:14,757 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 02:53:14,757 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 02:53:14,758 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 02:53:14,758 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 02:53:14,758 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 02:53:14,758 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 02:53:14,758 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 02:53:14,758 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 02:53:14,759 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 02:53:14,759 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int Derived loop invariant: ((((((((((((((((\valid[s2] == 1 && 1 <= length) && nondetString == 0) && 1 <= unknown-#length-unknown[__VERIFIER_nondet_String()]) && s1 == 0) && unknown-#memory_int-unknown[__VERIFIER_nondet_String()][__VERIFIER_nondet_String()] == 0) && unknown-#length-unknown[nondetString] == length) && \valid[nondetString] == 1) && 1 <= unknown-#length-unknown[s1]) && s2 == 0) && 0 == unknown-#memory_int-unknown[s1][s1]) && 1 == \valid[__VERIFIER_nondet_String()]) && 1 <= unknown-#length-unknown[s2]) && 0 == __VERIFIER_nondet_String()) && \valid[s1] == 1) || ((((((\exists ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset : int, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base : int :: !(ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base == s1) && 0 == unknown-#memory_int-unknown[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base][ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset + unknown-#length-unknown[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base] + -1]) && (((((((((((\valid[s2] == 1 && 1 <= length) && nondetString == 0) && 1 <= unknown-#length-unknown[__VERIFIER_nondet_String()]) && s1 == 0) && unknown-#length-unknown[nondetString] == length) && \valid[nondetString] == 1) && 1 <= unknown-#length-unknown[s1]) && s2 == 0) && 1 == \valid[__VERIFIER_nondet_String()]) && 1 <= unknown-#length-unknown[s2]) && 0 == __VERIFIER_nondet_String()) && \valid[s1] == 1) && !(nondetString == __VERIFIER_nondet_String())) && unknown-#memory_int-unknown[__VERIFIER_nondet_String()][unknown-#length-unknown[__VERIFIER_nondet_String()] + -1] == 0) && 0 == unknown-#memory_int-unknown[s1][unknown-#length-unknown[s1] + -1]) && (\exists ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset : int :: (ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset <= 0 && 0 <= ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset) && unknown-#memory_int-unknown[s2][ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset + unknown-#length-unknown[s2] + -1] == 0))) || (((((s1 <= s2 && ((((((((((((\valid[s2] == 1 && 1 <= length) && nondetString == 0) && 1 == \valid[__VERIFIER_nondet_String()]) && 1 <= unknown-#length-unknown[__VERIFIER_nondet_String()]) && unknown-#length-unknown[nondetString] == length) && \valid[s1] == 1) && 1 <= s1) && \valid[nondetString] == 1) && (\exists ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset : int, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base : int :: !(ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base == s1) && 0 == unknown-#memory_int-unknown[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base][ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset + unknown-#length-unknown[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base] + -1])) && !(nondetString == __VERIFIER_nondet_String())) && s1 + 1 <= unknown-#length-unknown[s1]) && unknown-#memory_int-unknown[__VERIFIER_nondet_String()][unknown-#length-unknown[__VERIFIER_nondet_String()] + -1] == 0) && 0 == unknown-#memory_int-unknown[s1][unknown-#length-unknown[s1] + -1]) && 0 == __VERIFIER_nondet_String()) && unknown-#memory_int-unknown[s2][s1 + -1 * s2 + unknown-#length-unknown[s2] + -1] == 0) && s2 + 1 <= unknown-#length-unknown[s2]) && s2 <= s1)) || ((1 == length && (((((((((((\valid[s2] == 1 && 1 <= length) && nondetString == 0) && 1 <= unknown-#length-unknown[__VERIFIER_nondet_String()]) && s1 == 0) && unknown-#length-unknown[nondetString] == length) && \valid[nondetString] == 1) && 1 <= unknown-#length-unknown[s1]) && s2 == 0) && 1 == \valid[__VERIFIER_nondet_String()]) && 1 <= unknown-#length-unknown[s2]) && 0 == __VERIFIER_nondet_String()) && \valid[s1] == 1) && 0 == unknown-#memory_int-unknown[s2][s2]) - InvariantResult [Line: 16]: Loop Invariant [2020-06-22 02:53:14,760 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 02:53:14,760 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: ((1 <= length && nondetString == 0) && unknown-#length-unknown[nondetString] == length) && \valid[nondetString] == 1 - InvariantResult [Line: 16]: Loop Invariant [2020-06-22 02:53:14,761 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18,QUANTIFIED] [2020-06-22 02:53:14,761 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18,QUANTIFIED] [2020-06-22 02:53:14,761 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18,QUANTIFIED] [2020-06-22 02:53:14,761 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18,QUANTIFIED] [2020-06-22 02:53:14,762 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 02:53:14,762 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 02:53:14,762 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 02:53:14,762 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 02:53:14,762 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 02:53:14,763 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 02:53:14,763 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 02:53:14,763 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 02:53:14,763 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 02:53:14,763 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 02:53:14,764 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18,QUANTIFIED] [2020-06-22 02:53:14,764 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18,QUANTIFIED] [2020-06-22 02:53:14,764 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18,QUANTIFIED] [2020-06-22 02:53:14,764 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18,QUANTIFIED] [2020-06-22 02:53:14,765 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 02:53:14,765 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 02:53:14,765 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 02:53:14,765 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 02:53:14,766 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 02:53:14,766 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 02:53:14,766 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 02:53:14,766 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 02:53:14,766 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 02:53:14,767 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int Derived loop invariant: (((!(nondetString == __VERIFIER_nondet_String()) && (((((1 <= length && nondetString == 0) && 1 == \valid[__VERIFIER_nondet_String()]) && 1 <= unknown-#length-unknown[__VERIFIER_nondet_String()]) && 0 == __VERIFIER_nondet_String()) && unknown-#length-unknown[nondetString] == length) && \valid[nondetString] == 1) && (\exists v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18 : int :: ((0 == unknown-#memory_int-unknown[__VERIFIER_nondet_String()][unknown-#length-unknown[__VERIFIER_nondet_String()] + v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18 + -1] && __VERIFIER_nondet_String() <= v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18) && v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18 <= 0) && 1 <= unknown-#length-unknown[__VERIFIER_nondet_String()] + v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_18)) || (1 == length && (((((1 <= length && nondetString == 0) && 1 == \valid[__VERIFIER_nondet_String()]) && 1 <= unknown-#length-unknown[__VERIFIER_nondet_String()]) && 0 == __VERIFIER_nondet_String()) && unknown-#length-unknown[nondetString] == length) && \valid[nondetString] == 1)) || (((((((1 <= length && nondetString == 0) && 1 == \valid[__VERIFIER_nondet_String()]) && 1 <= unknown-#length-unknown[__VERIFIER_nondet_String()]) && 0 == __VERIFIER_nondet_String()) && unknown-#length-unknown[nondetString] == length) && \valid[nondetString] == 1) && unknown-#memory_int-unknown[__VERIFIER_nondet_String()][__VERIFIER_nondet_String()] == 0) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 30 locations, 14 error locations. SAFE Result, 29.4s OverallTime, 25 OverallIterations, 4 TraceHistogramMax, 13.9s AutomataDifference, 0.0s DeadEndRemovalTime, 3.5s HoareAnnotationTime, HoareTripleCheckerStatistics: 201 SDtfs, 3083 SDslu, 1450 SDs, 0 SdLazy, 3672 SolverSat, 418 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 547 GetRequests, 185 SyntacticMatches, 3 SemanticMatches, 359 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1988 ImplicationChecksByTransitivity, 17.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=76occurred in iteration=23, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 25 MinimizatonAttempts, 546 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 21 NumberOfFragments, 537 HoareAnnotationTreeSize, 3 FomulaSimplifications, 540878 FormulaSimplificationTreeSizeReduction, 0.4s HoareSimplificationTime, 3 FomulaSimplificationsInter, 16936 FormulaSimplificationTreeSizeReductionInter, 3.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 10.6s InterpolantComputationTime, 579 NumberOfCodeBlocks, 579 NumberOfCodeBlocksAsserted, 38 NumberOfCheckSat, 544 ConstructedInterpolants, 68 QuantifiedInterpolants, 144151 SizeOfPredicates, 106 NumberOfNonLiveVariables, 1345 ConjunctsInSsa, 255 ConjunctsInUnsatCore, 35 InterpolantComputations, 17 PerfectInterpolantSequences, 63/221 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available - StatisticsResult: Constructed decomposition of program Your program was decomposed into 3 terminating modules (2 trivial, 0 deterministic, 1 nondeterministic). One nondeterministic module has affine ranking function -1 * s2 + unknown-#length-unknown[malloc(length * sizeof(char))] and consists of 5 locations. 2 modules have a trivial ranking function, the largest among these consists of 3 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.1s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 1.6s. Construction of modules took 0.1s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 15 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 31 SDtfs, 54 SDslu, 63 SDs, 0 SdLazy, 145 SolverSat, 17 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI2 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital209 mio100 ax100 hnf100 lsp97 ukn84 mio100 lsp47 div100 bol100 ite100 ukn100 eq197 hnf88 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 5ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! !SESSION 2020-06-22 02:52:38.777 ----------------------------------------------- eclipse.buildId=unknown java.version=1.8.0_242 java.vendor=Oracle Corporation BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox2/benchmark/theBenchmark.c Command-line arguments: -os linux -ws gtk -arch x86_64 -consoleLog -data @user.home/.ultimate -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -data /export/starexec/sandbox2/tmp -i /export/starexec/sandbox2/benchmark/theBenchmark.c !ENTRY org.eclipse.core.resources 2 10035 2020-06-22 02:53:14.993 !MESSAGE The workspace will exit with unsaved changes in this session. Received shutdown request... Ultimate: GTK+ Version Check