YES Ultimate: Cannot open display: This is Ultimate 0.1.24-8dc7c08-m [2020-06-22 10:17:53,465 INFO L170 SettingsManager]: Resetting all preferences to default values... [2020-06-22 10:17:53,467 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2020-06-22 10:17:53,478 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-06-22 10:17:53,479 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-06-22 10:17:53,480 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-06-22 10:17:53,481 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-06-22 10:17:53,482 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2020-06-22 10:17:53,484 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-06-22 10:17:53,485 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-06-22 10:17:53,485 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-06-22 10:17:53,486 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-06-22 10:17:53,487 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-06-22 10:17:53,487 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-06-22 10:17:53,488 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-06-22 10:17:53,489 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-06-22 10:17:53,490 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-06-22 10:17:53,492 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-06-22 10:17:53,494 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2020-06-22 10:17:53,495 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-06-22 10:17:53,496 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-06-22 10:17:53,497 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-06-22 10:17:53,499 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-06-22 10:17:53,499 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-06-22 10:17:53,500 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-06-22 10:17:53,500 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-06-22 10:17:53,501 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-06-22 10:17:53,502 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-06-22 10:17:53,502 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-06-22 10:17:53,502 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-06-22 10:17:53,503 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-06-22 10:17:53,504 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2020-06-22 10:17:53,505 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-06-22 10:17:53,505 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2020-06-22 10:17:53,506 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-06-22 10:17:53,506 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-06-22 10:17:53,506 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2020-06-22 10:17:53,507 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2020-06-22 10:17:53,507 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2020-06-22 10:17:53,508 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox/solver/bin/./../termcomp2017.epf [2020-06-22 10:17:53,522 INFO L110 SettingsManager]: Loading preferences was successful [2020-06-22 10:17:53,522 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2020-06-22 10:17:53,523 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-06-22 10:17:53,523 INFO L133 SettingsManager]: * Rewrite not-equals=true [2020-06-22 10:17:53,523 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2020-06-22 10:17:53,523 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE [2020-06-22 10:17:53,524 INFO L133 SettingsManager]: * Use SBE=true [2020-06-22 10:17:53,524 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-06-22 10:17:53,524 INFO L133 SettingsManager]: * Use old map elimination=false [2020-06-22 10:17:53,524 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2020-06-22 10:17:53,524 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION [2020-06-22 10:17:53,524 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2020-06-22 10:17:53,525 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-06-22 10:17:53,525 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true [2020-06-22 10:17:53,525 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 10:17:53,525 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-06-22 10:17:53,525 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-06-22 10:17:53,525 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2020-06-22 10:17:53,525 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2020-06-22 10:17:53,526 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-06-22 10:17:53,526 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE [2020-06-22 10:17:53,526 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-06-22 10:17:53,526 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-06-22 10:17:53,526 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-06-22 10:17:53,526 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-06-22 10:17:53,527 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-06-22 10:17:53,527 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-06-22 10:17:53,527 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2020-06-22 10:17:53,527 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-06-22 10:17:53,552 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-06-22 10:17:53,565 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-06-22 10:17:53,569 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-06-22 10:17:53,570 INFO L271 PluginConnector]: Initializing CDTParser... [2020-06-22 10:17:53,570 INFO L276 PluginConnector]: CDTParser initialized [2020-06-22 10:17:53,571 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox/benchmark/theBenchmark.c [2020-06-22 10:17:53,640 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox/tmp/023e2fade85742fd93ee135c7412c4df/FLAG4e17f1253 [2020-06-22 10:17:53,978 INFO L307 CDTParser]: Found 1 translation units. [2020-06-22 10:17:53,978 INFO L161 CDTParser]: Scanning /export/starexec/sandbox/benchmark/theBenchmark.c [2020-06-22 10:17:53,979 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. [2020-06-22 10:17:53,985 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox/tmp/023e2fade85742fd93ee135c7412c4df/FLAG4e17f1253 [2020-06-22 10:17:54,396 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox/tmp/023e2fade85742fd93ee135c7412c4df [2020-06-22 10:17:54,408 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-06-22 10:17:54,409 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. [2020-06-22 10:17:54,410 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-06-22 10:17:54,410 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-06-22 10:17:54,414 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2020-06-22 10:17:54,415 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.06 10:17:54" (1/1) ... [2020-06-22 10:17:54,418 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@424aadc6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:17:54, skipping insertion in model container [2020-06-22 10:17:54,419 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.06 10:17:54" (1/1) ... [2020-06-22 10:17:54,427 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-06-22 10:17:54,444 INFO L176 MainTranslator]: Built tables and reachable declarations [2020-06-22 10:17:54,607 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-06-22 10:17:54,682 INFO L191 MainTranslator]: Completed pre-run [2020-06-22 10:17:54,700 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-06-22 10:17:54,716 INFO L195 MainTranslator]: Completed translation [2020-06-22 10:17:54,716 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:17:54 WrapperNode [2020-06-22 10:17:54,717 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-06-22 10:17:54,718 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-06-22 10:17:54,719 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-06-22 10:17:54,719 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2020-06-22 10:17:54,728 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:17:54" (1/1) ... [2020-06-22 10:17:54,736 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:17:54" (1/1) ... [2020-06-22 10:17:54,758 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-06-22 10:17:54,758 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-06-22 10:17:54,758 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-06-22 10:17:54,759 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2020-06-22 10:17:54,768 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:17:54" (1/1) ... [2020-06-22 10:17:54,768 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:17:54" (1/1) ... [2020-06-22 10:17:54,770 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:17:54" (1/1) ... [2020-06-22 10:17:54,770 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:17:54" (1/1) ... [2020-06-22 10:17:54,774 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:17:54" (1/1) ... [2020-06-22 10:17:54,778 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:17:54" (1/1) ... [2020-06-22 10:17:54,779 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:17:54" (1/1) ... [2020-06-22 10:17:54,781 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-06-22 10:17:54,782 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-06-22 10:17:54,782 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-06-22 10:17:54,782 INFO L276 PluginConnector]: RCFGBuilder initialized [2020-06-22 10:17:54,783 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:17:54" (1/1) ... No working directory specified, using /export/starexec/sandbox/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 10:17:54,850 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-06-22 10:17:54,850 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-06-22 10:17:54,850 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-06-22 10:17:54,851 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-06-22 10:17:54,851 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-06-22 10:17:54,851 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-06-22 10:17:55,100 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-06-22 10:17:55,100 INFO L286 CfgBuilder]: Removed 5 assue(true) statements. [2020-06-22 10:17:55,102 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 10:17:55 BoogieIcfgContainer [2020-06-22 10:17:55,102 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-06-22 10:17:55,102 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- [2020-06-22 10:17:55,103 INFO L271 PluginConnector]: Initializing BlockEncodingV2... [2020-06-22 10:17:55,105 INFO L276 PluginConnector]: BlockEncodingV2 initialized [2020-06-22 10:17:55,105 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 10:17:55" (1/1) ... [2020-06-22 10:17:55,122 INFO L313 BlockEncoder]: Initial Icfg 43 locations, 46 edges [2020-06-22 10:17:55,123 INFO L258 BlockEncoder]: Using Remove infeasible edges [2020-06-22 10:17:55,124 INFO L263 BlockEncoder]: Using Maximize final states [2020-06-22 10:17:55,125 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false [2020-06-22 10:17:55,125 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE [2020-06-22 10:17:55,127 INFO L296 BlockEncoder]: Using Remove sink states [2020-06-22 10:17:55,127 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true [2020-06-22 10:17:55,128 INFO L179 BlockEncoder]: Using Rewrite not-equals [2020-06-22 10:17:55,154 INFO L185 BlockEncoder]: Using Use SBE [2020-06-22 10:17:55,193 INFO L200 BlockEncoder]: SBE split 24 edges [2020-06-22 10:17:55,199 INFO L70 emoveInfeasibleEdges]: Removed 1 edges and 0 locations because of local infeasibility [2020-06-22 10:17:55,201 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-22 10:17:55,224 INFO L100 BaseMinimizeStates]: Removed 14 edges and 7 locations by large block encoding [2020-06-22 10:17:55,227 INFO L70 RemoveSinkStates]: Removed 1 edges and 1 locations by removing sink states [2020-06-22 10:17:55,228 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-06-22 10:17:55,229 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-22 10:17:55,232 INFO L100 BaseMinimizeStates]: Removed 2 edges and 1 locations by large block encoding [2020-06-22 10:17:55,233 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-06-22 10:17:55,234 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-06-22 10:17:55,234 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-22 10:17:55,234 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding [2020-06-22 10:17:55,235 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-06-22 10:17:55,235 INFO L313 BlockEncoder]: Encoded RCFG 34 locations, 77 edges [2020-06-22 10:17:55,236 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 10:17:55 BasicIcfg [2020-06-22 10:17:55,236 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- [2020-06-22 10:17:55,237 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-06-22 10:17:55,237 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-06-22 10:17:55,242 INFO L276 PluginConnector]: TraceAbstraction initialized [2020-06-22 10:17:55,242 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.06 10:17:54" (1/4) ... [2020-06-22 10:17:55,243 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e572f8f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 10:17:55, skipping insertion in model container [2020-06-22 10:17:55,243 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:17:54" (2/4) ... [2020-06-22 10:17:55,243 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e572f8f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 10:17:55, skipping insertion in model container [2020-06-22 10:17:55,244 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 10:17:55" (3/4) ... [2020-06-22 10:17:55,244 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e572f8f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 10:17:55, skipping insertion in model container [2020-06-22 10:17:55,244 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 10:17:55" (4/4) ... [2020-06-22 10:17:55,246 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-06-22 10:17:55,256 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2020-06-22 10:17:55,264 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 20 error locations. [2020-06-22 10:17:55,280 INFO L257 AbstractCegarLoop]: Starting to check reachability of 20 error locations. [2020-06-22 10:17:55,309 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2020-06-22 10:17:55,310 INFO L382 AbstractCegarLoop]: Interprodecural is true [2020-06-22 10:17:55,310 INFO L383 AbstractCegarLoop]: Hoare is true [2020-06-22 10:17:55,310 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2020-06-22 10:17:55,310 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-06-22 10:17:55,311 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-06-22 10:17:55,311 INFO L387 AbstractCegarLoop]: Difference is false [2020-06-22 10:17:55,311 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-06-22 10:17:55,311 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-06-22 10:17:55,326 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states. [2020-06-22 10:17:55,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-06-22 10:17:55,332 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:17:55,333 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-06-22 10:17:55,334 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION]=== [2020-06-22 10:17:55,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:17:55,339 INFO L82 PathProgramCache]: Analyzing trace with hash 127364, now seen corresponding path program 1 times [2020-06-22 10:17:55,341 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:17:55,342 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:17:55,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:17:55,394 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:17:55,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:17:55,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:17:55,517 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 10:17:55,519 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:17:55,519 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 10:17:55,523 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 10:17:55,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 10:17:55,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:17:55,540 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 3 states. [2020-06-22 10:17:55,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:17:55,721 INFO L93 Difference]: Finished difference Result 53 states and 139 transitions. [2020-06-22 10:17:55,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 10:17:55,723 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-06-22 10:17:55,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:17:55,737 INFO L225 Difference]: With dead ends: 53 [2020-06-22 10:17:55,737 INFO L226 Difference]: Without dead ends: 26 [2020-06-22 10:17:55,740 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 10:17:55,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2020-06-22 10:17:55,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2020-06-22 10:17:55,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2020-06-22 10:17:55,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 46 transitions. [2020-06-22 10:17:55,779 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 46 transitions. Word has length 3 [2020-06-22 10:17:55,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:17:55,780 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 46 transitions. [2020-06-22 10:17:55,780 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 10:17:55,781 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 46 transitions. [2020-06-22 10:17:55,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-06-22 10:17:55,781 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:17:55,781 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-06-22 10:17:55,782 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION]=== [2020-06-22 10:17:55,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:17:55,782 INFO L82 PathProgramCache]: Analyzing trace with hash 127366, now seen corresponding path program 1 times [2020-06-22 10:17:55,782 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:17:55,782 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:17:55,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:17:55,783 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:17:55,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:17:55,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:17:55,805 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 10:17:55,805 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:17:55,805 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 10:17:55,807 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 10:17:55,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 10:17:55,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:17:55,808 INFO L87 Difference]: Start difference. First operand 26 states and 46 transitions. Second operand 3 states. [2020-06-22 10:17:55,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:17:55,871 INFO L93 Difference]: Finished difference Result 34 states and 46 transitions. [2020-06-22 10:17:55,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 10:17:55,872 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-06-22 10:17:55,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:17:55,872 INFO L225 Difference]: With dead ends: 34 [2020-06-22 10:17:55,873 INFO L226 Difference]: Without dead ends: 26 [2020-06-22 10:17:55,874 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 10:17:55,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2020-06-22 10:17:55,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2020-06-22 10:17:55,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2020-06-22 10:17:55,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 38 transitions. [2020-06-22 10:17:55,878 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 38 transitions. Word has length 3 [2020-06-22 10:17:55,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:17:55,878 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 38 transitions. [2020-06-22 10:17:55,878 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 10:17:55,879 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 38 transitions. [2020-06-22 10:17:55,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-06-22 10:17:55,879 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:17:55,879 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-06-22 10:17:55,879 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION]=== [2020-06-22 10:17:55,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:17:55,880 INFO L82 PathProgramCache]: Analyzing trace with hash 127367, now seen corresponding path program 1 times [2020-06-22 10:17:55,880 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:17:55,880 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:17:55,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:17:55,881 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:17:55,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:17:55,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:17:55,920 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 10:17:55,920 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:17:55,921 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 10:17:55,921 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 10:17:55,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 10:17:55,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:17:55,922 INFO L87 Difference]: Start difference. First operand 26 states and 38 transitions. Second operand 3 states. [2020-06-22 10:17:55,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:17:55,990 INFO L93 Difference]: Finished difference Result 26 states and 38 transitions. [2020-06-22 10:17:55,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 10:17:55,991 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-06-22 10:17:55,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:17:55,992 INFO L225 Difference]: With dead ends: 26 [2020-06-22 10:17:55,992 INFO L226 Difference]: Without dead ends: 18 [2020-06-22 10:17:55,992 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 10:17:55,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2020-06-22 10:17:55,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2020-06-22 10:17:55,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-06-22 10:17:55,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 30 transitions. [2020-06-22 10:17:55,996 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 30 transitions. Word has length 3 [2020-06-22 10:17:55,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:17:55,996 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 30 transitions. [2020-06-22 10:17:55,996 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 10:17:55,996 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 30 transitions. [2020-06-22 10:17:55,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-06-22 10:17:55,997 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:17:55,997 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-06-22 10:17:55,997 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION]=== [2020-06-22 10:17:55,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:17:55,997 INFO L82 PathProgramCache]: Analyzing trace with hash 3950319, now seen corresponding path program 1 times [2020-06-22 10:17:55,997 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:17:55,998 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:17:55,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:17:55,999 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:17:55,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:17:56,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:17:56,027 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 10:17:56,027 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:17:56,027 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 10:17:56,027 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 10:17:56,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 10:17:56,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:17:56,028 INFO L87 Difference]: Start difference. First operand 18 states and 30 transitions. Second operand 3 states. [2020-06-22 10:17:56,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:17:56,071 INFO L93 Difference]: Finished difference Result 18 states and 30 transitions. [2020-06-22 10:17:56,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 10:17:56,072 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-06-22 10:17:56,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:17:56,073 INFO L225 Difference]: With dead ends: 18 [2020-06-22 10:17:56,073 INFO L226 Difference]: Without dead ends: 16 [2020-06-22 10:17:56,073 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 10:17:56,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2020-06-22 10:17:56,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2020-06-22 10:17:56,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-06-22 10:17:56,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 26 transitions. [2020-06-22 10:17:56,076 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 26 transitions. Word has length 4 [2020-06-22 10:17:56,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:17:56,076 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 26 transitions. [2020-06-22 10:17:56,077 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 10:17:56,077 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 26 transitions. [2020-06-22 10:17:56,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-06-22 10:17:56,077 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:17:56,077 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-06-22 10:17:56,077 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION]=== [2020-06-22 10:17:56,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:17:56,078 INFO L82 PathProgramCache]: Analyzing trace with hash 3950321, now seen corresponding path program 1 times [2020-06-22 10:17:56,078 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:17:56,078 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:17:56,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:17:56,079 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:17:56,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:17:56,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:17:56,110 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 10:17:56,110 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:17:56,110 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 10:17:56,111 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 10:17:56,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 10:17:56,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:17:56,111 INFO L87 Difference]: Start difference. First operand 16 states and 26 transitions. Second operand 3 states. [2020-06-22 10:17:56,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:17:56,157 INFO L93 Difference]: Finished difference Result 16 states and 26 transitions. [2020-06-22 10:17:56,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 10:17:56,157 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-06-22 10:17:56,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:17:56,158 INFO L225 Difference]: With dead ends: 16 [2020-06-22 10:17:56,158 INFO L226 Difference]: Without dead ends: 0 [2020-06-22 10:17:56,158 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 10:17:56,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-06-22 10:17:56,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-06-22 10:17:56,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-06-22 10:17:56,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-06-22 10:17:56,159 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 4 [2020-06-22 10:17:56,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:17:56,159 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 10:17:56,160 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 10:17:56,160 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-06-22 10:17:56,160 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-06-22 10:17:56,164 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-06-22 10:17:56,189 INFO L448 ceAbstractionStarter]: For program point L17(lines 17 19) no Hoare annotation was computed. [2020-06-22 10:17:56,189 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr18REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. [2020-06-22 10:17:56,189 INFO L444 ceAbstractionStarter]: At program point L17-1(lines 9 20) the Hoare annotation is: (and (= ULTIMATE.start_main_~debug~0.offset 0) (= (select |#valid| ULTIMATE.start_main_~x~0.base) 1) (= ULTIMATE.start_main_~x~0.offset 0) (= 4 (select |#length| ULTIMATE.start_main_~debug~0.base)) (= 4 (select |#length| ULTIMATE.start_main_~x~0.base)) (= 1 (select |#valid| ULTIMATE.start_main_~debug~0.base))) [2020-06-22 10:17:56,190 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr17REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. [2020-06-22 10:17:56,190 INFO L448 ceAbstractionStarter]: For program point L15(line 15) no Hoare annotation was computed. [2020-06-22 10:17:56,190 INFO L448 ceAbstractionStarter]: For program point L15-1(line 15) no Hoare annotation was computed. [2020-06-22 10:17:56,190 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr19REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. [2020-06-22 10:17:56,190 INFO L448 ceAbstractionStarter]: For program point L13(line 13) no Hoare annotation was computed. [2020-06-22 10:17:56,190 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr14REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-06-22 10:17:56,190 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr13REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-06-22 10:17:56,190 INFO L448 ceAbstractionStarter]: For program point L13-2(line 13) no Hoare annotation was computed. [2020-06-22 10:17:56,191 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr16REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. [2020-06-22 10:17:56,191 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr15REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-06-22 10:17:56,191 INFO L448 ceAbstractionStarter]: For program point L9(line 9) no Hoare annotation was computed. [2020-06-22 10:17:56,191 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2REQUIRES_VIOLATION(line 9) no Hoare annotation was computed. [2020-06-22 10:17:56,191 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1REQUIRES_VIOLATION(line 8) no Hoare annotation was computed. [2020-06-22 10:17:56,191 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2020-06-22 10:17:56,191 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr4REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. [2020-06-22 10:17:56,191 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr3REQUIRES_VIOLATION(line 9) no Hoare annotation was computed. [2020-06-22 10:17:56,191 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-06-22 10:17:56,192 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0REQUIRES_VIOLATION(line 8) no Hoare annotation was computed. [2020-06-22 10:17:56,192 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr10REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. [2020-06-22 10:17:56,192 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr9REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. [2020-06-22 10:17:56,192 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr12REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-06-22 10:17:56,192 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr11REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. [2020-06-22 10:17:56,192 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr6REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. [2020-06-22 10:17:56,192 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr5REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. [2020-06-22 10:17:56,192 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr8REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. [2020-06-22 10:17:56,193 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr7REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. [2020-06-22 10:17:56,193 INFO L448 ceAbstractionStarter]: For program point L18(line 18) no Hoare annotation was computed. [2020-06-22 10:17:56,193 INFO L448 ceAbstractionStarter]: For program point L12(line 12) no Hoare annotation was computed. [2020-06-22 10:17:56,193 INFO L448 ceAbstractionStarter]: For program point L12-1(lines 12 16) no Hoare annotation was computed. [2020-06-22 10:17:56,193 INFO L448 ceAbstractionStarter]: For program point L12-3(lines 12 16) no Hoare annotation was computed. [2020-06-22 10:17:56,193 INFO L448 ceAbstractionStarter]: For program point L8(line 8) no Hoare annotation was computed. [2020-06-22 10:17:56,194 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2020-06-22 10:17:56,204 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:17:56,205 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:17:56,211 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:17:56,211 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:17:56,214 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 10:17:56 BasicIcfg [2020-06-22 10:17:56,214 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-06-22 10:17:56,214 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-06-22 10:17:56,215 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-06-22 10:17:56,218 INFO L276 PluginConnector]: BuchiAutomizer initialized [2020-06-22 10:17:56,219 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 10:17:56,219 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.06 10:17:54" (1/5) ... [2020-06-22 10:17:56,219 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@38c473aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.06 10:17:56, skipping insertion in model container [2020-06-22 10:17:56,219 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 10:17:56,220 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:17:54" (2/5) ... [2020-06-22 10:17:56,220 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@38c473aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.06 10:17:56, skipping insertion in model container [2020-06-22 10:17:56,220 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 10:17:56,220 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 10:17:55" (3/5) ... [2020-06-22 10:17:56,220 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@38c473aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 10:17:56, skipping insertion in model container [2020-06-22 10:17:56,220 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 10:17:56,221 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 10:17:55" (4/5) ... [2020-06-22 10:17:56,221 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@38c473aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 10:17:56, skipping insertion in model container [2020-06-22 10:17:56,221 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 10:17:56,221 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 10:17:56" (5/5) ... [2020-06-22 10:17:56,223 INFO L375 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-06-22 10:17:56,246 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2020-06-22 10:17:56,246 INFO L374 BuchiCegarLoop]: Interprodecural is true [2020-06-22 10:17:56,246 INFO L375 BuchiCegarLoop]: Hoare is true [2020-06-22 10:17:56,246 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-06-22 10:17:56,246 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-06-22 10:17:56,246 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-06-22 10:17:56,247 INFO L379 BuchiCegarLoop]: Difference is false [2020-06-22 10:17:56,247 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-06-22 10:17:56,247 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-06-22 10:17:56,251 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states. [2020-06-22 10:17:56,257 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2020-06-22 10:17:56,257 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 10:17:56,257 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 10:17:56,263 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-06-22 10:17:56,263 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:17:56,263 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2020-06-22 10:17:56,263 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states. [2020-06-22 10:17:56,266 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2020-06-22 10:17:56,266 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 10:17:56,266 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 10:17:56,267 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-06-22 10:17:56,267 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:17:56,272 INFO L794 eck$LassoCheckResult]: Stem: 28#ULTIMATE.startENTRYtrue [97] ULTIMATE.startENTRY-->L-1: Formula: (and (= |v_#NULL.offset_1| 0) (= |v_#NULL.base_1| 0) (= |v_#valid_1| (store |v_#valid_2| 0 0))) InVars {#valid=|v_#valid_2|} OutVars{#NULL.offset=|v_#NULL.offset_1|, #NULL.base=|v_#NULL.base_1|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, #NULL.offset, #NULL.base] 9#L-1true [139] L-1-->L8: Formula: (let ((.cse0 (store |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc0.base_1| 1))) (and (= 0 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= 0 (select |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc0.base_1|)) (= v_ULTIMATE.start_main_~debug~0.offset_1 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (< |v_ULTIMATE.start_main_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (< |v_ULTIMATE.start_main_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= |v_#length_1| (store (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc0.base_1| 4) |v_ULTIMATE.start_main_#t~malloc1.base_1| 4)) (= 0 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (= (store .cse0 |v_ULTIMATE.start_main_#t~malloc1.base_1| 1) |v_#valid_3|) (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc1.base_1|) 0) (= v_ULTIMATE.start_main_~x~0.offset_1 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= v_ULTIMATE.start_main_~x~0.base_1 |v_ULTIMATE.start_main_#t~malloc0.base_1|) (= v_ULTIMATE.start_main_~debug~0.base_1 |v_ULTIMATE.start_main_#t~malloc1.base_1|) (> 0 |v_ULTIMATE.start_main_#t~malloc1.base_1|) (> |v_ULTIMATE.start_main_#t~malloc0.base_1| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{ULTIMATE.start_main_#t~malloc1.offset=|v_ULTIMATE.start_main_#t~malloc1.offset_1|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_1|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_1, ULTIMATE.start_main_#t~malloc0.offset=|v_ULTIMATE.start_main_#t~malloc0.offset_1|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_1, ULTIMATE.start_main_#t~post6=|v_ULTIMATE.start_main_#t~post6_1|, ULTIMATE.start_main_#t~malloc0.base=|v_ULTIMATE.start_main_#t~malloc0.base_1|, ULTIMATE.start_main_#t~malloc1.base=|v_ULTIMATE.start_main_#t~malloc1.base_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#t~mem8=|v_ULTIMATE.start_main_#t~mem8_1|, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, #length=|v_#length_1|, ULTIMATE.start_main_~debug~0.offset=v_ULTIMATE.start_main_~debug~0.offset_1, ULTIMATE.start_main_~debug~0.base=v_ULTIMATE.start_main_~debug~0.base_1, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_1|, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_1|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc1.offset, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_~x~0.offset, ULTIMATE.start_main_#t~malloc0.offset, ULTIMATE.start_main_~x~0.base, ULTIMATE.start_main_#t~post6, ULTIMATE.start_main_#t~malloc0.base, ULTIMATE.start_main_#t~malloc1.base, ULTIMATE.start_main_#t~mem8, ULTIMATE.start_main_#t~mem7, ULTIMATE.start_main_#res, #valid, #length, ULTIMATE.start_main_~debug~0.offset, ULTIMATE.start_main_~debug~0.base, ULTIMATE.start_main_#t~mem5, ULTIMATE.start_main_#t~mem4, ULTIMATE.start_main_#t~mem3] 24#L8true [201] L8-->L9: Formula: (and (= (store |v_#memory_int_17| v_ULTIMATE.start_main_~x~0.base_28 (store (select |v_#memory_int_17| v_ULTIMATE.start_main_~x~0.base_28) v_ULTIMATE.start_main_~x~0.offset_20 |v_ULTIMATE.start_main_#t~nondet2_5|)) |v_#memory_int_16|) (<= 0 v_ULTIMATE.start_main_~x~0.offset_20) (= 1 (select |v_#valid_29| v_ULTIMATE.start_main_~x~0.base_28)) (<= (+ v_ULTIMATE.start_main_~x~0.offset_20 4) (select |v_#length_24| v_ULTIMATE.start_main_~x~0.base_28))) InVars {ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_5|, #valid=|v_#valid_29|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_20, #length=|v_#length_24|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_28} OutVars{ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_4|, #valid=|v_#valid_29|, #memory_int=|v_#memory_int_16|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_20, #length=|v_#length_24|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_28} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2, #memory_int] 8#L9true [68] L9-->L17-1: Formula: (and (<= 0 v_ULTIMATE.start_main_~debug~0.offset_4) (= (select |v_#valid_8| v_ULTIMATE.start_main_~debug~0.base_4) 1) (= |v_#memory_int_3| (store |v_#memory_int_4| v_ULTIMATE.start_main_~debug~0.base_4 (store (select |v_#memory_int_4| v_ULTIMATE.start_main_~debug~0.base_4) v_ULTIMATE.start_main_~debug~0.offset_4 0))) (<= (+ v_ULTIMATE.start_main_~debug~0.offset_4 4) (select |v_#length_6| v_ULTIMATE.start_main_~debug~0.base_4))) InVars {#memory_int=|v_#memory_int_4|, #length=|v_#length_6|, ULTIMATE.start_main_~debug~0.offset=v_ULTIMATE.start_main_~debug~0.offset_4, ULTIMATE.start_main_~debug~0.base=v_ULTIMATE.start_main_~debug~0.base_4, #valid=|v_#valid_8|} OutVars{#memory_int=|v_#memory_int_3|, #length=|v_#length_6|, ULTIMATE.start_main_~debug~0.offset=v_ULTIMATE.start_main_~debug~0.offset_4, ULTIMATE.start_main_~debug~0.base=v_ULTIMATE.start_main_~debug~0.base_4, #valid=|v_#valid_8|} AuxVars[] AssignedVars[#memory_int] 19#L17-1true [2020-06-22 10:17:56,273 INFO L796 eck$LassoCheckResult]: Loop: 19#L17-1true [208] L17-1-->L12: Formula: (and (< (select (select |v_#memory_int_23| v_ULTIMATE.start_main_~x~0.base_32) v_ULTIMATE.start_main_~x~0.offset_24) 255) (<= 0 v_ULTIMATE.start_main_~x~0.offset_24) (<= (+ v_ULTIMATE.start_main_~x~0.offset_24 4) (select |v_#length_28| v_ULTIMATE.start_main_~x~0.base_32)) (= 1 (select |v_#valid_39| v_ULTIMATE.start_main_~x~0.base_32))) InVars {#valid=|v_#valid_39|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_24, #memory_int=|v_#memory_int_23|, #length=|v_#length_28|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_32} OutVars{#valid=|v_#valid_39|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_24, #memory_int=|v_#memory_int_23|, #length=|v_#length_28|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_32, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem3] 14#L12true [76] L12-->L12-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_8 4) (select |v_#length_10| v_ULTIMATE.start_main_~x~0.base_10)) (= |v_ULTIMATE.start_main_#t~mem4_2| (select (select |v_#memory_int_6| v_ULTIMATE.start_main_~x~0.base_10) v_ULTIMATE.start_main_~x~0.offset_8)) (= 1 (select |v_#valid_12| v_ULTIMATE.start_main_~x~0.base_10)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_8)) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_8, #memory_int=|v_#memory_int_6|, #length=|v_#length_10|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_10, #valid=|v_#valid_12|} OutVars{#valid=|v_#valid_12|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_8, #memory_int=|v_#memory_int_6|, #length=|v_#length_10|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_10, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem4] 11#L12-1true [172] L12-1-->L15: Formula: (= 0 (mod |v_ULTIMATE.start_main_#t~mem4_6| 2)) InVars {ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_6|} OutVars{ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem4] 17#L15true [80] L15-->L15-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_14 4) (select |v_#length_16| v_ULTIMATE.start_main_~x~0.base_19)) (= 1 (select |v_#valid_18| v_ULTIMATE.start_main_~x~0.base_19)) (= |v_ULTIMATE.start_main_#t~mem7_2| (select (select |v_#memory_int_10| v_ULTIMATE.start_main_~x~0.base_19) v_ULTIMATE.start_main_~x~0.offset_14)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_14)) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_14, #memory_int=|v_#memory_int_10|, #length=|v_#length_16|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_19, #valid=|v_#valid_18|} OutVars{ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_2|, #valid=|v_#valid_18|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_14, #memory_int=|v_#memory_int_10|, #length=|v_#length_16|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_19} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem7] 35#L15-1true [206] L15-1-->L12-3: Formula: (and (<= 0 v_ULTIMATE.start_main_~x~0.offset_22) (= 1 (select |v_#valid_37| v_ULTIMATE.start_main_~x~0.base_30)) (<= (+ v_ULTIMATE.start_main_~x~0.offset_22 4) (select |v_#length_26| v_ULTIMATE.start_main_~x~0.base_30)) (= (store |v_#memory_int_20| v_ULTIMATE.start_main_~x~0.base_30 (store (select |v_#memory_int_20| v_ULTIMATE.start_main_~x~0.base_30) v_ULTIMATE.start_main_~x~0.offset_22 (+ |v_ULTIMATE.start_main_#t~mem7_6| 2))) |v_#memory_int_19|)) InVars {ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_6|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_20|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_22, #length=|v_#length_26|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_30} OutVars{ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_5|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_19|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_22, #length=|v_#length_26|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_30} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem7, #memory_int] 25#L12-3true [93] L12-3-->L17: Formula: (and (= 1 (select |v_#valid_22| v_ULTIMATE.start_main_~debug~0.base_7)) (<= (+ v_ULTIMATE.start_main_~debug~0.offset_6 4) (select |v_#length_20| v_ULTIMATE.start_main_~debug~0.base_7)) (= |v_ULTIMATE.start_main_#t~mem8_2| (select (select |v_#memory_int_13| v_ULTIMATE.start_main_~debug~0.base_7) v_ULTIMATE.start_main_~debug~0.offset_6)) (<= 0 v_ULTIMATE.start_main_~debug~0.offset_6)) InVars {#memory_int=|v_#memory_int_13|, #length=|v_#length_20|, ULTIMATE.start_main_~debug~0.offset=v_ULTIMATE.start_main_~debug~0.offset_6, ULTIMATE.start_main_~debug~0.base=v_ULTIMATE.start_main_~debug~0.base_7, #valid=|v_#valid_22|} OutVars{ULTIMATE.start_main_#t~mem8=|v_ULTIMATE.start_main_#t~mem8_2|, #valid=|v_#valid_22|, #memory_int=|v_#memory_int_13|, #length=|v_#length_20|, ULTIMATE.start_main_~debug~0.offset=v_ULTIMATE.start_main_~debug~0.offset_6, ULTIMATE.start_main_~debug~0.base=v_ULTIMATE.start_main_~debug~0.base_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem8] 21#L17true [88] L17-->L17-1: Formula: (= |v_ULTIMATE.start_main_#t~mem8_6| 0) InVars {ULTIMATE.start_main_#t~mem8=|v_ULTIMATE.start_main_#t~mem8_6|} OutVars{ULTIMATE.start_main_#t~mem8=|v_ULTIMATE.start_main_#t~mem8_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem8] 19#L17-1true [2020-06-22 10:17:56,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:17:56,274 INFO L82 PathProgramCache]: Analyzing trace with hash 3953126, now seen corresponding path program 1 times [2020-06-22 10:17:56,274 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:17:56,274 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:17:56,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:17:56,276 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:17:56,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:17:56,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:17:56,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:17:56,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:17:56,321 INFO L82 PathProgramCache]: Analyzing trace with hash -297739736, now seen corresponding path program 1 times [2020-06-22 10:17:56,321 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:17:56,321 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:17:56,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:17:56,322 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:17:56,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:17:56,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:17:56,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:17:56,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:17:56,342 INFO L82 PathProgramCache]: Analyzing trace with hash -1641771869, now seen corresponding path program 1 times [2020-06-22 10:17:56,342 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:17:56,342 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:17:56,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:17:56,343 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:17:56,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:17:56,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:17:56,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:17:56,614 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 58 [2020-06-22 10:17:56,702 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 10:17:56,703 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 10:17:56,703 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 10:17:56,704 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 10:17:56,704 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 10:17:56,704 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 10:17:56,704 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 10:17:56,704 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 10:17:56,704 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Lasso [2020-06-22 10:17:56,704 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 10:17:56,705 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 10:17:56,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 10:17:56,729 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 10:17:56,731 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 10:17:56,733 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 10:17:56,735 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 10:17:56,913 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 45 [2020-06-22 10:17:57,003 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 10:17:57,007 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 10:17:57,009 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 10:17:57,011 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 10:17:57,020 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 10:17:57,022 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 10:17:57,024 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 10:17:57,358 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 10:17:57,363 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 10:17:57,365 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 10:17:57,367 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:17:57,367 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:17:57,368 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:17:57,368 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:17:57,368 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:17:57,370 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:17:57,370 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:17:57,372 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:17:57,372 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 10:17:57,373 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:17:57,373 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:17:57,373 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:17:57,374 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:17:57,374 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:17:57,374 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:17:57,374 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:17:57,375 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:17:57,376 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 10:17:57,376 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:17:57,376 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:17:57,376 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:17:57,376 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:17:57,377 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:17:57,377 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:17:57,377 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:17:57,378 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:17:57,378 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 10:17:57,379 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:17:57,379 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:17:57,379 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:17:57,379 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:17:57,379 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:17:57,380 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:17:57,380 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:17:57,380 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:17:57,381 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 10:17:57,381 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:17:57,381 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:17:57,381 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:17:57,382 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:17:57,388 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:17:57,388 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:17:57,415 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:17:57,416 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 10:17:57,417 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:17:57,417 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:17:57,417 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:17:57,417 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:17:57,420 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:17:57,421 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:17:57,428 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:17:57,429 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 10:17:57,429 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:17:57,429 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:17:57,429 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:17:57,430 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:17:57,431 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:17:57,431 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:17:57,433 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:17:57,434 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 10:17:57,434 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:17:57,434 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:17:57,435 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:17:57,435 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:17:57,437 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:17:57,437 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:17:57,445 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:17:57,446 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 10:17:57,446 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:17:57,446 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:17:57,446 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:17:57,447 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:17:57,448 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:17:57,448 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:17:57,452 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:17:57,453 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 10:17:57,453 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:17:57,453 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:17:57,454 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:17:57,454 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:17:57,455 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:17:57,456 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:17:57,465 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:17:57,465 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 10:17:57,466 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:17:57,466 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:17:57,466 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:17:57,466 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:17:57,468 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:17:57,468 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:17:57,483 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 10:17:57,491 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-06-22 10:17:57,491 INFO L444 ModelExtractionUtils]: 4 out of 7 variables were initially zero. Simplification set additionally 0 variables to zero. [2020-06-22 10:17:57,494 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 10:17:57,495 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-06-22 10:17:57,496 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 10:17:57,496 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_1) = -1*v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_1 + 255 Supporting invariants [] [2020-06-22 10:17:57,531 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2020-06-22 10:17:57,534 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:17:57,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:17:57,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:17:57,567 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-22 10:17:57,569 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:17:57,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:17:57,584 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 5 conjunts are in the unsatisfiable core [2020-06-22 10:17:57,584 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:17:57,649 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 21 [2020-06-22 10:17:57,652 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:17:57,659 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:17:57,660 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:17:57,660 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:37, output treesize:13 [2020-06-22 10:17:57,673 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 10:17:57,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:17:57,738 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 5 conjunts are in the unsatisfiable core [2020-06-22 10:17:57,739 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:17:57,766 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 18 [2020-06-22 10:17:57,767 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:17:57,771 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:17:57,772 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:17:57,772 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:30, output treesize:9 [2020-06-22 10:17:57,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:17:57,798 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 10:17:57,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:17:57,806 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 5 conjunts are in the unsatisfiable core [2020-06-22 10:17:57,807 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:17:57,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:17:57,838 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 5 conjunts are in the unsatisfiable core [2020-06-22 10:17:57,839 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:17:57,850 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 21 [2020-06-22 10:17:57,850 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:17:57,858 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:17:57,859 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:17:57,859 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:37, output treesize:13 [2020-06-22 10:17:57,880 INFO L98 LoopCannibalizer]: 5 predicates before loop cannibalization 5 predicates after loop cannibalization [2020-06-22 10:17:57,884 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates [2020-06-22 10:17:57,885 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 34 states. Second operand 5 states. [2020-06-22 10:17:58,504 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 34 states.. Second operand 5 states. Result 213 states and 472 transitions. Complement of second has 19 states. [2020-06-22 10:17:58,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 11 states 1 stem states 8 non-accepting loop states 1 accepting loop states [2020-06-22 10:17:58,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-06-22 10:17:58,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 321 transitions. [2020-06-22 10:17:58,507 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 321 transitions. Stem has 4 letters. Loop has 7 letters. [2020-06-22 10:17:58,508 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:17:58,508 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 321 transitions. Stem has 11 letters. Loop has 7 letters. [2020-06-22 10:17:58,509 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:17:58,509 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 321 transitions. Stem has 4 letters. Loop has 14 letters. [2020-06-22 10:17:58,510 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:17:58,521 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 213 states and 472 transitions. [2020-06-22 10:17:58,530 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 21 [2020-06-22 10:17:58,532 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 213 states to 48 states and 70 transitions. [2020-06-22 10:17:58,533 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 39 [2020-06-22 10:17:58,534 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 41 [2020-06-22 10:17:58,534 INFO L73 IsDeterministic]: Start isDeterministic. Operand 48 states and 70 transitions. [2020-06-22 10:17:58,534 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 10:17:58,535 INFO L706 BuchiCegarLoop]: Abstraction has 48 states and 70 transitions. [2020-06-22 10:17:58,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states and 70 transitions. [2020-06-22 10:17:58,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 26. [2020-06-22 10:17:58,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2020-06-22 10:17:58,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 40 transitions. [2020-06-22 10:17:58,538 INFO L729 BuchiCegarLoop]: Abstraction has 26 states and 40 transitions. [2020-06-22 10:17:58,538 INFO L609 BuchiCegarLoop]: Abstraction has 26 states and 40 transitions. [2020-06-22 10:17:58,538 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2020-06-22 10:17:58,539 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 40 transitions. [2020-06-22 10:17:58,539 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2020-06-22 10:17:58,540 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 10:17:58,540 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 10:17:58,540 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:17:58,540 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:17:58,541 INFO L794 eck$LassoCheckResult]: Stem: 452#ULTIMATE.startENTRY [97] ULTIMATE.startENTRY-->L-1: Formula: (and (= |v_#NULL.offset_1| 0) (= |v_#NULL.base_1| 0) (= |v_#valid_1| (store |v_#valid_2| 0 0))) InVars {#valid=|v_#valid_2|} OutVars{#NULL.offset=|v_#NULL.offset_1|, #NULL.base=|v_#NULL.base_1|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, #NULL.offset, #NULL.base] 451#L-1 [139] L-1-->L8: Formula: (let ((.cse0 (store |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc0.base_1| 1))) (and (= 0 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= 0 (select |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc0.base_1|)) (= v_ULTIMATE.start_main_~debug~0.offset_1 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (< |v_ULTIMATE.start_main_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (< |v_ULTIMATE.start_main_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= |v_#length_1| (store (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc0.base_1| 4) |v_ULTIMATE.start_main_#t~malloc1.base_1| 4)) (= 0 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (= (store .cse0 |v_ULTIMATE.start_main_#t~malloc1.base_1| 1) |v_#valid_3|) (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc1.base_1|) 0) (= v_ULTIMATE.start_main_~x~0.offset_1 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= v_ULTIMATE.start_main_~x~0.base_1 |v_ULTIMATE.start_main_#t~malloc0.base_1|) (= v_ULTIMATE.start_main_~debug~0.base_1 |v_ULTIMATE.start_main_#t~malloc1.base_1|) (> 0 |v_ULTIMATE.start_main_#t~malloc1.base_1|) (> |v_ULTIMATE.start_main_#t~malloc0.base_1| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{ULTIMATE.start_main_#t~malloc1.offset=|v_ULTIMATE.start_main_#t~malloc1.offset_1|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_1|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_1, ULTIMATE.start_main_#t~malloc0.offset=|v_ULTIMATE.start_main_#t~malloc0.offset_1|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_1, ULTIMATE.start_main_#t~post6=|v_ULTIMATE.start_main_#t~post6_1|, ULTIMATE.start_main_#t~malloc0.base=|v_ULTIMATE.start_main_#t~malloc0.base_1|, ULTIMATE.start_main_#t~malloc1.base=|v_ULTIMATE.start_main_#t~malloc1.base_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#t~mem8=|v_ULTIMATE.start_main_#t~mem8_1|, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, #length=|v_#length_1|, ULTIMATE.start_main_~debug~0.offset=v_ULTIMATE.start_main_~debug~0.offset_1, ULTIMATE.start_main_~debug~0.base=v_ULTIMATE.start_main_~debug~0.base_1, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_1|, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_1|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc1.offset, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_~x~0.offset, ULTIMATE.start_main_#t~malloc0.offset, ULTIMATE.start_main_~x~0.base, ULTIMATE.start_main_#t~post6, ULTIMATE.start_main_#t~malloc0.base, ULTIMATE.start_main_#t~malloc1.base, ULTIMATE.start_main_#t~mem8, ULTIMATE.start_main_#t~mem7, ULTIMATE.start_main_#res, #valid, #length, ULTIMATE.start_main_~debug~0.offset, ULTIMATE.start_main_~debug~0.base, ULTIMATE.start_main_#t~mem5, ULTIMATE.start_main_#t~mem4, ULTIMATE.start_main_#t~mem3] 445#L8 [201] L8-->L9: Formula: (and (= (store |v_#memory_int_17| v_ULTIMATE.start_main_~x~0.base_28 (store (select |v_#memory_int_17| v_ULTIMATE.start_main_~x~0.base_28) v_ULTIMATE.start_main_~x~0.offset_20 |v_ULTIMATE.start_main_#t~nondet2_5|)) |v_#memory_int_16|) (<= 0 v_ULTIMATE.start_main_~x~0.offset_20) (= 1 (select |v_#valid_29| v_ULTIMATE.start_main_~x~0.base_28)) (<= (+ v_ULTIMATE.start_main_~x~0.offset_20 4) (select |v_#length_24| v_ULTIMATE.start_main_~x~0.base_28))) InVars {ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_5|, #valid=|v_#valid_29|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_20, #length=|v_#length_24|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_28} OutVars{ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_4|, #valid=|v_#valid_29|, #memory_int=|v_#memory_int_16|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_20, #length=|v_#length_24|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_28} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2, #memory_int] 446#L9 [68] L9-->L17-1: Formula: (and (<= 0 v_ULTIMATE.start_main_~debug~0.offset_4) (= (select |v_#valid_8| v_ULTIMATE.start_main_~debug~0.base_4) 1) (= |v_#memory_int_3| (store |v_#memory_int_4| v_ULTIMATE.start_main_~debug~0.base_4 (store (select |v_#memory_int_4| v_ULTIMATE.start_main_~debug~0.base_4) v_ULTIMATE.start_main_~debug~0.offset_4 0))) (<= (+ v_ULTIMATE.start_main_~debug~0.offset_4 4) (select |v_#length_6| v_ULTIMATE.start_main_~debug~0.base_4))) InVars {#memory_int=|v_#memory_int_4|, #length=|v_#length_6|, ULTIMATE.start_main_~debug~0.offset=v_ULTIMATE.start_main_~debug~0.offset_4, ULTIMATE.start_main_~debug~0.base=v_ULTIMATE.start_main_~debug~0.base_4, #valid=|v_#valid_8|} OutVars{#memory_int=|v_#memory_int_3|, #length=|v_#length_6|, ULTIMATE.start_main_~debug~0.offset=v_ULTIMATE.start_main_~debug~0.offset_4, ULTIMATE.start_main_~debug~0.base=v_ULTIMATE.start_main_~debug~0.base_4, #valid=|v_#valid_8|} AuxVars[] AssignedVars[#memory_int] 447#L17-1 [208] L17-1-->L12: Formula: (and (< (select (select |v_#memory_int_23| v_ULTIMATE.start_main_~x~0.base_32) v_ULTIMATE.start_main_~x~0.offset_24) 255) (<= 0 v_ULTIMATE.start_main_~x~0.offset_24) (<= (+ v_ULTIMATE.start_main_~x~0.offset_24 4) (select |v_#length_28| v_ULTIMATE.start_main_~x~0.base_32)) (= 1 (select |v_#valid_39| v_ULTIMATE.start_main_~x~0.base_32))) InVars {#valid=|v_#valid_39|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_24, #memory_int=|v_#memory_int_23|, #length=|v_#length_28|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_32} OutVars{#valid=|v_#valid_39|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_24, #memory_int=|v_#memory_int_23|, #length=|v_#length_28|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_32, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem3] 458#L12 [76] L12-->L12-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_8 4) (select |v_#length_10| v_ULTIMATE.start_main_~x~0.base_10)) (= |v_ULTIMATE.start_main_#t~mem4_2| (select (select |v_#memory_int_6| v_ULTIMATE.start_main_~x~0.base_10) v_ULTIMATE.start_main_~x~0.offset_8)) (= 1 (select |v_#valid_12| v_ULTIMATE.start_main_~x~0.base_10)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_8)) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_8, #memory_int=|v_#memory_int_6|, #length=|v_#length_10|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_10, #valid=|v_#valid_12|} OutVars{#valid=|v_#valid_12|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_8, #memory_int=|v_#memory_int_6|, #length=|v_#length_10|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_10, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem4] 454#L12-1 [171] L12-1-->L13: Formula: (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem4_4| 2))) (and (< 0 .cse0) (< (+ .cse0 (- 2)) 0) (< |v_ULTIMATE.start_main_#t~mem4_4| 0))) InVars {ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_4|} OutVars{ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem4] 455#L13 [2020-06-22 10:17:58,541 INFO L796 eck$LassoCheckResult]: Loop: 455#L13 [205] L13-->L13-2: Formula: (and (= |v_ULTIMATE.start_main_#t~post6_5| |v_ULTIMATE.start_main_#t~mem5_5|) (<= 0 v_ULTIMATE.start_main_~x~0.offset_21) (<= (+ v_ULTIMATE.start_main_~x~0.offset_21 4) (select |v_#length_25| v_ULTIMATE.start_main_~x~0.base_29)) (= 1 (select |v_#valid_36| v_ULTIMATE.start_main_~x~0.base_29)) (= |v_ULTIMATE.start_main_#t~mem5_5| (select (select |v_#memory_int_18| v_ULTIMATE.start_main_~x~0.base_29) v_ULTIMATE.start_main_~x~0.offset_21))) InVars {#valid=|v_#valid_36|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_21, #memory_int=|v_#memory_int_18|, #length=|v_#length_25|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_29} OutVars{#valid=|v_#valid_36|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_21, #memory_int=|v_#memory_int_18|, #length=|v_#length_25|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_29, ULTIMATE.start_main_#t~post6=|v_ULTIMATE.start_main_#t~post6_5|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post6, ULTIMATE.start_main_#t~mem5] 453#L13-2 [207] L13-2-->L12-3: Formula: (and (<= 0 v_ULTIMATE.start_main_~x~0.offset_23) (= 1 (select |v_#valid_38| v_ULTIMATE.start_main_~x~0.base_31)) (= (store |v_#memory_int_22| v_ULTIMATE.start_main_~x~0.base_31 (store (select |v_#memory_int_22| v_ULTIMATE.start_main_~x~0.base_31) v_ULTIMATE.start_main_~x~0.offset_23 (+ |v_ULTIMATE.start_main_#t~post6_7| (- 1)))) |v_#memory_int_21|) (<= (+ v_ULTIMATE.start_main_~x~0.offset_23 4) (select |v_#length_27| v_ULTIMATE.start_main_~x~0.base_31))) InVars {#valid=|v_#valid_38|, #memory_int=|v_#memory_int_22|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_23, #length=|v_#length_27|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_31, ULTIMATE.start_main_#t~post6=|v_ULTIMATE.start_main_#t~post6_7|} OutVars{#valid=|v_#valid_38|, #memory_int=|v_#memory_int_21|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_23, #length=|v_#length_27|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_31, ULTIMATE.start_main_#t~post6=|v_ULTIMATE.start_main_#t~post6_6|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_6|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_main_#t~post6, ULTIMATE.start_main_#t~mem5] 448#L12-3 [93] L12-3-->L17: Formula: (and (= 1 (select |v_#valid_22| v_ULTIMATE.start_main_~debug~0.base_7)) (<= (+ v_ULTIMATE.start_main_~debug~0.offset_6 4) (select |v_#length_20| v_ULTIMATE.start_main_~debug~0.base_7)) (= |v_ULTIMATE.start_main_#t~mem8_2| (select (select |v_#memory_int_13| v_ULTIMATE.start_main_~debug~0.base_7) v_ULTIMATE.start_main_~debug~0.offset_6)) (<= 0 v_ULTIMATE.start_main_~debug~0.offset_6)) InVars {#memory_int=|v_#memory_int_13|, #length=|v_#length_20|, ULTIMATE.start_main_~debug~0.offset=v_ULTIMATE.start_main_~debug~0.offset_6, ULTIMATE.start_main_~debug~0.base=v_ULTIMATE.start_main_~debug~0.base_7, #valid=|v_#valid_22|} OutVars{ULTIMATE.start_main_#t~mem8=|v_ULTIMATE.start_main_#t~mem8_2|, #valid=|v_#valid_22|, #memory_int=|v_#memory_int_13|, #length=|v_#length_20|, ULTIMATE.start_main_~debug~0.offset=v_ULTIMATE.start_main_~debug~0.offset_6, ULTIMATE.start_main_~debug~0.base=v_ULTIMATE.start_main_~debug~0.base_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem8] 442#L17 [88] L17-->L17-1: Formula: (= |v_ULTIMATE.start_main_#t~mem8_6| 0) InVars {ULTIMATE.start_main_#t~mem8=|v_ULTIMATE.start_main_#t~mem8_6|} OutVars{ULTIMATE.start_main_#t~mem8=|v_ULTIMATE.start_main_#t~mem8_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem8] 438#L17-1 [208] L17-1-->L12: Formula: (and (< (select (select |v_#memory_int_23| v_ULTIMATE.start_main_~x~0.base_32) v_ULTIMATE.start_main_~x~0.offset_24) 255) (<= 0 v_ULTIMATE.start_main_~x~0.offset_24) (<= (+ v_ULTIMATE.start_main_~x~0.offset_24 4) (select |v_#length_28| v_ULTIMATE.start_main_~x~0.base_32)) (= 1 (select |v_#valid_39| v_ULTIMATE.start_main_~x~0.base_32))) InVars {#valid=|v_#valid_39|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_24, #memory_int=|v_#memory_int_23|, #length=|v_#length_28|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_32} OutVars{#valid=|v_#valid_39|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_24, #memory_int=|v_#memory_int_23|, #length=|v_#length_28|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_32, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem3] 439#L12 [76] L12-->L12-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_8 4) (select |v_#length_10| v_ULTIMATE.start_main_~x~0.base_10)) (= |v_ULTIMATE.start_main_#t~mem4_2| (select (select |v_#memory_int_6| v_ULTIMATE.start_main_~x~0.base_10) v_ULTIMATE.start_main_~x~0.offset_8)) (= 1 (select |v_#valid_12| v_ULTIMATE.start_main_~x~0.base_10)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_8)) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_8, #memory_int=|v_#memory_int_6|, #length=|v_#length_10|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_10, #valid=|v_#valid_12|} OutVars{#valid=|v_#valid_12|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_8, #memory_int=|v_#memory_int_6|, #length=|v_#length_10|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_10, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem4] 457#L12-1 [161] L12-1-->L13: Formula: (and (< 0 (mod |v_ULTIMATE.start_main_#t~mem4_4| 2)) (>= |v_ULTIMATE.start_main_#t~mem4_4| 0)) InVars {ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_4|} OutVars{ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem4] 455#L13 [2020-06-22 10:17:58,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:17:58,542 INFO L82 PathProgramCache]: Analyzing trace with hash 1803662089, now seen corresponding path program 1 times [2020-06-22 10:17:58,542 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:17:58,542 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:17:58,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:17:58,543 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:17:58,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:17:58,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:17:58,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:17:58,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:17:58,565 INFO L82 PathProgramCache]: Analyzing trace with hash 717449639, now seen corresponding path program 1 times [2020-06-22 10:17:58,565 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:17:58,565 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:17:58,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:17:58,566 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:17:58,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:17:58,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:17:58,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:17:58,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:17:58,582 INFO L82 PathProgramCache]: Analyzing trace with hash -1383350881, now seen corresponding path program 1 times [2020-06-22 10:17:58,582 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:17:58,582 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:17:58,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:17:58,583 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:17:58,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:17:58,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:17:58,660 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:17:58,660 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 10:17:58,660 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox/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 10:17:58,675 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:17:58,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:17:58,698 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 7 conjunts are in the unsatisfiable core [2020-06-22 10:17:58,699 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:17:58,735 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 18 [2020-06-22 10:17:58,736 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:17:58,742 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:17:58,742 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:17:58,742 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:30, output treesize:9 [2020-06-22 10:17:58,747 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2020-06-22 10:17:58,747 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:17:58,749 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:17:58,749 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 10:17:58,749 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:17, output treesize:5 [2020-06-22 10:17:58,750 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:17:58,778 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-06-22 10:17:58,778 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2020-06-22 10:17:58,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-06-22 10:17:58,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2020-06-22 10:17:58,850 INFO L87 Difference]: Start difference. First operand 26 states and 40 transitions. cyclomatic complexity: 16 Second operand 9 states. [2020-06-22 10:17:59,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:17:59,053 INFO L93 Difference]: Finished difference Result 38 states and 56 transitions. [2020-06-22 10:17:59,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-06-22 10:17:59,059 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 56 transitions. [2020-06-22 10:17:59,061 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 22 [2020-06-22 10:17:59,061 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 38 states and 56 transitions. [2020-06-22 10:17:59,062 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 31 [2020-06-22 10:17:59,062 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 31 [2020-06-22 10:17:59,062 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 56 transitions. [2020-06-22 10:17:59,062 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 10:17:59,062 INFO L706 BuchiCegarLoop]: Abstraction has 38 states and 56 transitions. [2020-06-22 10:17:59,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states and 56 transitions. [2020-06-22 10:17:59,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 33. [2020-06-22 10:17:59,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2020-06-22 10:17:59,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 51 transitions. [2020-06-22 10:17:59,065 INFO L729 BuchiCegarLoop]: Abstraction has 33 states and 51 transitions. [2020-06-22 10:17:59,065 INFO L609 BuchiCegarLoop]: Abstraction has 33 states and 51 transitions. [2020-06-22 10:17:59,065 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2020-06-22 10:17:59,066 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 51 transitions. [2020-06-22 10:17:59,066 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 17 [2020-06-22 10:17:59,066 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 10:17:59,066 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 10:17:59,067 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:17:59,067 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:17:59,068 INFO L794 eck$LassoCheckResult]: Stem: 574#ULTIMATE.startENTRY [97] ULTIMATE.startENTRY-->L-1: Formula: (and (= |v_#NULL.offset_1| 0) (= |v_#NULL.base_1| 0) (= |v_#valid_1| (store |v_#valid_2| 0 0))) InVars {#valid=|v_#valid_2|} OutVars{#NULL.offset=|v_#NULL.offset_1|, #NULL.base=|v_#NULL.base_1|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, #NULL.offset, #NULL.base] 573#L-1 [139] L-1-->L8: Formula: (let ((.cse0 (store |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc0.base_1| 1))) (and (= 0 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= 0 (select |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc0.base_1|)) (= v_ULTIMATE.start_main_~debug~0.offset_1 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (< |v_ULTIMATE.start_main_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (< |v_ULTIMATE.start_main_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= |v_#length_1| (store (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc0.base_1| 4) |v_ULTIMATE.start_main_#t~malloc1.base_1| 4)) (= 0 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (= (store .cse0 |v_ULTIMATE.start_main_#t~malloc1.base_1| 1) |v_#valid_3|) (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc1.base_1|) 0) (= v_ULTIMATE.start_main_~x~0.offset_1 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= v_ULTIMATE.start_main_~x~0.base_1 |v_ULTIMATE.start_main_#t~malloc0.base_1|) (= v_ULTIMATE.start_main_~debug~0.base_1 |v_ULTIMATE.start_main_#t~malloc1.base_1|) (> 0 |v_ULTIMATE.start_main_#t~malloc1.base_1|) (> |v_ULTIMATE.start_main_#t~malloc0.base_1| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{ULTIMATE.start_main_#t~malloc1.offset=|v_ULTIMATE.start_main_#t~malloc1.offset_1|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_1|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_1, ULTIMATE.start_main_#t~malloc0.offset=|v_ULTIMATE.start_main_#t~malloc0.offset_1|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_1, ULTIMATE.start_main_#t~post6=|v_ULTIMATE.start_main_#t~post6_1|, ULTIMATE.start_main_#t~malloc0.base=|v_ULTIMATE.start_main_#t~malloc0.base_1|, ULTIMATE.start_main_#t~malloc1.base=|v_ULTIMATE.start_main_#t~malloc1.base_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#t~mem8=|v_ULTIMATE.start_main_#t~mem8_1|, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, #length=|v_#length_1|, ULTIMATE.start_main_~debug~0.offset=v_ULTIMATE.start_main_~debug~0.offset_1, ULTIMATE.start_main_~debug~0.base=v_ULTIMATE.start_main_~debug~0.base_1, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_1|, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_1|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc1.offset, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_~x~0.offset, ULTIMATE.start_main_#t~malloc0.offset, ULTIMATE.start_main_~x~0.base, ULTIMATE.start_main_#t~post6, ULTIMATE.start_main_#t~malloc0.base, ULTIMATE.start_main_#t~malloc1.base, ULTIMATE.start_main_#t~mem8, ULTIMATE.start_main_#t~mem7, ULTIMATE.start_main_#res, #valid, #length, ULTIMATE.start_main_~debug~0.offset, ULTIMATE.start_main_~debug~0.base, ULTIMATE.start_main_#t~mem5, ULTIMATE.start_main_#t~mem4, ULTIMATE.start_main_#t~mem3] 567#L8 [201] L8-->L9: Formula: (and (= (store |v_#memory_int_17| v_ULTIMATE.start_main_~x~0.base_28 (store (select |v_#memory_int_17| v_ULTIMATE.start_main_~x~0.base_28) v_ULTIMATE.start_main_~x~0.offset_20 |v_ULTIMATE.start_main_#t~nondet2_5|)) |v_#memory_int_16|) (<= 0 v_ULTIMATE.start_main_~x~0.offset_20) (= 1 (select |v_#valid_29| v_ULTIMATE.start_main_~x~0.base_28)) (<= (+ v_ULTIMATE.start_main_~x~0.offset_20 4) (select |v_#length_24| v_ULTIMATE.start_main_~x~0.base_28))) InVars {ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_5|, #valid=|v_#valid_29|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_20, #length=|v_#length_24|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_28} OutVars{ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_4|, #valid=|v_#valid_29|, #memory_int=|v_#memory_int_16|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_20, #length=|v_#length_24|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_28} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2, #memory_int] 568#L9 [68] L9-->L17-1: Formula: (and (<= 0 v_ULTIMATE.start_main_~debug~0.offset_4) (= (select |v_#valid_8| v_ULTIMATE.start_main_~debug~0.base_4) 1) (= |v_#memory_int_3| (store |v_#memory_int_4| v_ULTIMATE.start_main_~debug~0.base_4 (store (select |v_#memory_int_4| v_ULTIMATE.start_main_~debug~0.base_4) v_ULTIMATE.start_main_~debug~0.offset_4 0))) (<= (+ v_ULTIMATE.start_main_~debug~0.offset_4 4) (select |v_#length_6| v_ULTIMATE.start_main_~debug~0.base_4))) InVars {#memory_int=|v_#memory_int_4|, #length=|v_#length_6|, ULTIMATE.start_main_~debug~0.offset=v_ULTIMATE.start_main_~debug~0.offset_4, ULTIMATE.start_main_~debug~0.base=v_ULTIMATE.start_main_~debug~0.base_4, #valid=|v_#valid_8|} OutVars{#memory_int=|v_#memory_int_3|, #length=|v_#length_6|, ULTIMATE.start_main_~debug~0.offset=v_ULTIMATE.start_main_~debug~0.offset_4, ULTIMATE.start_main_~debug~0.base=v_ULTIMATE.start_main_~debug~0.base_4, #valid=|v_#valid_8|} AuxVars[] AssignedVars[#memory_int] 569#L17-1 [208] L17-1-->L12: Formula: (and (< (select (select |v_#memory_int_23| v_ULTIMATE.start_main_~x~0.base_32) v_ULTIMATE.start_main_~x~0.offset_24) 255) (<= 0 v_ULTIMATE.start_main_~x~0.offset_24) (<= (+ v_ULTIMATE.start_main_~x~0.offset_24 4) (select |v_#length_28| v_ULTIMATE.start_main_~x~0.base_32)) (= 1 (select |v_#valid_39| v_ULTIMATE.start_main_~x~0.base_32))) InVars {#valid=|v_#valid_39|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_24, #memory_int=|v_#memory_int_23|, #length=|v_#length_28|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_32} OutVars{#valid=|v_#valid_39|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_24, #memory_int=|v_#memory_int_23|, #length=|v_#length_28|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_32, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem3] 560#L12 [76] L12-->L12-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_8 4) (select |v_#length_10| v_ULTIMATE.start_main_~x~0.base_10)) (= |v_ULTIMATE.start_main_#t~mem4_2| (select (select |v_#memory_int_6| v_ULTIMATE.start_main_~x~0.base_10) v_ULTIMATE.start_main_~x~0.offset_8)) (= 1 (select |v_#valid_12| v_ULTIMATE.start_main_~x~0.base_10)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_8)) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_8, #memory_int=|v_#memory_int_6|, #length=|v_#length_10|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_10, #valid=|v_#valid_12|} OutVars{#valid=|v_#valid_12|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_8, #memory_int=|v_#memory_int_6|, #length=|v_#length_10|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_10, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem4] 575#L12-1 [168] L12-1-->L13: Formula: (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem4_4| 2))) (and (< 0 .cse0) (< (+ .cse0 (- 2)) 0))) InVars {ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_4|} OutVars{ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem4] 576#L13 [2020-06-22 10:17:59,069 INFO L796 eck$LassoCheckResult]: Loop: 576#L13 [205] L13-->L13-2: Formula: (and (= |v_ULTIMATE.start_main_#t~post6_5| |v_ULTIMATE.start_main_#t~mem5_5|) (<= 0 v_ULTIMATE.start_main_~x~0.offset_21) (<= (+ v_ULTIMATE.start_main_~x~0.offset_21 4) (select |v_#length_25| v_ULTIMATE.start_main_~x~0.base_29)) (= 1 (select |v_#valid_36| v_ULTIMATE.start_main_~x~0.base_29)) (= |v_ULTIMATE.start_main_#t~mem5_5| (select (select |v_#memory_int_18| v_ULTIMATE.start_main_~x~0.base_29) v_ULTIMATE.start_main_~x~0.offset_21))) InVars {#valid=|v_#valid_36|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_21, #memory_int=|v_#memory_int_18|, #length=|v_#length_25|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_29} OutVars{#valid=|v_#valid_36|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_21, #memory_int=|v_#memory_int_18|, #length=|v_#length_25|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_29, ULTIMATE.start_main_#t~post6=|v_ULTIMATE.start_main_#t~post6_5|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post6, ULTIMATE.start_main_#t~mem5] 579#L13-2 [207] L13-2-->L12-3: Formula: (and (<= 0 v_ULTIMATE.start_main_~x~0.offset_23) (= 1 (select |v_#valid_38| v_ULTIMATE.start_main_~x~0.base_31)) (= (store |v_#memory_int_22| v_ULTIMATE.start_main_~x~0.base_31 (store (select |v_#memory_int_22| v_ULTIMATE.start_main_~x~0.base_31) v_ULTIMATE.start_main_~x~0.offset_23 (+ |v_ULTIMATE.start_main_#t~post6_7| (- 1)))) |v_#memory_int_21|) (<= (+ v_ULTIMATE.start_main_~x~0.offset_23 4) (select |v_#length_27| v_ULTIMATE.start_main_~x~0.base_31))) InVars {#valid=|v_#valid_38|, #memory_int=|v_#memory_int_22|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_23, #length=|v_#length_27|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_31, ULTIMATE.start_main_#t~post6=|v_ULTIMATE.start_main_#t~post6_7|} OutVars{#valid=|v_#valid_38|, #memory_int=|v_#memory_int_21|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_23, #length=|v_#length_27|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_31, ULTIMATE.start_main_#t~post6=|v_ULTIMATE.start_main_#t~post6_6|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_6|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_main_#t~post6, ULTIMATE.start_main_#t~mem5] 570#L12-3 [93] L12-3-->L17: Formula: (and (= 1 (select |v_#valid_22| v_ULTIMATE.start_main_~debug~0.base_7)) (<= (+ v_ULTIMATE.start_main_~debug~0.offset_6 4) (select |v_#length_20| v_ULTIMATE.start_main_~debug~0.base_7)) (= |v_ULTIMATE.start_main_#t~mem8_2| (select (select |v_#memory_int_13| v_ULTIMATE.start_main_~debug~0.base_7) v_ULTIMATE.start_main_~debug~0.offset_6)) (<= 0 v_ULTIMATE.start_main_~debug~0.offset_6)) InVars {#memory_int=|v_#memory_int_13|, #length=|v_#length_20|, ULTIMATE.start_main_~debug~0.offset=v_ULTIMATE.start_main_~debug~0.offset_6, ULTIMATE.start_main_~debug~0.base=v_ULTIMATE.start_main_~debug~0.base_7, #valid=|v_#valid_22|} OutVars{ULTIMATE.start_main_#t~mem8=|v_ULTIMATE.start_main_#t~mem8_2|, #valid=|v_#valid_22|, #memory_int=|v_#memory_int_13|, #length=|v_#length_20|, ULTIMATE.start_main_~debug~0.offset=v_ULTIMATE.start_main_~debug~0.offset_6, ULTIMATE.start_main_~debug~0.base=v_ULTIMATE.start_main_~debug~0.base_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem8] 563#L17 [88] L17-->L17-1: Formula: (= |v_ULTIMATE.start_main_#t~mem8_6| 0) InVars {ULTIMATE.start_main_#t~mem8=|v_ULTIMATE.start_main_#t~mem8_6|} OutVars{ULTIMATE.start_main_#t~mem8=|v_ULTIMATE.start_main_#t~mem8_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem8] 565#L17-1 [208] L17-1-->L12: Formula: (and (< (select (select |v_#memory_int_23| v_ULTIMATE.start_main_~x~0.base_32) v_ULTIMATE.start_main_~x~0.offset_24) 255) (<= 0 v_ULTIMATE.start_main_~x~0.offset_24) (<= (+ v_ULTIMATE.start_main_~x~0.offset_24 4) (select |v_#length_28| v_ULTIMATE.start_main_~x~0.base_32)) (= 1 (select |v_#valid_39| v_ULTIMATE.start_main_~x~0.base_32))) InVars {#valid=|v_#valid_39|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_24, #memory_int=|v_#memory_int_23|, #length=|v_#length_28|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_32} OutVars{#valid=|v_#valid_39|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_24, #memory_int=|v_#memory_int_23|, #length=|v_#length_28|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_32, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem3] 582#L12 [76] L12-->L12-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_8 4) (select |v_#length_10| v_ULTIMATE.start_main_~x~0.base_10)) (= |v_ULTIMATE.start_main_#t~mem4_2| (select (select |v_#memory_int_6| v_ULTIMATE.start_main_~x~0.base_10) v_ULTIMATE.start_main_~x~0.offset_8)) (= 1 (select |v_#valid_12| v_ULTIMATE.start_main_~x~0.base_10)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_8)) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_8, #memory_int=|v_#memory_int_6|, #length=|v_#length_10|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_10, #valid=|v_#valid_12|} OutVars{#valid=|v_#valid_12|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_8, #memory_int=|v_#memory_int_6|, #length=|v_#length_10|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_10, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem4] 583#L12-1 [161] L12-1-->L13: Formula: (and (< 0 (mod |v_ULTIMATE.start_main_#t~mem4_4| 2)) (>= |v_ULTIMATE.start_main_#t~mem4_4| 0)) InVars {ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_4|} OutVars{ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem4] 576#L13 [2020-06-22 10:17:59,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:17:59,069 INFO L82 PathProgramCache]: Analyzing trace with hash 1803662086, now seen corresponding path program 1 times [2020-06-22 10:17:59,069 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:17:59,069 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:17:59,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:17:59,070 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:17:59,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:17:59,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:17:59,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:17:59,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:17:59,089 INFO L82 PathProgramCache]: Analyzing trace with hash 717449639, now seen corresponding path program 2 times [2020-06-22 10:17:59,090 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:17:59,090 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:17:59,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:17:59,091 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:17:59,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:17:59,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:17:59,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:17:59,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:17:59,104 INFO L82 PathProgramCache]: Analyzing trace with hash 1978152706, now seen corresponding path program 1 times [2020-06-22 10:17:59,104 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:17:59,104 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:17:59,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:17:59,105 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 10:17:59,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:17:59,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:17:59,187 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:17:59,187 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 10:17:59,187 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox/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 10:17:59,200 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:17:59,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:17:59,219 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 11 conjunts are in the unsatisfiable core [2020-06-22 10:17:59,220 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:17:59,269 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 21 [2020-06-22 10:17:59,269 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:17:59,276 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:17:59,276 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:17:59,277 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:37, output treesize:19 [2020-06-22 10:17:59,281 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2020-06-22 10:17:59,281 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:17:59,283 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:17:59,283 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 10:17:59,283 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:27, output treesize:11 [2020-06-22 10:17:59,293 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:17:59,319 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-06-22 10:17:59,319 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2020-06-22 10:17:59,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-06-22 10:17:59,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-06-22 10:17:59,392 INFO L87 Difference]: Start difference. First operand 33 states and 51 transitions. cyclomatic complexity: 20 Second operand 8 states. [2020-06-22 10:17:59,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:17:59,540 INFO L93 Difference]: Finished difference Result 39 states and 57 transitions. [2020-06-22 10:17:59,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-06-22 10:17:59,546 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 57 transitions. [2020-06-22 10:17:59,547 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2020-06-22 10:17:59,548 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 39 states and 57 transitions. [2020-06-22 10:17:59,548 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 32 [2020-06-22 10:17:59,548 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 32 [2020-06-22 10:17:59,549 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 57 transitions. [2020-06-22 10:17:59,549 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 10:17:59,549 INFO L706 BuchiCegarLoop]: Abstraction has 39 states and 57 transitions. [2020-06-22 10:17:59,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 57 transitions. [2020-06-22 10:17:59,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 31. [2020-06-22 10:17:59,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-06-22 10:17:59,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 47 transitions. [2020-06-22 10:17:59,551 INFO L729 BuchiCegarLoop]: Abstraction has 31 states and 47 transitions. [2020-06-22 10:17:59,551 INFO L609 BuchiCegarLoop]: Abstraction has 31 states and 47 transitions. [2020-06-22 10:17:59,551 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2020-06-22 10:17:59,552 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 47 transitions. [2020-06-22 10:17:59,552 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2020-06-22 10:17:59,552 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 10:17:59,552 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 10:17:59,553 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:17:59,553 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2020-06-22 10:17:59,554 INFO L794 eck$LassoCheckResult]: Stem: 699#ULTIMATE.startENTRY [97] ULTIMATE.startENTRY-->L-1: Formula: (and (= |v_#NULL.offset_1| 0) (= |v_#NULL.base_1| 0) (= |v_#valid_1| (store |v_#valid_2| 0 0))) InVars {#valid=|v_#valid_2|} OutVars{#NULL.offset=|v_#NULL.offset_1|, #NULL.base=|v_#NULL.base_1|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, #NULL.offset, #NULL.base] 698#L-1 [139] L-1-->L8: Formula: (let ((.cse0 (store |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc0.base_1| 1))) (and (= 0 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= 0 (select |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc0.base_1|)) (= v_ULTIMATE.start_main_~debug~0.offset_1 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (< |v_ULTIMATE.start_main_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (< |v_ULTIMATE.start_main_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= |v_#length_1| (store (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc0.base_1| 4) |v_ULTIMATE.start_main_#t~malloc1.base_1| 4)) (= 0 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (= (store .cse0 |v_ULTIMATE.start_main_#t~malloc1.base_1| 1) |v_#valid_3|) (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc1.base_1|) 0) (= v_ULTIMATE.start_main_~x~0.offset_1 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= v_ULTIMATE.start_main_~x~0.base_1 |v_ULTIMATE.start_main_#t~malloc0.base_1|) (= v_ULTIMATE.start_main_~debug~0.base_1 |v_ULTIMATE.start_main_#t~malloc1.base_1|) (> 0 |v_ULTIMATE.start_main_#t~malloc1.base_1|) (> |v_ULTIMATE.start_main_#t~malloc0.base_1| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{ULTIMATE.start_main_#t~malloc1.offset=|v_ULTIMATE.start_main_#t~malloc1.offset_1|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_1|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_1, ULTIMATE.start_main_#t~malloc0.offset=|v_ULTIMATE.start_main_#t~malloc0.offset_1|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_1, ULTIMATE.start_main_#t~post6=|v_ULTIMATE.start_main_#t~post6_1|, ULTIMATE.start_main_#t~malloc0.base=|v_ULTIMATE.start_main_#t~malloc0.base_1|, ULTIMATE.start_main_#t~malloc1.base=|v_ULTIMATE.start_main_#t~malloc1.base_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#t~mem8=|v_ULTIMATE.start_main_#t~mem8_1|, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, #length=|v_#length_1|, ULTIMATE.start_main_~debug~0.offset=v_ULTIMATE.start_main_~debug~0.offset_1, ULTIMATE.start_main_~debug~0.base=v_ULTIMATE.start_main_~debug~0.base_1, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_1|, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_1|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc1.offset, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_~x~0.offset, ULTIMATE.start_main_#t~malloc0.offset, ULTIMATE.start_main_~x~0.base, ULTIMATE.start_main_#t~post6, ULTIMATE.start_main_#t~malloc0.base, ULTIMATE.start_main_#t~malloc1.base, ULTIMATE.start_main_#t~mem8, ULTIMATE.start_main_#t~mem7, ULTIMATE.start_main_#res, #valid, #length, ULTIMATE.start_main_~debug~0.offset, ULTIMATE.start_main_~debug~0.base, ULTIMATE.start_main_#t~mem5, ULTIMATE.start_main_#t~mem4, ULTIMATE.start_main_#t~mem3] 692#L8 [201] L8-->L9: Formula: (and (= (store |v_#memory_int_17| v_ULTIMATE.start_main_~x~0.base_28 (store (select |v_#memory_int_17| v_ULTIMATE.start_main_~x~0.base_28) v_ULTIMATE.start_main_~x~0.offset_20 |v_ULTIMATE.start_main_#t~nondet2_5|)) |v_#memory_int_16|) (<= 0 v_ULTIMATE.start_main_~x~0.offset_20) (= 1 (select |v_#valid_29| v_ULTIMATE.start_main_~x~0.base_28)) (<= (+ v_ULTIMATE.start_main_~x~0.offset_20 4) (select |v_#length_24| v_ULTIMATE.start_main_~x~0.base_28))) InVars {ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_5|, #valid=|v_#valid_29|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_20, #length=|v_#length_24|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_28} OutVars{ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_4|, #valid=|v_#valid_29|, #memory_int=|v_#memory_int_16|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_20, #length=|v_#length_24|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_28} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2, #memory_int] 693#L9 [68] L9-->L17-1: Formula: (and (<= 0 v_ULTIMATE.start_main_~debug~0.offset_4) (= (select |v_#valid_8| v_ULTIMATE.start_main_~debug~0.base_4) 1) (= |v_#memory_int_3| (store |v_#memory_int_4| v_ULTIMATE.start_main_~debug~0.base_4 (store (select |v_#memory_int_4| v_ULTIMATE.start_main_~debug~0.base_4) v_ULTIMATE.start_main_~debug~0.offset_4 0))) (<= (+ v_ULTIMATE.start_main_~debug~0.offset_4 4) (select |v_#length_6| v_ULTIMATE.start_main_~debug~0.base_4))) InVars {#memory_int=|v_#memory_int_4|, #length=|v_#length_6|, ULTIMATE.start_main_~debug~0.offset=v_ULTIMATE.start_main_~debug~0.offset_4, ULTIMATE.start_main_~debug~0.base=v_ULTIMATE.start_main_~debug~0.base_4, #valid=|v_#valid_8|} OutVars{#memory_int=|v_#memory_int_3|, #length=|v_#length_6|, ULTIMATE.start_main_~debug~0.offset=v_ULTIMATE.start_main_~debug~0.offset_4, ULTIMATE.start_main_~debug~0.base=v_ULTIMATE.start_main_~debug~0.base_4, #valid=|v_#valid_8|} AuxVars[] AssignedVars[#memory_int] 694#L17-1 [208] L17-1-->L12: Formula: (and (< (select (select |v_#memory_int_23| v_ULTIMATE.start_main_~x~0.base_32) v_ULTIMATE.start_main_~x~0.offset_24) 255) (<= 0 v_ULTIMATE.start_main_~x~0.offset_24) (<= (+ v_ULTIMATE.start_main_~x~0.offset_24 4) (select |v_#length_28| v_ULTIMATE.start_main_~x~0.base_32)) (= 1 (select |v_#valid_39| v_ULTIMATE.start_main_~x~0.base_32))) InVars {#valid=|v_#valid_39|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_24, #memory_int=|v_#memory_int_23|, #length=|v_#length_28|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_32} OutVars{#valid=|v_#valid_39|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_24, #memory_int=|v_#memory_int_23|, #length=|v_#length_28|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_32, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem3] 706#L12 [76] L12-->L12-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_8 4) (select |v_#length_10| v_ULTIMATE.start_main_~x~0.base_10)) (= |v_ULTIMATE.start_main_#t~mem4_2| (select (select |v_#memory_int_6| v_ULTIMATE.start_main_~x~0.base_10) v_ULTIMATE.start_main_~x~0.offset_8)) (= 1 (select |v_#valid_12| v_ULTIMATE.start_main_~x~0.base_10)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_8)) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_8, #memory_int=|v_#memory_int_6|, #length=|v_#length_10|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_10, #valid=|v_#valid_12|} OutVars{#valid=|v_#valid_12|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_8, #memory_int=|v_#memory_int_6|, #length=|v_#length_10|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_10, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem4] 700#L12-1 [171] L12-1-->L13: Formula: (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem4_4| 2))) (and (< 0 .cse0) (< (+ .cse0 (- 2)) 0) (< |v_ULTIMATE.start_main_#t~mem4_4| 0))) InVars {ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_4|} OutVars{ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem4] 701#L13 [2020-06-22 10:17:59,554 INFO L796 eck$LassoCheckResult]: Loop: 701#L13 [205] L13-->L13-2: Formula: (and (= |v_ULTIMATE.start_main_#t~post6_5| |v_ULTIMATE.start_main_#t~mem5_5|) (<= 0 v_ULTIMATE.start_main_~x~0.offset_21) (<= (+ v_ULTIMATE.start_main_~x~0.offset_21 4) (select |v_#length_25| v_ULTIMATE.start_main_~x~0.base_29)) (= 1 (select |v_#valid_36| v_ULTIMATE.start_main_~x~0.base_29)) (= |v_ULTIMATE.start_main_#t~mem5_5| (select (select |v_#memory_int_18| v_ULTIMATE.start_main_~x~0.base_29) v_ULTIMATE.start_main_~x~0.offset_21))) InVars {#valid=|v_#valid_36|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_21, #memory_int=|v_#memory_int_18|, #length=|v_#length_25|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_29} OutVars{#valid=|v_#valid_36|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_21, #memory_int=|v_#memory_int_18|, #length=|v_#length_25|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_29, ULTIMATE.start_main_#t~post6=|v_ULTIMATE.start_main_#t~post6_5|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post6, ULTIMATE.start_main_#t~mem5] 703#L13-2 [207] L13-2-->L12-3: Formula: (and (<= 0 v_ULTIMATE.start_main_~x~0.offset_23) (= 1 (select |v_#valid_38| v_ULTIMATE.start_main_~x~0.base_31)) (= (store |v_#memory_int_22| v_ULTIMATE.start_main_~x~0.base_31 (store (select |v_#memory_int_22| v_ULTIMATE.start_main_~x~0.base_31) v_ULTIMATE.start_main_~x~0.offset_23 (+ |v_ULTIMATE.start_main_#t~post6_7| (- 1)))) |v_#memory_int_21|) (<= (+ v_ULTIMATE.start_main_~x~0.offset_23 4) (select |v_#length_27| v_ULTIMATE.start_main_~x~0.base_31))) InVars {#valid=|v_#valid_38|, #memory_int=|v_#memory_int_22|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_23, #length=|v_#length_27|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_31, ULTIMATE.start_main_#t~post6=|v_ULTIMATE.start_main_#t~post6_7|} OutVars{#valid=|v_#valid_38|, #memory_int=|v_#memory_int_21|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_23, #length=|v_#length_27|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_31, ULTIMATE.start_main_#t~post6=|v_ULTIMATE.start_main_#t~post6_6|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_6|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_main_#t~post6, ULTIMATE.start_main_#t~mem5] 695#L12-3 [93] L12-3-->L17: Formula: (and (= 1 (select |v_#valid_22| v_ULTIMATE.start_main_~debug~0.base_7)) (<= (+ v_ULTIMATE.start_main_~debug~0.offset_6 4) (select |v_#length_20| v_ULTIMATE.start_main_~debug~0.base_7)) (= |v_ULTIMATE.start_main_#t~mem8_2| (select (select |v_#memory_int_13| v_ULTIMATE.start_main_~debug~0.base_7) v_ULTIMATE.start_main_~debug~0.offset_6)) (<= 0 v_ULTIMATE.start_main_~debug~0.offset_6)) InVars {#memory_int=|v_#memory_int_13|, #length=|v_#length_20|, ULTIMATE.start_main_~debug~0.offset=v_ULTIMATE.start_main_~debug~0.offset_6, ULTIMATE.start_main_~debug~0.base=v_ULTIMATE.start_main_~debug~0.base_7, #valid=|v_#valid_22|} OutVars{ULTIMATE.start_main_#t~mem8=|v_ULTIMATE.start_main_#t~mem8_2|, #valid=|v_#valid_22|, #memory_int=|v_#memory_int_13|, #length=|v_#length_20|, ULTIMATE.start_main_~debug~0.offset=v_ULTIMATE.start_main_~debug~0.offset_6, ULTIMATE.start_main_~debug~0.base=v_ULTIMATE.start_main_~debug~0.base_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem8] 689#L17 [88] L17-->L17-1: Formula: (= |v_ULTIMATE.start_main_#t~mem8_6| 0) InVars {ULTIMATE.start_main_#t~mem8=|v_ULTIMATE.start_main_#t~mem8_6|} OutVars{ULTIMATE.start_main_#t~mem8=|v_ULTIMATE.start_main_#t~mem8_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem8] 685#L17-1 [208] L17-1-->L12: Formula: (and (< (select (select |v_#memory_int_23| v_ULTIMATE.start_main_~x~0.base_32) v_ULTIMATE.start_main_~x~0.offset_24) 255) (<= 0 v_ULTIMATE.start_main_~x~0.offset_24) (<= (+ v_ULTIMATE.start_main_~x~0.offset_24 4) (select |v_#length_28| v_ULTIMATE.start_main_~x~0.base_32)) (= 1 (select |v_#valid_39| v_ULTIMATE.start_main_~x~0.base_32))) InVars {#valid=|v_#valid_39|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_24, #memory_int=|v_#memory_int_23|, #length=|v_#length_28|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_32} OutVars{#valid=|v_#valid_39|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_24, #memory_int=|v_#memory_int_23|, #length=|v_#length_28|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_32, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem3] 686#L12 [76] L12-->L12-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_8 4) (select |v_#length_10| v_ULTIMATE.start_main_~x~0.base_10)) (= |v_ULTIMATE.start_main_#t~mem4_2| (select (select |v_#memory_int_6| v_ULTIMATE.start_main_~x~0.base_10) v_ULTIMATE.start_main_~x~0.offset_8)) (= 1 (select |v_#valid_12| v_ULTIMATE.start_main_~x~0.base_10)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_8)) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_8, #memory_int=|v_#memory_int_6|, #length=|v_#length_10|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_10, #valid=|v_#valid_12|} OutVars{#valid=|v_#valid_12|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_8, #memory_int=|v_#memory_int_6|, #length=|v_#length_10|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_10, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem4] 704#L12-1 [172] L12-1-->L15: Formula: (= 0 (mod |v_ULTIMATE.start_main_#t~mem4_6| 2)) InVars {ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_6|} OutVars{ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem4] 681#L15 [80] L15-->L15-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_14 4) (select |v_#length_16| v_ULTIMATE.start_main_~x~0.base_19)) (= 1 (select |v_#valid_18| v_ULTIMATE.start_main_~x~0.base_19)) (= |v_ULTIMATE.start_main_#t~mem7_2| (select (select |v_#memory_int_10| v_ULTIMATE.start_main_~x~0.base_19) v_ULTIMATE.start_main_~x~0.offset_14)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_14)) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_14, #memory_int=|v_#memory_int_10|, #length=|v_#length_16|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_19, #valid=|v_#valid_18|} OutVars{ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_2|, #valid=|v_#valid_18|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_14, #memory_int=|v_#memory_int_10|, #length=|v_#length_16|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_19} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem7] 682#L15-1 [206] L15-1-->L12-3: Formula: (and (<= 0 v_ULTIMATE.start_main_~x~0.offset_22) (= 1 (select |v_#valid_37| v_ULTIMATE.start_main_~x~0.base_30)) (<= (+ v_ULTIMATE.start_main_~x~0.offset_22 4) (select |v_#length_26| v_ULTIMATE.start_main_~x~0.base_30)) (= (store |v_#memory_int_20| v_ULTIMATE.start_main_~x~0.base_30 (store (select |v_#memory_int_20| v_ULTIMATE.start_main_~x~0.base_30) v_ULTIMATE.start_main_~x~0.offset_22 (+ |v_ULTIMATE.start_main_#t~mem7_6| 2))) |v_#memory_int_19|)) InVars {ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_6|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_20|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_22, #length=|v_#length_26|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_30} OutVars{ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_5|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_19|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_22, #length=|v_#length_26|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_30} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem7, #memory_int] 705#L12-3 [93] L12-3-->L17: Formula: (and (= 1 (select |v_#valid_22| v_ULTIMATE.start_main_~debug~0.base_7)) (<= (+ v_ULTIMATE.start_main_~debug~0.offset_6 4) (select |v_#length_20| v_ULTIMATE.start_main_~debug~0.base_7)) (= |v_ULTIMATE.start_main_#t~mem8_2| (select (select |v_#memory_int_13| v_ULTIMATE.start_main_~debug~0.base_7) v_ULTIMATE.start_main_~debug~0.offset_6)) (<= 0 v_ULTIMATE.start_main_~debug~0.offset_6)) InVars {#memory_int=|v_#memory_int_13|, #length=|v_#length_20|, ULTIMATE.start_main_~debug~0.offset=v_ULTIMATE.start_main_~debug~0.offset_6, ULTIMATE.start_main_~debug~0.base=v_ULTIMATE.start_main_~debug~0.base_7, #valid=|v_#valid_22|} OutVars{ULTIMATE.start_main_#t~mem8=|v_ULTIMATE.start_main_#t~mem8_2|, #valid=|v_#valid_22|, #memory_int=|v_#memory_int_13|, #length=|v_#length_20|, ULTIMATE.start_main_~debug~0.offset=v_ULTIMATE.start_main_~debug~0.offset_6, ULTIMATE.start_main_~debug~0.base=v_ULTIMATE.start_main_~debug~0.base_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem8] 711#L17 [88] L17-->L17-1: Formula: (= |v_ULTIMATE.start_main_#t~mem8_6| 0) InVars {ULTIMATE.start_main_#t~mem8=|v_ULTIMATE.start_main_#t~mem8_6|} OutVars{ULTIMATE.start_main_#t~mem8=|v_ULTIMATE.start_main_#t~mem8_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem8] 710#L17-1 [208] L17-1-->L12: Formula: (and (< (select (select |v_#memory_int_23| v_ULTIMATE.start_main_~x~0.base_32) v_ULTIMATE.start_main_~x~0.offset_24) 255) (<= 0 v_ULTIMATE.start_main_~x~0.offset_24) (<= (+ v_ULTIMATE.start_main_~x~0.offset_24 4) (select |v_#length_28| v_ULTIMATE.start_main_~x~0.base_32)) (= 1 (select |v_#valid_39| v_ULTIMATE.start_main_~x~0.base_32))) InVars {#valid=|v_#valid_39|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_24, #memory_int=|v_#memory_int_23|, #length=|v_#length_28|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_32} OutVars{#valid=|v_#valid_39|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_24, #memory_int=|v_#memory_int_23|, #length=|v_#length_28|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_32, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem3] 709#L12 [76] L12-->L12-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_8 4) (select |v_#length_10| v_ULTIMATE.start_main_~x~0.base_10)) (= |v_ULTIMATE.start_main_#t~mem4_2| (select (select |v_#memory_int_6| v_ULTIMATE.start_main_~x~0.base_10) v_ULTIMATE.start_main_~x~0.offset_8)) (= 1 (select |v_#valid_12| v_ULTIMATE.start_main_~x~0.base_10)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_8)) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_8, #memory_int=|v_#memory_int_6|, #length=|v_#length_10|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_10, #valid=|v_#valid_12|} OutVars{#valid=|v_#valid_12|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_8, #memory_int=|v_#memory_int_6|, #length=|v_#length_10|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_10, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem4] 708#L12-1 [161] L12-1-->L13: Formula: (and (< 0 (mod |v_ULTIMATE.start_main_#t~mem4_4| 2)) (>= |v_ULTIMATE.start_main_#t~mem4_4| 0)) InVars {ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_4|} OutVars{ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem4] 701#L13 [2020-06-22 10:17:59,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:17:59,555 INFO L82 PathProgramCache]: Analyzing trace with hash 1803662089, now seen corresponding path program 2 times [2020-06-22 10:17:59,555 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:17:59,555 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:17:59,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:17:59,556 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:17:59,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:17:59,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:17:59,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:17:59,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:17:59,572 INFO L82 PathProgramCache]: Analyzing trace with hash 1184374650, now seen corresponding path program 1 times [2020-06-22 10:17:59,572 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:17:59,572 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:17:59,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:17:59,573 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 10:17:59,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:17:59,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:17:59,648 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:17:59,648 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 10:17:59,648 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox/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 10:17:59,662 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:17:59,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:17:59,678 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 9 conjunts are in the unsatisfiable core [2020-06-22 10:17:59,680 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:17:59,717 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 21 [2020-06-22 10:17:59,717 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:17:59,726 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:17:59,727 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:17:59,727 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:37, output treesize:15 [2020-06-22 10:17:59,750 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2020-06-22 10:17:59,750 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:17:59,752 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:17:59,752 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 10:17:59,753 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:27, output treesize:11 [2020-06-22 10:17:59,761 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:17:59,787 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-06-22 10:17:59,787 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2020-06-22 10:17:59,788 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-06-22 10:17:59,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-06-22 10:17:59,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-06-22 10:17:59,788 INFO L87 Difference]: Start difference. First operand 31 states and 47 transitions. cyclomatic complexity: 18 Second operand 8 states. [2020-06-22 10:17:59,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:17:59,929 INFO L93 Difference]: Finished difference Result 39 states and 51 transitions. [2020-06-22 10:17:59,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-06-22 10:17:59,934 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 51 transitions. [2020-06-22 10:17:59,934 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2020-06-22 10:17:59,935 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 36 states and 48 transitions. [2020-06-22 10:17:59,935 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2020-06-22 10:17:59,935 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2020-06-22 10:17:59,935 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 48 transitions. [2020-06-22 10:17:59,936 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 10:17:59,936 INFO L706 BuchiCegarLoop]: Abstraction has 36 states and 48 transitions. [2020-06-22 10:17:59,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 48 transitions. [2020-06-22 10:17:59,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 25. [2020-06-22 10:17:59,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-06-22 10:17:59,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 35 transitions. [2020-06-22 10:17:59,938 INFO L729 BuchiCegarLoop]: Abstraction has 25 states and 35 transitions. [2020-06-22 10:17:59,938 INFO L609 BuchiCegarLoop]: Abstraction has 25 states and 35 transitions. [2020-06-22 10:17:59,938 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2020-06-22 10:17:59,938 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 35 transitions. [2020-06-22 10:17:59,939 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2020-06-22 10:17:59,939 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 10:17:59,939 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 10:17:59,939 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:17:59,939 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:17:59,940 INFO L794 eck$LassoCheckResult]: Stem: 821#ULTIMATE.startENTRY [97] ULTIMATE.startENTRY-->L-1: Formula: (and (= |v_#NULL.offset_1| 0) (= |v_#NULL.base_1| 0) (= |v_#valid_1| (store |v_#valid_2| 0 0))) InVars {#valid=|v_#valid_2|} OutVars{#NULL.offset=|v_#NULL.offset_1|, #NULL.base=|v_#NULL.base_1|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, #NULL.offset, #NULL.base] 820#L-1 [139] L-1-->L8: Formula: (let ((.cse0 (store |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc0.base_1| 1))) (and (= 0 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= 0 (select |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc0.base_1|)) (= v_ULTIMATE.start_main_~debug~0.offset_1 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (< |v_ULTIMATE.start_main_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (< |v_ULTIMATE.start_main_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= |v_#length_1| (store (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc0.base_1| 4) |v_ULTIMATE.start_main_#t~malloc1.base_1| 4)) (= 0 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (= (store .cse0 |v_ULTIMATE.start_main_#t~malloc1.base_1| 1) |v_#valid_3|) (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc1.base_1|) 0) (= v_ULTIMATE.start_main_~x~0.offset_1 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= v_ULTIMATE.start_main_~x~0.base_1 |v_ULTIMATE.start_main_#t~malloc0.base_1|) (= v_ULTIMATE.start_main_~debug~0.base_1 |v_ULTIMATE.start_main_#t~malloc1.base_1|) (> 0 |v_ULTIMATE.start_main_#t~malloc1.base_1|) (> |v_ULTIMATE.start_main_#t~malloc0.base_1| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{ULTIMATE.start_main_#t~malloc1.offset=|v_ULTIMATE.start_main_#t~malloc1.offset_1|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_1|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_1, ULTIMATE.start_main_#t~malloc0.offset=|v_ULTIMATE.start_main_#t~malloc0.offset_1|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_1, ULTIMATE.start_main_#t~post6=|v_ULTIMATE.start_main_#t~post6_1|, ULTIMATE.start_main_#t~malloc0.base=|v_ULTIMATE.start_main_#t~malloc0.base_1|, ULTIMATE.start_main_#t~malloc1.base=|v_ULTIMATE.start_main_#t~malloc1.base_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#t~mem8=|v_ULTIMATE.start_main_#t~mem8_1|, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, #length=|v_#length_1|, ULTIMATE.start_main_~debug~0.offset=v_ULTIMATE.start_main_~debug~0.offset_1, ULTIMATE.start_main_~debug~0.base=v_ULTIMATE.start_main_~debug~0.base_1, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_1|, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_1|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc1.offset, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_~x~0.offset, ULTIMATE.start_main_#t~malloc0.offset, ULTIMATE.start_main_~x~0.base, ULTIMATE.start_main_#t~post6, ULTIMATE.start_main_#t~malloc0.base, ULTIMATE.start_main_#t~malloc1.base, ULTIMATE.start_main_#t~mem8, ULTIMATE.start_main_#t~mem7, ULTIMATE.start_main_#res, #valid, #length, ULTIMATE.start_main_~debug~0.offset, ULTIMATE.start_main_~debug~0.base, ULTIMATE.start_main_#t~mem5, ULTIMATE.start_main_#t~mem4, ULTIMATE.start_main_#t~mem3] 814#L8 [201] L8-->L9: Formula: (and (= (store |v_#memory_int_17| v_ULTIMATE.start_main_~x~0.base_28 (store (select |v_#memory_int_17| v_ULTIMATE.start_main_~x~0.base_28) v_ULTIMATE.start_main_~x~0.offset_20 |v_ULTIMATE.start_main_#t~nondet2_5|)) |v_#memory_int_16|) (<= 0 v_ULTIMATE.start_main_~x~0.offset_20) (= 1 (select |v_#valid_29| v_ULTIMATE.start_main_~x~0.base_28)) (<= (+ v_ULTIMATE.start_main_~x~0.offset_20 4) (select |v_#length_24| v_ULTIMATE.start_main_~x~0.base_28))) InVars {ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_5|, #valid=|v_#valid_29|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_20, #length=|v_#length_24|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_28} OutVars{ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_4|, #valid=|v_#valid_29|, #memory_int=|v_#memory_int_16|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_20, #length=|v_#length_24|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_28} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2, #memory_int] 815#L9 [68] L9-->L17-1: Formula: (and (<= 0 v_ULTIMATE.start_main_~debug~0.offset_4) (= (select |v_#valid_8| v_ULTIMATE.start_main_~debug~0.base_4) 1) (= |v_#memory_int_3| (store |v_#memory_int_4| v_ULTIMATE.start_main_~debug~0.base_4 (store (select |v_#memory_int_4| v_ULTIMATE.start_main_~debug~0.base_4) v_ULTIMATE.start_main_~debug~0.offset_4 0))) (<= (+ v_ULTIMATE.start_main_~debug~0.offset_4 4) (select |v_#length_6| v_ULTIMATE.start_main_~debug~0.base_4))) InVars {#memory_int=|v_#memory_int_4|, #length=|v_#length_6|, ULTIMATE.start_main_~debug~0.offset=v_ULTIMATE.start_main_~debug~0.offset_4, ULTIMATE.start_main_~debug~0.base=v_ULTIMATE.start_main_~debug~0.base_4, #valid=|v_#valid_8|} OutVars{#memory_int=|v_#memory_int_3|, #length=|v_#length_6|, ULTIMATE.start_main_~debug~0.offset=v_ULTIMATE.start_main_~debug~0.offset_4, ULTIMATE.start_main_~debug~0.base=v_ULTIMATE.start_main_~debug~0.base_4, #valid=|v_#valid_8|} AuxVars[] AssignedVars[#memory_int] 819#L17-1 [208] L17-1-->L12: Formula: (and (< (select (select |v_#memory_int_23| v_ULTIMATE.start_main_~x~0.base_32) v_ULTIMATE.start_main_~x~0.offset_24) 255) (<= 0 v_ULTIMATE.start_main_~x~0.offset_24) (<= (+ v_ULTIMATE.start_main_~x~0.offset_24 4) (select |v_#length_28| v_ULTIMATE.start_main_~x~0.base_32)) (= 1 (select |v_#valid_39| v_ULTIMATE.start_main_~x~0.base_32))) InVars {#valid=|v_#valid_39|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_24, #memory_int=|v_#memory_int_23|, #length=|v_#length_28|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_32} OutVars{#valid=|v_#valid_39|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_24, #memory_int=|v_#memory_int_23|, #length=|v_#length_28|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_32, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem3] 827#L12 [76] L12-->L12-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_8 4) (select |v_#length_10| v_ULTIMATE.start_main_~x~0.base_10)) (= |v_ULTIMATE.start_main_#t~mem4_2| (select (select |v_#memory_int_6| v_ULTIMATE.start_main_~x~0.base_10) v_ULTIMATE.start_main_~x~0.offset_8)) (= 1 (select |v_#valid_12| v_ULTIMATE.start_main_~x~0.base_10)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_8)) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_8, #memory_int=|v_#memory_int_6|, #length=|v_#length_10|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_10, #valid=|v_#valid_12|} OutVars{#valid=|v_#valid_12|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_8, #memory_int=|v_#memory_int_6|, #length=|v_#length_10|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_10, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem4] 822#L12-1 [171] L12-1-->L13: Formula: (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem4_4| 2))) (and (< 0 .cse0) (< (+ .cse0 (- 2)) 0) (< |v_ULTIMATE.start_main_#t~mem4_4| 0))) InVars {ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_4|} OutVars{ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem4] 823#L13 [205] L13-->L13-2: Formula: (and (= |v_ULTIMATE.start_main_#t~post6_5| |v_ULTIMATE.start_main_#t~mem5_5|) (<= 0 v_ULTIMATE.start_main_~x~0.offset_21) (<= (+ v_ULTIMATE.start_main_~x~0.offset_21 4) (select |v_#length_25| v_ULTIMATE.start_main_~x~0.base_29)) (= 1 (select |v_#valid_36| v_ULTIMATE.start_main_~x~0.base_29)) (= |v_ULTIMATE.start_main_#t~mem5_5| (select (select |v_#memory_int_18| v_ULTIMATE.start_main_~x~0.base_29) v_ULTIMATE.start_main_~x~0.offset_21))) InVars {#valid=|v_#valid_36|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_21, #memory_int=|v_#memory_int_18|, #length=|v_#length_25|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_29} OutVars{#valid=|v_#valid_36|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_21, #memory_int=|v_#memory_int_18|, #length=|v_#length_25|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_29, ULTIMATE.start_main_#t~post6=|v_ULTIMATE.start_main_#t~post6_5|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post6, ULTIMATE.start_main_#t~mem5] 825#L13-2 [207] L13-2-->L12-3: Formula: (and (<= 0 v_ULTIMATE.start_main_~x~0.offset_23) (= 1 (select |v_#valid_38| v_ULTIMATE.start_main_~x~0.base_31)) (= (store |v_#memory_int_22| v_ULTIMATE.start_main_~x~0.base_31 (store (select |v_#memory_int_22| v_ULTIMATE.start_main_~x~0.base_31) v_ULTIMATE.start_main_~x~0.offset_23 (+ |v_ULTIMATE.start_main_#t~post6_7| (- 1)))) |v_#memory_int_21|) (<= (+ v_ULTIMATE.start_main_~x~0.offset_23 4) (select |v_#length_27| v_ULTIMATE.start_main_~x~0.base_31))) InVars {#valid=|v_#valid_38|, #memory_int=|v_#memory_int_22|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_23, #length=|v_#length_27|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_31, ULTIMATE.start_main_#t~post6=|v_ULTIMATE.start_main_#t~post6_7|} OutVars{#valid=|v_#valid_38|, #memory_int=|v_#memory_int_21|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_23, #length=|v_#length_27|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_31, ULTIMATE.start_main_#t~post6=|v_ULTIMATE.start_main_#t~post6_6|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_6|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_main_#t~post6, ULTIMATE.start_main_#t~mem5] 816#L12-3 [2020-06-22 10:17:59,940 INFO L796 eck$LassoCheckResult]: Loop: 816#L12-3 [93] L12-3-->L17: Formula: (and (= 1 (select |v_#valid_22| v_ULTIMATE.start_main_~debug~0.base_7)) (<= (+ v_ULTIMATE.start_main_~debug~0.offset_6 4) (select |v_#length_20| v_ULTIMATE.start_main_~debug~0.base_7)) (= |v_ULTIMATE.start_main_#t~mem8_2| (select (select |v_#memory_int_13| v_ULTIMATE.start_main_~debug~0.base_7) v_ULTIMATE.start_main_~debug~0.offset_6)) (<= 0 v_ULTIMATE.start_main_~debug~0.offset_6)) InVars {#memory_int=|v_#memory_int_13|, #length=|v_#length_20|, ULTIMATE.start_main_~debug~0.offset=v_ULTIMATE.start_main_~debug~0.offset_6, ULTIMATE.start_main_~debug~0.base=v_ULTIMATE.start_main_~debug~0.base_7, #valid=|v_#valid_22|} OutVars{ULTIMATE.start_main_#t~mem8=|v_ULTIMATE.start_main_#t~mem8_2|, #valid=|v_#valid_22|, #memory_int=|v_#memory_int_13|, #length=|v_#length_20|, ULTIMATE.start_main_~debug~0.offset=v_ULTIMATE.start_main_~debug~0.offset_6, ULTIMATE.start_main_~debug~0.base=v_ULTIMATE.start_main_~debug~0.base_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem8] 817#L17 [88] L17-->L17-1: Formula: (= |v_ULTIMATE.start_main_#t~mem8_6| 0) InVars {ULTIMATE.start_main_#t~mem8=|v_ULTIMATE.start_main_#t~mem8_6|} OutVars{ULTIMATE.start_main_#t~mem8=|v_ULTIMATE.start_main_#t~mem8_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem8] 807#L17-1 [208] L17-1-->L12: Formula: (and (< (select (select |v_#memory_int_23| v_ULTIMATE.start_main_~x~0.base_32) v_ULTIMATE.start_main_~x~0.offset_24) 255) (<= 0 v_ULTIMATE.start_main_~x~0.offset_24) (<= (+ v_ULTIMATE.start_main_~x~0.offset_24 4) (select |v_#length_28| v_ULTIMATE.start_main_~x~0.base_32)) (= 1 (select |v_#valid_39| v_ULTIMATE.start_main_~x~0.base_32))) InVars {#valid=|v_#valid_39|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_24, #memory_int=|v_#memory_int_23|, #length=|v_#length_28|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_32} OutVars{#valid=|v_#valid_39|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_24, #memory_int=|v_#memory_int_23|, #length=|v_#length_28|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_32, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem3] 808#L12 [76] L12-->L12-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_8 4) (select |v_#length_10| v_ULTIMATE.start_main_~x~0.base_10)) (= |v_ULTIMATE.start_main_#t~mem4_2| (select (select |v_#memory_int_6| v_ULTIMATE.start_main_~x~0.base_10) v_ULTIMATE.start_main_~x~0.offset_8)) (= 1 (select |v_#valid_12| v_ULTIMATE.start_main_~x~0.base_10)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_8)) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_8, #memory_int=|v_#memory_int_6|, #length=|v_#length_10|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_10, #valid=|v_#valid_12|} OutVars{#valid=|v_#valid_12|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_8, #memory_int=|v_#memory_int_6|, #length=|v_#length_10|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_10, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem4] 826#L12-1 [172] L12-1-->L15: Formula: (= 0 (mod |v_ULTIMATE.start_main_#t~mem4_6| 2)) InVars {ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_6|} OutVars{ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem4] 803#L15 [80] L15-->L15-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_14 4) (select |v_#length_16| v_ULTIMATE.start_main_~x~0.base_19)) (= 1 (select |v_#valid_18| v_ULTIMATE.start_main_~x~0.base_19)) (= |v_ULTIMATE.start_main_#t~mem7_2| (select (select |v_#memory_int_10| v_ULTIMATE.start_main_~x~0.base_19) v_ULTIMATE.start_main_~x~0.offset_14)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_14)) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_14, #memory_int=|v_#memory_int_10|, #length=|v_#length_16|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_19, #valid=|v_#valid_18|} OutVars{ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_2|, #valid=|v_#valid_18|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_14, #memory_int=|v_#memory_int_10|, #length=|v_#length_16|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_19} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem7] 804#L15-1 [206] L15-1-->L12-3: Formula: (and (<= 0 v_ULTIMATE.start_main_~x~0.offset_22) (= 1 (select |v_#valid_37| v_ULTIMATE.start_main_~x~0.base_30)) (<= (+ v_ULTIMATE.start_main_~x~0.offset_22 4) (select |v_#length_26| v_ULTIMATE.start_main_~x~0.base_30)) (= (store |v_#memory_int_20| v_ULTIMATE.start_main_~x~0.base_30 (store (select |v_#memory_int_20| v_ULTIMATE.start_main_~x~0.base_30) v_ULTIMATE.start_main_~x~0.offset_22 (+ |v_ULTIMATE.start_main_#t~mem7_6| 2))) |v_#memory_int_19|)) InVars {ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_6|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_20|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_22, #length=|v_#length_26|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_30} OutVars{ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_5|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_19|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_22, #length=|v_#length_26|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_30} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem7, #memory_int] 816#L12-3 [2020-06-22 10:17:59,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:17:59,941 INFO L82 PathProgramCache]: Analyzing trace with hash -1847513493, now seen corresponding path program 1 times [2020-06-22 10:17:59,941 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:17:59,941 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:17:59,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:17:59,942 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:17:59,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:17:59,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:17:59,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:17:59,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:17:59,959 INFO L82 PathProgramCache]: Analyzing trace with hash 1095196498, now seen corresponding path program 2 times [2020-06-22 10:17:59,959 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:17:59,959 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:17:59,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:17:59,960 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:17:59,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:17:59,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:17:59,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:17:59,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:17:59,969 INFO L82 PathProgramCache]: Analyzing trace with hash 2039678376, now seen corresponding path program 1 times [2020-06-22 10:17:59,969 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:17:59,969 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:17:59,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:17:59,970 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 10:17:59,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:17:59,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:17:59,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:18:00,244 WARN L188 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 76 [2020-06-22 10:18:00,338 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 10:18:00,338 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 10:18:00,338 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 10:18:00,338 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 10:18:00,338 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 10:18:00,339 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 10:18:00,339 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 10:18:00,339 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 10:18:00,339 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration5_Lasso [2020-06-22 10:18:00,339 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 10:18:00,339 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 10:18:00,342 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 10:18:00,498 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 52 [2020-06-22 10:18:00,573 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 10:18:00,575 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 10:18:00,577 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 10:18:00,578 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 10:18:00,580 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 10:18:00,582 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 10:18:00,583 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 10:18:00,585 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 10:18:00,586 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 10:18:00,588 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 10:18:00,917 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 10:18:00,917 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 10:18:00,917 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 10:18:00,918 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:18:00,918 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:00,918 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:00,919 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:18:00,920 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:18:00,920 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:18:00,925 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:00,925 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 10:18:00,926 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:18:00,926 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:00,926 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:00,926 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:18:00,928 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:18:00,928 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:18:00,932 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:00,932 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 10:18:00,933 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:18:00,933 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:00,933 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:00,933 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:18:00,936 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:18:00,936 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:18:00,946 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:18:00,946 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 10:18:00,947 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:18:00,947 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:18:00,947 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:18:00,947 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:18:00,948 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:18:00,948 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:18:00,959 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 10:18:00,963 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-06-22 10:18:00,963 INFO L444 ModelExtractionUtils]: 4 out of 7 variables were initially zero. Simplification set additionally 0 variables to zero. [2020-06-22 10:18:00,963 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 10:18:00,964 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-06-22 10:18:00,964 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 10:18:00,965 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_2) = -1*v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_2 + 255 Supporting invariants [] [2020-06-22 10:18:00,993 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2020-06-22 10:18:00,995 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:18:01,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:18:01,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:18:01,020 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-22 10:18:01,020 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:18:01,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:18:01,028 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 5 conjunts are in the unsatisfiable core [2020-06-22 10:18:01,029 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:18:01,054 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 10:18:01,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:18:01,093 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 5 conjunts are in the unsatisfiable core [2020-06-22 10:18:01,094 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:18:01,113 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 18 [2020-06-22 10:18:01,114 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:18:01,119 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:18:01,119 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:18:01,120 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:30, output treesize:9 [2020-06-22 10:18:01,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:18:01,164 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 5 conjunts are in the unsatisfiable core [2020-06-22 10:18:01,164 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:18:01,170 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 18 [2020-06-22 10:18:01,171 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:18:01,176 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:18:01,177 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:18:01,177 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:30, output treesize:9 [2020-06-22 10:18:01,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:18:01,202 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 10:18:01,203 INFO L98 LoopCannibalizer]: 3 predicates before loop cannibalization 4 predicates after loop cannibalization [2020-06-22 10:18:01,203 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2020-06-22 10:18:01,203 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 25 states and 35 transitions. cyclomatic complexity: 12 Second operand 5 states. [2020-06-22 10:18:01,277 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 25 states and 35 transitions. cyclomatic complexity: 12. Second operand 5 states. Result 51 states and 65 transitions. Complement of second has 12 states. [2020-06-22 10:18:01,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 1 stem states 5 non-accepting loop states 1 accepting loop states [2020-06-22 10:18:01,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-06-22 10:18:01,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 37 transitions. [2020-06-22 10:18:01,278 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 37 transitions. Stem has 9 letters. Loop has 7 letters. [2020-06-22 10:18:01,279 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:18:01,279 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 37 transitions. Stem has 16 letters. Loop has 7 letters. [2020-06-22 10:18:01,279 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:18:01,280 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 37 transitions. Stem has 9 letters. Loop has 14 letters. [2020-06-22 10:18:01,280 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:18:01,283 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 51 states and 65 transitions. [2020-06-22 10:18:01,284 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2020-06-22 10:18:01,285 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 51 states to 40 states and 53 transitions. [2020-06-22 10:18:01,285 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2020-06-22 10:18:01,285 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2020-06-22 10:18:01,285 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 53 transitions. [2020-06-22 10:18:01,286 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 10:18:01,286 INFO L706 BuchiCegarLoop]: Abstraction has 40 states and 53 transitions. [2020-06-22 10:18:01,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states and 53 transitions. [2020-06-22 10:18:01,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 26. [2020-06-22 10:18:01,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2020-06-22 10:18:01,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 37 transitions. [2020-06-22 10:18:01,288 INFO L729 BuchiCegarLoop]: Abstraction has 26 states and 37 transitions. [2020-06-22 10:18:01,288 INFO L609 BuchiCegarLoop]: Abstraction has 26 states and 37 transitions. [2020-06-22 10:18:01,288 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2020-06-22 10:18:01,288 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 37 transitions. [2020-06-22 10:18:01,289 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2020-06-22 10:18:01,289 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 10:18:01,289 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 10:18:01,290 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:18:01,290 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:18:01,290 INFO L794 eck$LassoCheckResult]: Stem: 1063#ULTIMATE.startENTRY [97] ULTIMATE.startENTRY-->L-1: Formula: (and (= |v_#NULL.offset_1| 0) (= |v_#NULL.base_1| 0) (= |v_#valid_1| (store |v_#valid_2| 0 0))) InVars {#valid=|v_#valid_2|} OutVars{#NULL.offset=|v_#NULL.offset_1|, #NULL.base=|v_#NULL.base_1|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, #NULL.offset, #NULL.base] 1062#L-1 [139] L-1-->L8: Formula: (let ((.cse0 (store |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc0.base_1| 1))) (and (= 0 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= 0 (select |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc0.base_1|)) (= v_ULTIMATE.start_main_~debug~0.offset_1 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (< |v_ULTIMATE.start_main_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (< |v_ULTIMATE.start_main_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= |v_#length_1| (store (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc0.base_1| 4) |v_ULTIMATE.start_main_#t~malloc1.base_1| 4)) (= 0 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (= (store .cse0 |v_ULTIMATE.start_main_#t~malloc1.base_1| 1) |v_#valid_3|) (= (select .cse0 |v_ULTIMATE.start_main_#t~malloc1.base_1|) 0) (= v_ULTIMATE.start_main_~x~0.offset_1 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= v_ULTIMATE.start_main_~x~0.base_1 |v_ULTIMATE.start_main_#t~malloc0.base_1|) (= v_ULTIMATE.start_main_~debug~0.base_1 |v_ULTIMATE.start_main_#t~malloc1.base_1|) (> 0 |v_ULTIMATE.start_main_#t~malloc1.base_1|) (> |v_ULTIMATE.start_main_#t~malloc0.base_1| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{ULTIMATE.start_main_#t~malloc1.offset=|v_ULTIMATE.start_main_#t~malloc1.offset_1|, ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_1|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_1, ULTIMATE.start_main_#t~malloc0.offset=|v_ULTIMATE.start_main_#t~malloc0.offset_1|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_1, ULTIMATE.start_main_#t~post6=|v_ULTIMATE.start_main_#t~post6_1|, ULTIMATE.start_main_#t~malloc0.base=|v_ULTIMATE.start_main_#t~malloc0.base_1|, ULTIMATE.start_main_#t~malloc1.base=|v_ULTIMATE.start_main_#t~malloc1.base_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#t~mem8=|v_ULTIMATE.start_main_#t~mem8_1|, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, #length=|v_#length_1|, ULTIMATE.start_main_~debug~0.offset=v_ULTIMATE.start_main_~debug~0.offset_1, ULTIMATE.start_main_~debug~0.base=v_ULTIMATE.start_main_~debug~0.base_1, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_1|, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_1|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc1.offset, ULTIMATE.start_main_#t~nondet2, ULTIMATE.start_main_~x~0.offset, ULTIMATE.start_main_#t~malloc0.offset, ULTIMATE.start_main_~x~0.base, ULTIMATE.start_main_#t~post6, ULTIMATE.start_main_#t~malloc0.base, ULTIMATE.start_main_#t~malloc1.base, ULTIMATE.start_main_#t~mem8, ULTIMATE.start_main_#t~mem7, ULTIMATE.start_main_#res, #valid, #length, ULTIMATE.start_main_~debug~0.offset, ULTIMATE.start_main_~debug~0.base, ULTIMATE.start_main_#t~mem5, ULTIMATE.start_main_#t~mem4, ULTIMATE.start_main_#t~mem3] 1057#L8 [201] L8-->L9: Formula: (and (= (store |v_#memory_int_17| v_ULTIMATE.start_main_~x~0.base_28 (store (select |v_#memory_int_17| v_ULTIMATE.start_main_~x~0.base_28) v_ULTIMATE.start_main_~x~0.offset_20 |v_ULTIMATE.start_main_#t~nondet2_5|)) |v_#memory_int_16|) (<= 0 v_ULTIMATE.start_main_~x~0.offset_20) (= 1 (select |v_#valid_29| v_ULTIMATE.start_main_~x~0.base_28)) (<= (+ v_ULTIMATE.start_main_~x~0.offset_20 4) (select |v_#length_24| v_ULTIMATE.start_main_~x~0.base_28))) InVars {ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_5|, #valid=|v_#valid_29|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_20, #length=|v_#length_24|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_28} OutVars{ULTIMATE.start_main_#t~nondet2=|v_ULTIMATE.start_main_#t~nondet2_4|, #valid=|v_#valid_29|, #memory_int=|v_#memory_int_16|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_20, #length=|v_#length_24|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_28} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet2, #memory_int] 1058#L9 [68] L9-->L17-1: Formula: (and (<= 0 v_ULTIMATE.start_main_~debug~0.offset_4) (= (select |v_#valid_8| v_ULTIMATE.start_main_~debug~0.base_4) 1) (= |v_#memory_int_3| (store |v_#memory_int_4| v_ULTIMATE.start_main_~debug~0.base_4 (store (select |v_#memory_int_4| v_ULTIMATE.start_main_~debug~0.base_4) v_ULTIMATE.start_main_~debug~0.offset_4 0))) (<= (+ v_ULTIMATE.start_main_~debug~0.offset_4 4) (select |v_#length_6| v_ULTIMATE.start_main_~debug~0.base_4))) InVars {#memory_int=|v_#memory_int_4|, #length=|v_#length_6|, ULTIMATE.start_main_~debug~0.offset=v_ULTIMATE.start_main_~debug~0.offset_4, ULTIMATE.start_main_~debug~0.base=v_ULTIMATE.start_main_~debug~0.base_4, #valid=|v_#valid_8|} OutVars{#memory_int=|v_#memory_int_3|, #length=|v_#length_6|, ULTIMATE.start_main_~debug~0.offset=v_ULTIMATE.start_main_~debug~0.offset_4, ULTIMATE.start_main_~debug~0.base=v_ULTIMATE.start_main_~debug~0.base_4, #valid=|v_#valid_8|} AuxVars[] AssignedVars[#memory_int] 1061#L17-1 [208] L17-1-->L12: Formula: (and (< (select (select |v_#memory_int_23| v_ULTIMATE.start_main_~x~0.base_32) v_ULTIMATE.start_main_~x~0.offset_24) 255) (<= 0 v_ULTIMATE.start_main_~x~0.offset_24) (<= (+ v_ULTIMATE.start_main_~x~0.offset_24 4) (select |v_#length_28| v_ULTIMATE.start_main_~x~0.base_32)) (= 1 (select |v_#valid_39| v_ULTIMATE.start_main_~x~0.base_32))) InVars {#valid=|v_#valid_39|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_24, #memory_int=|v_#memory_int_23|, #length=|v_#length_28|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_32} OutVars{#valid=|v_#valid_39|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_24, #memory_int=|v_#memory_int_23|, #length=|v_#length_28|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_32, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem3] 1053#L12 [76] L12-->L12-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_8 4) (select |v_#length_10| v_ULTIMATE.start_main_~x~0.base_10)) (= |v_ULTIMATE.start_main_#t~mem4_2| (select (select |v_#memory_int_6| v_ULTIMATE.start_main_~x~0.base_10) v_ULTIMATE.start_main_~x~0.offset_8)) (= 1 (select |v_#valid_12| v_ULTIMATE.start_main_~x~0.base_10)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_8)) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_8, #memory_int=|v_#memory_int_6|, #length=|v_#length_10|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_10, #valid=|v_#valid_12|} OutVars{#valid=|v_#valid_12|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_8, #memory_int=|v_#memory_int_6|, #length=|v_#length_10|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_10, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem4] 1065#L12-1 [172] L12-1-->L15: Formula: (= 0 (mod |v_ULTIMATE.start_main_#t~mem4_6| 2)) InVars {ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_6|} OutVars{ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem4] 1048#L15 [80] L15-->L15-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_14 4) (select |v_#length_16| v_ULTIMATE.start_main_~x~0.base_19)) (= 1 (select |v_#valid_18| v_ULTIMATE.start_main_~x~0.base_19)) (= |v_ULTIMATE.start_main_#t~mem7_2| (select (select |v_#memory_int_10| v_ULTIMATE.start_main_~x~0.base_19) v_ULTIMATE.start_main_~x~0.offset_14)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_14)) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_14, #memory_int=|v_#memory_int_10|, #length=|v_#length_16|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_19, #valid=|v_#valid_18|} OutVars{ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_2|, #valid=|v_#valid_18|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_14, #memory_int=|v_#memory_int_10|, #length=|v_#length_16|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_19} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem7] 1049#L15-1 [206] L15-1-->L12-3: Formula: (and (<= 0 v_ULTIMATE.start_main_~x~0.offset_22) (= 1 (select |v_#valid_37| v_ULTIMATE.start_main_~x~0.base_30)) (<= (+ v_ULTIMATE.start_main_~x~0.offset_22 4) (select |v_#length_26| v_ULTIMATE.start_main_~x~0.base_30)) (= (store |v_#memory_int_20| v_ULTIMATE.start_main_~x~0.base_30 (store (select |v_#memory_int_20| v_ULTIMATE.start_main_~x~0.base_30) v_ULTIMATE.start_main_~x~0.offset_22 (+ |v_ULTIMATE.start_main_#t~mem7_6| 2))) |v_#memory_int_19|)) InVars {ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_6|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_20|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_22, #length=|v_#length_26|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_30} OutVars{ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_5|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_19|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_22, #length=|v_#length_26|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_30} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem7, #memory_int] 1060#L12-3 [93] L12-3-->L17: Formula: (and (= 1 (select |v_#valid_22| v_ULTIMATE.start_main_~debug~0.base_7)) (<= (+ v_ULTIMATE.start_main_~debug~0.offset_6 4) (select |v_#length_20| v_ULTIMATE.start_main_~debug~0.base_7)) (= |v_ULTIMATE.start_main_#t~mem8_2| (select (select |v_#memory_int_13| v_ULTIMATE.start_main_~debug~0.base_7) v_ULTIMATE.start_main_~debug~0.offset_6)) (<= 0 v_ULTIMATE.start_main_~debug~0.offset_6)) InVars {#memory_int=|v_#memory_int_13|, #length=|v_#length_20|, ULTIMATE.start_main_~debug~0.offset=v_ULTIMATE.start_main_~debug~0.offset_6, ULTIMATE.start_main_~debug~0.base=v_ULTIMATE.start_main_~debug~0.base_7, #valid=|v_#valid_22|} OutVars{ULTIMATE.start_main_#t~mem8=|v_ULTIMATE.start_main_#t~mem8_2|, #valid=|v_#valid_22|, #memory_int=|v_#memory_int_13|, #length=|v_#length_20|, ULTIMATE.start_main_~debug~0.offset=v_ULTIMATE.start_main_~debug~0.offset_6, ULTIMATE.start_main_~debug~0.base=v_ULTIMATE.start_main_~debug~0.base_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem8] 1054#L17 [196] L17-->L18: Formula: (> |v_ULTIMATE.start_main_#t~mem8_4| 0) InVars {ULTIMATE.start_main_#t~mem8=|v_ULTIMATE.start_main_#t~mem8_4|} OutVars{ULTIMATE.start_main_#t~mem8=|v_ULTIMATE.start_main_#t~mem8_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem8] 1055#L18 [2020-06-22 10:18:01,291 INFO L796 eck$LassoCheckResult]: Loop: 1055#L18 [65] L18-->L17-1: Formula: (and (= (store |v_#memory_int_15| v_ULTIMATE.start_main_~x~0.base_25 (store (select |v_#memory_int_15| v_ULTIMATE.start_main_~x~0.base_25) v_ULTIMATE.start_main_~x~0.offset_18 0)) |v_#memory_int_14|) (<= (+ v_ULTIMATE.start_main_~x~0.offset_18 4) (select |v_#length_22| v_ULTIMATE.start_main_~x~0.base_25)) (= 1 (select |v_#valid_24| v_ULTIMATE.start_main_~x~0.base_25)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_18)) InVars {#memory_int=|v_#memory_int_15|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_18, #length=|v_#length_22|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_25, #valid=|v_#valid_24|} OutVars{#memory_int=|v_#memory_int_14|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_18, #length=|v_#length_22|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_25, #valid=|v_#valid_24|} AuxVars[] AssignedVars[#memory_int] 1050#L17-1 [208] L17-1-->L12: Formula: (and (< (select (select |v_#memory_int_23| v_ULTIMATE.start_main_~x~0.base_32) v_ULTIMATE.start_main_~x~0.offset_24) 255) (<= 0 v_ULTIMATE.start_main_~x~0.offset_24) (<= (+ v_ULTIMATE.start_main_~x~0.offset_24 4) (select |v_#length_28| v_ULTIMATE.start_main_~x~0.base_32)) (= 1 (select |v_#valid_39| v_ULTIMATE.start_main_~x~0.base_32))) InVars {#valid=|v_#valid_39|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_24, #memory_int=|v_#memory_int_23|, #length=|v_#length_28|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_32} OutVars{#valid=|v_#valid_39|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_24, #memory_int=|v_#memory_int_23|, #length=|v_#length_28|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_32, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem3] 1051#L12 [76] L12-->L12-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_8 4) (select |v_#length_10| v_ULTIMATE.start_main_~x~0.base_10)) (= |v_ULTIMATE.start_main_#t~mem4_2| (select (select |v_#memory_int_6| v_ULTIMATE.start_main_~x~0.base_10) v_ULTIMATE.start_main_~x~0.offset_8)) (= 1 (select |v_#valid_12| v_ULTIMATE.start_main_~x~0.base_10)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_8)) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_8, #memory_int=|v_#memory_int_6|, #length=|v_#length_10|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_10, #valid=|v_#valid_12|} OutVars{#valid=|v_#valid_12|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_8, #memory_int=|v_#memory_int_6|, #length=|v_#length_10|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_10, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem4] 1064#L12-1 [172] L12-1-->L15: Formula: (= 0 (mod |v_ULTIMATE.start_main_#t~mem4_6| 2)) InVars {ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_6|} OutVars{ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem4] 1046#L15 [80] L15-->L15-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_14 4) (select |v_#length_16| v_ULTIMATE.start_main_~x~0.base_19)) (= 1 (select |v_#valid_18| v_ULTIMATE.start_main_~x~0.base_19)) (= |v_ULTIMATE.start_main_#t~mem7_2| (select (select |v_#memory_int_10| v_ULTIMATE.start_main_~x~0.base_19) v_ULTIMATE.start_main_~x~0.offset_14)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_14)) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_14, #memory_int=|v_#memory_int_10|, #length=|v_#length_16|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_19, #valid=|v_#valid_18|} OutVars{ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_2|, #valid=|v_#valid_18|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_14, #memory_int=|v_#memory_int_10|, #length=|v_#length_16|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_19} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem7] 1047#L15-1 [206] L15-1-->L12-3: Formula: (and (<= 0 v_ULTIMATE.start_main_~x~0.offset_22) (= 1 (select |v_#valid_37| v_ULTIMATE.start_main_~x~0.base_30)) (<= (+ v_ULTIMATE.start_main_~x~0.offset_22 4) (select |v_#length_26| v_ULTIMATE.start_main_~x~0.base_30)) (= (store |v_#memory_int_20| v_ULTIMATE.start_main_~x~0.base_30 (store (select |v_#memory_int_20| v_ULTIMATE.start_main_~x~0.base_30) v_ULTIMATE.start_main_~x~0.offset_22 (+ |v_ULTIMATE.start_main_#t~mem7_6| 2))) |v_#memory_int_19|)) InVars {ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_6|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_20|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_22, #length=|v_#length_26|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_30} OutVars{ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_5|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_19|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_22, #length=|v_#length_26|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_30} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem7, #memory_int] 1068#L12-3 [93] L12-3-->L17: Formula: (and (= 1 (select |v_#valid_22| v_ULTIMATE.start_main_~debug~0.base_7)) (<= (+ v_ULTIMATE.start_main_~debug~0.offset_6 4) (select |v_#length_20| v_ULTIMATE.start_main_~debug~0.base_7)) (= |v_ULTIMATE.start_main_#t~mem8_2| (select (select |v_#memory_int_13| v_ULTIMATE.start_main_~debug~0.base_7) v_ULTIMATE.start_main_~debug~0.offset_6)) (<= 0 v_ULTIMATE.start_main_~debug~0.offset_6)) InVars {#memory_int=|v_#memory_int_13|, #length=|v_#length_20|, ULTIMATE.start_main_~debug~0.offset=v_ULTIMATE.start_main_~debug~0.offset_6, ULTIMATE.start_main_~debug~0.base=v_ULTIMATE.start_main_~debug~0.base_7, #valid=|v_#valid_22|} OutVars{ULTIMATE.start_main_#t~mem8=|v_ULTIMATE.start_main_#t~mem8_2|, #valid=|v_#valid_22|, #memory_int=|v_#memory_int_13|, #length=|v_#length_20|, ULTIMATE.start_main_~debug~0.offset=v_ULTIMATE.start_main_~debug~0.offset_6, ULTIMATE.start_main_~debug~0.base=v_ULTIMATE.start_main_~debug~0.base_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem8] 1071#L17 [195] L17-->L18: Formula: (< |v_ULTIMATE.start_main_#t~mem8_4| 0) InVars {ULTIMATE.start_main_#t~mem8=|v_ULTIMATE.start_main_#t~mem8_4|} OutVars{ULTIMATE.start_main_#t~mem8=|v_ULTIMATE.start_main_#t~mem8_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem8] 1055#L18 [2020-06-22 10:18:01,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:18:01,291 INFO L82 PathProgramCache]: Analyzing trace with hash -1641771761, now seen corresponding path program 1 times [2020-06-22 10:18:01,291 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:18:01,291 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:18:01,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:18:01,292 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:18:01,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:18:01,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:18:01,357 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 10:18:01,357 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:18:01,357 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-06-22 10:18:01,357 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-06-22 10:18:01,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:18:01,358 INFO L82 PathProgramCache]: Analyzing trace with hash 2060484948, now seen corresponding path program 1 times [2020-06-22 10:18:01,358 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:18:01,358 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:18:01,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:18:01,359 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:18:01,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:18:01,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:18:01,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:18:01,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-06-22 10:18:01,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-06-22 10:18:01,485 INFO L87 Difference]: Start difference. First operand 26 states and 37 transitions. cyclomatic complexity: 13 Second operand 6 states. [2020-06-22 10:18:01,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:18:01,542 INFO L93 Difference]: Finished difference Result 18 states and 25 transitions. [2020-06-22 10:18:01,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-06-22 10:18:01,546 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 25 transitions. [2020-06-22 10:18:01,547 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-06-22 10:18:01,547 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 0 states and 0 transitions. [2020-06-22 10:18:01,547 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-06-22 10:18:01,547 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-06-22 10:18:01,547 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-06-22 10:18:01,547 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 10:18:01,547 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 10:18:01,547 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 10:18:01,548 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 10:18:01,548 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2020-06-22 10:18:01,548 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-06-22 10:18:01,548 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-06-22 10:18:01,548 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-06-22 10:18:01,554 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 10:18:01 BasicIcfg [2020-06-22 10:18:01,555 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-06-22 10:18:01,555 INFO L168 Benchmark]: Toolchain (without parser) took 7147.05 ms. Allocated memory was 649.6 MB in the beginning and 849.3 MB in the end (delta: 199.8 MB). Free memory was 558.5 MB in the beginning and 736.7 MB in the end (delta: -178.1 MB). Peak memory consumption was 21.6 MB. Max. memory is 50.3 GB. [2020-06-22 10:18:01,556 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 649.6 MB. Free memory is still 580.4 MB. There was no memory consumed. Max. memory is 50.3 GB. [2020-06-22 10:18:01,556 INFO L168 Benchmark]: CACSL2BoogieTranslator took 307.86 ms. Allocated memory was 649.6 MB in the beginning and 687.9 MB in the end (delta: 38.3 MB). Free memory was 558.5 MB in the beginning and 651.9 MB in the end (delta: -93.4 MB). Peak memory consumption was 29.1 MB. Max. memory is 50.3 GB. [2020-06-22 10:18:01,557 INFO L168 Benchmark]: Boogie Procedure Inliner took 39.67 ms. Allocated memory is still 687.9 MB. Free memory was 651.9 MB in the beginning and 649.7 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 50.3 GB. [2020-06-22 10:18:01,558 INFO L168 Benchmark]: Boogie Preprocessor took 22.97 ms. Allocated memory is still 687.9 MB. Free memory was 649.7 MB in the beginning and 648.7 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 50.3 GB. [2020-06-22 10:18:01,558 INFO L168 Benchmark]: RCFGBuilder took 320.42 ms. Allocated memory is still 687.9 MB. Free memory was 647.6 MB in the beginning and 626.2 MB in the end (delta: 21.4 MB). Peak memory consumption was 21.4 MB. Max. memory is 50.3 GB. [2020-06-22 10:18:01,559 INFO L168 Benchmark]: BlockEncodingV2 took 133.81 ms. Allocated memory is still 687.9 MB. Free memory was 626.2 MB in the beginning and 615.4 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 50.3 GB. [2020-06-22 10:18:01,559 INFO L168 Benchmark]: TraceAbstraction took 976.84 ms. Allocated memory is still 687.9 MB. Free memory was 614.3 MB in the beginning and 514.3 MB in the end (delta: 100.0 MB). Peak memory consumption was 100.0 MB. Max. memory is 50.3 GB. [2020-06-22 10:18:01,559 INFO L168 Benchmark]: BuchiAutomizer took 5340.35 ms. Allocated memory was 687.9 MB in the beginning and 849.3 MB in the end (delta: 161.5 MB). Free memory was 514.3 MB in the beginning and 736.7 MB in the end (delta: -222.3 MB). There was no memory consumed. Max. memory is 50.3 GB. [2020-06-22 10:18:01,563 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 43 locations, 46 edges - StatisticsResult: Encoded RCFG 34 locations, 77 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 649.6 MB. Free memory is still 580.4 MB. There was no memory consumed. Max. memory is 50.3 GB. * CACSL2BoogieTranslator took 307.86 ms. Allocated memory was 649.6 MB in the beginning and 687.9 MB in the end (delta: 38.3 MB). Free memory was 558.5 MB in the beginning and 651.9 MB in the end (delta: -93.4 MB). Peak memory consumption was 29.1 MB. Max. memory is 50.3 GB. * Boogie Procedure Inliner took 39.67 ms. Allocated memory is still 687.9 MB. Free memory was 651.9 MB in the beginning and 649.7 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 50.3 GB. * Boogie Preprocessor took 22.97 ms. Allocated memory is still 687.9 MB. Free memory was 649.7 MB in the beginning and 648.7 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 50.3 GB. * RCFGBuilder took 320.42 ms. Allocated memory is still 687.9 MB. Free memory was 647.6 MB in the beginning and 626.2 MB in the end (delta: 21.4 MB). Peak memory consumption was 21.4 MB. Max. memory is 50.3 GB. * BlockEncodingV2 took 133.81 ms. Allocated memory is still 687.9 MB. Free memory was 626.2 MB in the beginning and 615.4 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 50.3 GB. * TraceAbstraction took 976.84 ms. Allocated memory is still 687.9 MB. Free memory was 614.3 MB in the beginning and 514.3 MB in the end (delta: 100.0 MB). Peak memory consumption was 100.0 MB. Max. memory is 50.3 GB. * BuchiAutomizer took 5340.35 ms. Allocated memory was 687.9 MB in the beginning and 849.3 MB in the end (delta: 161.5 MB). Free memory was 514.3 MB in the beginning and 736.7 MB in the end (delta: -222.3 MB). There was no memory consumed. Max. memory is 50.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - 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 #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 13]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 18]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 13]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 18]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 12]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 12]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 17]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 17]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 11]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 11]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 9]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 9]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 8]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 8]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 13]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 13]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 20 specifications checked. All of them hold - InvariantResult [Line: 9]: Loop Invariant [2020-06-22 10:18:01,572 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:18:01,572 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:18:01,573 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:18:01,573 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: ((((debug == 0 && \valid[x] == 1) && x == 0) && 4 == unknown-#length-unknown[debug]) && 4 == unknown-#length-unknown[x]) && 1 == \valid[debug] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 34 locations, 20 error locations. SAFE Result, 0.8s OverallTime, 5 OverallIterations, 1 TraceHistogramMax, 0.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 12 SDtfs, 135 SDslu, 3 SDs, 0 SdLazy, 152 SolverSat, 65 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=34occurred in iteration=0, 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.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 2 NumberOfFragments, 27 HoareAnnotationTreeSize, 1 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 1 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 17 NumberOfCodeBlocks, 17 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 12 ConstructedInterpolants, 0 QuantifiedInterpolants, 130 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available - StatisticsResult: Constructed decomposition of program Your program was decomposed into 6 terminating modules (4 trivial, 0 deterministic, 2 nondeterministic). One nondeterministic module has affine ranking function -1 * unknown-#memory_int-unknown[x][x] + 255 and consists of 11 locations. One nondeterministic module has affine ranking function -1 * unknown-#memory_int-unknown[x][x] + 255 and consists of 7 locations. 4 modules have a trivial ranking function, the largest among these consists of 9 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 5.3s and 7 iterations. TraceHistogramMax:2. Analysis of lassos took 3.3s. Construction of modules took 0.7s. Büchi inclusion checks took 1.0s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 5. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 60 StatesRemovedByMinimization, 5 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 33 states and ocurred in iteration 2. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 58 SDtfs, 358 SDslu, 235 SDs, 0 SdLazy, 1017 SolverSat, 105 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc2 concLT0 SILN0 SILU1 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital242 mio100 ax100 hnf100 lsp96 ukn58 mio100 lsp39 div155 bol100 ite100 ukn100 eq149 hnf71 smp94 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 34ms VariablesStem: 7 VariablesLoop: 6 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 10:17:51.162 ----------------------------------------------- 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/sandbox/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/sandbox/tmp -i /export/starexec/sandbox/benchmark/theBenchmark.c !ENTRY org.eclipse.core.resources 2 10035 2020-06-22 10:18:01.800 !MESSAGE The workspace will exit with unsaved changes in this session. Received shutdown request... Ultimate: GTK+ Version Check