250.63/218.79 250.63/218.79 Ultimate: Cannot open display: 250.63/218.79 This is Ultimate 0.1.24-8dc7c08-m 250.63/218.79 [2019-03-28 12:43:44,447 INFO L170 SettingsManager]: Resetting all preferences to default values... 250.63/218.79 [2019-03-28 12:43:44,450 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values 250.63/218.79 [2019-03-28 12:43:44,461 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... 250.63/218.79 [2019-03-28 12:43:44,461 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values 250.63/218.79 [2019-03-28 12:43:44,463 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values 250.63/218.79 [2019-03-28 12:43:44,464 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values 250.63/218.79 [2019-03-28 12:43:44,465 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values 250.63/218.79 [2019-03-28 12:43:44,467 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values 250.63/218.79 [2019-03-28 12:43:44,468 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values 250.63/218.79 [2019-03-28 12:43:44,468 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... 250.63/218.79 [2019-03-28 12:43:44,469 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values 250.63/218.79 [2019-03-28 12:43:44,470 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values 250.63/218.79 [2019-03-28 12:43:44,471 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values 250.63/218.79 [2019-03-28 12:43:44,472 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values 250.63/218.79 [2019-03-28 12:43:44,472 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values 250.63/218.79 [2019-03-28 12:43:44,473 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values 250.63/218.79 [2019-03-28 12:43:44,475 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values 250.63/218.79 [2019-03-28 12:43:44,477 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values 250.63/218.79 [2019-03-28 12:43:44,478 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values 250.63/218.79 [2019-03-28 12:43:44,479 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values 250.63/218.79 [2019-03-28 12:43:44,480 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values 250.63/218.79 [2019-03-28 12:43:44,482 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... 250.63/218.79 [2019-03-28 12:43:44,483 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... 250.63/218.79 [2019-03-28 12:43:44,483 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values 250.63/218.79 [2019-03-28 12:43:44,484 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values 250.63/218.79 [2019-03-28 12:43:44,484 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values 250.63/218.79 [2019-03-28 12:43:44,485 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... 250.63/218.79 [2019-03-28 12:43:44,485 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values 250.63/218.79 [2019-03-28 12:43:44,486 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values 250.63/218.79 [2019-03-28 12:43:44,486 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values 250.63/218.79 [2019-03-28 12:43:44,487 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values 250.63/218.79 [2019-03-28 12:43:44,488 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... 250.63/218.79 [2019-03-28 12:43:44,488 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values 250.63/218.79 [2019-03-28 12:43:44,489 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... 250.63/218.79 [2019-03-28 12:43:44,489 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... 250.63/218.79 [2019-03-28 12:43:44,489 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values 250.63/218.79 [2019-03-28 12:43:44,490 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values 250.63/218.79 [2019-03-28 12:43:44,491 INFO L181 SettingsManager]: Finished resetting all preferences to default values... 250.63/218.79 [2019-03-28 12:43:44,491 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox/solver/bin/./../termcomp2017.epf 250.63/218.79 [2019-03-28 12:43:44,506 INFO L110 SettingsManager]: Loading preferences was successful 250.63/218.79 [2019-03-28 12:43:44,506 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: 250.63/218.79 [2019-03-28 12:43:44,507 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: 250.63/218.79 [2019-03-28 12:43:44,508 INFO L133 SettingsManager]: * Rewrite not-equals=true 250.63/218.79 [2019-03-28 12:43:44,508 INFO L133 SettingsManager]: * Create parallel compositions if possible=false 250.63/218.79 [2019-03-28 12:43:44,508 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE 250.63/218.79 [2019-03-28 12:43:44,508 INFO L133 SettingsManager]: * Use SBE=true 250.63/218.79 [2019-03-28 12:43:44,508 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: 250.63/218.79 [2019-03-28 12:43:44,508 INFO L133 SettingsManager]: * Use old map elimination=false 250.63/218.79 [2019-03-28 12:43:44,509 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false 250.63/218.79 [2019-03-28 12:43:44,509 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION 250.63/218.79 [2019-03-28 12:43:44,509 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true 250.63/218.79 [2019-03-28 12:43:44,509 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES 250.63/218.79 [2019-03-28 12:43:44,509 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true 250.63/218.79 [2019-03-28 12:43:44,509 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 250.63/218.79 [2019-03-28 12:43:44,510 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: 250.63/218.79 [2019-03-28 12:43:44,510 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false 250.63/218.79 [2019-03-28 12:43:44,510 INFO L133 SettingsManager]: * Check division by zero=IGNORE 250.63/218.79 [2019-03-28 12:43:44,510 INFO L133 SettingsManager]: * Check if freed pointer was valid=false 250.63/218.79 [2019-03-28 12:43:44,510 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false 250.63/218.79 [2019-03-28 12:43:44,511 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE 250.63/218.79 [2019-03-28 12:43:44,511 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: 250.63/218.79 [2019-03-28 12:43:44,511 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements 250.63/218.79 [2019-03-28 12:43:44,511 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump 250.63/218.79 [2019-03-28 12:43:44,511 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 250.63/218.79 [2019-03-28 12:43:44,511 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: 250.63/218.79 [2019-03-28 12:43:44,512 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles 250.63/218.79 [2019-03-28 12:43:44,512 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL 250.63/218.79 [2019-03-28 12:43:44,512 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 250.63/218.79 [2019-03-28 12:43:44,537 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp 250.63/218.79 [2019-03-28 12:43:44,551 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized 250.63/218.79 [2019-03-28 12:43:44,554 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. 250.63/218.79 [2019-03-28 12:43:44,556 INFO L271 PluginConnector]: Initializing CDTParser... 250.63/218.79 [2019-03-28 12:43:44,556 INFO L276 PluginConnector]: CDTParser initialized 250.63/218.79 [2019-03-28 12:43:44,557 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox/benchmark/theBenchmark.c 250.63/218.79 [2019-03-28 12:43:44,621 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox/tmp/e61c75ba9dd44d0c8a8db24a5934b3d8/FLAGc41e2527b 250.63/218.79 [2019-03-28 12:43:44,971 INFO L307 CDTParser]: Found 1 translation units. 250.63/218.79 [2019-03-28 12:43:44,972 INFO L161 CDTParser]: Scanning /export/starexec/sandbox/benchmark/theBenchmark.c 250.63/218.79 [2019-03-28 12:43:44,972 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. 250.63/218.79 [2019-03-28 12:43:44,979 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox/tmp/e61c75ba9dd44d0c8a8db24a5934b3d8/FLAGc41e2527b 250.63/218.79 [2019-03-28 12:43:45,385 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox/tmp/e61c75ba9dd44d0c8a8db24a5934b3d8 250.63/218.79 [2019-03-28 12:43:45,397 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### 250.63/218.79 [2019-03-28 12:43:45,399 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. 250.63/218.79 [2019-03-28 12:43:45,401 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- 250.63/218.79 [2019-03-28 12:43:45,401 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... 250.63/218.79 [2019-03-28 12:43:45,404 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized 250.63/218.79 [2019-03-28 12:43:45,405 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 12:43:45" (1/1) ... 250.63/218.79 [2019-03-28 12:43:45,408 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4576b75f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:43:45, skipping insertion in model container 250.63/218.79 [2019-03-28 12:43:45,409 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.03 12:43:45" (1/1) ... 250.63/218.79 [2019-03-28 12:43:45,416 INFO L145 MainTranslator]: Starting translation in SV-COMP mode 250.63/218.79 [2019-03-28 12:43:45,434 INFO L176 MainTranslator]: Built tables and reachable declarations 250.63/218.79 [2019-03-28 12:43:45,602 INFO L206 PostProcessor]: Analyzing one entry point: main 250.63/218.79 [2019-03-28 12:43:45,615 INFO L191 MainTranslator]: Completed pre-run 250.63/218.79 [2019-03-28 12:43:45,697 INFO L206 PostProcessor]: Analyzing one entry point: main 250.63/218.79 [2019-03-28 12:43:45,714 INFO L195 MainTranslator]: Completed translation 250.63/218.79 [2019-03-28 12:43:45,715 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:43:45 WrapperNode 250.63/218.79 [2019-03-28 12:43:45,715 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- 250.63/218.79 [2019-03-28 12:43:45,716 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- 250.63/218.79 [2019-03-28 12:43:45,716 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... 250.63/218.79 [2019-03-28 12:43:45,716 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized 250.63/218.79 [2019-03-28 12:43:45,726 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:43:45" (1/1) ... 250.63/218.79 [2019-03-28 12:43:45,736 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:43:45" (1/1) ... 250.63/218.79 [2019-03-28 12:43:45,762 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- 250.63/218.79 [2019-03-28 12:43:45,762 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- 250.63/218.79 [2019-03-28 12:43:45,763 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... 250.63/218.79 [2019-03-28 12:43:45,763 INFO L276 PluginConnector]: Boogie Preprocessor initialized 250.63/218.79 [2019-03-28 12:43:45,773 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:43:45" (1/1) ... 250.63/218.79 [2019-03-28 12:43:45,773 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:43:45" (1/1) ... 250.63/218.79 [2019-03-28 12:43:45,775 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:43:45" (1/1) ... 250.63/218.79 [2019-03-28 12:43:45,775 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:43:45" (1/1) ... 250.63/218.79 [2019-03-28 12:43:45,781 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:43:45" (1/1) ... 250.63/218.79 [2019-03-28 12:43:45,786 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:43:45" (1/1) ... 250.63/218.79 [2019-03-28 12:43:45,788 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:43:45" (1/1) ... 250.63/218.79 [2019-03-28 12:43:45,790 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- 250.63/218.79 [2019-03-28 12:43:45,791 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- 250.63/218.79 [2019-03-28 12:43:45,791 INFO L271 PluginConnector]: Initializing RCFGBuilder... 250.63/218.79 [2019-03-28 12:43:45,791 INFO L276 PluginConnector]: RCFGBuilder initialized 250.63/218.79 [2019-03-28 12:43:45,792 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:43:45" (1/1) ... 250.63/218.79 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 250.63/218.79 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) 250.63/218.79 Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 250.63/218.79 [2019-03-28 12:43:45,862 INFO L130 BoogieDeclarations]: Found specification of procedure write~int 250.63/218.79 [2019-03-28 12:43:45,862 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start 250.63/218.79 [2019-03-28 12:43:45,863 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start 250.63/218.79 [2019-03-28 12:43:45,863 INFO L130 BoogieDeclarations]: Found specification of procedure read~int 250.63/218.79 [2019-03-28 12:43:45,863 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack 250.63/218.79 [2019-03-28 12:43:45,863 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc 250.63/218.79 [2019-03-28 12:43:46,231 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) 250.63/218.79 [2019-03-28 12:43:46,232 INFO L286 CfgBuilder]: Removed 7 assue(true) statements. 250.63/218.79 [2019-03-28 12:43:46,233 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:43:46 BoogieIcfgContainer 250.63/218.79 [2019-03-28 12:43:46,233 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- 250.63/218.79 [2019-03-28 12:43:46,234 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- 250.63/218.79 [2019-03-28 12:43:46,234 INFO L271 PluginConnector]: Initializing BlockEncodingV2... 250.63/218.79 [2019-03-28 12:43:46,237 INFO L276 PluginConnector]: BlockEncodingV2 initialized 250.63/218.79 [2019-03-28 12:43:46,237 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:43:46" (1/1) ... 250.63/218.79 [2019-03-28 12:43:46,256 INFO L313 BlockEncoder]: Initial Icfg 70 locations, 72 edges 250.63/218.79 [2019-03-28 12:43:46,258 INFO L258 BlockEncoder]: Using Remove infeasible edges 250.63/218.79 [2019-03-28 12:43:46,259 INFO L263 BlockEncoder]: Using Maximize final states 250.63/218.79 [2019-03-28 12:43:46,259 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false 250.63/218.79 [2019-03-28 12:43:46,260 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE 250.63/218.79 [2019-03-28 12:43:46,261 INFO L296 BlockEncoder]: Using Remove sink states 250.63/218.79 [2019-03-28 12:43:46,262 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true 250.63/218.79 [2019-03-28 12:43:46,263 INFO L179 BlockEncoder]: Using Rewrite not-equals 250.63/218.79 [2019-03-28 12:43:46,292 INFO L185 BlockEncoder]: Using Use SBE 250.63/218.79 [2019-03-28 12:43:46,349 INFO L200 BlockEncoder]: SBE split 39 edges 250.63/218.79 [2019-03-28 12:43:46,354 INFO L70 emoveInfeasibleEdges]: Removed 1 edges and 0 locations because of local infeasibility 250.63/218.79 [2019-03-28 12:43:46,356 INFO L71 MaximizeFinalStates]: 0 new accepting states 250.63/218.79 [2019-03-28 12:43:46,418 INFO L100 BaseMinimizeStates]: Removed 18 edges and 9 locations by large block encoding 250.63/218.79 [2019-03-28 12:43:46,421 INFO L70 RemoveSinkStates]: Removed 1 edges and 1 locations by removing sink states 250.63/218.79 [2019-03-28 12:43:46,423 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility 250.63/218.79 [2019-03-28 12:43:46,423 INFO L71 MaximizeFinalStates]: 0 new accepting states 250.63/218.79 [2019-03-28 12:43:46,423 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding 250.63/218.79 [2019-03-28 12:43:46,424 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states 250.63/218.79 [2019-03-28 12:43:46,425 INFO L313 BlockEncoder]: Encoded RCFG 60 locations, 130 edges 250.63/218.79 [2019-03-28 12:43:46,425 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:43:46 BasicIcfg 250.63/218.79 [2019-03-28 12:43:46,425 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- 250.63/218.79 [2019-03-28 12:43:46,426 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- 250.63/218.79 [2019-03-28 12:43:46,426 INFO L271 PluginConnector]: Initializing TraceAbstraction... 250.63/218.79 [2019-03-28 12:43:46,430 INFO L276 PluginConnector]: TraceAbstraction initialized 250.63/218.79 [2019-03-28 12:43:46,430 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.03 12:43:45" (1/4) ... 250.63/218.79 [2019-03-28 12:43:46,431 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4600590b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 12:43:46, skipping insertion in model container 250.63/218.79 [2019-03-28 12:43:46,431 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:43:45" (2/4) ... 250.63/218.79 [2019-03-28 12:43:46,432 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4600590b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.03 12:43:46, skipping insertion in model container 250.63/218.79 [2019-03-28 12:43:46,432 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:43:46" (3/4) ... 250.63/218.79 [2019-03-28 12:43:46,432 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4600590b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:43:46, skipping insertion in model container 250.63/218.79 [2019-03-28 12:43:46,432 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:43:46" (4/4) ... 250.63/218.79 [2019-03-28 12:43:46,434 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 250.63/218.79 [2019-03-28 12:43:46,444 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION 250.63/218.79 [2019-03-28 12:43:46,453 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 36 error locations. 250.63/218.79 [2019-03-28 12:43:46,470 INFO L257 AbstractCegarLoop]: Starting to check reachability of 36 error locations. 250.63/218.79 [2019-03-28 12:43:46,502 INFO L133 ementStrategyFactory]: Using default assertion order modulation 250.63/218.79 [2019-03-28 12:43:46,503 INFO L382 AbstractCegarLoop]: Interprodecural is true 250.63/218.79 [2019-03-28 12:43:46,503 INFO L383 AbstractCegarLoop]: Hoare is true 250.63/218.79 [2019-03-28 12:43:46,503 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates 250.63/218.79 [2019-03-28 12:43:46,504 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE 250.63/218.79 [2019-03-28 12:43:46,504 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION 250.63/218.79 [2019-03-28 12:43:46,504 INFO L387 AbstractCegarLoop]: Difference is false 250.63/218.79 [2019-03-28 12:43:46,504 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA 250.63/218.79 [2019-03-28 12:43:46,504 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== 250.63/218.79 [2019-03-28 12:43:46,521 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states. 250.63/218.79 [2019-03-28 12:43:46,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 250.63/218.79 [2019-03-28 12:43:46,527 INFO L394 BasicCegarLoop]: Found error trace 250.63/218.79 [2019-03-28 12:43:46,528 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] 250.63/218.79 [2019-03-28 12:43:46,529 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION]=== 250.63/218.79 [2019-03-28 12:43:46,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 250.63/218.79 [2019-03-28 12:43:46,534 INFO L82 PathProgramCache]: Analyzing trace with hash 148628, now seen corresponding path program 1 times 250.63/218.79 [2019-03-28 12:43:46,536 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 250.63/218.79 [2019-03-28 12:43:46,537 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 250.63/218.79 [2019-03-28 12:43:46,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 250.63/218.79 [2019-03-28 12:43:46,591 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 250.63/218.79 [2019-03-28 12:43:46,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 250.63/218.79 [2019-03-28 12:43:46,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 250.63/218.79 [2019-03-28 12:43:46,746 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 250.63/218.79 [2019-03-28 12:43:46,749 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 250.63/218.79 [2019-03-28 12:43:46,749 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 250.63/218.79 [2019-03-28 12:43:46,753 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 250.63/218.79 [2019-03-28 12:43:46,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 250.63/218.79 [2019-03-28 12:43:46,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 250.63/218.79 [2019-03-28 12:43:46,770 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 3 states. 250.63/218.79 [2019-03-28 12:43:47,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 250.63/218.79 [2019-03-28 12:43:47,115 INFO L93 Difference]: Finished difference Result 60 states and 130 transitions. 250.63/218.79 [2019-03-28 12:43:47,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 250.63/218.79 [2019-03-28 12:43:47,117 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 250.63/218.79 [2019-03-28 12:43:47,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 250.63/218.79 [2019-03-28 12:43:47,131 INFO L225 Difference]: With dead ends: 60 250.63/218.79 [2019-03-28 12:43:47,131 INFO L226 Difference]: Without dead ends: 56 250.63/218.79 [2019-03-28 12:43:47,134 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 250.63/218.79 [2019-03-28 12:43:47,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. 250.63/218.79 [2019-03-28 12:43:47,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. 250.63/218.79 [2019-03-28 12:43:47,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. 250.63/218.79 [2019-03-28 12:43:47,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 122 transitions. 250.63/218.79 [2019-03-28 12:43:47,177 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 122 transitions. Word has length 3 250.63/218.79 [2019-03-28 12:43:47,178 INFO L84 Accepts]: Finished accepts. word is rejected. 250.63/218.79 [2019-03-28 12:43:47,178 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 122 transitions. 250.63/218.79 [2019-03-28 12:43:47,178 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 250.63/218.79 [2019-03-28 12:43:47,179 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 122 transitions. 250.63/218.79 [2019-03-28 12:43:47,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 250.63/218.79 [2019-03-28 12:43:47,179 INFO L394 BasicCegarLoop]: Found error trace 250.63/218.79 [2019-03-28 12:43:47,179 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] 250.63/218.79 [2019-03-28 12:43:47,180 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION]=== 250.63/218.79 [2019-03-28 12:43:47,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 250.63/218.79 [2019-03-28 12:43:47,180 INFO L82 PathProgramCache]: Analyzing trace with hash 148630, now seen corresponding path program 1 times 250.63/218.79 [2019-03-28 12:43:47,180 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 250.63/218.79 [2019-03-28 12:43:47,180 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 250.63/218.79 [2019-03-28 12:43:47,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 250.63/218.79 [2019-03-28 12:43:47,181 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 250.63/218.79 [2019-03-28 12:43:47,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 250.63/218.79 [2019-03-28 12:43:47,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 250.63/218.79 [2019-03-28 12:43:47,211 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 250.63/218.79 [2019-03-28 12:43:47,211 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 250.63/218.79 [2019-03-28 12:43:47,212 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 250.63/218.79 [2019-03-28 12:43:47,213 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 250.63/218.79 [2019-03-28 12:43:47,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 250.63/218.79 [2019-03-28 12:43:47,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 250.63/218.79 [2019-03-28 12:43:47,214 INFO L87 Difference]: Start difference. First operand 56 states and 122 transitions. Second operand 3 states. 250.63/218.79 [2019-03-28 12:43:47,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 250.63/218.79 [2019-03-28 12:43:47,428 INFO L93 Difference]: Finished difference Result 60 states and 122 transitions. 250.63/218.79 [2019-03-28 12:43:47,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 250.63/218.79 [2019-03-28 12:43:47,428 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 250.63/218.79 [2019-03-28 12:43:47,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 250.63/218.79 [2019-03-28 12:43:47,430 INFO L225 Difference]: With dead ends: 60 250.63/218.79 [2019-03-28 12:43:47,430 INFO L226 Difference]: Without dead ends: 56 250.63/218.79 [2019-03-28 12:43:47,431 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 250.63/218.80 [2019-03-28 12:43:47,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. 250.63/218.80 [2019-03-28 12:43:47,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. 250.63/218.80 [2019-03-28 12:43:47,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. 250.63/218.80 [2019-03-28 12:43:47,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 118 transitions. 250.63/218.80 [2019-03-28 12:43:47,440 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 118 transitions. Word has length 3 250.63/218.80 [2019-03-28 12:43:47,440 INFO L84 Accepts]: Finished accepts. word is rejected. 250.63/218.80 [2019-03-28 12:43:47,441 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 118 transitions. 250.63/218.80 [2019-03-28 12:43:47,441 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 250.63/218.80 [2019-03-28 12:43:47,441 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 118 transitions. 250.63/218.80 [2019-03-28 12:43:47,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 250.63/218.80 [2019-03-28 12:43:47,441 INFO L394 BasicCegarLoop]: Found error trace 250.63/218.80 [2019-03-28 12:43:47,441 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] 250.63/218.80 [2019-03-28 12:43:47,442 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION]=== 250.63/218.80 [2019-03-28 12:43:47,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 250.63/218.80 [2019-03-28 12:43:47,442 INFO L82 PathProgramCache]: Analyzing trace with hash 148631, now seen corresponding path program 1 times 250.63/218.80 [2019-03-28 12:43:47,442 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 250.63/218.80 [2019-03-28 12:43:47,443 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 250.63/218.80 [2019-03-28 12:43:47,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 250.63/218.80 [2019-03-28 12:43:47,444 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 250.63/218.80 [2019-03-28 12:43:47,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 250.63/218.80 [2019-03-28 12:43:47,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 250.63/218.80 [2019-03-28 12:43:47,503 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 250.63/218.80 [2019-03-28 12:43:47,503 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 250.63/218.80 [2019-03-28 12:43:47,504 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 250.63/218.80 [2019-03-28 12:43:47,504 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 250.63/218.80 [2019-03-28 12:43:47,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 250.63/218.80 [2019-03-28 12:43:47,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 250.63/218.80 [2019-03-28 12:43:47,505 INFO L87 Difference]: Start difference. First operand 56 states and 118 transitions. Second operand 3 states. 250.63/218.80 [2019-03-28 12:43:47,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 250.63/218.80 [2019-03-28 12:43:47,772 INFO L93 Difference]: Finished difference Result 56 states and 118 transitions. 250.63/218.80 [2019-03-28 12:43:47,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 250.63/218.80 [2019-03-28 12:43:47,773 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 250.63/218.80 [2019-03-28 12:43:47,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 250.63/218.80 [2019-03-28 12:43:47,774 INFO L225 Difference]: With dead ends: 56 250.63/218.80 [2019-03-28 12:43:47,774 INFO L226 Difference]: Without dead ends: 52 250.63/218.80 [2019-03-28 12:43:47,775 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 250.63/218.80 [2019-03-28 12:43:47,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. 250.63/218.80 [2019-03-28 12:43:47,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. 250.63/218.80 [2019-03-28 12:43:47,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. 250.63/218.80 [2019-03-28 12:43:47,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 114 transitions. 250.63/218.80 [2019-03-28 12:43:47,782 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 114 transitions. Word has length 3 250.63/218.80 [2019-03-28 12:43:47,782 INFO L84 Accepts]: Finished accepts. word is rejected. 250.63/218.80 [2019-03-28 12:43:47,782 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 114 transitions. 250.63/218.80 [2019-03-28 12:43:47,782 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 250.63/218.80 [2019-03-28 12:43:47,782 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 114 transitions. 250.63/218.80 [2019-03-28 12:43:47,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 250.63/218.80 [2019-03-28 12:43:47,783 INFO L394 BasicCegarLoop]: Found error trace 250.63/218.80 [2019-03-28 12:43:47,783 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] 250.63/218.80 [2019-03-28 12:43:47,783 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION]=== 250.63/218.80 [2019-03-28 12:43:47,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 250.63/218.80 [2019-03-28 12:43:47,783 INFO L82 PathProgramCache]: Analyzing trace with hash 4604696, now seen corresponding path program 1 times 250.63/218.80 [2019-03-28 12:43:47,784 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 250.63/218.80 [2019-03-28 12:43:47,784 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 250.63/218.80 [2019-03-28 12:43:47,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 250.63/218.80 [2019-03-28 12:43:47,785 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 250.63/218.80 [2019-03-28 12:43:47,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 250.63/218.80 [2019-03-28 12:43:47,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 250.63/218.80 [2019-03-28 12:43:47,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 250.63/218.80 [2019-03-28 12:43:47,847 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 250.63/218.80 [2019-03-28 12:43:47,847 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 250.63/218.80 [2019-03-28 12:43:47,847 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 250.63/218.80 [2019-03-28 12:43:47,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 250.63/218.80 [2019-03-28 12:43:47,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 250.63/218.80 [2019-03-28 12:43:47,848 INFO L87 Difference]: Start difference. First operand 52 states and 114 transitions. Second operand 3 states. 250.63/218.80 [2019-03-28 12:43:48,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 250.63/218.80 [2019-03-28 12:43:48,080 INFO L93 Difference]: Finished difference Result 52 states and 114 transitions. 250.63/218.80 [2019-03-28 12:43:48,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 250.63/218.80 [2019-03-28 12:43:48,080 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 250.63/218.80 [2019-03-28 12:43:48,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 250.63/218.80 [2019-03-28 12:43:48,081 INFO L225 Difference]: With dead ends: 52 250.63/218.80 [2019-03-28 12:43:48,082 INFO L226 Difference]: Without dead ends: 48 250.63/218.80 [2019-03-28 12:43:48,082 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 250.63/218.80 [2019-03-28 12:43:48,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. 250.63/218.80 [2019-03-28 12:43:48,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. 250.63/218.80 [2019-03-28 12:43:48,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. 250.63/218.80 [2019-03-28 12:43:48,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 106 transitions. 250.63/218.80 [2019-03-28 12:43:48,088 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 106 transitions. Word has length 4 250.63/218.80 [2019-03-28 12:43:48,088 INFO L84 Accepts]: Finished accepts. word is rejected. 250.63/218.80 [2019-03-28 12:43:48,088 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 106 transitions. 250.63/218.80 [2019-03-28 12:43:48,089 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 250.63/218.80 [2019-03-28 12:43:48,089 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 106 transitions. 250.63/218.80 [2019-03-28 12:43:48,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 250.63/218.80 [2019-03-28 12:43:48,089 INFO L394 BasicCegarLoop]: Found error trace 250.63/218.80 [2019-03-28 12:43:48,089 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] 250.63/218.80 [2019-03-28 12:43:48,090 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION]=== 250.63/218.80 [2019-03-28 12:43:48,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 250.63/218.80 [2019-03-28 12:43:48,090 INFO L82 PathProgramCache]: Analyzing trace with hash 4604698, now seen corresponding path program 1 times 250.63/218.80 [2019-03-28 12:43:48,090 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 250.63/218.80 [2019-03-28 12:43:48,090 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 250.63/218.80 [2019-03-28 12:43:48,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 250.63/218.80 [2019-03-28 12:43:48,091 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 250.63/218.80 [2019-03-28 12:43:48,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 250.63/218.80 [2019-03-28 12:43:48,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 250.63/218.80 [2019-03-28 12:43:48,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 250.63/218.80 [2019-03-28 12:43:48,119 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 250.63/218.80 [2019-03-28 12:43:48,119 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 250.63/218.80 [2019-03-28 12:43:48,119 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 250.63/218.80 [2019-03-28 12:43:48,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 250.63/218.80 [2019-03-28 12:43:48,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 250.63/218.80 [2019-03-28 12:43:48,120 INFO L87 Difference]: Start difference. First operand 48 states and 106 transitions. Second operand 3 states. 250.63/218.80 [2019-03-28 12:43:48,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 250.63/218.80 [2019-03-28 12:43:48,312 INFO L93 Difference]: Finished difference Result 52 states and 106 transitions. 250.63/218.80 [2019-03-28 12:43:48,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 250.63/218.80 [2019-03-28 12:43:48,312 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 250.63/218.80 [2019-03-28 12:43:48,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 250.63/218.80 [2019-03-28 12:43:48,313 INFO L225 Difference]: With dead ends: 52 250.63/218.80 [2019-03-28 12:43:48,313 INFO L226 Difference]: Without dead ends: 48 250.63/218.80 [2019-03-28 12:43:48,314 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 250.63/218.80 [2019-03-28 12:43:48,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. 250.63/218.80 [2019-03-28 12:43:48,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. 250.63/218.80 [2019-03-28 12:43:48,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. 250.63/218.80 [2019-03-28 12:43:48,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 102 transitions. 250.63/218.80 [2019-03-28 12:43:48,319 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 102 transitions. Word has length 4 250.63/218.80 [2019-03-28 12:43:48,319 INFO L84 Accepts]: Finished accepts. word is rejected. 250.63/218.80 [2019-03-28 12:43:48,319 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 102 transitions. 250.63/218.80 [2019-03-28 12:43:48,319 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 250.63/218.80 [2019-03-28 12:43:48,319 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 102 transitions. 250.63/218.80 [2019-03-28 12:43:48,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 250.63/218.80 [2019-03-28 12:43:48,320 INFO L394 BasicCegarLoop]: Found error trace 250.63/218.80 [2019-03-28 12:43:48,320 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] 250.63/218.80 [2019-03-28 12:43:48,320 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION]=== 250.63/218.80 [2019-03-28 12:43:48,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 250.63/218.80 [2019-03-28 12:43:48,320 INFO L82 PathProgramCache]: Analyzing trace with hash 4604699, now seen corresponding path program 1 times 250.63/218.80 [2019-03-28 12:43:48,321 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 250.63/218.80 [2019-03-28 12:43:48,321 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 250.63/218.80 [2019-03-28 12:43:48,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 250.63/218.80 [2019-03-28 12:43:48,322 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 250.63/218.80 [2019-03-28 12:43:48,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 250.63/218.80 [2019-03-28 12:43:48,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 250.63/218.80 [2019-03-28 12:43:48,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 250.63/218.80 [2019-03-28 12:43:48,378 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 250.63/218.80 [2019-03-28 12:43:48,378 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 250.63/218.80 [2019-03-28 12:43:48,379 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 250.63/218.80 [2019-03-28 12:43:48,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 250.63/218.80 [2019-03-28 12:43:48,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 250.63/218.80 [2019-03-28 12:43:48,379 INFO L87 Difference]: Start difference. First operand 48 states and 102 transitions. Second operand 3 states. 250.63/218.80 [2019-03-28 12:43:48,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 250.63/218.80 [2019-03-28 12:43:48,583 INFO L93 Difference]: Finished difference Result 48 states and 102 transitions. 250.63/218.80 [2019-03-28 12:43:48,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 250.63/218.80 [2019-03-28 12:43:48,584 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 250.63/218.80 [2019-03-28 12:43:48,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 250.63/218.80 [2019-03-28 12:43:48,585 INFO L225 Difference]: With dead ends: 48 250.63/218.80 [2019-03-28 12:43:48,585 INFO L226 Difference]: Without dead ends: 44 250.63/218.80 [2019-03-28 12:43:48,586 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 250.63/218.80 [2019-03-28 12:43:48,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. 250.63/218.80 [2019-03-28 12:43:48,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. 250.63/218.80 [2019-03-28 12:43:48,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. 250.63/218.80 [2019-03-28 12:43:48,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 98 transitions. 250.63/218.80 [2019-03-28 12:43:48,590 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 98 transitions. Word has length 4 250.63/218.80 [2019-03-28 12:43:48,590 INFO L84 Accepts]: Finished accepts. word is rejected. 250.63/218.80 [2019-03-28 12:43:48,590 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 98 transitions. 250.63/218.80 [2019-03-28 12:43:48,591 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 250.63/218.80 [2019-03-28 12:43:48,591 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 98 transitions. 250.63/218.80 [2019-03-28 12:43:48,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 250.63/218.80 [2019-03-28 12:43:48,591 INFO L394 BasicCegarLoop]: Found error trace 250.63/218.80 [2019-03-28 12:43:48,591 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] 250.63/218.80 [2019-03-28 12:43:48,592 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION]=== 250.63/218.80 [2019-03-28 12:43:48,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 250.63/218.80 [2019-03-28 12:43:48,592 INFO L82 PathProgramCache]: Analyzing trace with hash 142742592, now seen corresponding path program 1 times 250.63/218.80 [2019-03-28 12:43:48,592 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 250.63/218.80 [2019-03-28 12:43:48,592 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 250.63/218.80 [2019-03-28 12:43:48,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 250.63/218.80 [2019-03-28 12:43:48,593 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 250.63/218.80 [2019-03-28 12:43:48,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 250.63/218.80 [2019-03-28 12:43:48,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 250.63/218.80 [2019-03-28 12:43:48,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 250.63/218.80 [2019-03-28 12:43:48,630 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 250.63/218.80 [2019-03-28 12:43:48,630 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 250.63/218.80 [2019-03-28 12:43:48,631 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 250.63/218.80 [2019-03-28 12:43:48,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 250.63/218.80 [2019-03-28 12:43:48,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 250.63/218.80 [2019-03-28 12:43:48,631 INFO L87 Difference]: Start difference. First operand 44 states and 98 transitions. Second operand 3 states. 250.63/218.80 [2019-03-28 12:43:48,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 250.63/218.80 [2019-03-28 12:43:48,816 INFO L93 Difference]: Finished difference Result 44 states and 98 transitions. 250.63/218.80 [2019-03-28 12:43:48,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 250.63/218.80 [2019-03-28 12:43:48,817 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 250.63/218.80 [2019-03-28 12:43:48,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 250.63/218.80 [2019-03-28 12:43:48,818 INFO L225 Difference]: With dead ends: 44 250.63/218.80 [2019-03-28 12:43:48,818 INFO L226 Difference]: Without dead ends: 41 250.63/218.80 [2019-03-28 12:43:48,818 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 250.63/218.80 [2019-03-28 12:43:48,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. 250.63/218.80 [2019-03-28 12:43:48,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. 250.63/218.80 [2019-03-28 12:43:48,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. 250.63/218.80 [2019-03-28 12:43:48,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 92 transitions. 250.63/218.80 [2019-03-28 12:43:48,822 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 92 transitions. Word has length 5 250.63/218.80 [2019-03-28 12:43:48,822 INFO L84 Accepts]: Finished accepts. word is rejected. 250.63/218.80 [2019-03-28 12:43:48,823 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 92 transitions. 250.63/218.80 [2019-03-28 12:43:48,823 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 250.63/218.80 [2019-03-28 12:43:48,823 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 92 transitions. 250.63/218.80 [2019-03-28 12:43:48,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 250.63/218.80 [2019-03-28 12:43:48,823 INFO L394 BasicCegarLoop]: Found error trace 250.63/218.80 [2019-03-28 12:43:48,823 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] 250.63/218.80 [2019-03-28 12:43:48,824 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION]=== 250.63/218.80 [2019-03-28 12:43:48,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 250.63/218.80 [2019-03-28 12:43:48,824 INFO L82 PathProgramCache]: Analyzing trace with hash 142742593, now seen corresponding path program 1 times 250.63/218.80 [2019-03-28 12:43:48,824 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 250.63/218.80 [2019-03-28 12:43:48,824 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 250.63/218.80 [2019-03-28 12:43:48,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 250.63/218.80 [2019-03-28 12:43:48,825 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 250.63/218.80 [2019-03-28 12:43:48,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 250.63/218.80 [2019-03-28 12:43:48,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 250.63/218.80 [2019-03-28 12:43:48,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 250.63/218.80 [2019-03-28 12:43:48,854 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 250.63/218.80 [2019-03-28 12:43:48,854 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 250.63/218.80 [2019-03-28 12:43:48,855 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 250.63/218.80 [2019-03-28 12:43:48,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 250.63/218.80 [2019-03-28 12:43:48,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 250.63/218.80 [2019-03-28 12:43:48,856 INFO L87 Difference]: Start difference. First operand 41 states and 92 transitions. Second operand 3 states. 250.63/218.80 [2019-03-28 12:43:49,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 250.63/218.80 [2019-03-28 12:43:49,036 INFO L93 Difference]: Finished difference Result 44 states and 92 transitions. 250.63/218.80 [2019-03-28 12:43:49,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 250.63/218.80 [2019-03-28 12:43:49,037 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 250.63/218.80 [2019-03-28 12:43:49,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 250.63/218.80 [2019-03-28 12:43:49,037 INFO L225 Difference]: With dead ends: 44 250.63/218.80 [2019-03-28 12:43:49,038 INFO L226 Difference]: Without dead ends: 41 250.63/218.80 [2019-03-28 12:43:49,038 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 250.63/218.80 [2019-03-28 12:43:49,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. 250.63/218.80 [2019-03-28 12:43:49,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. 250.63/218.80 [2019-03-28 12:43:49,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. 250.63/218.80 [2019-03-28 12:43:49,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 89 transitions. 250.63/218.80 [2019-03-28 12:43:49,042 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 89 transitions. Word has length 5 250.63/218.80 [2019-03-28 12:43:49,042 INFO L84 Accepts]: Finished accepts. word is rejected. 250.63/218.80 [2019-03-28 12:43:49,043 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 89 transitions. 250.63/218.80 [2019-03-28 12:43:49,043 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 250.63/218.80 [2019-03-28 12:43:49,043 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 89 transitions. 250.63/218.80 [2019-03-28 12:43:49,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 250.63/218.80 [2019-03-28 12:43:49,043 INFO L394 BasicCegarLoop]: Found error trace 250.63/218.80 [2019-03-28 12:43:49,043 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] 250.63/218.80 [2019-03-28 12:43:49,044 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION]=== 250.63/218.80 [2019-03-28 12:43:49,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 250.63/218.80 [2019-03-28 12:43:49,044 INFO L82 PathProgramCache]: Analyzing trace with hash 142742594, now seen corresponding path program 1 times 250.63/218.80 [2019-03-28 12:43:49,044 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 250.63/218.80 [2019-03-28 12:43:49,044 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 250.63/218.80 [2019-03-28 12:43:49,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 250.63/218.80 [2019-03-28 12:43:49,045 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 250.63/218.80 [2019-03-28 12:43:49,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 250.63/218.80 [2019-03-28 12:43:49,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 250.63/218.80 [2019-03-28 12:43:49,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 250.63/218.80 [2019-03-28 12:43:49,087 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 250.63/218.80 [2019-03-28 12:43:49,087 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 250.63/218.80 [2019-03-28 12:43:49,087 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 250.63/218.80 [2019-03-28 12:43:49,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 250.63/218.80 [2019-03-28 12:43:49,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 250.63/218.80 [2019-03-28 12:43:49,088 INFO L87 Difference]: Start difference. First operand 41 states and 89 transitions. Second operand 3 states. 250.63/218.80 [2019-03-28 12:43:49,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 250.63/218.80 [2019-03-28 12:43:49,254 INFO L93 Difference]: Finished difference Result 41 states and 89 transitions. 250.63/218.80 [2019-03-28 12:43:49,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 250.63/218.80 [2019-03-28 12:43:49,255 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 250.63/218.80 [2019-03-28 12:43:49,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 250.63/218.80 [2019-03-28 12:43:49,256 INFO L225 Difference]: With dead ends: 41 250.63/218.80 [2019-03-28 12:43:49,256 INFO L226 Difference]: Without dead ends: 38 250.63/218.80 [2019-03-28 12:43:49,256 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 250.63/218.80 [2019-03-28 12:43:49,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. 250.63/218.80 [2019-03-28 12:43:49,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. 250.63/218.80 [2019-03-28 12:43:49,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. 250.63/218.80 [2019-03-28 12:43:49,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 86 transitions. 250.63/218.80 [2019-03-28 12:43:49,260 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 86 transitions. Word has length 5 250.63/218.80 [2019-03-28 12:43:49,260 INFO L84 Accepts]: Finished accepts. word is rejected. 250.63/218.80 [2019-03-28 12:43:49,260 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 86 transitions. 250.63/218.80 [2019-03-28 12:43:49,261 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 250.63/218.80 [2019-03-28 12:43:49,261 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 86 transitions. 250.63/218.80 [2019-03-28 12:43:49,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 250.63/218.80 [2019-03-28 12:43:49,261 INFO L394 BasicCegarLoop]: Found error trace 250.63/218.80 [2019-03-28 12:43:49,261 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] 250.63/218.80 [2019-03-28 12:43:49,261 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION]=== 250.63/218.80 [2019-03-28 12:43:49,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 250.63/218.80 [2019-03-28 12:43:49,262 INFO L82 PathProgramCache]: Analyzing trace with hash 130050664, now seen corresponding path program 1 times 250.63/218.80 [2019-03-28 12:43:49,262 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 250.63/218.80 [2019-03-28 12:43:49,262 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 250.63/218.80 [2019-03-28 12:43:49,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 250.63/218.80 [2019-03-28 12:43:49,263 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 250.63/218.80 [2019-03-28 12:43:49,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 250.63/218.80 [2019-03-28 12:43:49,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 250.63/218.80 [2019-03-28 12:43:49,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 250.63/218.80 [2019-03-28 12:43:49,292 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 250.63/218.80 [2019-03-28 12:43:49,292 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 250.63/218.80 [2019-03-28 12:43:49,293 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 250.63/218.80 [2019-03-28 12:43:49,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 250.63/218.80 [2019-03-28 12:43:49,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 250.63/218.80 [2019-03-28 12:43:49,293 INFO L87 Difference]: Start difference. First operand 38 states and 86 transitions. Second operand 3 states. 250.63/218.80 [2019-03-28 12:43:49,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 250.63/218.80 [2019-03-28 12:43:49,462 INFO L93 Difference]: Finished difference Result 38 states and 86 transitions. 250.63/218.80 [2019-03-28 12:43:49,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 250.63/218.80 [2019-03-28 12:43:49,463 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 250.63/218.80 [2019-03-28 12:43:49,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 250.63/218.80 [2019-03-28 12:43:49,464 INFO L225 Difference]: With dead ends: 38 250.63/218.80 [2019-03-28 12:43:49,464 INFO L226 Difference]: Without dead ends: 35 250.63/218.80 [2019-03-28 12:43:49,464 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 250.63/218.80 [2019-03-28 12:43:49,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. 250.63/218.80 [2019-03-28 12:43:49,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. 250.63/218.80 [2019-03-28 12:43:49,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. 250.63/218.80 [2019-03-28 12:43:49,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 80 transitions. 250.63/218.80 [2019-03-28 12:43:49,468 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 80 transitions. Word has length 6 250.63/218.80 [2019-03-28 12:43:49,468 INFO L84 Accepts]: Finished accepts. word is rejected. 250.63/218.80 [2019-03-28 12:43:49,468 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 80 transitions. 250.63/218.80 [2019-03-28 12:43:49,468 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 250.63/218.80 [2019-03-28 12:43:49,468 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 80 transitions. 250.63/218.80 [2019-03-28 12:43:49,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 250.63/218.80 [2019-03-28 12:43:49,469 INFO L394 BasicCegarLoop]: Found error trace 250.63/218.80 [2019-03-28 12:43:49,469 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] 250.63/218.80 [2019-03-28 12:43:49,469 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION]=== 250.63/218.80 [2019-03-28 12:43:49,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 250.63/218.80 [2019-03-28 12:43:49,469 INFO L82 PathProgramCache]: Analyzing trace with hash 130050666, now seen corresponding path program 1 times 250.63/218.80 [2019-03-28 12:43:49,469 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 250.63/218.80 [2019-03-28 12:43:49,470 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 250.63/218.80 [2019-03-28 12:43:49,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 250.63/218.80 [2019-03-28 12:43:49,471 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 250.63/218.80 [2019-03-28 12:43:49,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 250.63/218.80 [2019-03-28 12:43:49,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 250.63/218.80 [2019-03-28 12:43:49,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 250.63/218.80 [2019-03-28 12:43:49,500 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 250.63/218.80 [2019-03-28 12:43:49,500 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 250.63/218.80 [2019-03-28 12:43:49,500 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 250.63/218.80 [2019-03-28 12:43:49,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 250.63/218.80 [2019-03-28 12:43:49,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 250.63/218.80 [2019-03-28 12:43:49,501 INFO L87 Difference]: Start difference. First operand 35 states and 80 transitions. Second operand 3 states. 250.63/218.80 [2019-03-28 12:43:49,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 250.63/218.80 [2019-03-28 12:43:49,657 INFO L93 Difference]: Finished difference Result 35 states and 80 transitions. 250.63/218.80 [2019-03-28 12:43:49,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 250.63/218.80 [2019-03-28 12:43:49,657 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 250.63/218.80 [2019-03-28 12:43:49,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 250.63/218.80 [2019-03-28 12:43:49,658 INFO L225 Difference]: With dead ends: 35 250.63/218.80 [2019-03-28 12:43:49,658 INFO L226 Difference]: Without dead ends: 32 250.63/218.80 [2019-03-28 12:43:49,658 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 250.63/218.80 [2019-03-28 12:43:49,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. 250.63/218.80 [2019-03-28 12:43:49,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. 250.63/218.80 [2019-03-28 12:43:49,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. 250.63/218.80 [2019-03-28 12:43:49,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 74 transitions. 250.63/218.80 [2019-03-28 12:43:49,662 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 74 transitions. Word has length 6 250.63/218.80 [2019-03-28 12:43:49,662 INFO L84 Accepts]: Finished accepts. word is rejected. 250.63/218.80 [2019-03-28 12:43:49,662 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 74 transitions. 250.63/218.80 [2019-03-28 12:43:49,662 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 250.63/218.80 [2019-03-28 12:43:49,662 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 74 transitions. 250.63/218.80 [2019-03-28 12:43:49,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 250.63/218.80 [2019-03-28 12:43:49,663 INFO L394 BasicCegarLoop]: Found error trace 250.63/218.80 [2019-03-28 12:43:49,663 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] 250.63/218.80 [2019-03-28 12:43:49,663 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION]=== 250.63/218.80 [2019-03-28 12:43:49,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 250.63/218.80 [2019-03-28 12:43:49,663 INFO L82 PathProgramCache]: Analyzing trace with hash -263400867, now seen corresponding path program 1 times 250.63/218.80 [2019-03-28 12:43:49,663 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 250.63/218.80 [2019-03-28 12:43:49,664 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 250.63/218.80 [2019-03-28 12:43:49,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 250.63/218.80 [2019-03-28 12:43:49,665 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 250.63/218.80 [2019-03-28 12:43:49,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 250.63/218.80 [2019-03-28 12:43:49,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 250.63/218.80 [2019-03-28 12:43:49,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 250.63/218.80 [2019-03-28 12:43:49,696 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 250.63/218.80 [2019-03-28 12:43:49,696 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 250.63/218.80 [2019-03-28 12:43:49,697 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 250.63/218.80 [2019-03-28 12:43:49,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 250.63/218.80 [2019-03-28 12:43:49,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 250.63/218.80 [2019-03-28 12:43:49,697 INFO L87 Difference]: Start difference. First operand 32 states and 74 transitions. Second operand 3 states. 250.63/218.80 [2019-03-28 12:43:49,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 250.63/218.80 [2019-03-28 12:43:49,839 INFO L93 Difference]: Finished difference Result 32 states and 74 transitions. 250.63/218.80 [2019-03-28 12:43:49,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 250.63/218.80 [2019-03-28 12:43:49,840 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 250.63/218.80 [2019-03-28 12:43:49,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 250.63/218.80 [2019-03-28 12:43:49,841 INFO L225 Difference]: With dead ends: 32 250.63/218.80 [2019-03-28 12:43:49,841 INFO L226 Difference]: Without dead ends: 28 250.63/218.80 [2019-03-28 12:43:49,841 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 250.63/218.80 [2019-03-28 12:43:49,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. 250.63/218.80 [2019-03-28 12:43:49,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. 250.63/218.80 [2019-03-28 12:43:49,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. 250.63/218.80 [2019-03-28 12:43:49,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 66 transitions. 250.63/218.80 [2019-03-28 12:43:49,844 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 66 transitions. Word has length 7 250.63/218.80 [2019-03-28 12:43:49,845 INFO L84 Accepts]: Finished accepts. word is rejected. 250.63/218.80 [2019-03-28 12:43:49,845 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 66 transitions. 250.63/218.80 [2019-03-28 12:43:49,845 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 250.63/218.80 [2019-03-28 12:43:49,845 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 66 transitions. 250.63/218.80 [2019-03-28 12:43:49,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 250.63/218.80 [2019-03-28 12:43:49,845 INFO L394 BasicCegarLoop]: Found error trace 250.63/218.80 [2019-03-28 12:43:49,845 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] 250.63/218.80 [2019-03-28 12:43:49,846 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION]=== 250.63/218.80 [2019-03-28 12:43:49,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 250.63/218.80 [2019-03-28 12:43:49,846 INFO L82 PathProgramCache]: Analyzing trace with hash -263400865, now seen corresponding path program 1 times 250.63/218.80 [2019-03-28 12:43:49,846 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 250.63/218.80 [2019-03-28 12:43:49,846 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 250.63/218.80 [2019-03-28 12:43:49,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 250.63/218.80 [2019-03-28 12:43:49,847 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 250.63/218.80 [2019-03-28 12:43:49,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 250.63/218.80 [2019-03-28 12:43:49,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 250.63/218.80 [2019-03-28 12:43:49,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 250.63/218.80 [2019-03-28 12:43:49,868 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 250.63/218.80 [2019-03-28 12:43:49,868 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 250.63/218.80 [2019-03-28 12:43:49,868 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 250.63/218.80 [2019-03-28 12:43:49,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 250.63/218.80 [2019-03-28 12:43:49,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 250.63/218.80 [2019-03-28 12:43:49,869 INFO L87 Difference]: Start difference. First operand 28 states and 66 transitions. Second operand 3 states. 250.63/218.80 [2019-03-28 12:43:49,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 250.63/218.80 [2019-03-28 12:43:49,995 INFO L93 Difference]: Finished difference Result 32 states and 66 transitions. 250.63/218.80 [2019-03-28 12:43:49,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 250.63/218.80 [2019-03-28 12:43:49,996 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 250.63/218.80 [2019-03-28 12:43:49,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 250.63/218.80 [2019-03-28 12:43:49,996 INFO L225 Difference]: With dead ends: 32 250.63/218.80 [2019-03-28 12:43:49,996 INFO L226 Difference]: Without dead ends: 28 250.63/218.80 [2019-03-28 12:43:49,997 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 250.63/218.80 [2019-03-28 12:43:49,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. 250.63/218.80 [2019-03-28 12:43:49,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. 250.63/218.80 [2019-03-28 12:43:49,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. 250.63/218.80 [2019-03-28 12:43:49,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 62 transitions. 250.63/218.80 [2019-03-28 12:43:50,000 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 62 transitions. Word has length 7 250.63/218.80 [2019-03-28 12:43:50,000 INFO L84 Accepts]: Finished accepts. word is rejected. 250.63/218.80 [2019-03-28 12:43:50,000 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 62 transitions. 250.63/218.80 [2019-03-28 12:43:50,000 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 250.63/218.80 [2019-03-28 12:43:50,000 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 62 transitions. 250.63/218.80 [2019-03-28 12:43:50,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 250.63/218.80 [2019-03-28 12:43:50,001 INFO L394 BasicCegarLoop]: Found error trace 250.63/218.80 [2019-03-28 12:43:50,001 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] 250.63/218.80 [2019-03-28 12:43:50,001 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION]=== 250.63/218.80 [2019-03-28 12:43:50,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 250.63/218.80 [2019-03-28 12:43:50,002 INFO L82 PathProgramCache]: Analyzing trace with hash -263400864, now seen corresponding path program 1 times 250.63/218.80 [2019-03-28 12:43:50,002 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 250.63/218.80 [2019-03-28 12:43:50,002 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 250.74/218.80 [2019-03-28 12:43:50,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 250.74/218.80 [2019-03-28 12:43:50,003 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 250.74/218.80 [2019-03-28 12:43:50,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 250.74/218.80 [2019-03-28 12:43:50,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 250.74/218.80 [2019-03-28 12:43:50,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 250.74/218.80 [2019-03-28 12:43:50,035 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 250.74/218.80 [2019-03-28 12:43:50,035 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 250.74/218.80 [2019-03-28 12:43:50,035 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states 250.74/218.80 [2019-03-28 12:43:50,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 250.74/218.80 [2019-03-28 12:43:50,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 250.74/218.80 [2019-03-28 12:43:50,036 INFO L87 Difference]: Start difference. First operand 28 states and 62 transitions. Second operand 3 states. 250.74/218.80 [2019-03-28 12:43:50,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 250.74/218.80 [2019-03-28 12:43:50,174 INFO L93 Difference]: Finished difference Result 28 states and 62 transitions. 250.74/218.80 [2019-03-28 12:43:50,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 250.74/218.80 [2019-03-28 12:43:50,175 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 250.74/218.80 [2019-03-28 12:43:50,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. 250.74/218.80 [2019-03-28 12:43:50,176 INFO L225 Difference]: With dead ends: 28 250.74/218.80 [2019-03-28 12:43:50,176 INFO L226 Difference]: Without dead ends: 0 250.74/218.80 [2019-03-28 12:43:50,176 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 250.74/218.80 [2019-03-28 12:43:50,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. 250.74/218.80 [2019-03-28 12:43:50,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. 250.74/218.80 [2019-03-28 12:43:50,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. 250.74/218.80 [2019-03-28 12:43:50,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. 250.74/218.80 [2019-03-28 12:43:50,177 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 7 250.74/218.80 [2019-03-28 12:43:50,177 INFO L84 Accepts]: Finished accepts. word is rejected. 250.74/218.80 [2019-03-28 12:43:50,177 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. 250.74/218.80 [2019-03-28 12:43:50,178 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. 250.74/218.80 [2019-03-28 12:43:50,178 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. 250.74/218.80 [2019-03-28 12:43:50,178 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. 250.74/218.80 [2019-03-28 12:43:50,183 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. 250.74/218.80 [2019-03-28 12:43:50,229 INFO L448 ceAbstractionStarter]: For program point L19(line 19) no Hoare annotation was computed. 250.74/218.80 [2019-03-28 12:43:50,229 INFO L448 ceAbstractionStarter]: For program point L19-1(line 19) no Hoare annotation was computed. 250.74/218.80 [2019-03-28 12:43:50,229 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr3REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. 250.74/218.80 [2019-03-28 12:43:50,229 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr5REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. 250.74/218.80 [2019-03-28 12:43:50,230 INFO L448 ceAbstractionStarter]: For program point L15(line 15) no Hoare annotation was computed. 250.74/218.80 [2019-03-28 12:43:50,230 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr7REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. 250.74/218.80 [2019-03-28 12:43:50,230 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr9REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. 250.74/218.80 [2019-03-28 12:43:50,230 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. 250.74/218.80 [2019-03-28 12:43:50,230 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr19REQUIRES_VIOLATION(line 19) no Hoare annotation was computed. 250.74/218.80 [2019-03-28 12:43:50,230 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. 250.74/218.80 [2019-03-28 12:43:50,230 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr21REQUIRES_VIOLATION(line 19) no Hoare annotation was computed. 250.74/218.80 [2019-03-28 12:43:50,230 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. 250.74/218.80 [2019-03-28 12:43:50,231 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr23REQUIRES_VIOLATION(line 20) no Hoare annotation was computed. 250.74/218.80 [2019-03-28 12:43:50,231 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr25REQUIRES_VIOLATION(line 20) no Hoare annotation was computed. 250.74/218.80 [2019-03-28 12:43:50,231 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr11REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. 250.74/218.80 [2019-03-28 12:43:50,231 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr13REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. 250.74/218.80 [2019-03-28 12:43:50,231 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr15REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. 250.74/218.80 [2019-03-28 12:43:50,231 INFO L448 ceAbstractionStarter]: For program point L20(line 20) no Hoare annotation was computed. 250.74/218.80 [2019-03-28 12:43:50,231 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr17REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. 250.74/218.80 [2019-03-28 12:43:50,231 INFO L448 ceAbstractionStarter]: For program point L20-1(line 20) no Hoare annotation was computed. 250.74/218.80 [2019-03-28 12:43:50,231 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr35REQUIRES_VIOLATION(line 24) no Hoare annotation was computed. 250.74/218.80 [2019-03-28 12:43:50,232 INFO L448 ceAbstractionStarter]: For program point L12(line 12) no Hoare annotation was computed. 250.74/218.80 [2019-03-28 12:43:50,232 INFO L448 ceAbstractionStarter]: For program point L12-1(line 12) no Hoare annotation was computed. 250.74/218.80 [2019-03-28 12:43:50,232 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr27REQUIRES_VIOLATION(line 21) no Hoare annotation was computed. 250.74/218.80 [2019-03-28 12:43:50,232 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr29REQUIRES_VIOLATION(line 21) no Hoare annotation was computed. 250.74/218.80 [2019-03-28 12:43:50,232 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr31REQUIRES_VIOLATION(line 22) no Hoare annotation was computed. 250.74/218.80 [2019-03-28 12:43:50,232 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr33REQUIRES_VIOLATION(line 22) no Hoare annotation was computed. 250.74/218.80 [2019-03-28 12:43:50,232 INFO L448 ceAbstractionStarter]: For program point L21(line 21) no Hoare annotation was computed. 250.74/218.80 [2019-03-28 12:43:50,232 INFO L448 ceAbstractionStarter]: For program point L21-1(line 21) no Hoare annotation was computed. 250.74/218.80 [2019-03-28 12:43:50,232 INFO L448 ceAbstractionStarter]: For program point L17(line 17) no Hoare annotation was computed. 250.74/218.80 [2019-03-28 12:43:50,233 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. 250.74/218.80 [2019-03-28 12:43:50,233 INFO L448 ceAbstractionStarter]: For program point L17-1(line 17) no Hoare annotation was computed. 250.74/218.80 [2019-03-28 12:43:50,233 INFO L448 ceAbstractionStarter]: For program point L17-2(line 17) no Hoare annotation was computed. 250.74/218.80 [2019-03-28 12:43:50,233 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr4REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. 250.74/218.80 [2019-03-28 12:43:50,233 INFO L448 ceAbstractionStarter]: For program point L17-3(line 17) no Hoare annotation was computed. 250.74/218.80 [2019-03-28 12:43:50,233 INFO L448 ceAbstractionStarter]: For program point L13(line 13) no Hoare annotation was computed. 250.74/218.80 [2019-03-28 12:43:50,234 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr6REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. 250.74/218.80 [2019-03-28 12:43:50,234 INFO L448 ceAbstractionStarter]: For program point L17-5(lines 17 23) no Hoare annotation was computed. 250.74/218.80 [2019-03-28 12:43:50,234 INFO L444 ceAbstractionStarter]: At program point L17-7(lines 16 23) the Hoare annotation is: (and (= 4 (select |#length| ULTIMATE.start_test_fun_~k_ref~0.base)) (= 1 (select |#valid| ULTIMATE.start_test_fun_~tmp_ref~0.base)) (= 4 (select |#length| ULTIMATE.start_test_fun_~tmp_ref~0.base)) (= ULTIMATE.start_test_fun_~tmp_ref~0.offset 0) (= (select |#length| ULTIMATE.start_test_fun_~j_ref~0.base) 4) (= 1 (select |#valid| ULTIMATE.start_test_fun_~c~0.base)) (= 0 ULTIMATE.start_test_fun_~i_ref~0.offset) (= 0 ULTIMATE.start_test_fun_~c~0.offset) (= 0 ULTIMATE.start_test_fun_~k_ref~0.offset) (= 0 ULTIMATE.start_test_fun_~j_ref~0.offset) (= (select |#length| ULTIMATE.start_test_fun_~i_ref~0.base) 4) (= (select |#valid| ULTIMATE.start_test_fun_~i_ref~0.base) 1) (= 4 (select |#length| ULTIMATE.start_test_fun_~c~0.base)) (= 1 (select |#valid| ULTIMATE.start_test_fun_~j_ref~0.base)) (= 1 (select |#valid| ULTIMATE.start_test_fun_~k_ref~0.base))) 250.74/218.80 [2019-03-28 12:43:50,235 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr8REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. 250.74/218.80 [2019-03-28 12:43:50,235 INFO L448 ceAbstractionStarter]: For program point L17-8(lines 17 23) no Hoare annotation was computed. 250.74/218.80 [2019-03-28 12:43:50,235 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. 250.74/218.80 [2019-03-28 12:43:50,235 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr18REQUIRES_VIOLATION(line 19) no Hoare annotation was computed. 250.74/218.80 [2019-03-28 12:43:50,235 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr20REQUIRES_VIOLATION(line 19) no Hoare annotation was computed. 250.74/218.80 [2019-03-28 12:43:50,235 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr22REQUIRES_VIOLATION(line 20) no Hoare annotation was computed. 250.74/218.80 [2019-03-28 12:43:50,235 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr24REQUIRES_VIOLATION(line 20) no Hoare annotation was computed. 250.74/218.80 [2019-03-28 12:43:50,235 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr10REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. 250.74/218.80 [2019-03-28 12:43:50,235 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr12REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. 250.74/218.80 [2019-03-28 12:43:50,236 INFO L448 ceAbstractionStarter]: For program point L22(line 22) no Hoare annotation was computed. 250.74/218.80 [2019-03-28 12:43:50,236 INFO L448 ceAbstractionStarter]: For program point L22-1(line 22) no Hoare annotation was computed. 250.74/218.80 [2019-03-28 12:43:50,236 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr14REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. 250.74/218.80 [2019-03-28 12:43:50,236 INFO L448 ceAbstractionStarter]: For program point L18(line 18) no Hoare annotation was computed. 250.74/218.80 [2019-03-28 12:43:50,236 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr16REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. 250.74/218.80 [2019-03-28 12:43:50,236 INFO L448 ceAbstractionStarter]: For program point L18-1(line 18) no Hoare annotation was computed. 250.74/218.80 [2019-03-28 12:43:50,236 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr34REQUIRES_VIOLATION(line 24) no Hoare annotation was computed. 250.74/218.80 [2019-03-28 12:43:50,236 INFO L448 ceAbstractionStarter]: For program point L14(line 14) no Hoare annotation was computed. 250.74/218.80 [2019-03-28 12:43:50,236 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr26REQUIRES_VIOLATION(line 21) no Hoare annotation was computed. 250.74/218.80 [2019-03-28 12:43:50,237 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr28REQUIRES_VIOLATION(line 21) no Hoare annotation was computed. 250.74/218.80 [2019-03-28 12:43:50,237 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr30REQUIRES_VIOLATION(line 22) no Hoare annotation was computed. 250.74/218.80 [2019-03-28 12:43:50,237 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr32REQUIRES_VIOLATION(line 22) no Hoare annotation was computed. 250.74/218.80 [2019-03-28 12:43:50,237 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg 250.74/218.80 [2019-03-28 12:43:50,247 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 250.74/218.80 [2019-03-28 12:43:50,248 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 250.74/218.80 [2019-03-28 12:43:50,249 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 250.74/218.80 [2019-03-28 12:43:50,249 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 250.74/218.80 [2019-03-28 12:43:50,249 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 250.74/218.80 [2019-03-28 12:43:50,256 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 250.74/218.80 [2019-03-28 12:43:50,257 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 250.74/218.80 [2019-03-28 12:43:50,257 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 250.74/218.80 [2019-03-28 12:43:50,257 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 250.74/218.80 [2019-03-28 12:43:50,258 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 250.74/218.80 [2019-03-28 12:43:50,260 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:43:50 BasicIcfg 250.74/218.80 [2019-03-28 12:43:50,260 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- 250.74/218.80 [2019-03-28 12:43:50,261 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- 250.74/218.80 [2019-03-28 12:43:50,261 INFO L271 PluginConnector]: Initializing BuchiAutomizer... 250.74/218.80 [2019-03-28 12:43:50,265 INFO L276 PluginConnector]: BuchiAutomizer initialized 250.74/218.80 [2019-03-28 12:43:50,265 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 250.74/218.80 [2019-03-28 12:43:50,265 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.03 12:43:45" (1/5) ... 250.74/218.80 [2019-03-28 12:43:50,266 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2b20f3e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.03 12:43:50, skipping insertion in model container 250.74/218.80 [2019-03-28 12:43:50,266 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 250.74/218.80 [2019-03-28 12:43:50,266 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.03 12:43:45" (2/5) ... 250.74/218.80 [2019-03-28 12:43:50,267 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2b20f3e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.03 12:43:50, skipping insertion in model container 250.74/218.80 [2019-03-28 12:43:50,267 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 250.74/218.80 [2019-03-28 12:43:50,267 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.03 12:43:46" (3/5) ... 250.74/218.80 [2019-03-28 12:43:50,267 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2b20f3e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:43:50, skipping insertion in model container 250.74/218.80 [2019-03-28 12:43:50,267 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 250.74/218.80 [2019-03-28 12:43:50,267 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 28.03 12:43:46" (4/5) ... 250.74/218.80 [2019-03-28 12:43:50,268 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2b20f3e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.03 12:43:50, skipping insertion in model container 250.74/218.80 [2019-03-28 12:43:50,268 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis 250.74/218.80 [2019-03-28 12:43:50,268 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.03 12:43:50" (5/5) ... 250.74/218.80 [2019-03-28 12:43:50,269 INFO L375 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 250.74/218.80 [2019-03-28 12:43:50,291 INFO L133 ementStrategyFactory]: Using default assertion order modulation 250.74/218.80 [2019-03-28 12:43:50,291 INFO L374 BuchiCegarLoop]: Interprodecural is true 250.74/218.80 [2019-03-28 12:43:50,291 INFO L375 BuchiCegarLoop]: Hoare is true 250.74/218.80 [2019-03-28 12:43:50,292 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates 250.74/218.80 [2019-03-28 12:43:50,292 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE 250.74/218.80 [2019-03-28 12:43:50,292 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION 250.74/218.80 [2019-03-28 12:43:50,292 INFO L379 BuchiCegarLoop]: Difference is false 250.74/218.80 [2019-03-28 12:43:50,292 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA 250.74/218.80 [2019-03-28 12:43:50,292 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== 250.74/218.80 [2019-03-28 12:43:50,296 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 60 states. 250.74/218.80 [2019-03-28 12:43:50,302 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 250.74/218.80 [2019-03-28 12:43:50,302 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 250.74/218.80 [2019-03-28 12:43:50,302 INFO L119 BuchiIsEmpty]: Starting construction of run 250.74/218.80 [2019-03-28 12:43:50,307 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] 250.74/218.80 [2019-03-28 12:43:50,307 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 250.74/218.80 [2019-03-28 12:43:50,307 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ 250.74/218.80 [2019-03-28 12:43:50,307 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 60 states. 250.74/218.80 [2019-03-28 12:43:50,310 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 250.74/218.80 [2019-03-28 12:43:50,310 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 250.74/218.80 [2019-03-28 12:43:50,310 INFO L119 BuchiIsEmpty]: Starting construction of run 250.74/218.80 [2019-03-28 12:43:50,311 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] 250.74/218.80 [2019-03-28 12:43:50,311 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 250.74/218.80 [2019-03-28 12:43:50,317 INFO L794 eck$LassoCheckResult]: Stem: 25#ULTIMATE.startENTRYtrue [117] 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 [230] L-1-->L12: Formula: (let ((.cse3 (store |v_#valid_8| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 1))) (let ((.cse0 (store .cse3 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 1))) (let ((.cse2 (store .cse0 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1| 1))) (let ((.cse1 (store .cse2 |v_ULTIMATE.start_test_fun_#t~malloc3.base_1| 1))) (and (= (select |v_#valid_8| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1|) 0) (= v_ULTIMATE.start_test_fun_~i_ref~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc0.offset_1|) (< |v_ULTIMATE.start_test_fun_#t~malloc2.base_1| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_test_fun_#t~malloc3.offset_1| 0) (= v_ULTIMATE.start_test_fun_~c~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc4.offset_1|) (= |v_ULTIMATE.start_test_fun_#t~malloc0.offset_1| 0) (= |v_ULTIMATE.start_test_fun_#t~malloc1.offset_1| 0) (> |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 0) (> |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 0) (< |v_ULTIMATE.start_test_fun_#t~malloc3.base_1| |v_#StackHeapBarrier_1|) (< 0 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|) (= 0 (select .cse0 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|)) (= v_ULTIMATE.start_test_fun_~k_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|) (= v_ULTIMATE.start_test_fun_~k_1 |v_ULTIMATE.start_test_fun_#in~k_1|) (= (select .cse1 |v_ULTIMATE.start_test_fun_#t~malloc4.base_1|) 0) (= |v_ULTIMATE.start_test_fun_#t~malloc4.offset_1| 0) (= (select .cse2 |v_ULTIMATE.start_test_fun_#t~malloc3.base_1|) 0) (= (select .cse3 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|) 0) (= |v_ULTIMATE.start_test_fun_#in~k_1| |v_ULTIMATE.start_main_#t~nondet16_1|) (< |v_ULTIMATE.start_test_fun_#t~malloc3.base_1| 0) (= v_ULTIMATE.start_test_fun_~i_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc0.base_1|) (= v_ULTIMATE.start_test_fun_~tmp_ref~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc3.offset_1|) (< |v_ULTIMATE.start_test_fun_#t~malloc4.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_test_fun_~k_ref~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc2.offset_1|) (= |v_ULTIMATE.start_test_fun_#in~i_1| |v_ULTIMATE.start_main_#t~nondet14_1|) (= |v_ULTIMATE.start_test_fun_#in~j_1| |v_ULTIMATE.start_main_#t~nondet15_1|) (< |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (= (store .cse1 |v_ULTIMATE.start_test_fun_#t~malloc4.base_1| 1) |v_#valid_3|) (= (store (store (store (store (store |v_#length_6| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 4) |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 4) |v_ULTIMATE.start_test_fun_#t~malloc2.base_1| 4) |v_ULTIMATE.start_test_fun_#t~malloc3.base_1| 4) |v_ULTIMATE.start_test_fun_#t~malloc4.base_1| 4) |v_#length_1|) (= v_ULTIMATE.start_test_fun_~tmp_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc3.base_1|) (= |v_ULTIMATE.start_test_fun_#in~tmp_1| |v_ULTIMATE.start_main_#t~nondet17_1|) (> 0 |v_ULTIMATE.start_test_fun_#t~malloc4.base_1|) (= v_ULTIMATE.start_test_fun_~c~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc4.base_1|) (= v_ULTIMATE.start_test_fun_~j_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|) (= v_ULTIMATE.start_test_fun_~tmp_1 |v_ULTIMATE.start_test_fun_#in~tmp_1|) (= v_ULTIMATE.start_test_fun_~j_ref~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc1.offset_1|) (= |v_ULTIMATE.start_test_fun_#t~malloc2.offset_1| 0) (= v_ULTIMATE.start_test_fun_~j_1 |v_ULTIMATE.start_test_fun_#in~j_1|) (< |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_test_fun_~i_1 |v_ULTIMATE.start_test_fun_#in~i_1|)))))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_6|, #valid=|v_#valid_8|} OutVars{ULTIMATE.start_test_fun_~tmp_ref~0.base=v_ULTIMATE.start_test_fun_~tmp_ref~0.base_1, ULTIMATE.start_test_fun_~j_ref~0.offset=v_ULTIMATE.start_test_fun_~j_ref~0.offset_1, ULTIMATE.start_test_fun_~tmp_ref~0.offset=v_ULTIMATE.start_test_fun_~tmp_ref~0.offset_1, ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_1|, ULTIMATE.start_test_fun_#t~mem11=|v_ULTIMATE.start_test_fun_#t~mem11_1|, ULTIMATE.start_test_fun_#t~mem12=|v_ULTIMATE.start_test_fun_#t~mem12_1|, ULTIMATE.start_test_fun_#t~mem13=|v_ULTIMATE.start_test_fun_#t~mem13_1|, ULTIMATE.start_main_#t~nondet14=|v_ULTIMATE.start_main_#t~nondet14_1|, ULTIMATE.start_test_fun_~i_ref~0.offset=v_ULTIMATE.start_test_fun_~i_ref~0.offset_1, ULTIMATE.start_test_fun_#t~malloc1.offset=|v_ULTIMATE.start_test_fun_#t~malloc1.offset_1|, ULTIMATE.start_test_fun_#t~malloc4.offset=|v_ULTIMATE.start_test_fun_#t~malloc4.offset_1|, ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_1|, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_1|, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_1|, ULTIMATE.start_test_fun_~i=v_ULTIMATE.start_test_fun_~i_1, ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_1|, ULTIMATE.start_test_fun_~k_ref~0.offset=v_ULTIMATE.start_test_fun_~k_ref~0.offset_1, ULTIMATE.start_test_fun_#res=|v_ULTIMATE.start_test_fun_#res_1|, #length=|v_#length_1|, ULTIMATE.start_test_fun_#t~malloc3.offset=|v_ULTIMATE.start_test_fun_#t~malloc3.offset_1|, ULTIMATE.start_test_fun_#in~k=|v_ULTIMATE.start_test_fun_#in~k_1|, ULTIMATE.start_test_fun_#in~j=|v_ULTIMATE.start_test_fun_#in~j_1|, ULTIMATE.start_test_fun_#in~i=|v_ULTIMATE.start_test_fun_#in~i_1|, ULTIMATE.start_test_fun_~k=v_ULTIMATE.start_test_fun_~k_1, ULTIMATE.start_test_fun_~j=v_ULTIMATE.start_test_fun_~j_1, ULTIMATE.start_test_fun_~tmp=v_ULTIMATE.start_test_fun_~tmp_1, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_1, ULTIMATE.start_test_fun_#in~tmp=|v_ULTIMATE.start_test_fun_#in~tmp_1|, ULTIMATE.start_test_fun_#t~malloc0.offset=|v_ULTIMATE.start_test_fun_#t~malloc0.offset_1|, ULTIMATE.start_test_fun_#t~short7=|v_ULTIMATE.start_test_fun_#t~short7_1|, ULTIMATE.start_test_fun_~i_ref~0.base=v_ULTIMATE.start_test_fun_~i_ref~0.base_1, ULTIMATE.start_main_#t~ret18=|v_ULTIMATE.start_main_#t~ret18_1|, ULTIMATE.start_test_fun_#t~malloc1.base=|v_ULTIMATE.start_test_fun_#t~malloc1.base_1|, ULTIMATE.start_test_fun_#t~malloc2.base=|v_ULTIMATE.start_test_fun_#t~malloc2.base_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_test_fun_~j_ref~0.base=v_ULTIMATE.start_test_fun_~j_ref~0.base_1, ULTIMATE.start_test_fun_#t~malloc2.offset=|v_ULTIMATE.start_test_fun_#t~malloc2.offset_1|, ULTIMATE.start_test_fun_~k_ref~0.base=v_ULTIMATE.start_test_fun_~k_ref~0.base_1, ULTIMATE.start_test_fun_#t~malloc3.base=|v_ULTIMATE.start_test_fun_#t~malloc3.base_1|, ULTIMATE.start_test_fun_#t~malloc0.base=|v_ULTIMATE.start_test_fun_#t~malloc0.base_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_1|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_1|, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_1|, ULTIMATE.start_test_fun_#t~malloc4.base=|v_ULTIMATE.start_test_fun_#t~malloc4.base_1|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_1} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_~tmp_ref~0.base, ULTIMATE.start_test_fun_~j_ref~0.offset, ULTIMATE.start_test_fun_~tmp_ref~0.offset, ULTIMATE.start_test_fun_#t~mem10, ULTIMATE.start_test_fun_#t~mem11, ULTIMATE.start_test_fun_#t~mem12, ULTIMATE.start_test_fun_#t~mem13, ULTIMATE.start_main_#t~nondet14, ULTIMATE.start_test_fun_~i_ref~0.offset, ULTIMATE.start_test_fun_#t~malloc1.offset, ULTIMATE.start_test_fun_#t~malloc4.offset, ULTIMATE.start_test_fun_#t~mem8, ULTIMATE.start_test_fun_#t~mem9, ULTIMATE.start_test_fun_#t~mem6, ULTIMATE.start_test_fun_~i, ULTIMATE.start_test_fun_#t~mem5, ULTIMATE.start_test_fun_~k_ref~0.offset, ULTIMATE.start_test_fun_#res, #length, ULTIMATE.start_test_fun_#t~malloc3.offset, ULTIMATE.start_test_fun_#in~k, ULTIMATE.start_test_fun_#in~j, ULTIMATE.start_test_fun_#in~i, ULTIMATE.start_test_fun_~k, ULTIMATE.start_test_fun_~j, ULTIMATE.start_test_fun_~tmp, ULTIMATE.start_test_fun_~c~0.offset, ULTIMATE.start_test_fun_#in~tmp, ULTIMATE.start_test_fun_#t~malloc0.offset, ULTIMATE.start_test_fun_#t~short7, ULTIMATE.start_test_fun_~i_ref~0.base, ULTIMATE.start_main_#t~ret18, ULTIMATE.start_test_fun_#t~malloc1.base, ULTIMATE.start_test_fun_#t~malloc2.base, ULTIMATE.start_test_fun_~j_ref~0.base, ULTIMATE.start_test_fun_#t~malloc2.offset, ULTIMATE.start_test_fun_~k_ref~0.base, ULTIMATE.start_test_fun_#t~malloc3.base, ULTIMATE.start_test_fun_#t~malloc0.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_#t~nondet15, ULTIMATE.start_main_#t~nondet16, ULTIMATE.start_main_#t~nondet17, ULTIMATE.start_test_fun_#t~malloc4.base, ULTIMATE.start_test_fun_~c~0.base] 42#L12true [134] L12-->L12-1: Formula: (and (= (select |v_#valid_9| v_ULTIMATE.start_test_fun_~i_ref~0.base_3) 1) (<= 0 v_ULTIMATE.start_test_fun_~i_ref~0.offset_3) (= |v_#memory_int_1| (store |v_#memory_int_2| v_ULTIMATE.start_test_fun_~i_ref~0.base_3 (store (select |v_#memory_int_2| v_ULTIMATE.start_test_fun_~i_ref~0.base_3) v_ULTIMATE.start_test_fun_~i_ref~0.offset_3 v_ULTIMATE.start_test_fun_~i_3))) (<= (+ v_ULTIMATE.start_test_fun_~i_ref~0.offset_3 4) (select |v_#length_7| v_ULTIMATE.start_test_fun_~i_ref~0.base_3))) InVars {ULTIMATE.start_test_fun_~i=v_ULTIMATE.start_test_fun_~i_3, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_2|, #length=|v_#length_7|, ULTIMATE.start_test_fun_~i_ref~0.offset=v_ULTIMATE.start_test_fun_~i_ref~0.offset_3, ULTIMATE.start_test_fun_~i_ref~0.base=v_ULTIMATE.start_test_fun_~i_ref~0.base_3} OutVars{ULTIMATE.start_test_fun_~i=v_ULTIMATE.start_test_fun_~i_3, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_1|, #length=|v_#length_7|, ULTIMATE.start_test_fun_~i_ref~0.offset=v_ULTIMATE.start_test_fun_~i_ref~0.offset_3, ULTIMATE.start_test_fun_~i_ref~0.base=v_ULTIMATE.start_test_fun_~i_ref~0.base_3} AuxVars[] AssignedVars[#memory_int] 41#L12-1true [131] L12-1-->L13: Formula: (and (= 1 (select |v_#valid_11| v_ULTIMATE.start_test_fun_~j_ref~0.base_3)) (<= (+ v_ULTIMATE.start_test_fun_~j_ref~0.offset_3 4) (select |v_#length_9| v_ULTIMATE.start_test_fun_~j_ref~0.base_3)) (<= 0 v_ULTIMATE.start_test_fun_~j_ref~0.offset_3) (= |v_#memory_int_3| (store |v_#memory_int_4| v_ULTIMATE.start_test_fun_~j_ref~0.base_3 (store (select |v_#memory_int_4| v_ULTIMATE.start_test_fun_~j_ref~0.base_3) v_ULTIMATE.start_test_fun_~j_ref~0.offset_3 v_ULTIMATE.start_test_fun_~j_3)))) InVars {ULTIMATE.start_test_fun_~j_ref~0.offset=v_ULTIMATE.start_test_fun_~j_ref~0.offset_3, ULTIMATE.start_test_fun_~j_ref~0.base=v_ULTIMATE.start_test_fun_~j_ref~0.base_3, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_4|, #length=|v_#length_9|, ULTIMATE.start_test_fun_~j=v_ULTIMATE.start_test_fun_~j_3} OutVars{ULTIMATE.start_test_fun_~j_ref~0.offset=v_ULTIMATE.start_test_fun_~j_ref~0.offset_3, ULTIMATE.start_test_fun_~j_ref~0.base=v_ULTIMATE.start_test_fun_~j_ref~0.base_3, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_3|, #length=|v_#length_9|, ULTIMATE.start_test_fun_~j=v_ULTIMATE.start_test_fun_~j_3} AuxVars[] AssignedVars[#memory_int] 59#L13true [155] L13-->L14: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~k_ref~0.offset_3 4) (select |v_#length_11| v_ULTIMATE.start_test_fun_~k_ref~0.base_3)) (= (store |v_#memory_int_6| v_ULTIMATE.start_test_fun_~k_ref~0.base_3 (store (select |v_#memory_int_6| v_ULTIMATE.start_test_fun_~k_ref~0.base_3) v_ULTIMATE.start_test_fun_~k_ref~0.offset_3 v_ULTIMATE.start_test_fun_~k_3)) |v_#memory_int_5|) (<= 0 v_ULTIMATE.start_test_fun_~k_ref~0.offset_3) (= 1 (select |v_#valid_13| v_ULTIMATE.start_test_fun_~k_ref~0.base_3))) InVars {ULTIMATE.start_test_fun_~k_ref~0.offset=v_ULTIMATE.start_test_fun_~k_ref~0.offset_3, ULTIMATE.start_test_fun_~k_ref~0.base=v_ULTIMATE.start_test_fun_~k_ref~0.base_3, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_6|, #length=|v_#length_11|, ULTIMATE.start_test_fun_~k=v_ULTIMATE.start_test_fun_~k_3} OutVars{ULTIMATE.start_test_fun_~k_ref~0.offset=v_ULTIMATE.start_test_fun_~k_ref~0.offset_3, ULTIMATE.start_test_fun_~k_ref~0.base=v_ULTIMATE.start_test_fun_~k_ref~0.base_3, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_5|, #length=|v_#length_11|, ULTIMATE.start_test_fun_~k=v_ULTIMATE.start_test_fun_~k_3} AuxVars[] AssignedVars[#memory_int] 14#L14true [101] L14-->L15: Formula: (and (= 1 (select |v_#valid_15| v_ULTIMATE.start_test_fun_~tmp_ref~0.base_3)) (= (store |v_#memory_int_8| v_ULTIMATE.start_test_fun_~tmp_ref~0.base_3 (store (select |v_#memory_int_8| v_ULTIMATE.start_test_fun_~tmp_ref~0.base_3) v_ULTIMATE.start_test_fun_~tmp_ref~0.offset_3 v_ULTIMATE.start_test_fun_~tmp_3)) |v_#memory_int_7|) (<= 0 v_ULTIMATE.start_test_fun_~tmp_ref~0.offset_3) (<= (+ v_ULTIMATE.start_test_fun_~tmp_ref~0.offset_3 4) (select |v_#length_13| v_ULTIMATE.start_test_fun_~tmp_ref~0.base_3))) InVars {ULTIMATE.start_test_fun_~tmp_ref~0.base=v_ULTIMATE.start_test_fun_~tmp_ref~0.base_3, ULTIMATE.start_test_fun_~tmp=v_ULTIMATE.start_test_fun_~tmp_3, ULTIMATE.start_test_fun_~tmp_ref~0.offset=v_ULTIMATE.start_test_fun_~tmp_ref~0.offset_3, #valid=|v_#valid_15|, #memory_int=|v_#memory_int_8|, #length=|v_#length_13|} OutVars{ULTIMATE.start_test_fun_~tmp_ref~0.base=v_ULTIMATE.start_test_fun_~tmp_ref~0.base_3, ULTIMATE.start_test_fun_~tmp=v_ULTIMATE.start_test_fun_~tmp_3, ULTIMATE.start_test_fun_~tmp_ref~0.offset=v_ULTIMATE.start_test_fun_~tmp_ref~0.offset_3, #valid=|v_#valid_15|, #memory_int=|v_#memory_int_7|, #length=|v_#length_13|} AuxVars[] AssignedVars[#memory_int] 15#L15true [104] L15-->L17-7: Formula: (and (= |v_#memory_int_9| (store |v_#memory_int_10| v_ULTIMATE.start_test_fun_~c~0.base_3 (store (select |v_#memory_int_10| v_ULTIMATE.start_test_fun_~c~0.base_3) v_ULTIMATE.start_test_fun_~c~0.offset_3 0))) (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_3) (= 1 (select |v_#valid_17| v_ULTIMATE.start_test_fun_~c~0.base_3)) (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_3 4) (select |v_#length_15| v_ULTIMATE.start_test_fun_~c~0.base_3))) InVars {#memory_int=|v_#memory_int_10|, #length=|v_#length_15|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_3, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_3, #valid=|v_#valid_17|} OutVars{#memory_int=|v_#memory_int_9|, #length=|v_#length_15|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_3, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_3, #valid=|v_#valid_17|} AuxVars[] AssignedVars[#memory_int] 55#L17-7true 250.74/218.80 [2019-03-28 12:43:50,318 INFO L796 eck$LassoCheckResult]: Loop: 55#L17-7true [149] L17-7-->L17: Formula: (and (= (select (select |v_#memory_int_11| v_ULTIMATE.start_test_fun_~i_ref~0.base_6) v_ULTIMATE.start_test_fun_~i_ref~0.offset_5) |v_ULTIMATE.start_test_fun_#t~mem5_2|) (<= (+ v_ULTIMATE.start_test_fun_~i_ref~0.offset_5 4) (select |v_#length_17| v_ULTIMATE.start_test_fun_~i_ref~0.base_6)) (= 1 (select |v_#valid_19| v_ULTIMATE.start_test_fun_~i_ref~0.base_6)) (<= 0 v_ULTIMATE.start_test_fun_~i_ref~0.offset_5)) InVars {#memory_int=|v_#memory_int_11|, #length=|v_#length_17|, ULTIMATE.start_test_fun_~i_ref~0.offset=v_ULTIMATE.start_test_fun_~i_ref~0.offset_5, ULTIMATE.start_test_fun_~i_ref~0.base=v_ULTIMATE.start_test_fun_~i_ref~0.base_6, #valid=|v_#valid_19|} OutVars{ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_2|, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_11|, #length=|v_#length_17|, ULTIMATE.start_test_fun_~i_ref~0.offset=v_ULTIMATE.start_test_fun_~i_ref~0.offset_5, ULTIMATE.start_test_fun_~i_ref~0.base=v_ULTIMATE.start_test_fun_~i_ref~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem5] 50#L17true [259] L17-->L17-1: Formula: (and |v_ULTIMATE.start_test_fun_#t~short7_2| (<= |v_ULTIMATE.start_test_fun_#t~mem5_3| 100)) InVars {ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_3|} OutVars{ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_3|, ULTIMATE.start_test_fun_#t~short7=|v_ULTIMATE.start_test_fun_#t~short7_2|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~short7] 47#L17-1true [141] L17-1-->L17-5: Formula: (not |v_ULTIMATE.start_test_fun_#t~short7_5|) InVars {ULTIMATE.start_test_fun_#t~short7=|v_ULTIMATE.start_test_fun_#t~short7_5|} OutVars{ULTIMATE.start_test_fun_#t~short7=|v_ULTIMATE.start_test_fun_#t~short7_5|} AuxVars[] AssignedVars[] 57#L17-5true [153] L17-5-->L18: Formula: |v_ULTIMATE.start_test_fun_#t~short7_9| InVars {ULTIMATE.start_test_fun_#t~short7=|v_ULTIMATE.start_test_fun_#t~short7_9|} OutVars{ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_5|, ULTIMATE.start_test_fun_#t~short7=|v_ULTIMATE.start_test_fun_#t~short7_8|, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem5, ULTIMATE.start_test_fun_#t~short7, ULTIMATE.start_test_fun_#t~mem6] 6#L18true [92] L18-->L18-1: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~i_ref~0.offset_7) (<= (+ v_ULTIMATE.start_test_fun_~i_ref~0.offset_7 4) (select |v_#length_21| v_ULTIMATE.start_test_fun_~i_ref~0.base_9)) (= (select |v_#valid_23| v_ULTIMATE.start_test_fun_~i_ref~0.base_9) 1) (= (select (select |v_#memory_int_13| v_ULTIMATE.start_test_fun_~i_ref~0.base_9) v_ULTIMATE.start_test_fun_~i_ref~0.offset_7) |v_ULTIMATE.start_test_fun_#t~mem8_2|)) InVars {#memory_int=|v_#memory_int_13|, #length=|v_#length_21|, ULTIMATE.start_test_fun_~i_ref~0.offset=v_ULTIMATE.start_test_fun_~i_ref~0.offset_7, ULTIMATE.start_test_fun_~i_ref~0.base=v_ULTIMATE.start_test_fun_~i_ref~0.base_9, #valid=|v_#valid_23|} OutVars{#valid=|v_#valid_23|, #memory_int=|v_#memory_int_13|, #length=|v_#length_21|, ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_2|, ULTIMATE.start_test_fun_~i_ref~0.offset=v_ULTIMATE.start_test_fun_~i_ref~0.offset_7, ULTIMATE.start_test_fun_~i_ref~0.base=v_ULTIMATE.start_test_fun_~i_ref~0.base_9} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem8] 5#L18-1true [309] L18-1-->L19: Formula: (and (= 1 (select |v_#valid_55| v_ULTIMATE.start_test_fun_~tmp_ref~0.base_12)) (<= 0 v_ULTIMATE.start_test_fun_~tmp_ref~0.offset_9) (<= (+ v_ULTIMATE.start_test_fun_~tmp_ref~0.offset_9 4) (select |v_#length_45| v_ULTIMATE.start_test_fun_~tmp_ref~0.base_12)) (= (store |v_#memory_int_32| v_ULTIMATE.start_test_fun_~tmp_ref~0.base_12 (store (select |v_#memory_int_32| v_ULTIMATE.start_test_fun_~tmp_ref~0.base_12) v_ULTIMATE.start_test_fun_~tmp_ref~0.offset_9 |v_ULTIMATE.start_test_fun_#t~mem8_6|)) |v_#memory_int_31|)) InVars {ULTIMATE.start_test_fun_~tmp_ref~0.base=v_ULTIMATE.start_test_fun_~tmp_ref~0.base_12, ULTIMATE.start_test_fun_~tmp_ref~0.offset=v_ULTIMATE.start_test_fun_~tmp_ref~0.offset_9, #valid=|v_#valid_55|, #memory_int=|v_#memory_int_32|, #length=|v_#length_45|, ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_6|} OutVars{ULTIMATE.start_test_fun_~tmp_ref~0.base=v_ULTIMATE.start_test_fun_~tmp_ref~0.base_12, ULTIMATE.start_test_fun_~tmp_ref~0.offset=v_ULTIMATE.start_test_fun_~tmp_ref~0.offset_9, #valid=|v_#valid_55|, #memory_int=|v_#memory_int_31|, #length=|v_#length_45|, ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_5|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_test_fun_#t~mem8] 21#L19true [111] L19-->L19-1: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~j_ref~0.offset_7) (= (select |v_#valid_27| v_ULTIMATE.start_test_fun_~j_ref~0.base_9) 1) (= (select (select |v_#memory_int_16| v_ULTIMATE.start_test_fun_~j_ref~0.base_9) v_ULTIMATE.start_test_fun_~j_ref~0.offset_7) |v_ULTIMATE.start_test_fun_#t~mem9_2|) (<= (+ v_ULTIMATE.start_test_fun_~j_ref~0.offset_7 4) (select |v_#length_25| v_ULTIMATE.start_test_fun_~j_ref~0.base_9))) InVars {#memory_int=|v_#memory_int_16|, ULTIMATE.start_test_fun_~j_ref~0.offset=v_ULTIMATE.start_test_fun_~j_ref~0.offset_7, #length=|v_#length_25|, ULTIMATE.start_test_fun_~j_ref~0.base=v_ULTIMATE.start_test_fun_~j_ref~0.base_9, #valid=|v_#valid_27|} OutVars{ULTIMATE.start_test_fun_~j_ref~0.offset=v_ULTIMATE.start_test_fun_~j_ref~0.offset_7, ULTIMATE.start_test_fun_~j_ref~0.base=v_ULTIMATE.start_test_fun_~j_ref~0.base_9, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_16|, #length=|v_#length_25|, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_2|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem9] 18#L19-1true [312] L19-1-->L20: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~i_ref~0.offset_11) (= (store |v_#memory_int_36| v_ULTIMATE.start_test_fun_~i_ref~0.base_15 (store (select |v_#memory_int_36| v_ULTIMATE.start_test_fun_~i_ref~0.base_15) v_ULTIMATE.start_test_fun_~i_ref~0.offset_11 |v_ULTIMATE.start_test_fun_#t~mem9_6|)) |v_#memory_int_35|) (= 1 (select |v_#valid_60| v_ULTIMATE.start_test_fun_~i_ref~0.base_15)) (<= (+ v_ULTIMATE.start_test_fun_~i_ref~0.offset_11 4) (select |v_#length_48| v_ULTIMATE.start_test_fun_~i_ref~0.base_15))) InVars {#valid=|v_#valid_60|, #memory_int=|v_#memory_int_36|, #length=|v_#length_48|, ULTIMATE.start_test_fun_~i_ref~0.offset=v_ULTIMATE.start_test_fun_~i_ref~0.offset_11, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_6|, ULTIMATE.start_test_fun_~i_ref~0.base=v_ULTIMATE.start_test_fun_~i_ref~0.base_15} OutVars{#valid=|v_#valid_60|, #memory_int=|v_#memory_int_35|, #length=|v_#length_48|, ULTIMATE.start_test_fun_~i_ref~0.offset=v_ULTIMATE.start_test_fun_~i_ref~0.offset_11, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_5|, ULTIMATE.start_test_fun_~i_ref~0.base=v_ULTIMATE.start_test_fun_~i_ref~0.base_15} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_test_fun_#t~mem9] 38#L20true [128] L20-->L20-1: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem10_2| (select (select |v_#memory_int_19| v_ULTIMATE.start_test_fun_~tmp_ref~0.base_9) v_ULTIMATE.start_test_fun_~tmp_ref~0.offset_7)) (<= 0 v_ULTIMATE.start_test_fun_~tmp_ref~0.offset_7) (= (select |v_#valid_31| v_ULTIMATE.start_test_fun_~tmp_ref~0.base_9) 1) (<= (+ v_ULTIMATE.start_test_fun_~tmp_ref~0.offset_7 4) (select |v_#length_29| v_ULTIMATE.start_test_fun_~tmp_ref~0.base_9))) InVars {ULTIMATE.start_test_fun_~tmp_ref~0.base=v_ULTIMATE.start_test_fun_~tmp_ref~0.base_9, #memory_int=|v_#memory_int_19|, #length=|v_#length_29|, ULTIMATE.start_test_fun_~tmp_ref~0.offset=v_ULTIMATE.start_test_fun_~tmp_ref~0.offset_7, #valid=|v_#valid_31|} OutVars{ULTIMATE.start_test_fun_~tmp_ref~0.base=v_ULTIMATE.start_test_fun_~tmp_ref~0.base_9, ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_2|, ULTIMATE.start_test_fun_~tmp_ref~0.offset=v_ULTIMATE.start_test_fun_~tmp_ref~0.offset_7, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_19|, #length=|v_#length_29|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem10] 36#L20-1true [313] L20-1-->L21: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~j_ref~0.offset_11 4) (select |v_#length_49| v_ULTIMATE.start_test_fun_~j_ref~0.base_15)) (= 1 (select |v_#valid_61| v_ULTIMATE.start_test_fun_~j_ref~0.base_15)) (= (store |v_#memory_int_38| v_ULTIMATE.start_test_fun_~j_ref~0.base_15 (store (select |v_#memory_int_38| v_ULTIMATE.start_test_fun_~j_ref~0.base_15) v_ULTIMATE.start_test_fun_~j_ref~0.offset_11 (+ |v_ULTIMATE.start_test_fun_#t~mem10_6| 1))) |v_#memory_int_37|) (<= 0 v_ULTIMATE.start_test_fun_~j_ref~0.offset_11)) InVars {ULTIMATE.start_test_fun_~j_ref~0.offset=v_ULTIMATE.start_test_fun_~j_ref~0.offset_11, ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_6|, ULTIMATE.start_test_fun_~j_ref~0.base=v_ULTIMATE.start_test_fun_~j_ref~0.base_15, #valid=|v_#valid_61|, #memory_int=|v_#memory_int_38|, #length=|v_#length_49|} OutVars{ULTIMATE.start_test_fun_~j_ref~0.offset=v_ULTIMATE.start_test_fun_~j_ref~0.offset_11, ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_5|, ULTIMATE.start_test_fun_~j_ref~0.base=v_ULTIMATE.start_test_fun_~j_ref~0.base_15, #valid=|v_#valid_61|, #memory_int=|v_#memory_int_37|, #length=|v_#length_49|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem10, #memory_int] 11#L21true [97] L21-->L21-1: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~k_ref~0.offset_5) (= (select |v_#valid_35| v_ULTIMATE.start_test_fun_~k_ref~0.base_6) 1) (= (select (select |v_#memory_int_22| v_ULTIMATE.start_test_fun_~k_ref~0.base_6) v_ULTIMATE.start_test_fun_~k_ref~0.offset_5) |v_ULTIMATE.start_test_fun_#t~mem11_2|) (<= (+ v_ULTIMATE.start_test_fun_~k_ref~0.offset_5 4) (select |v_#length_33| v_ULTIMATE.start_test_fun_~k_ref~0.base_6))) InVars {#memory_int=|v_#memory_int_22|, ULTIMATE.start_test_fun_~k_ref~0.offset=v_ULTIMATE.start_test_fun_~k_ref~0.offset_5, #length=|v_#length_33|, ULTIMATE.start_test_fun_~k_ref~0.base=v_ULTIMATE.start_test_fun_~k_ref~0.base_6, #valid=|v_#valid_35|} OutVars{ULTIMATE.start_test_fun_~k_ref~0.offset=v_ULTIMATE.start_test_fun_~k_ref~0.offset_5, ULTIMATE.start_test_fun_#t~mem11=|v_ULTIMATE.start_test_fun_#t~mem11_2|, ULTIMATE.start_test_fun_~k_ref~0.base=v_ULTIMATE.start_test_fun_~k_ref~0.base_6, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_22|, #length=|v_#length_33|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem11] 53#L21-1true [314] L21-1-->L22: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~k_ref~0.offset_9) (<= (+ v_ULTIMATE.start_test_fun_~k_ref~0.offset_9 4) (select |v_#length_50| v_ULTIMATE.start_test_fun_~k_ref~0.base_12)) (= (store |v_#memory_int_40| v_ULTIMATE.start_test_fun_~k_ref~0.base_12 (store (select |v_#memory_int_40| v_ULTIMATE.start_test_fun_~k_ref~0.base_12) v_ULTIMATE.start_test_fun_~k_ref~0.offset_9 (+ |v_ULTIMATE.start_test_fun_#t~mem11_6| (- 1)))) |v_#memory_int_39|) (= 1 (select |v_#valid_62| v_ULTIMATE.start_test_fun_~k_ref~0.base_12))) InVars {ULTIMATE.start_test_fun_~k_ref~0.offset=v_ULTIMATE.start_test_fun_~k_ref~0.offset_9, ULTIMATE.start_test_fun_#t~mem11=|v_ULTIMATE.start_test_fun_#t~mem11_6|, ULTIMATE.start_test_fun_~k_ref~0.base=v_ULTIMATE.start_test_fun_~k_ref~0.base_12, #valid=|v_#valid_62|, #memory_int=|v_#memory_int_40|, #length=|v_#length_50|} OutVars{ULTIMATE.start_test_fun_~k_ref~0.offset=v_ULTIMATE.start_test_fun_~k_ref~0.offset_9, ULTIMATE.start_test_fun_#t~mem11=|v_ULTIMATE.start_test_fun_#t~mem11_5|, ULTIMATE.start_test_fun_~k_ref~0.base=v_ULTIMATE.start_test_fun_~k_ref~0.base_12, #valid=|v_#valid_62|, #memory_int=|v_#memory_int_39|, #length=|v_#length_50|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem11, #memory_int] 29#L22true [118] L22-->L22-1: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem12_2| (select (select |v_#memory_int_25| v_ULTIMATE.start_test_fun_~c~0.base_6) v_ULTIMATE.start_test_fun_~c~0.offset_5)) (= 1 (select |v_#valid_39| v_ULTIMATE.start_test_fun_~c~0.base_6)) (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_5) (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_5 4) (select |v_#length_37| v_ULTIMATE.start_test_fun_~c~0.base_6))) InVars {#memory_int=|v_#memory_int_25|, #length=|v_#length_37|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_5, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_6, #valid=|v_#valid_39|} OutVars{ULTIMATE.start_test_fun_#t~mem12=|v_ULTIMATE.start_test_fun_#t~mem12_2|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_5, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_25|, #length=|v_#length_37|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem12] 24#L22-1true [315] L22-1-->L17-7: Formula: (and (= (store |v_#memory_int_42| v_ULTIMATE.start_test_fun_~c~0.base_19 (store (select |v_#memory_int_42| v_ULTIMATE.start_test_fun_~c~0.base_19) v_ULTIMATE.start_test_fun_~c~0.offset_15 (+ |v_ULTIMATE.start_test_fun_#t~mem12_6| 1))) |v_#memory_int_41|) (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_15 4) (select |v_#length_51| v_ULTIMATE.start_test_fun_~c~0.base_19)) (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_15) (= 1 (select |v_#valid_63| v_ULTIMATE.start_test_fun_~c~0.base_19))) InVars {ULTIMATE.start_test_fun_#t~mem12=|v_ULTIMATE.start_test_fun_#t~mem12_6|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_15, #valid=|v_#valid_63|, #memory_int=|v_#memory_int_42|, #length=|v_#length_51|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_19} OutVars{ULTIMATE.start_test_fun_#t~mem12=|v_ULTIMATE.start_test_fun_#t~mem12_5|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_15, #valid=|v_#valid_63|, #memory_int=|v_#memory_int_41|, #length=|v_#length_51|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_19} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem12, #memory_int] 55#L17-7true 250.74/218.80 [2019-03-28 12:43:50,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 250.74/218.80 [2019-03-28 12:43:50,319 INFO L82 PathProgramCache]: Analyzing trace with hash 624102671, now seen corresponding path program 1 times 250.74/218.80 [2019-03-28 12:43:50,320 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 250.74/218.80 [2019-03-28 12:43:50,320 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 250.74/218.80 [2019-03-28 12:43:50,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 250.74/218.80 [2019-03-28 12:43:50,321 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 250.74/218.80 [2019-03-28 12:43:50,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 250.74/218.80 [2019-03-28 12:43:50,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 250.74/218.80 [2019-03-28 12:43:50,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 250.74/218.80 [2019-03-28 12:43:50,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 250.74/218.80 [2019-03-28 12:43:50,375 INFO L82 PathProgramCache]: Analyzing trace with hash -2011602764, now seen corresponding path program 1 times 250.74/218.80 [2019-03-28 12:43:50,376 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 250.74/218.80 [2019-03-28 12:43:50,376 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 250.74/218.80 [2019-03-28 12:43:50,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 250.74/218.80 [2019-03-28 12:43:50,377 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 250.74/218.80 [2019-03-28 12:43:50,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 250.74/218.80 [2019-03-28 12:43:50,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 250.74/218.80 [2019-03-28 12:43:50,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 250.74/218.80 [2019-03-28 12:43:50,397 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 250.74/218.80 [2019-03-28 12:43:50,397 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 250.74/218.80 [2019-03-28 12:43:50,397 INFO L811 eck$LassoCheckResult]: loop already infeasible 250.74/218.80 [2019-03-28 12:43:50,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 250.74/218.80 [2019-03-28 12:43:50,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 250.74/218.80 [2019-03-28 12:43:50,400 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 3 states. 250.74/218.80 [2019-03-28 12:43:50,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 250.74/218.80 [2019-03-28 12:43:50,662 INFO L93 Difference]: Finished difference Result 62 states and 132 transitions. 250.74/218.80 [2019-03-28 12:43:50,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 250.74/218.80 [2019-03-28 12:43:50,665 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 62 states and 132 transitions. 250.74/218.80 [2019-03-28 12:43:50,667 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 18 250.74/218.80 [2019-03-28 12:43:50,668 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 62 states to 25 states and 59 transitions. 250.74/218.80 [2019-03-28 12:43:50,669 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 250.74/218.80 [2019-03-28 12:43:50,669 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 250.74/218.80 [2019-03-28 12:43:50,670 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 59 transitions. 250.74/218.80 [2019-03-28 12:43:50,670 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 250.74/218.80 [2019-03-28 12:43:50,671 INFO L706 BuchiCegarLoop]: Abstraction has 25 states and 59 transitions. 250.74/218.80 [2019-03-28 12:43:50,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 59 transitions. 250.74/218.80 [2019-03-28 12:43:50,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. 250.74/218.80 [2019-03-28 12:43:50,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. 250.74/218.80 [2019-03-28 12:43:50,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 58 transitions. 250.74/218.80 [2019-03-28 12:43:50,673 INFO L729 BuchiCegarLoop]: Abstraction has 24 states and 58 transitions. 250.74/218.80 [2019-03-28 12:43:50,673 INFO L609 BuchiCegarLoop]: Abstraction has 24 states and 58 transitions. 250.74/218.80 [2019-03-28 12:43:50,674 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ 250.74/218.80 [2019-03-28 12:43:50,674 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 58 transitions. 250.74/218.80 [2019-03-28 12:43:50,674 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 17 250.74/218.80 [2019-03-28 12:43:50,675 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 250.74/218.80 [2019-03-28 12:43:50,675 INFO L119 BuchiIsEmpty]: Starting construction of run 250.74/218.80 [2019-03-28 12:43:50,675 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] 250.74/218.80 [2019-03-28 12:43:50,675 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 250.74/218.80 [2019-03-28 12:43:50,676 INFO L794 eck$LassoCheckResult]: Stem: 150#ULTIMATE.startENTRY [117] 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] 147#L-1 [230] L-1-->L12: Formula: (let ((.cse3 (store |v_#valid_8| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 1))) (let ((.cse0 (store .cse3 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 1))) (let ((.cse2 (store .cse0 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1| 1))) (let ((.cse1 (store .cse2 |v_ULTIMATE.start_test_fun_#t~malloc3.base_1| 1))) (and (= (select |v_#valid_8| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1|) 0) (= v_ULTIMATE.start_test_fun_~i_ref~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc0.offset_1|) (< |v_ULTIMATE.start_test_fun_#t~malloc2.base_1| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_test_fun_#t~malloc3.offset_1| 0) (= v_ULTIMATE.start_test_fun_~c~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc4.offset_1|) (= |v_ULTIMATE.start_test_fun_#t~malloc0.offset_1| 0) (= |v_ULTIMATE.start_test_fun_#t~malloc1.offset_1| 0) (> |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 0) (> |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 0) (< |v_ULTIMATE.start_test_fun_#t~malloc3.base_1| |v_#StackHeapBarrier_1|) (< 0 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|) (= 0 (select .cse0 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|)) (= v_ULTIMATE.start_test_fun_~k_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|) (= v_ULTIMATE.start_test_fun_~k_1 |v_ULTIMATE.start_test_fun_#in~k_1|) (= (select .cse1 |v_ULTIMATE.start_test_fun_#t~malloc4.base_1|) 0) (= |v_ULTIMATE.start_test_fun_#t~malloc4.offset_1| 0) (= (select .cse2 |v_ULTIMATE.start_test_fun_#t~malloc3.base_1|) 0) (= (select .cse3 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|) 0) (= |v_ULTIMATE.start_test_fun_#in~k_1| |v_ULTIMATE.start_main_#t~nondet16_1|) (< |v_ULTIMATE.start_test_fun_#t~malloc3.base_1| 0) (= v_ULTIMATE.start_test_fun_~i_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc0.base_1|) (= v_ULTIMATE.start_test_fun_~tmp_ref~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc3.offset_1|) (< |v_ULTIMATE.start_test_fun_#t~malloc4.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_test_fun_~k_ref~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc2.offset_1|) (= |v_ULTIMATE.start_test_fun_#in~i_1| |v_ULTIMATE.start_main_#t~nondet14_1|) (= |v_ULTIMATE.start_test_fun_#in~j_1| |v_ULTIMATE.start_main_#t~nondet15_1|) (< |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (= (store .cse1 |v_ULTIMATE.start_test_fun_#t~malloc4.base_1| 1) |v_#valid_3|) (= (store (store (store (store (store |v_#length_6| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 4) |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 4) |v_ULTIMATE.start_test_fun_#t~malloc2.base_1| 4) |v_ULTIMATE.start_test_fun_#t~malloc3.base_1| 4) |v_ULTIMATE.start_test_fun_#t~malloc4.base_1| 4) |v_#length_1|) (= v_ULTIMATE.start_test_fun_~tmp_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc3.base_1|) (= |v_ULTIMATE.start_test_fun_#in~tmp_1| |v_ULTIMATE.start_main_#t~nondet17_1|) (> 0 |v_ULTIMATE.start_test_fun_#t~malloc4.base_1|) (= v_ULTIMATE.start_test_fun_~c~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc4.base_1|) (= v_ULTIMATE.start_test_fun_~j_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|) (= v_ULTIMATE.start_test_fun_~tmp_1 |v_ULTIMATE.start_test_fun_#in~tmp_1|) (= v_ULTIMATE.start_test_fun_~j_ref~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc1.offset_1|) (= |v_ULTIMATE.start_test_fun_#t~malloc2.offset_1| 0) (= v_ULTIMATE.start_test_fun_~j_1 |v_ULTIMATE.start_test_fun_#in~j_1|) (< |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_test_fun_~i_1 |v_ULTIMATE.start_test_fun_#in~i_1|)))))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_6|, #valid=|v_#valid_8|} OutVars{ULTIMATE.start_test_fun_~tmp_ref~0.base=v_ULTIMATE.start_test_fun_~tmp_ref~0.base_1, ULTIMATE.start_test_fun_~j_ref~0.offset=v_ULTIMATE.start_test_fun_~j_ref~0.offset_1, ULTIMATE.start_test_fun_~tmp_ref~0.offset=v_ULTIMATE.start_test_fun_~tmp_ref~0.offset_1, ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_1|, ULTIMATE.start_test_fun_#t~mem11=|v_ULTIMATE.start_test_fun_#t~mem11_1|, ULTIMATE.start_test_fun_#t~mem12=|v_ULTIMATE.start_test_fun_#t~mem12_1|, ULTIMATE.start_test_fun_#t~mem13=|v_ULTIMATE.start_test_fun_#t~mem13_1|, ULTIMATE.start_main_#t~nondet14=|v_ULTIMATE.start_main_#t~nondet14_1|, ULTIMATE.start_test_fun_~i_ref~0.offset=v_ULTIMATE.start_test_fun_~i_ref~0.offset_1, ULTIMATE.start_test_fun_#t~malloc1.offset=|v_ULTIMATE.start_test_fun_#t~malloc1.offset_1|, ULTIMATE.start_test_fun_#t~malloc4.offset=|v_ULTIMATE.start_test_fun_#t~malloc4.offset_1|, ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_1|, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_1|, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_1|, ULTIMATE.start_test_fun_~i=v_ULTIMATE.start_test_fun_~i_1, ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_1|, ULTIMATE.start_test_fun_~k_ref~0.offset=v_ULTIMATE.start_test_fun_~k_ref~0.offset_1, ULTIMATE.start_test_fun_#res=|v_ULTIMATE.start_test_fun_#res_1|, #length=|v_#length_1|, ULTIMATE.start_test_fun_#t~malloc3.offset=|v_ULTIMATE.start_test_fun_#t~malloc3.offset_1|, ULTIMATE.start_test_fun_#in~k=|v_ULTIMATE.start_test_fun_#in~k_1|, ULTIMATE.start_test_fun_#in~j=|v_ULTIMATE.start_test_fun_#in~j_1|, ULTIMATE.start_test_fun_#in~i=|v_ULTIMATE.start_test_fun_#in~i_1|, ULTIMATE.start_test_fun_~k=v_ULTIMATE.start_test_fun_~k_1, ULTIMATE.start_test_fun_~j=v_ULTIMATE.start_test_fun_~j_1, ULTIMATE.start_test_fun_~tmp=v_ULTIMATE.start_test_fun_~tmp_1, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_1, ULTIMATE.start_test_fun_#in~tmp=|v_ULTIMATE.start_test_fun_#in~tmp_1|, ULTIMATE.start_test_fun_#t~malloc0.offset=|v_ULTIMATE.start_test_fun_#t~malloc0.offset_1|, ULTIMATE.start_test_fun_#t~short7=|v_ULTIMATE.start_test_fun_#t~short7_1|, ULTIMATE.start_test_fun_~i_ref~0.base=v_ULTIMATE.start_test_fun_~i_ref~0.base_1, ULTIMATE.start_main_#t~ret18=|v_ULTIMATE.start_main_#t~ret18_1|, ULTIMATE.start_test_fun_#t~malloc1.base=|v_ULTIMATE.start_test_fun_#t~malloc1.base_1|, ULTIMATE.start_test_fun_#t~malloc2.base=|v_ULTIMATE.start_test_fun_#t~malloc2.base_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_test_fun_~j_ref~0.base=v_ULTIMATE.start_test_fun_~j_ref~0.base_1, ULTIMATE.start_test_fun_#t~malloc2.offset=|v_ULTIMATE.start_test_fun_#t~malloc2.offset_1|, ULTIMATE.start_test_fun_~k_ref~0.base=v_ULTIMATE.start_test_fun_~k_ref~0.base_1, ULTIMATE.start_test_fun_#t~malloc3.base=|v_ULTIMATE.start_test_fun_#t~malloc3.base_1|, ULTIMATE.start_test_fun_#t~malloc0.base=|v_ULTIMATE.start_test_fun_#t~malloc0.base_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_1|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_1|, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_1|, ULTIMATE.start_test_fun_#t~malloc4.base=|v_ULTIMATE.start_test_fun_#t~malloc4.base_1|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_1} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_~tmp_ref~0.base, ULTIMATE.start_test_fun_~j_ref~0.offset, ULTIMATE.start_test_fun_~tmp_ref~0.offset, ULTIMATE.start_test_fun_#t~mem10, ULTIMATE.start_test_fun_#t~mem11, ULTIMATE.start_test_fun_#t~mem12, ULTIMATE.start_test_fun_#t~mem13, ULTIMATE.start_main_#t~nondet14, ULTIMATE.start_test_fun_~i_ref~0.offset, ULTIMATE.start_test_fun_#t~malloc1.offset, ULTIMATE.start_test_fun_#t~malloc4.offset, ULTIMATE.start_test_fun_#t~mem8, ULTIMATE.start_test_fun_#t~mem9, ULTIMATE.start_test_fun_#t~mem6, ULTIMATE.start_test_fun_~i, ULTIMATE.start_test_fun_#t~mem5, ULTIMATE.start_test_fun_~k_ref~0.offset, ULTIMATE.start_test_fun_#res, #length, ULTIMATE.start_test_fun_#t~malloc3.offset, ULTIMATE.start_test_fun_#in~k, ULTIMATE.start_test_fun_#in~j, ULTIMATE.start_test_fun_#in~i, ULTIMATE.start_test_fun_~k, ULTIMATE.start_test_fun_~j, ULTIMATE.start_test_fun_~tmp, ULTIMATE.start_test_fun_~c~0.offset, ULTIMATE.start_test_fun_#in~tmp, ULTIMATE.start_test_fun_#t~malloc0.offset, ULTIMATE.start_test_fun_#t~short7, ULTIMATE.start_test_fun_~i_ref~0.base, ULTIMATE.start_main_#t~ret18, ULTIMATE.start_test_fun_#t~malloc1.base, ULTIMATE.start_test_fun_#t~malloc2.base, ULTIMATE.start_test_fun_~j_ref~0.base, ULTIMATE.start_test_fun_#t~malloc2.offset, ULTIMATE.start_test_fun_~k_ref~0.base, ULTIMATE.start_test_fun_#t~malloc3.base, ULTIMATE.start_test_fun_#t~malloc0.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_#t~nondet15, ULTIMATE.start_main_#t~nondet16, ULTIMATE.start_main_#t~nondet17, ULTIMATE.start_test_fun_#t~malloc4.base, ULTIMATE.start_test_fun_~c~0.base] 148#L12 [134] L12-->L12-1: Formula: (and (= (select |v_#valid_9| v_ULTIMATE.start_test_fun_~i_ref~0.base_3) 1) (<= 0 v_ULTIMATE.start_test_fun_~i_ref~0.offset_3) (= |v_#memory_int_1| (store |v_#memory_int_2| v_ULTIMATE.start_test_fun_~i_ref~0.base_3 (store (select |v_#memory_int_2| v_ULTIMATE.start_test_fun_~i_ref~0.base_3) v_ULTIMATE.start_test_fun_~i_ref~0.offset_3 v_ULTIMATE.start_test_fun_~i_3))) (<= (+ v_ULTIMATE.start_test_fun_~i_ref~0.offset_3 4) (select |v_#length_7| v_ULTIMATE.start_test_fun_~i_ref~0.base_3))) InVars {ULTIMATE.start_test_fun_~i=v_ULTIMATE.start_test_fun_~i_3, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_2|, #length=|v_#length_7|, ULTIMATE.start_test_fun_~i_ref~0.offset=v_ULTIMATE.start_test_fun_~i_ref~0.offset_3, ULTIMATE.start_test_fun_~i_ref~0.base=v_ULTIMATE.start_test_fun_~i_ref~0.base_3} OutVars{ULTIMATE.start_test_fun_~i=v_ULTIMATE.start_test_fun_~i_3, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_1|, #length=|v_#length_7|, ULTIMATE.start_test_fun_~i_ref~0.offset=v_ULTIMATE.start_test_fun_~i_ref~0.offset_3, ULTIMATE.start_test_fun_~i_ref~0.base=v_ULTIMATE.start_test_fun_~i_ref~0.base_3} AuxVars[] AssignedVars[#memory_int] 151#L12-1 [131] L12-1-->L13: Formula: (and (= 1 (select |v_#valid_11| v_ULTIMATE.start_test_fun_~j_ref~0.base_3)) (<= (+ v_ULTIMATE.start_test_fun_~j_ref~0.offset_3 4) (select |v_#length_9| v_ULTIMATE.start_test_fun_~j_ref~0.base_3)) (<= 0 v_ULTIMATE.start_test_fun_~j_ref~0.offset_3) (= |v_#memory_int_3| (store |v_#memory_int_4| v_ULTIMATE.start_test_fun_~j_ref~0.base_3 (store (select |v_#memory_int_4| v_ULTIMATE.start_test_fun_~j_ref~0.base_3) v_ULTIMATE.start_test_fun_~j_ref~0.offset_3 v_ULTIMATE.start_test_fun_~j_3)))) InVars {ULTIMATE.start_test_fun_~j_ref~0.offset=v_ULTIMATE.start_test_fun_~j_ref~0.offset_3, ULTIMATE.start_test_fun_~j_ref~0.base=v_ULTIMATE.start_test_fun_~j_ref~0.base_3, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_4|, #length=|v_#length_9|, ULTIMATE.start_test_fun_~j=v_ULTIMATE.start_test_fun_~j_3} OutVars{ULTIMATE.start_test_fun_~j_ref~0.offset=v_ULTIMATE.start_test_fun_~j_ref~0.offset_3, ULTIMATE.start_test_fun_~j_ref~0.base=v_ULTIMATE.start_test_fun_~j_ref~0.base_3, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_3|, #length=|v_#length_9|, ULTIMATE.start_test_fun_~j=v_ULTIMATE.start_test_fun_~j_3} AuxVars[] AssignedVars[#memory_int] 152#L13 [155] L13-->L14: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~k_ref~0.offset_3 4) (select |v_#length_11| v_ULTIMATE.start_test_fun_~k_ref~0.base_3)) (= (store |v_#memory_int_6| v_ULTIMATE.start_test_fun_~k_ref~0.base_3 (store (select |v_#memory_int_6| v_ULTIMATE.start_test_fun_~k_ref~0.base_3) v_ULTIMATE.start_test_fun_~k_ref~0.offset_3 v_ULTIMATE.start_test_fun_~k_3)) |v_#memory_int_5|) (<= 0 v_ULTIMATE.start_test_fun_~k_ref~0.offset_3) (= 1 (select |v_#valid_13| v_ULTIMATE.start_test_fun_~k_ref~0.base_3))) InVars {ULTIMATE.start_test_fun_~k_ref~0.offset=v_ULTIMATE.start_test_fun_~k_ref~0.offset_3, ULTIMATE.start_test_fun_~k_ref~0.base=v_ULTIMATE.start_test_fun_~k_ref~0.base_3, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_6|, #length=|v_#length_11|, ULTIMATE.start_test_fun_~k=v_ULTIMATE.start_test_fun_~k_3} OutVars{ULTIMATE.start_test_fun_~k_ref~0.offset=v_ULTIMATE.start_test_fun_~k_ref~0.offset_3, ULTIMATE.start_test_fun_~k_ref~0.base=v_ULTIMATE.start_test_fun_~k_ref~0.base_3, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_5|, #length=|v_#length_11|, ULTIMATE.start_test_fun_~k=v_ULTIMATE.start_test_fun_~k_3} AuxVars[] AssignedVars[#memory_int] 154#L14 [101] L14-->L15: Formula: (and (= 1 (select |v_#valid_15| v_ULTIMATE.start_test_fun_~tmp_ref~0.base_3)) (= (store |v_#memory_int_8| v_ULTIMATE.start_test_fun_~tmp_ref~0.base_3 (store (select |v_#memory_int_8| v_ULTIMATE.start_test_fun_~tmp_ref~0.base_3) v_ULTIMATE.start_test_fun_~tmp_ref~0.offset_3 v_ULTIMATE.start_test_fun_~tmp_3)) |v_#memory_int_7|) (<= 0 v_ULTIMATE.start_test_fun_~tmp_ref~0.offset_3) (<= (+ v_ULTIMATE.start_test_fun_~tmp_ref~0.offset_3 4) (select |v_#length_13| v_ULTIMATE.start_test_fun_~tmp_ref~0.base_3))) InVars {ULTIMATE.start_test_fun_~tmp_ref~0.base=v_ULTIMATE.start_test_fun_~tmp_ref~0.base_3, ULTIMATE.start_test_fun_~tmp=v_ULTIMATE.start_test_fun_~tmp_3, ULTIMATE.start_test_fun_~tmp_ref~0.offset=v_ULTIMATE.start_test_fun_~tmp_ref~0.offset_3, #valid=|v_#valid_15|, #memory_int=|v_#memory_int_8|, #length=|v_#length_13|} OutVars{ULTIMATE.start_test_fun_~tmp_ref~0.base=v_ULTIMATE.start_test_fun_~tmp_ref~0.base_3, ULTIMATE.start_test_fun_~tmp=v_ULTIMATE.start_test_fun_~tmp_3, ULTIMATE.start_test_fun_~tmp_ref~0.offset=v_ULTIMATE.start_test_fun_~tmp_ref~0.offset_3, #valid=|v_#valid_15|, #memory_int=|v_#memory_int_7|, #length=|v_#length_13|} AuxVars[] AssignedVars[#memory_int] 131#L15 [104] L15-->L17-7: Formula: (and (= |v_#memory_int_9| (store |v_#memory_int_10| v_ULTIMATE.start_test_fun_~c~0.base_3 (store (select |v_#memory_int_10| v_ULTIMATE.start_test_fun_~c~0.base_3) v_ULTIMATE.start_test_fun_~c~0.offset_3 0))) (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_3) (= 1 (select |v_#valid_17| v_ULTIMATE.start_test_fun_~c~0.base_3)) (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_3 4) (select |v_#length_15| v_ULTIMATE.start_test_fun_~c~0.base_3))) InVars {#memory_int=|v_#memory_int_10|, #length=|v_#length_15|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_3, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_3, #valid=|v_#valid_17|} OutVars{#memory_int=|v_#memory_int_9|, #length=|v_#length_15|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_3, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_3, #valid=|v_#valid_17|} AuxVars[] AssignedVars[#memory_int] 132#L17-7 250.74/218.80 [2019-03-28 12:43:50,677 INFO L796 eck$LassoCheckResult]: Loop: 132#L17-7 [149] L17-7-->L17: Formula: (and (= (select (select |v_#memory_int_11| v_ULTIMATE.start_test_fun_~i_ref~0.base_6) v_ULTIMATE.start_test_fun_~i_ref~0.offset_5) |v_ULTIMATE.start_test_fun_#t~mem5_2|) (<= (+ v_ULTIMATE.start_test_fun_~i_ref~0.offset_5 4) (select |v_#length_17| v_ULTIMATE.start_test_fun_~i_ref~0.base_6)) (= 1 (select |v_#valid_19| v_ULTIMATE.start_test_fun_~i_ref~0.base_6)) (<= 0 v_ULTIMATE.start_test_fun_~i_ref~0.offset_5)) InVars {#memory_int=|v_#memory_int_11|, #length=|v_#length_17|, ULTIMATE.start_test_fun_~i_ref~0.offset=v_ULTIMATE.start_test_fun_~i_ref~0.offset_5, ULTIMATE.start_test_fun_~i_ref~0.base=v_ULTIMATE.start_test_fun_~i_ref~0.base_6, #valid=|v_#valid_19|} OutVars{ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_2|, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_11|, #length=|v_#length_17|, ULTIMATE.start_test_fun_~i_ref~0.offset=v_ULTIMATE.start_test_fun_~i_ref~0.offset_5, ULTIMATE.start_test_fun_~i_ref~0.base=v_ULTIMATE.start_test_fun_~i_ref~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem5] 136#L17 [260] L17-->L17-1: Formula: (and (not |v_ULTIMATE.start_test_fun_#t~short7_2|) (> |v_ULTIMATE.start_test_fun_#t~mem5_3| 100)) InVars {ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_3|} OutVars{ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_3|, ULTIMATE.start_test_fun_#t~short7=|v_ULTIMATE.start_test_fun_#t~short7_2|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~short7] 137#L17-1 [141] L17-1-->L17-5: Formula: (not |v_ULTIMATE.start_test_fun_#t~short7_5|) InVars {ULTIMATE.start_test_fun_#t~short7=|v_ULTIMATE.start_test_fun_#t~short7_5|} OutVars{ULTIMATE.start_test_fun_#t~short7=|v_ULTIMATE.start_test_fun_#t~short7_5|} AuxVars[] AssignedVars[] 153#L17-5 [153] L17-5-->L18: Formula: |v_ULTIMATE.start_test_fun_#t~short7_9| InVars {ULTIMATE.start_test_fun_#t~short7=|v_ULTIMATE.start_test_fun_#t~short7_9|} OutVars{ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_5|, ULTIMATE.start_test_fun_#t~short7=|v_ULTIMATE.start_test_fun_#t~short7_8|, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem5, ULTIMATE.start_test_fun_#t~short7, ULTIMATE.start_test_fun_#t~mem6] 140#L18 [92] L18-->L18-1: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~i_ref~0.offset_7) (<= (+ v_ULTIMATE.start_test_fun_~i_ref~0.offset_7 4) (select |v_#length_21| v_ULTIMATE.start_test_fun_~i_ref~0.base_9)) (= (select |v_#valid_23| v_ULTIMATE.start_test_fun_~i_ref~0.base_9) 1) (= (select (select |v_#memory_int_13| v_ULTIMATE.start_test_fun_~i_ref~0.base_9) v_ULTIMATE.start_test_fun_~i_ref~0.offset_7) |v_ULTIMATE.start_test_fun_#t~mem8_2|)) InVars {#memory_int=|v_#memory_int_13|, #length=|v_#length_21|, ULTIMATE.start_test_fun_~i_ref~0.offset=v_ULTIMATE.start_test_fun_~i_ref~0.offset_7, ULTIMATE.start_test_fun_~i_ref~0.base=v_ULTIMATE.start_test_fun_~i_ref~0.base_9, #valid=|v_#valid_23|} OutVars{#valid=|v_#valid_23|, #memory_int=|v_#memory_int_13|, #length=|v_#length_21|, ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_2|, ULTIMATE.start_test_fun_~i_ref~0.offset=v_ULTIMATE.start_test_fun_~i_ref~0.offset_7, ULTIMATE.start_test_fun_~i_ref~0.base=v_ULTIMATE.start_test_fun_~i_ref~0.base_9} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem8] 138#L18-1 [309] L18-1-->L19: Formula: (and (= 1 (select |v_#valid_55| v_ULTIMATE.start_test_fun_~tmp_ref~0.base_12)) (<= 0 v_ULTIMATE.start_test_fun_~tmp_ref~0.offset_9) (<= (+ v_ULTIMATE.start_test_fun_~tmp_ref~0.offset_9 4) (select |v_#length_45| v_ULTIMATE.start_test_fun_~tmp_ref~0.base_12)) (= (store |v_#memory_int_32| v_ULTIMATE.start_test_fun_~tmp_ref~0.base_12 (store (select |v_#memory_int_32| v_ULTIMATE.start_test_fun_~tmp_ref~0.base_12) v_ULTIMATE.start_test_fun_~tmp_ref~0.offset_9 |v_ULTIMATE.start_test_fun_#t~mem8_6|)) |v_#memory_int_31|)) InVars {ULTIMATE.start_test_fun_~tmp_ref~0.base=v_ULTIMATE.start_test_fun_~tmp_ref~0.base_12, ULTIMATE.start_test_fun_~tmp_ref~0.offset=v_ULTIMATE.start_test_fun_~tmp_ref~0.offset_9, #valid=|v_#valid_55|, #memory_int=|v_#memory_int_32|, #length=|v_#length_45|, ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_6|} OutVars{ULTIMATE.start_test_fun_~tmp_ref~0.base=v_ULTIMATE.start_test_fun_~tmp_ref~0.base_12, ULTIMATE.start_test_fun_~tmp_ref~0.offset=v_ULTIMATE.start_test_fun_~tmp_ref~0.offset_9, #valid=|v_#valid_55|, #memory_int=|v_#memory_int_31|, #length=|v_#length_45|, ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_5|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_test_fun_#t~mem8] 139#L19 [111] L19-->L19-1: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~j_ref~0.offset_7) (= (select |v_#valid_27| v_ULTIMATE.start_test_fun_~j_ref~0.base_9) 1) (= (select (select |v_#memory_int_16| v_ULTIMATE.start_test_fun_~j_ref~0.base_9) v_ULTIMATE.start_test_fun_~j_ref~0.offset_7) |v_ULTIMATE.start_test_fun_#t~mem9_2|) (<= (+ v_ULTIMATE.start_test_fun_~j_ref~0.offset_7 4) (select |v_#length_25| v_ULTIMATE.start_test_fun_~j_ref~0.base_9))) InVars {#memory_int=|v_#memory_int_16|, ULTIMATE.start_test_fun_~j_ref~0.offset=v_ULTIMATE.start_test_fun_~j_ref~0.offset_7, #length=|v_#length_25|, ULTIMATE.start_test_fun_~j_ref~0.base=v_ULTIMATE.start_test_fun_~j_ref~0.base_9, #valid=|v_#valid_27|} OutVars{ULTIMATE.start_test_fun_~j_ref~0.offset=v_ULTIMATE.start_test_fun_~j_ref~0.offset_7, ULTIMATE.start_test_fun_~j_ref~0.base=v_ULTIMATE.start_test_fun_~j_ref~0.base_9, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_16|, #length=|v_#length_25|, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_2|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem9] 141#L19-1 [312] L19-1-->L20: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~i_ref~0.offset_11) (= (store |v_#memory_int_36| v_ULTIMATE.start_test_fun_~i_ref~0.base_15 (store (select |v_#memory_int_36| v_ULTIMATE.start_test_fun_~i_ref~0.base_15) v_ULTIMATE.start_test_fun_~i_ref~0.offset_11 |v_ULTIMATE.start_test_fun_#t~mem9_6|)) |v_#memory_int_35|) (= 1 (select |v_#valid_60| v_ULTIMATE.start_test_fun_~i_ref~0.base_15)) (<= (+ v_ULTIMATE.start_test_fun_~i_ref~0.offset_11 4) (select |v_#length_48| v_ULTIMATE.start_test_fun_~i_ref~0.base_15))) InVars {#valid=|v_#valid_60|, #memory_int=|v_#memory_int_36|, #length=|v_#length_48|, ULTIMATE.start_test_fun_~i_ref~0.offset=v_ULTIMATE.start_test_fun_~i_ref~0.offset_11, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_6|, ULTIMATE.start_test_fun_~i_ref~0.base=v_ULTIMATE.start_test_fun_~i_ref~0.base_15} OutVars{#valid=|v_#valid_60|, #memory_int=|v_#memory_int_35|, #length=|v_#length_48|, ULTIMATE.start_test_fun_~i_ref~0.offset=v_ULTIMATE.start_test_fun_~i_ref~0.offset_11, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_5|, ULTIMATE.start_test_fun_~i_ref~0.base=v_ULTIMATE.start_test_fun_~i_ref~0.base_15} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_test_fun_#t~mem9] 142#L20 [128] L20-->L20-1: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem10_2| (select (select |v_#memory_int_19| v_ULTIMATE.start_test_fun_~tmp_ref~0.base_9) v_ULTIMATE.start_test_fun_~tmp_ref~0.offset_7)) (<= 0 v_ULTIMATE.start_test_fun_~tmp_ref~0.offset_7) (= (select |v_#valid_31| v_ULTIMATE.start_test_fun_~tmp_ref~0.base_9) 1) (<= (+ v_ULTIMATE.start_test_fun_~tmp_ref~0.offset_7 4) (select |v_#length_29| v_ULTIMATE.start_test_fun_~tmp_ref~0.base_9))) InVars {ULTIMATE.start_test_fun_~tmp_ref~0.base=v_ULTIMATE.start_test_fun_~tmp_ref~0.base_9, #memory_int=|v_#memory_int_19|, #length=|v_#length_29|, ULTIMATE.start_test_fun_~tmp_ref~0.offset=v_ULTIMATE.start_test_fun_~tmp_ref~0.offset_7, #valid=|v_#valid_31|} OutVars{ULTIMATE.start_test_fun_~tmp_ref~0.base=v_ULTIMATE.start_test_fun_~tmp_ref~0.base_9, ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_2|, ULTIMATE.start_test_fun_~tmp_ref~0.offset=v_ULTIMATE.start_test_fun_~tmp_ref~0.offset_7, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_19|, #length=|v_#length_29|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem10] 143#L20-1 [313] L20-1-->L21: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~j_ref~0.offset_11 4) (select |v_#length_49| v_ULTIMATE.start_test_fun_~j_ref~0.base_15)) (= 1 (select |v_#valid_61| v_ULTIMATE.start_test_fun_~j_ref~0.base_15)) (= (store |v_#memory_int_38| v_ULTIMATE.start_test_fun_~j_ref~0.base_15 (store (select |v_#memory_int_38| v_ULTIMATE.start_test_fun_~j_ref~0.base_15) v_ULTIMATE.start_test_fun_~j_ref~0.offset_11 (+ |v_ULTIMATE.start_test_fun_#t~mem10_6| 1))) |v_#memory_int_37|) (<= 0 v_ULTIMATE.start_test_fun_~j_ref~0.offset_11)) InVars {ULTIMATE.start_test_fun_~j_ref~0.offset=v_ULTIMATE.start_test_fun_~j_ref~0.offset_11, ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_6|, ULTIMATE.start_test_fun_~j_ref~0.base=v_ULTIMATE.start_test_fun_~j_ref~0.base_15, #valid=|v_#valid_61|, #memory_int=|v_#memory_int_38|, #length=|v_#length_49|} OutVars{ULTIMATE.start_test_fun_~j_ref~0.offset=v_ULTIMATE.start_test_fun_~j_ref~0.offset_11, ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_5|, ULTIMATE.start_test_fun_~j_ref~0.base=v_ULTIMATE.start_test_fun_~j_ref~0.base_15, #valid=|v_#valid_61|, #memory_int=|v_#memory_int_37|, #length=|v_#length_49|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem10, #memory_int] 144#L21 [97] L21-->L21-1: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~k_ref~0.offset_5) (= (select |v_#valid_35| v_ULTIMATE.start_test_fun_~k_ref~0.base_6) 1) (= (select (select |v_#memory_int_22| v_ULTIMATE.start_test_fun_~k_ref~0.base_6) v_ULTIMATE.start_test_fun_~k_ref~0.offset_5) |v_ULTIMATE.start_test_fun_#t~mem11_2|) (<= (+ v_ULTIMATE.start_test_fun_~k_ref~0.offset_5 4) (select |v_#length_33| v_ULTIMATE.start_test_fun_~k_ref~0.base_6))) InVars {#memory_int=|v_#memory_int_22|, ULTIMATE.start_test_fun_~k_ref~0.offset=v_ULTIMATE.start_test_fun_~k_ref~0.offset_5, #length=|v_#length_33|, ULTIMATE.start_test_fun_~k_ref~0.base=v_ULTIMATE.start_test_fun_~k_ref~0.base_6, #valid=|v_#valid_35|} OutVars{ULTIMATE.start_test_fun_~k_ref~0.offset=v_ULTIMATE.start_test_fun_~k_ref~0.offset_5, ULTIMATE.start_test_fun_#t~mem11=|v_ULTIMATE.start_test_fun_#t~mem11_2|, ULTIMATE.start_test_fun_~k_ref~0.base=v_ULTIMATE.start_test_fun_~k_ref~0.base_6, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_22|, #length=|v_#length_33|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem11] 145#L21-1 [314] L21-1-->L22: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~k_ref~0.offset_9) (<= (+ v_ULTIMATE.start_test_fun_~k_ref~0.offset_9 4) (select |v_#length_50| v_ULTIMATE.start_test_fun_~k_ref~0.base_12)) (= (store |v_#memory_int_40| v_ULTIMATE.start_test_fun_~k_ref~0.base_12 (store (select |v_#memory_int_40| v_ULTIMATE.start_test_fun_~k_ref~0.base_12) v_ULTIMATE.start_test_fun_~k_ref~0.offset_9 (+ |v_ULTIMATE.start_test_fun_#t~mem11_6| (- 1)))) |v_#memory_int_39|) (= 1 (select |v_#valid_62| v_ULTIMATE.start_test_fun_~k_ref~0.base_12))) InVars {ULTIMATE.start_test_fun_~k_ref~0.offset=v_ULTIMATE.start_test_fun_~k_ref~0.offset_9, ULTIMATE.start_test_fun_#t~mem11=|v_ULTIMATE.start_test_fun_#t~mem11_6|, ULTIMATE.start_test_fun_~k_ref~0.base=v_ULTIMATE.start_test_fun_~k_ref~0.base_12, #valid=|v_#valid_62|, #memory_int=|v_#memory_int_40|, #length=|v_#length_50|} OutVars{ULTIMATE.start_test_fun_~k_ref~0.offset=v_ULTIMATE.start_test_fun_~k_ref~0.offset_9, ULTIMATE.start_test_fun_#t~mem11=|v_ULTIMATE.start_test_fun_#t~mem11_5|, ULTIMATE.start_test_fun_~k_ref~0.base=v_ULTIMATE.start_test_fun_~k_ref~0.base_12, #valid=|v_#valid_62|, #memory_int=|v_#memory_int_39|, #length=|v_#length_50|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem11, #memory_int] 146#L22 [118] L22-->L22-1: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem12_2| (select (select |v_#memory_int_25| v_ULTIMATE.start_test_fun_~c~0.base_6) v_ULTIMATE.start_test_fun_~c~0.offset_5)) (= 1 (select |v_#valid_39| v_ULTIMATE.start_test_fun_~c~0.base_6)) (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_5) (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_5 4) (select |v_#length_37| v_ULTIMATE.start_test_fun_~c~0.base_6))) InVars {#memory_int=|v_#memory_int_25|, #length=|v_#length_37|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_5, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_6, #valid=|v_#valid_39|} OutVars{ULTIMATE.start_test_fun_#t~mem12=|v_ULTIMATE.start_test_fun_#t~mem12_2|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_5, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_25|, #length=|v_#length_37|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem12] 149#L22-1 [315] L22-1-->L17-7: Formula: (and (= (store |v_#memory_int_42| v_ULTIMATE.start_test_fun_~c~0.base_19 (store (select |v_#memory_int_42| v_ULTIMATE.start_test_fun_~c~0.base_19) v_ULTIMATE.start_test_fun_~c~0.offset_15 (+ |v_ULTIMATE.start_test_fun_#t~mem12_6| 1))) |v_#memory_int_41|) (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_15 4) (select |v_#length_51| v_ULTIMATE.start_test_fun_~c~0.base_19)) (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_15) (= 1 (select |v_#valid_63| v_ULTIMATE.start_test_fun_~c~0.base_19))) InVars {ULTIMATE.start_test_fun_#t~mem12=|v_ULTIMATE.start_test_fun_#t~mem12_6|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_15, #valid=|v_#valid_63|, #memory_int=|v_#memory_int_42|, #length=|v_#length_51|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_19} OutVars{ULTIMATE.start_test_fun_#t~mem12=|v_ULTIMATE.start_test_fun_#t~mem12_5|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_15, #valid=|v_#valid_63|, #memory_int=|v_#memory_int_41|, #length=|v_#length_51|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_19} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem12, #memory_int] 132#L17-7 250.74/218.80 [2019-03-28 12:43:50,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 250.74/218.80 [2019-03-28 12:43:50,677 INFO L82 PathProgramCache]: Analyzing trace with hash 624102671, now seen corresponding path program 2 times 250.74/218.80 [2019-03-28 12:43:50,678 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 250.74/218.80 [2019-03-28 12:43:50,678 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 250.74/218.80 [2019-03-28 12:43:50,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 250.74/218.80 [2019-03-28 12:43:50,679 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 250.74/218.80 [2019-03-28 12:43:50,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 250.74/218.80 [2019-03-28 12:43:50,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 250.74/218.80 [2019-03-28 12:43:50,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 250.74/218.80 [2019-03-28 12:43:50,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 250.74/218.80 [2019-03-28 12:43:50,709 INFO L82 PathProgramCache]: Analyzing trace with hash 1989961525, now seen corresponding path program 1 times 250.74/218.80 [2019-03-28 12:43:50,709 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 250.74/218.80 [2019-03-28 12:43:50,710 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 250.74/218.80 [2019-03-28 12:43:50,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 250.74/218.80 [2019-03-28 12:43:50,710 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 250.74/218.80 [2019-03-28 12:43:50,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 250.74/218.80 [2019-03-28 12:43:50,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 250.74/218.80 [2019-03-28 12:43:50,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 250.74/218.80 [2019-03-28 12:43:50,724 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. 250.74/218.80 [2019-03-28 12:43:50,725 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 250.74/218.80 [2019-03-28 12:43:50,725 INFO L811 eck$LassoCheckResult]: loop already infeasible 250.74/218.80 [2019-03-28 12:43:50,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. 250.74/218.80 [2019-03-28 12:43:50,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 250.74/218.80 [2019-03-28 12:43:50,726 INFO L87 Difference]: Start difference. First operand 24 states and 58 transitions. cyclomatic complexity: 35 Second operand 3 states. 250.74/218.80 [2019-03-28 12:43:50,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. 250.74/218.80 [2019-03-28 12:43:50,866 INFO L93 Difference]: Finished difference Result 25 states and 57 transitions. 250.74/218.80 [2019-03-28 12:43:50,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 250.74/218.80 [2019-03-28 12:43:50,867 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 57 transitions. 250.74/218.80 [2019-03-28 12:43:50,868 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 250.74/218.80 [2019-03-28 12:43:50,868 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 23 states and 54 transitions. 250.74/218.80 [2019-03-28 12:43:50,869 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 250.74/218.80 [2019-03-28 12:43:50,869 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 250.74/218.80 [2019-03-28 12:43:50,869 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 54 transitions. 250.74/218.80 [2019-03-28 12:43:50,869 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. 250.74/218.80 [2019-03-28 12:43:50,869 INFO L706 BuchiCegarLoop]: Abstraction has 23 states and 54 transitions. 250.74/218.80 [2019-03-28 12:43:50,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 54 transitions. 250.74/218.80 [2019-03-28 12:43:50,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. 250.74/218.80 [2019-03-28 12:43:50,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. 250.74/218.80 [2019-03-28 12:43:50,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 54 transitions. 250.74/218.80 [2019-03-28 12:43:50,871 INFO L729 BuchiCegarLoop]: Abstraction has 23 states and 54 transitions. 250.74/218.80 [2019-03-28 12:43:50,871 INFO L609 BuchiCegarLoop]: Abstraction has 23 states and 54 transitions. 250.74/218.80 [2019-03-28 12:43:50,871 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ 250.74/218.80 [2019-03-28 12:43:50,871 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 54 transitions. 250.74/218.80 [2019-03-28 12:43:50,872 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 250.74/218.80 [2019-03-28 12:43:50,872 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false 250.74/218.80 [2019-03-28 12:43:50,872 INFO L119 BuchiIsEmpty]: Starting construction of run 250.74/218.80 [2019-03-28 12:43:50,873 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] 250.74/218.80 [2019-03-28 12:43:50,873 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] 250.74/218.80 [2019-03-28 12:43:50,874 INFO L794 eck$LassoCheckResult]: Stem: 204#ULTIMATE.startENTRY [117] 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] 201#L-1 [230] L-1-->L12: Formula: (let ((.cse3 (store |v_#valid_8| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 1))) (let ((.cse0 (store .cse3 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 1))) (let ((.cse2 (store .cse0 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1| 1))) (let ((.cse1 (store .cse2 |v_ULTIMATE.start_test_fun_#t~malloc3.base_1| 1))) (and (= (select |v_#valid_8| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1|) 0) (= v_ULTIMATE.start_test_fun_~i_ref~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc0.offset_1|) (< |v_ULTIMATE.start_test_fun_#t~malloc2.base_1| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_test_fun_#t~malloc3.offset_1| 0) (= v_ULTIMATE.start_test_fun_~c~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc4.offset_1|) (= |v_ULTIMATE.start_test_fun_#t~malloc0.offset_1| 0) (= |v_ULTIMATE.start_test_fun_#t~malloc1.offset_1| 0) (> |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 0) (> |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 0) (< |v_ULTIMATE.start_test_fun_#t~malloc3.base_1| |v_#StackHeapBarrier_1|) (< 0 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|) (= 0 (select .cse0 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|)) (= v_ULTIMATE.start_test_fun_~k_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|) (= v_ULTIMATE.start_test_fun_~k_1 |v_ULTIMATE.start_test_fun_#in~k_1|) (= (select .cse1 |v_ULTIMATE.start_test_fun_#t~malloc4.base_1|) 0) (= |v_ULTIMATE.start_test_fun_#t~malloc4.offset_1| 0) (= (select .cse2 |v_ULTIMATE.start_test_fun_#t~malloc3.base_1|) 0) (= (select .cse3 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|) 0) (= |v_ULTIMATE.start_test_fun_#in~k_1| |v_ULTIMATE.start_main_#t~nondet16_1|) (< |v_ULTIMATE.start_test_fun_#t~malloc3.base_1| 0) (= v_ULTIMATE.start_test_fun_~i_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc0.base_1|) (= v_ULTIMATE.start_test_fun_~tmp_ref~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc3.offset_1|) (< |v_ULTIMATE.start_test_fun_#t~malloc4.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_test_fun_~k_ref~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc2.offset_1|) (= |v_ULTIMATE.start_test_fun_#in~i_1| |v_ULTIMATE.start_main_#t~nondet14_1|) (= |v_ULTIMATE.start_test_fun_#in~j_1| |v_ULTIMATE.start_main_#t~nondet15_1|) (< |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| |v_#StackHeapBarrier_1|) (= (store .cse1 |v_ULTIMATE.start_test_fun_#t~malloc4.base_1| 1) |v_#valid_3|) (= (store (store (store (store (store |v_#length_6| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 4) |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 4) |v_ULTIMATE.start_test_fun_#t~malloc2.base_1| 4) |v_ULTIMATE.start_test_fun_#t~malloc3.base_1| 4) |v_ULTIMATE.start_test_fun_#t~malloc4.base_1| 4) |v_#length_1|) (= v_ULTIMATE.start_test_fun_~tmp_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc3.base_1|) (= |v_ULTIMATE.start_test_fun_#in~tmp_1| |v_ULTIMATE.start_main_#t~nondet17_1|) (> 0 |v_ULTIMATE.start_test_fun_#t~malloc4.base_1|) (= v_ULTIMATE.start_test_fun_~c~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc4.base_1|) (= v_ULTIMATE.start_test_fun_~j_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|) (= v_ULTIMATE.start_test_fun_~tmp_1 |v_ULTIMATE.start_test_fun_#in~tmp_1|) (= v_ULTIMATE.start_test_fun_~j_ref~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc1.offset_1|) (= |v_ULTIMATE.start_test_fun_#t~malloc2.offset_1| 0) (= v_ULTIMATE.start_test_fun_~j_1 |v_ULTIMATE.start_test_fun_#in~j_1|) (< |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| |v_#StackHeapBarrier_1|) (= v_ULTIMATE.start_test_fun_~i_1 |v_ULTIMATE.start_test_fun_#in~i_1|)))))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_6|, #valid=|v_#valid_8|} OutVars{ULTIMATE.start_test_fun_~tmp_ref~0.base=v_ULTIMATE.start_test_fun_~tmp_ref~0.base_1, ULTIMATE.start_test_fun_~j_ref~0.offset=v_ULTIMATE.start_test_fun_~j_ref~0.offset_1, ULTIMATE.start_test_fun_~tmp_ref~0.offset=v_ULTIMATE.start_test_fun_~tmp_ref~0.offset_1, ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_1|, ULTIMATE.start_test_fun_#t~mem11=|v_ULTIMATE.start_test_fun_#t~mem11_1|, ULTIMATE.start_test_fun_#t~mem12=|v_ULTIMATE.start_test_fun_#t~mem12_1|, ULTIMATE.start_test_fun_#t~mem13=|v_ULTIMATE.start_test_fun_#t~mem13_1|, ULTIMATE.start_main_#t~nondet14=|v_ULTIMATE.start_main_#t~nondet14_1|, ULTIMATE.start_test_fun_~i_ref~0.offset=v_ULTIMATE.start_test_fun_~i_ref~0.offset_1, ULTIMATE.start_test_fun_#t~malloc1.offset=|v_ULTIMATE.start_test_fun_#t~malloc1.offset_1|, ULTIMATE.start_test_fun_#t~malloc4.offset=|v_ULTIMATE.start_test_fun_#t~malloc4.offset_1|, ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_1|, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_1|, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_1|, ULTIMATE.start_test_fun_~i=v_ULTIMATE.start_test_fun_~i_1, ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_1|, ULTIMATE.start_test_fun_~k_ref~0.offset=v_ULTIMATE.start_test_fun_~k_ref~0.offset_1, ULTIMATE.start_test_fun_#res=|v_ULTIMATE.start_test_fun_#res_1|, #length=|v_#length_1|, ULTIMATE.start_test_fun_#t~malloc3.offset=|v_ULTIMATE.start_test_fun_#t~malloc3.offset_1|, ULTIMATE.start_test_fun_#in~k=|v_ULTIMATE.start_test_fun_#in~k_1|, ULTIMATE.start_test_fun_#in~j=|v_ULTIMATE.start_test_fun_#in~j_1|, ULTIMATE.start_test_fun_#in~i=|v_ULTIMATE.start_test_fun_#in~i_1|, ULTIMATE.start_test_fun_~k=v_ULTIMATE.start_test_fun_~k_1, ULTIMATE.start_test_fun_~j=v_ULTIMATE.start_test_fun_~j_1, ULTIMATE.start_test_fun_~tmp=v_ULTIMATE.start_test_fun_~tmp_1, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_1, ULTIMATE.start_test_fun_#in~tmp=|v_ULTIMATE.start_test_fun_#in~tmp_1|, ULTIMATE.start_test_fun_#t~malloc0.offset=|v_ULTIMATE.start_test_fun_#t~malloc0.offset_1|, ULTIMATE.start_test_fun_#t~short7=|v_ULTIMATE.start_test_fun_#t~short7_1|, ULTIMATE.start_test_fun_~i_ref~0.base=v_ULTIMATE.start_test_fun_~i_ref~0.base_1, ULTIMATE.start_main_#t~ret18=|v_ULTIMATE.start_main_#t~ret18_1|, ULTIMATE.start_test_fun_#t~malloc1.base=|v_ULTIMATE.start_test_fun_#t~malloc1.base_1|, ULTIMATE.start_test_fun_#t~malloc2.base=|v_ULTIMATE.start_test_fun_#t~malloc2.base_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_test_fun_~j_ref~0.base=v_ULTIMATE.start_test_fun_~j_ref~0.base_1, ULTIMATE.start_test_fun_#t~malloc2.offset=|v_ULTIMATE.start_test_fun_#t~malloc2.offset_1|, ULTIMATE.start_test_fun_~k_ref~0.base=v_ULTIMATE.start_test_fun_~k_ref~0.base_1, ULTIMATE.start_test_fun_#t~malloc3.base=|v_ULTIMATE.start_test_fun_#t~malloc3.base_1|, ULTIMATE.start_test_fun_#t~malloc0.base=|v_ULTIMATE.start_test_fun_#t~malloc0.base_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_1|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_1|, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_1|, ULTIMATE.start_test_fun_#t~malloc4.base=|v_ULTIMATE.start_test_fun_#t~malloc4.base_1|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_1} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_~tmp_ref~0.base, ULTIMATE.start_test_fun_~j_ref~0.offset, ULTIMATE.start_test_fun_~tmp_ref~0.offset, ULTIMATE.start_test_fun_#t~mem10, ULTIMATE.start_test_fun_#t~mem11, ULTIMATE.start_test_fun_#t~mem12, ULTIMATE.start_test_fun_#t~mem13, ULTIMATE.start_main_#t~nondet14, ULTIMATE.start_test_fun_~i_ref~0.offset, ULTIMATE.start_test_fun_#t~malloc1.offset, ULTIMATE.start_test_fun_#t~malloc4.offset, ULTIMATE.start_test_fun_#t~mem8, ULTIMATE.start_test_fun_#t~mem9, ULTIMATE.start_test_fun_#t~mem6, ULTIMATE.start_test_fun_~i, ULTIMATE.start_test_fun_#t~mem5, ULTIMATE.start_test_fun_~k_ref~0.offset, ULTIMATE.start_test_fun_#res, #length, ULTIMATE.start_test_fun_#t~malloc3.offset, ULTIMATE.start_test_fun_#in~k, ULTIMATE.start_test_fun_#in~j, ULTIMATE.start_test_fun_#in~i, ULTIMATE.start_test_fun_~k, ULTIMATE.start_test_fun_~j, ULTIMATE.start_test_fun_~tmp, ULTIMATE.start_test_fun_~c~0.offset, ULTIMATE.start_test_fun_#in~tmp, ULTIMATE.start_test_fun_#t~malloc0.offset, ULTIMATE.start_test_fun_#t~short7, ULTIMATE.start_test_fun_~i_ref~0.base, ULTIMATE.start_main_#t~ret18, ULTIMATE.start_test_fun_#t~malloc1.base, ULTIMATE.start_test_fun_#t~malloc2.base, ULTIMATE.start_test_fun_~j_ref~0.base, ULTIMATE.start_test_fun_#t~malloc2.offset, ULTIMATE.start_test_fun_~k_ref~0.base, ULTIMATE.start_test_fun_#t~malloc3.base, ULTIMATE.start_test_fun_#t~malloc0.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_#t~nondet15, ULTIMATE.start_main_#t~nondet16, ULTIMATE.start_main_#t~nondet17, ULTIMATE.start_test_fun_#t~malloc4.base, ULTIMATE.start_test_fun_~c~0.base] 202#L12 [134] L12-->L12-1: Formula: (and (= (select |v_#valid_9| v_ULTIMATE.start_test_fun_~i_ref~0.base_3) 1) (<= 0 v_ULTIMATE.start_test_fun_~i_ref~0.offset_3) (= |v_#memory_int_1| (store |v_#memory_int_2| v_ULTIMATE.start_test_fun_~i_ref~0.base_3 (store (select |v_#memory_int_2| v_ULTIMATE.start_test_fun_~i_ref~0.base_3) v_ULTIMATE.start_test_fun_~i_ref~0.offset_3 v_ULTIMATE.start_test_fun_~i_3))) (<= (+ v_ULTIMATE.start_test_fun_~i_ref~0.offset_3 4) (select |v_#length_7| v_ULTIMATE.start_test_fun_~i_ref~0.base_3))) InVars {ULTIMATE.start_test_fun_~i=v_ULTIMATE.start_test_fun_~i_3, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_2|, #length=|v_#length_7|, ULTIMATE.start_test_fun_~i_ref~0.offset=v_ULTIMATE.start_test_fun_~i_ref~0.offset_3, ULTIMATE.start_test_fun_~i_ref~0.base=v_ULTIMATE.start_test_fun_~i_ref~0.base_3} OutVars{ULTIMATE.start_test_fun_~i=v_ULTIMATE.start_test_fun_~i_3, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_1|, #length=|v_#length_7|, ULTIMATE.start_test_fun_~i_ref~0.offset=v_ULTIMATE.start_test_fun_~i_ref~0.offset_3, ULTIMATE.start_test_fun_~i_ref~0.base=v_ULTIMATE.start_test_fun_~i_ref~0.base_3} AuxVars[] AssignedVars[#memory_int] 205#L12-1 [131] L12-1-->L13: Formula: (and (= 1 (select |v_#valid_11| v_ULTIMATE.start_test_fun_~j_ref~0.base_3)) (<= (+ v_ULTIMATE.start_test_fun_~j_ref~0.offset_3 4) (select |v_#length_9| v_ULTIMATE.start_test_fun_~j_ref~0.base_3)) (<= 0 v_ULTIMATE.start_test_fun_~j_ref~0.offset_3) (= |v_#memory_int_3| (store |v_#memory_int_4| v_ULTIMATE.start_test_fun_~j_ref~0.base_3 (store (select |v_#memory_int_4| v_ULTIMATE.start_test_fun_~j_ref~0.base_3) v_ULTIMATE.start_test_fun_~j_ref~0.offset_3 v_ULTIMATE.start_test_fun_~j_3)))) InVars {ULTIMATE.start_test_fun_~j_ref~0.offset=v_ULTIMATE.start_test_fun_~j_ref~0.offset_3, ULTIMATE.start_test_fun_~j_ref~0.base=v_ULTIMATE.start_test_fun_~j_ref~0.base_3, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_4|, #length=|v_#length_9|, ULTIMATE.start_test_fun_~j=v_ULTIMATE.start_test_fun_~j_3} OutVars{ULTIMATE.start_test_fun_~j_ref~0.offset=v_ULTIMATE.start_test_fun_~j_ref~0.offset_3, ULTIMATE.start_test_fun_~j_ref~0.base=v_ULTIMATE.start_test_fun_~j_ref~0.base_3, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_3|, #length=|v_#length_9|, ULTIMATE.start_test_fun_~j=v_ULTIMATE.start_test_fun_~j_3} AuxVars[] AssignedVars[#memory_int] 206#L13 [155] L13-->L14: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~k_ref~0.offset_3 4) (select |v_#length_11| v_ULTIMATE.start_test_fun_~k_ref~0.base_3)) (= (store |v_#memory_int_6| v_ULTIMATE.start_test_fun_~k_ref~0.base_3 (store (select |v_#memory_int_6| v_ULTIMATE.start_test_fun_~k_ref~0.base_3) v_ULTIMATE.start_test_fun_~k_ref~0.offset_3 v_ULTIMATE.start_test_fun_~k_3)) |v_#memory_int_5|) (<= 0 v_ULTIMATE.start_test_fun_~k_ref~0.offset_3) (= 1 (select |v_#valid_13| v_ULTIMATE.start_test_fun_~k_ref~0.base_3))) InVars {ULTIMATE.start_test_fun_~k_ref~0.offset=v_ULTIMATE.start_test_fun_~k_ref~0.offset_3, ULTIMATE.start_test_fun_~k_ref~0.base=v_ULTIMATE.start_test_fun_~k_ref~0.base_3, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_6|, #length=|v_#length_11|, ULTIMATE.start_test_fun_~k=v_ULTIMATE.start_test_fun_~k_3} OutVars{ULTIMATE.start_test_fun_~k_ref~0.offset=v_ULTIMATE.start_test_fun_~k_ref~0.offset_3, ULTIMATE.start_test_fun_~k_ref~0.base=v_ULTIMATE.start_test_fun_~k_ref~0.base_3, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_5|, #length=|v_#length_11|, ULTIMATE.start_test_fun_~k=v_ULTIMATE.start_test_fun_~k_3} AuxVars[] AssignedVars[#memory_int] 208#L14 [101] L14-->L15: Formula: (and (= 1 (select |v_#valid_15| v_ULTIMATE.start_test_fun_~tmp_ref~0.base_3)) (= (store |v_#memory_int_8| v_ULTIMATE.start_test_fun_~tmp_ref~0.base_3 (store (select |v_#memory_int_8| v_ULTIMATE.start_test_fun_~tmp_ref~0.base_3) v_ULTIMATE.start_test_fun_~tmp_ref~0.offset_3 v_ULTIMATE.start_test_fun_~tmp_3)) |v_#memory_int_7|) (<= 0 v_ULTIMATE.start_test_fun_~tmp_ref~0.offset_3) (<= (+ v_ULTIMATE.start_test_fun_~tmp_ref~0.offset_3 4) (select |v_#length_13| v_ULTIMATE.start_test_fun_~tmp_ref~0.base_3))) InVars {ULTIMATE.start_test_fun_~tmp_ref~0.base=v_ULTIMATE.start_test_fun_~tmp_ref~0.base_3, ULTIMATE.start_test_fun_~tmp=v_ULTIMATE.start_test_fun_~tmp_3, ULTIMATE.start_test_fun_~tmp_ref~0.offset=v_ULTIMATE.start_test_fun_~tmp_ref~0.offset_3, #valid=|v_#valid_15|, #memory_int=|v_#memory_int_8|, #length=|v_#length_13|} OutVars{ULTIMATE.start_test_fun_~tmp_ref~0.base=v_ULTIMATE.start_test_fun_~tmp_ref~0.base_3, ULTIMATE.start_test_fun_~tmp=v_ULTIMATE.start_test_fun_~tmp_3, ULTIMATE.start_test_fun_~tmp_ref~0.offset=v_ULTIMATE.start_test_fun_~tmp_ref~0.offset_3, #valid=|v_#valid_15|, #memory_int=|v_#memory_int_7|, #length=|v_#length_13|} AuxVars[] AssignedVars[#memory_int] 186#L15 [104] L15-->L17-7: Formula: (and (= |v_#memory_int_9| (store |v_#memory_int_10| v_ULTIMATE.start_test_fun_~c~0.base_3 (store (select |v_#memory_int_10| v_ULTIMATE.start_test_fun_~c~0.base_3) v_ULTIMATE.start_test_fun_~c~0.offset_3 0))) (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_3) (= 1 (select |v_#valid_17| v_ULTIMATE.start_test_fun_~c~0.base_3)) (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_3 4) (select |v_#length_15| v_ULTIMATE.start_test_fun_~c~0.base_3))) InVars {#memory_int=|v_#memory_int_10|, #length=|v_#length_15|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_3, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_3, #valid=|v_#valid_17|} OutVars{#memory_int=|v_#memory_int_9|, #length=|v_#length_15|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_3, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_3, #valid=|v_#valid_17|} AuxVars[] AssignedVars[#memory_int] 187#L17-7 250.74/218.80 [2019-03-28 12:43:50,875 INFO L796 eck$LassoCheckResult]: Loop: 187#L17-7 [149] L17-7-->L17: Formula: (and (= (select (select |v_#memory_int_11| v_ULTIMATE.start_test_fun_~i_ref~0.base_6) v_ULTIMATE.start_test_fun_~i_ref~0.offset_5) |v_ULTIMATE.start_test_fun_#t~mem5_2|) (<= (+ v_ULTIMATE.start_test_fun_~i_ref~0.offset_5 4) (select |v_#length_17| v_ULTIMATE.start_test_fun_~i_ref~0.base_6)) (= 1 (select |v_#valid_19| v_ULTIMATE.start_test_fun_~i_ref~0.base_6)) (<= 0 v_ULTIMATE.start_test_fun_~i_ref~0.offset_5)) InVars {#memory_int=|v_#memory_int_11|, #length=|v_#length_17|, ULTIMATE.start_test_fun_~i_ref~0.offset=v_ULTIMATE.start_test_fun_~i_ref~0.offset_5, ULTIMATE.start_test_fun_~i_ref~0.base=v_ULTIMATE.start_test_fun_~i_ref~0.base_6, #valid=|v_#valid_19|} OutVars{ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_2|, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_11|, #length=|v_#length_17|, ULTIMATE.start_test_fun_~i_ref~0.offset=v_ULTIMATE.start_test_fun_~i_ref~0.offset_5, ULTIMATE.start_test_fun_~i_ref~0.base=v_ULTIMATE.start_test_fun_~i_ref~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem5] 191#L17 [259] L17-->L17-1: Formula: (and |v_ULTIMATE.start_test_fun_#t~short7_2| (<= |v_ULTIMATE.start_test_fun_#t~mem5_3| 100)) InVars {ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_3|} OutVars{ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_3|, ULTIMATE.start_test_fun_#t~short7=|v_ULTIMATE.start_test_fun_#t~short7_2|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~short7] 190#L17-1 [140] L17-1-->L17-2: Formula: |v_ULTIMATE.start_test_fun_#t~short7_3| InVars {ULTIMATE.start_test_fun_#t~short7=|v_ULTIMATE.start_test_fun_#t~short7_3|} OutVars{ULTIMATE.start_test_fun_#t~short7=|v_ULTIMATE.start_test_fun_#t~short7_3|} AuxVars[] AssignedVars[] 188#L17-2 [137] L17-2-->L17-3: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem6_2| (select (select |v_#memory_int_12| v_ULTIMATE.start_test_fun_~j_ref~0.base_6) v_ULTIMATE.start_test_fun_~j_ref~0.offset_5)) (<= (+ v_ULTIMATE.start_test_fun_~j_ref~0.offset_5 4) (select |v_#length_19| v_ULTIMATE.start_test_fun_~j_ref~0.base_6)) (= (select |v_#valid_21| v_ULTIMATE.start_test_fun_~j_ref~0.base_6) 1) (<= 0 v_ULTIMATE.start_test_fun_~j_ref~0.offset_5)) InVars {#memory_int=|v_#memory_int_12|, ULTIMATE.start_test_fun_~j_ref~0.offset=v_ULTIMATE.start_test_fun_~j_ref~0.offset_5, #length=|v_#length_19|, ULTIMATE.start_test_fun_~j_ref~0.base=v_ULTIMATE.start_test_fun_~j_ref~0.base_6, #valid=|v_#valid_21|} OutVars{ULTIMATE.start_test_fun_~j_ref~0.offset=v_ULTIMATE.start_test_fun_~j_ref~0.offset_5, ULTIMATE.start_test_fun_~j_ref~0.base=v_ULTIMATE.start_test_fun_~j_ref~0.base_6, #valid=|v_#valid_21|, #memory_int=|v_#memory_int_12|, #length=|v_#length_19|, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_2|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem6] 189#L17-3 [266] L17-3-->L17-5: Formula: (and (<= |v_ULTIMATE.start_test_fun_#t~mem6_3| v_ULTIMATE.start_test_fun_~k_4) |v_ULTIMATE.start_test_fun_#t~short7_4|) InVars {ULTIMATE.start_test_fun_~k=v_ULTIMATE.start_test_fun_~k_4, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_3|} OutVars{ULTIMATE.start_test_fun_#t~short7=|v_ULTIMATE.start_test_fun_#t~short7_4|, ULTIMATE.start_test_fun_~k=v_ULTIMATE.start_test_fun_~k_4, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_3|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~short7] 207#L17-5 [153] L17-5-->L18: Formula: |v_ULTIMATE.start_test_fun_#t~short7_9| InVars {ULTIMATE.start_test_fun_#t~short7=|v_ULTIMATE.start_test_fun_#t~short7_9|} OutVars{ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_5|, ULTIMATE.start_test_fun_#t~short7=|v_ULTIMATE.start_test_fun_#t~short7_8|, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem5, ULTIMATE.start_test_fun_#t~short7, ULTIMATE.start_test_fun_#t~mem6] 194#L18 [92] L18-->L18-1: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~i_ref~0.offset_7) (<= (+ v_ULTIMATE.start_test_fun_~i_ref~0.offset_7 4) (select |v_#length_21| v_ULTIMATE.start_test_fun_~i_ref~0.base_9)) (= (select |v_#valid_23| v_ULTIMATE.start_test_fun_~i_ref~0.base_9) 1) (= (select (select |v_#memory_int_13| v_ULTIMATE.start_test_fun_~i_ref~0.base_9) v_ULTIMATE.start_test_fun_~i_ref~0.offset_7) |v_ULTIMATE.start_test_fun_#t~mem8_2|)) InVars {#memory_int=|v_#memory_int_13|, #length=|v_#length_21|, ULTIMATE.start_test_fun_~i_ref~0.offset=v_ULTIMATE.start_test_fun_~i_ref~0.offset_7, ULTIMATE.start_test_fun_~i_ref~0.base=v_ULTIMATE.start_test_fun_~i_ref~0.base_9, #valid=|v_#valid_23|} OutVars{#valid=|v_#valid_23|, #memory_int=|v_#memory_int_13|, #length=|v_#length_21|, ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_2|, ULTIMATE.start_test_fun_~i_ref~0.offset=v_ULTIMATE.start_test_fun_~i_ref~0.offset_7, ULTIMATE.start_test_fun_~i_ref~0.base=v_ULTIMATE.start_test_fun_~i_ref~0.base_9} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem8] 192#L18-1 [309] L18-1-->L19: Formula: (and (= 1 (select |v_#valid_55| v_ULTIMATE.start_test_fun_~tmp_ref~0.base_12)) (<= 0 v_ULTIMATE.start_test_fun_~tmp_ref~0.offset_9) (<= (+ v_ULTIMATE.start_test_fun_~tmp_ref~0.offset_9 4) (select |v_#length_45| v_ULTIMATE.start_test_fun_~tmp_ref~0.base_12)) (= (store |v_#memory_int_32| v_ULTIMATE.start_test_fun_~tmp_ref~0.base_12 (store (select |v_#memory_int_32| v_ULTIMATE.start_test_fun_~tmp_ref~0.base_12) v_ULTIMATE.start_test_fun_~tmp_ref~0.offset_9 |v_ULTIMATE.start_test_fun_#t~mem8_6|)) |v_#memory_int_31|)) InVars {ULTIMATE.start_test_fun_~tmp_ref~0.base=v_ULTIMATE.start_test_fun_~tmp_ref~0.base_12, ULTIMATE.start_test_fun_~tmp_ref~0.offset=v_ULTIMATE.start_test_fun_~tmp_ref~0.offset_9, #valid=|v_#valid_55|, #memory_int=|v_#memory_int_32|, #length=|v_#length_45|, ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_6|} OutVars{ULTIMATE.start_test_fun_~tmp_ref~0.base=v_ULTIMATE.start_test_fun_~tmp_ref~0.base_12, ULTIMATE.start_test_fun_~tmp_ref~0.offset=v_ULTIMATE.start_test_fun_~tmp_ref~0.offset_9, #valid=|v_#valid_55|, #memory_int=|v_#memory_int_31|, #length=|v_#length_45|, ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_5|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_test_fun_#t~mem8] 193#L19 [111] L19-->L19-1: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~j_ref~0.offset_7) (= (select |v_#valid_27| v_ULTIMATE.start_test_fun_~j_ref~0.base_9) 1) (= (select (select |v_#memory_int_16| v_ULTIMATE.start_test_fun_~j_ref~0.base_9) v_ULTIMATE.start_test_fun_~j_ref~0.offset_7) |v_ULTIMATE.start_test_fun_#t~mem9_2|) (<= (+ v_ULTIMATE.start_test_fun_~j_ref~0.offset_7 4) (select |v_#length_25| v_ULTIMATE.start_test_fun_~j_ref~0.base_9))) InVars {#memory_int=|v_#memory_int_16|, ULTIMATE.start_test_fun_~j_ref~0.offset=v_ULTIMATE.start_test_fun_~j_ref~0.offset_7, #length=|v_#length_25|, ULTIMATE.start_test_fun_~j_ref~0.base=v_ULTIMATE.start_test_fun_~j_ref~0.base_9, #valid=|v_#valid_27|} OutVars{ULTIMATE.start_test_fun_~j_ref~0.offset=v_ULTIMATE.start_test_fun_~j_ref~0.offset_7, ULTIMATE.start_test_fun_~j_ref~0.base=v_ULTIMATE.start_test_fun_~j_ref~0.base_9, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_16|, #length=|v_#length_25|, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_2|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem9] 195#L19-1 [312] L19-1-->L20: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~i_ref~0.offset_11) (= (store |v_#memory_int_36| v_ULTIMATE.start_test_fun_~i_ref~0.base_15 (store (select |v_#memory_int_36| v_ULTIMATE.start_test_fun_~i_ref~0.base_15) v_ULTIMATE.start_test_fun_~i_ref~0.offset_11 |v_ULTIMATE.start_test_fun_#t~mem9_6|)) |v_#memory_int_35|) (= 1 (select |v_#valid_60| v_ULTIMATE.start_test_fun_~i_ref~0.base_15)) (<= (+ v_ULTIMATE.start_test_fun_~i_ref~0.offset_11 4) (select |v_#length_48| v_ULTIMATE.start_test_fun_~i_ref~0.base_15))) InVars {#valid=|v_#valid_60|, #memory_int=|v_#memory_int_36|, #length=|v_#length_48|, ULTIMATE.start_test_fun_~i_ref~0.offset=v_ULTIMATE.start_test_fun_~i_ref~0.offset_11, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_6|, ULTIMATE.start_test_fun_~i_ref~0.base=v_ULTIMATE.start_test_fun_~i_ref~0.base_15} OutVars{#valid=|v_#valid_60|, #memory_int=|v_#memory_int_35|, #length=|v_#length_48|, ULTIMATE.start_test_fun_~i_ref~0.offset=v_ULTIMATE.start_test_fun_~i_ref~0.offset_11, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_5|, ULTIMATE.start_test_fun_~i_ref~0.base=v_ULTIMATE.start_test_fun_~i_ref~0.base_15} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_test_fun_#t~mem9] 196#L20 [128] L20-->L20-1: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem10_2| (select (select |v_#memory_int_19| v_ULTIMATE.start_test_fun_~tmp_ref~0.base_9) v_ULTIMATE.start_test_fun_~tmp_ref~0.offset_7)) (<= 0 v_ULTIMATE.start_test_fun_~tmp_ref~0.offset_7) (= (select |v_#valid_31| v_ULTIMATE.start_test_fun_~tmp_ref~0.base_9) 1) (<= (+ v_ULTIMATE.start_test_fun_~tmp_ref~0.offset_7 4) (select |v_#length_29| v_ULTIMATE.start_test_fun_~tmp_ref~0.base_9))) InVars {ULTIMATE.start_test_fun_~tmp_ref~0.base=v_ULTIMATE.start_test_fun_~tmp_ref~0.base_9, #memory_int=|v_#memory_int_19|, #length=|v_#length_29|, ULTIMATE.start_test_fun_~tmp_ref~0.offset=v_ULTIMATE.start_test_fun_~tmp_ref~0.offset_7, #valid=|v_#valid_31|} OutVars{ULTIMATE.start_test_fun_~tmp_ref~0.base=v_ULTIMATE.start_test_fun_~tmp_ref~0.base_9, ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_2|, ULTIMATE.start_test_fun_~tmp_ref~0.offset=v_ULTIMATE.start_test_fun_~tmp_ref~0.offset_7, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_19|, #length=|v_#length_29|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem10] 197#L20-1 [313] L20-1-->L21: Formula: (and (<= (+ v_ULTIMATE.start_test_fun_~j_ref~0.offset_11 4) (select |v_#length_49| v_ULTIMATE.start_test_fun_~j_ref~0.base_15)) (= 1 (select |v_#valid_61| v_ULTIMATE.start_test_fun_~j_ref~0.base_15)) (= (store |v_#memory_int_38| v_ULTIMATE.start_test_fun_~j_ref~0.base_15 (store (select |v_#memory_int_38| v_ULTIMATE.start_test_fun_~j_ref~0.base_15) v_ULTIMATE.start_test_fun_~j_ref~0.offset_11 (+ |v_ULTIMATE.start_test_fun_#t~mem10_6| 1))) |v_#memory_int_37|) (<= 0 v_ULTIMATE.start_test_fun_~j_ref~0.offset_11)) InVars {ULTIMATE.start_test_fun_~j_ref~0.offset=v_ULTIMATE.start_test_fun_~j_ref~0.offset_11, ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_6|, ULTIMATE.start_test_fun_~j_ref~0.base=v_ULTIMATE.start_test_fun_~j_ref~0.base_15, #valid=|v_#valid_61|, #memory_int=|v_#memory_int_38|, #length=|v_#length_49|} OutVars{ULTIMATE.start_test_fun_~j_ref~0.offset=v_ULTIMATE.start_test_fun_~j_ref~0.offset_11, ULTIMATE.start_test_fun_#t~mem10=|v_ULTIMATE.start_test_fun_#t~mem10_5|, ULTIMATE.start_test_fun_~j_ref~0.base=v_ULTIMATE.start_test_fun_~j_ref~0.base_15, #valid=|v_#valid_61|, #memory_int=|v_#memory_int_37|, #length=|v_#length_49|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem10, #memory_int] 198#L21 [97] L21-->L21-1: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~k_ref~0.offset_5) (= (select |v_#valid_35| v_ULTIMATE.start_test_fun_~k_ref~0.base_6) 1) (= (select (select |v_#memory_int_22| v_ULTIMATE.start_test_fun_~k_ref~0.base_6) v_ULTIMATE.start_test_fun_~k_ref~0.offset_5) |v_ULTIMATE.start_test_fun_#t~mem11_2|) (<= (+ v_ULTIMATE.start_test_fun_~k_ref~0.offset_5 4) (select |v_#length_33| v_ULTIMATE.start_test_fun_~k_ref~0.base_6))) InVars {#memory_int=|v_#memory_int_22|, ULTIMATE.start_test_fun_~k_ref~0.offset=v_ULTIMATE.start_test_fun_~k_ref~0.offset_5, #length=|v_#length_33|, ULTIMATE.start_test_fun_~k_ref~0.base=v_ULTIMATE.start_test_fun_~k_ref~0.base_6, #valid=|v_#valid_35|} OutVars{ULTIMATE.start_test_fun_~k_ref~0.offset=v_ULTIMATE.start_test_fun_~k_ref~0.offset_5, ULTIMATE.start_test_fun_#t~mem11=|v_ULTIMATE.start_test_fun_#t~mem11_2|, ULTIMATE.start_test_fun_~k_ref~0.base=v_ULTIMATE.start_test_fun_~k_ref~0.base_6, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_22|, #length=|v_#length_33|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem11] 199#L21-1 [314] L21-1-->L22: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~k_ref~0.offset_9) (<= (+ v_ULTIMATE.start_test_fun_~k_ref~0.offset_9 4) (select |v_#length_50| v_ULTIMATE.start_test_fun_~k_ref~0.base_12)) (= (store |v_#memory_int_40| v_ULTIMATE.start_test_fun_~k_ref~0.base_12 (store (select |v_#memory_int_40| v_ULTIMATE.start_test_fun_~k_ref~0.base_12) v_ULTIMATE.start_test_fun_~k_ref~0.offset_9 (+ |v_ULTIMATE.start_test_fun_#t~mem11_6| (- 1)))) |v_#memory_int_39|) (= 1 (select |v_#valid_62| v_ULTIMATE.start_test_fun_~k_ref~0.base_12))) InVars {ULTIMATE.start_test_fun_~k_ref~0.offset=v_ULTIMATE.start_test_fun_~k_ref~0.offset_9, ULTIMATE.start_test_fun_#t~mem11=|v_ULTIMATE.start_test_fun_#t~mem11_6|, ULTIMATE.start_test_fun_~k_ref~0.base=v_ULTIMATE.start_test_fun_~k_ref~0.base_12, #valid=|v_#valid_62|, #memory_int=|v_#memory_int_40|, #length=|v_#length_50|} OutVars{ULTIMATE.start_test_fun_~k_ref~0.offset=v_ULTIMATE.start_test_fun_~k_ref~0.offset_9, ULTIMATE.start_test_fun_#t~mem11=|v_ULTIMATE.start_test_fun_#t~mem11_5|, ULTIMATE.start_test_fun_~k_ref~0.base=v_ULTIMATE.start_test_fun_~k_ref~0.base_12, #valid=|v_#valid_62|, #memory_int=|v_#memory_int_39|, #length=|v_#length_50|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem11, #memory_int] 200#L22 [118] L22-->L22-1: Formula: (and (= |v_ULTIMATE.start_test_fun_#t~mem12_2| (select (select |v_#memory_int_25| v_ULTIMATE.start_test_fun_~c~0.base_6) v_ULTIMATE.start_test_fun_~c~0.offset_5)) (= 1 (select |v_#valid_39| v_ULTIMATE.start_test_fun_~c~0.base_6)) (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_5) (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_5 4) (select |v_#length_37| v_ULTIMATE.start_test_fun_~c~0.base_6))) InVars {#memory_int=|v_#memory_int_25|, #length=|v_#length_37|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_5, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_6, #valid=|v_#valid_39|} OutVars{ULTIMATE.start_test_fun_#t~mem12=|v_ULTIMATE.start_test_fun_#t~mem12_2|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_5, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_25|, #length=|v_#length_37|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem12] 203#L22-1 [315] L22-1-->L17-7: Formula: (and (= (store |v_#memory_int_42| v_ULTIMATE.start_test_fun_~c~0.base_19 (store (select |v_#memory_int_42| v_ULTIMATE.start_test_fun_~c~0.base_19) v_ULTIMATE.start_test_fun_~c~0.offset_15 (+ |v_ULTIMATE.start_test_fun_#t~mem12_6| 1))) |v_#memory_int_41|) (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_15 4) (select |v_#length_51| v_ULTIMATE.start_test_fun_~c~0.base_19)) (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_15) (= 1 (select |v_#valid_63| v_ULTIMATE.start_test_fun_~c~0.base_19))) InVars {ULTIMATE.start_test_fun_#t~mem12=|v_ULTIMATE.start_test_fun_#t~mem12_6|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_15, #valid=|v_#valid_63|, #memory_int=|v_#memory_int_42|, #length=|v_#length_51|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_19} OutVars{ULTIMATE.start_test_fun_#t~mem12=|v_ULTIMATE.start_test_fun_#t~mem12_5|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_15, #valid=|v_#valid_63|, #memory_int=|v_#memory_int_41|, #length=|v_#length_51|, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_19} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem12, #memory_int] 187#L17-7 250.74/218.80 [2019-03-28 12:43:50,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 250.74/218.80 [2019-03-28 12:43:50,875 INFO L82 PathProgramCache]: Analyzing trace with hash 624102671, now seen corresponding path program 3 times 250.74/218.80 [2019-03-28 12:43:50,875 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 250.74/218.80 [2019-03-28 12:43:50,875 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 250.74/218.80 [2019-03-28 12:43:50,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 250.74/218.80 [2019-03-28 12:43:50,876 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 250.74/218.80 [2019-03-28 12:43:50,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 250.74/218.80 [2019-03-28 12:43:50,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 250.74/218.80 [2019-03-28 12:43:50,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 250.74/218.80 [2019-03-28 12:43:50,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 250.74/218.80 [2019-03-28 12:43:50,904 INFO L82 PathProgramCache]: Analyzing trace with hash -666171820, now seen corresponding path program 1 times 250.74/218.80 [2019-03-28 12:43:50,904 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 250.74/218.80 [2019-03-28 12:43:50,904 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 250.74/218.80 [2019-03-28 12:43:50,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 250.74/218.80 [2019-03-28 12:43:50,905 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 250.74/218.80 [2019-03-28 12:43:50,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 250.74/218.80 [2019-03-28 12:43:50,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 250.74/218.80 [2019-03-28 12:43:50,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 250.74/218.80 [2019-03-28 12:43:50,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 250.74/218.80 [2019-03-28 12:43:50,929 INFO L82 PathProgramCache]: Analyzing trace with hash 1091450722, now seen corresponding path program 1 times 250.74/218.80 [2019-03-28 12:43:50,930 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS 250.74/218.80 [2019-03-28 12:43:50,930 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy 250.74/218.80 [2019-03-28 12:43:50,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 250.74/218.80 [2019-03-28 12:43:50,931 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 250.74/218.80 [2019-03-28 12:43:50,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY 250.74/218.80 [2019-03-28 12:43:50,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 250.74/218.80 [2019-03-28 12:43:50,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 250.74/218.80 [2019-03-28 12:43:51,255 WARN L188 SmtUtils]: Spent 264.00 ms on a formula simplification that was a NOOP. DAG size: 106 250.74/218.80 [2019-03-28 12:43:51,483 WARN L188 SmtUtils]: Spent 210.00 ms on a formula simplification that was a NOOP. DAG size: 82 250.74/218.80 [2019-03-28 12:43:52,491 WARN L188 SmtUtils]: Spent 1.01 s on a formula simplification. DAG size of input: 159 DAG size of output: 136 250.74/218.80 [2019-03-28 12:43:52,927 WARN L188 SmtUtils]: Spent 432.00 ms on a formula simplification that was a NOOP. DAG size: 126 250.74/218.80 [2019-03-28 12:43:52,943 INFO L216 LassoAnalysis]: Preferences: 250.74/218.80 [2019-03-28 12:43:52,944 INFO L124 ssoRankerPreferences]: Compute integeral hull: false 250.74/218.80 [2019-03-28 12:43:52,945 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true 250.74/218.80 [2019-03-28 12:43:52,945 INFO L126 ssoRankerPreferences]: Term annotations enabled: false 250.74/218.80 [2019-03-28 12:43:52,945 INFO L127 ssoRankerPreferences]: Use exernal solver: false 250.74/218.80 [2019-03-28 12:43:52,945 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 250.74/218.80 [2019-03-28 12:43:52,945 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false 250.74/218.80 [2019-03-28 12:43:52,945 INFO L130 ssoRankerPreferences]: Path of dumped script: 250.74/218.80 [2019-03-28 12:43:52,946 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration3_Lasso 250.74/218.80 [2019-03-28 12:43:52,946 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank 250.74/218.80 [2019-03-28 12:43:52,946 INFO L282 LassoAnalysis]: Starting lasso preprocessing... 250.74/218.80 [2019-03-28 12:43:52,967 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 250.74/218.80 [2019-03-28 12:43:52,973 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 250.74/218.80 [2019-03-28 12:43:53,913 WARN L188 SmtUtils]: Spent 461.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 116 250.74/218.80 [2019-03-28 12:43:54,151 WARN L188 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 95 250.74/218.80 [2019-03-28 12:43:54,152 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 250.74/218.80 [2019-03-28 12:43:54,155 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 250.74/218.80 [2019-03-28 12:43:54,158 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 250.74/218.80 [2019-03-28 12:43:54,161 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 250.74/218.80 [2019-03-28 12:43:54,163 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 250.74/218.80 [2019-03-28 12:43:54,165 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 250.74/218.80 [2019-03-28 12:43:54,167 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 250.74/218.80 [2019-03-28 12:43:54,169 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 250.74/218.80 [2019-03-28 12:43:54,171 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 250.74/218.80 [2019-03-28 12:43:54,172 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 250.74/218.80 [2019-03-28 12:43:54,174 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 250.74/218.80 [2019-03-28 12:43:54,176 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 250.74/218.80 [2019-03-28 12:43:54,177 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 250.74/218.80 [2019-03-28 12:43:54,179 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 250.74/218.80 [2019-03-28 12:43:54,181 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true 250.74/218.80 [2019-03-28 12:43:54,858 INFO L300 LassoAnalysis]: Preprocessing complete. 250.74/218.80 [2019-03-28 12:43:54,863 INFO L497 LassoAnalysis]: Using template 'affine'. 250.74/218.80 [2019-03-28 12:43:54,866 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 250.74/218.80 Termination analysis: LINEAR_WITH_GUESSES 250.74/218.80 Number of strict supporting invariants: 0 250.74/218.80 Number of non-strict supporting invariants: 1 250.74/218.80 Consider only non-deceasing supporting invariants: true 250.74/218.80 Simplify termination arguments: true 250.74/218.80 Simplify supporting invariants: trueOverapproximate stem: false 250.74/218.80 [2019-03-28 12:43:54,867 INFO L339 nArgumentSynthesizer]: Template has degree 0. 250.74/218.80 [2019-03-28 12:43:54,868 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. 250.74/218.80 [2019-03-28 12:43:54,868 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 250.74/218.80 [2019-03-28 12:43:54,868 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 250.74/218.80 [2019-03-28 12:43:54,868 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 250.74/218.80 [2019-03-28 12:43:54,870 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. 250.74/218.80 [2019-03-28 12:43:54,871 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. 250.74/218.80 [2019-03-28 12:43:54,872 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 250.74/218.80 [2019-03-28 12:43:54,873 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 250.74/218.80 Termination analysis: LINEAR_WITH_GUESSES 250.74/218.80 Number of strict supporting invariants: 0 250.74/218.80 Number of non-strict supporting invariants: 1 250.74/218.80 Consider only non-deceasing supporting invariants: true 250.74/218.80 Simplify termination arguments: true 250.74/218.80 Simplify supporting invariants: trueOverapproximate stem: false 250.74/218.80 [2019-03-28 12:43:54,873 INFO L339 nArgumentSynthesizer]: Template has degree 0. 250.74/218.80 [2019-03-28 12:43:54,873 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 250.74/218.80 [2019-03-28 12:43:54,874 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 250.74/218.80 [2019-03-28 12:43:54,874 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 250.74/218.80 [2019-03-28 12:43:54,877 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 250.74/218.80 [2019-03-28 12:43:54,877 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 250.74/218.80 [2019-03-28 12:43:54,886 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. 250.74/218.80 [2019-03-28 12:43:54,886 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: 250.74/218.80 Termination analysis: LINEAR_WITH_GUESSES 250.74/218.80 Number of strict supporting invariants: 0 250.74/218.80 Number of non-strict supporting invariants: 1 250.74/218.80 Consider only non-deceasing supporting invariants: true 250.74/218.80 Simplify termination arguments: true 250.74/218.80 Simplify supporting invariants: trueOverapproximate stem: false 250.74/218.80 [2019-03-28 12:43:54,887 INFO L339 nArgumentSynthesizer]: Template has degree 0. 250.74/218.80 [2019-03-28 12:43:54,887 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts 250.74/218.80 [2019-03-28 12:43:54,887 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts 250.74/218.80 [2019-03-28 12:43:54,887 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. 250.74/218.80 [2019-03-28 12:43:54,896 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. 250.74/218.80 [2019-03-28 12:43:54,896 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. 250.74/218.80 [2019-03-28 12:43:54,921 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. 250.74/218.80 [2019-03-28 12:43:54,948 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. 250.74/218.80 [2019-03-28 12:43:54,948 INFO L444 ModelExtractionUtils]: 44 out of 52 variables were initially zero. Simplification set additionally 3 variables to zero. 250.74/218.80 [2019-03-28 12:43:54,951 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... 250.74/218.80 [2019-03-28 12:43:54,954 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. 250.74/218.80 [2019-03-28 12:43:54,954 INFO L518 LassoAnalysis]: Proved termination. 250.74/218.80 [2019-03-28 12:43:54,954 INFO L520 LassoAnalysis]: Termination argument consisting of: 250.74/218.80 Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~j_ref~0.base) ULTIMATE.start_test_fun_~j_ref~0.offset)_1, v_rep(select (select #memory_int ULTIMATE.start_test_fun_~i_ref~0.base) ULTIMATE.start_test_fun_~i_ref~0.offset)_1, ULTIMATE.start_test_fun_~k) = -2*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~j_ref~0.base) ULTIMATE.start_test_fun_~j_ref~0.offset)_1 - 2*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~i_ref~0.base) ULTIMATE.start_test_fun_~i_ref~0.offset)_1 + 2*ULTIMATE.start_test_fun_~k + 201 250.74/218.80 Supporting invariants [] 250.74/218.80 [2019-03-28 12:43:55,362 INFO L297 tatePredicateManager]: 59 out of 65 supporting invariants were superfluous and have been removed 250.74/218.80 [2019-03-28 12:43:55,372 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 250.74/218.80 [2019-03-28 12:43:55,373 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int 250.74/218.80 [2019-03-28 12:43:55,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier 250.74/218.80 [2019-03-28 12:43:55,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 250.74/218.80 [2019-03-28 12:43:55,427 INFO L256 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 17 conjunts are in the unsatisfiable core 250.74/218.80 [2019-03-28 12:43:55,429 INFO L279 TraceCheckSpWp]: Computing forward predicates... 250.74/218.80 [2019-03-28 12:43:55,474 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 250.74/218.80 [2019-03-28 12:43:55,474 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 27 250.74/218.80 [2019-03-28 12:43:55,475 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 250.74/218.80 [2019-03-28 12:43:55,491 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 250.74/218.80 [2019-03-28 12:43:55,492 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. 250.74/218.80 [2019-03-28 12:43:55,492 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:36, output treesize:29 250.74/218.80 [2019-03-28 12:43:55,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 250.74/218.80 [2019-03-28 12:43:55,539 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 24 conjunts are in the unsatisfiable core 250.74/218.80 [2019-03-28 12:43:55,541 INFO L279 TraceCheckSpWp]: Computing forward predicates... 250.74/218.80 [2019-03-28 12:43:55,736 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 250.74/218.80 [2019-03-28 12:43:55,736 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 57 250.74/218.80 [2019-03-28 12:43:55,738 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 250.74/218.80 [2019-03-28 12:43:55,780 INFO L497 ElimStorePlain]: treesize reduction 20, result has 78.5 percent of original size 250.74/218.80 [2019-03-28 12:43:55,781 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 250.74/218.80 [2019-03-28 12:43:55,781 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:77, output treesize:70 250.74/218.80 [2019-03-28 12:43:55,905 INFO L340 Elim1Store]: treesize reduction 24, result has 45.5 percent of original size 250.74/218.80 [2019-03-28 12:43:55,905 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 63 treesize of output 57 250.74/218.80 [2019-03-28 12:43:55,913 INFO L427 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 250.74/218.80 [2019-03-28 12:43:55,944 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 250.74/218.80 [2019-03-28 12:43:55,946 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 250.74/218.80 [2019-03-28 12:43:55,946 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:85, output treesize:85 250.74/218.80 [2019-03-28 12:43:56,176 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 62 250.74/218.80 [2019-03-28 12:43:56,213 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 79 250.74/218.80 [2019-03-28 12:43:56,214 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 250.74/218.80 [2019-03-28 12:43:56,236 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 250.74/218.80 [2019-03-28 12:43:56,237 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 93 treesize of output 79 250.74/218.80 [2019-03-28 12:43:56,238 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 250.74/218.80 [2019-03-28 12:43:56,270 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 250.74/218.80 [2019-03-28 12:43:56,271 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 94 treesize of output 110 250.74/218.80 [2019-03-28 12:43:56,274 INFO L427 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 250.74/218.80 [2019-03-28 12:43:56,489 WARN L188 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 77 250.74/218.80 [2019-03-28 12:43:56,489 INFO L497 ElimStorePlain]: treesize reduction 18, result has 92.9 percent of original size 250.74/218.80 [2019-03-28 12:43:56,493 INFO L427 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 3 xjuncts. 250.74/218.80 [2019-03-28 12:43:56,493 INFO L217 ElimStorePlain]: Needed 4 recursive calls to eliminate 7 variables, input treesize:281, output treesize:226 250.74/218.80 [2019-03-28 12:43:56,796 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 250.74/218.80 [2019-03-28 12:43:56,796 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 89 treesize of output 116 250.74/218.80 [2019-03-28 12:43:56,799 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 250.74/218.80 [2019-03-28 12:43:56,834 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 250.74/218.80 [2019-03-28 12:43:56,834 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 88 treesize of output 111 250.74/218.80 [2019-03-28 12:43:56,836 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 250.74/218.80 [2019-03-28 12:43:56,872 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 250.74/218.80 [2019-03-28 12:43:56,872 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 79 treesize of output 103 250.74/218.80 [2019-03-28 12:43:56,874 INFO L427 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. 250.74/218.80 [2019-03-28 12:43:56,908 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 250.74/218.80 [2019-03-28 12:43:56,909 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 88 treesize of output 111 250.74/218.80 [2019-03-28 12:43:56,911 INFO L427 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. 250.74/218.80 [2019-03-28 12:43:57,286 WARN L188 SmtUtils]: Spent 374.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 111 250.74/218.80 [2019-03-28 12:43:57,287 INFO L497 ElimStorePlain]: treesize reduction 100, result has 79.9 percent of original size 250.74/218.80 [2019-03-28 12:43:57,294 INFO L427 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 1 dim-2 vars, End of recursive call: 10 dim-0 vars, and 4 xjuncts. 250.74/218.80 [2019-03-28 12:43:57,295 INFO L217 ElimStorePlain]: Needed 5 recursive calls to eliminate 9 variables, input treesize:345, output treesize:408 250.74/218.80 [2019-03-28 12:43:57,647 WARN L188 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 115 250.74/218.80 [2019-03-28 12:43:58,103 WARN L188 SmtUtils]: Spent 345.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 118 250.74/218.80 [2019-03-28 12:43:58,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. 250.74/218.80 [2019-03-28 12:44:05,609 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 250.74/218.80 [2019-03-28 12:44:09,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat 250.74/218.80 [2019-03-28 12:44:09,843 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings 250.74/218.80 [2019-03-28 12:44:09,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat 250.74/218.80 [2019-03-28 12:44:09,861 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 24 conjunts are in the unsatisfiable core 250.74/218.80 [2019-03-28 12:44:09,863 INFO L279 TraceCheckSpWp]: Computing forward predicates... 250.74/218.80 [2019-03-28 12:44:10,000 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 250.74/218.80 [2019-03-28 12:44:10,000 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 51 250.74/218.80 [2019-03-28 12:44:10,001 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 250.74/218.80 [2019-03-28 12:44:10,043 INFO L497 ElimStorePlain]: treesize reduction 20, result has 74.7 percent of original size 250.74/218.80 [2019-03-28 12:44:10,044 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. 250.74/218.80 [2019-03-28 12:44:10,044 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:63, output treesize:56 250.74/218.80 [2019-03-28 12:44:10,338 INFO L340 Elim1Store]: treesize reduction 24, result has 45.5 percent of original size 250.74/218.80 [2019-03-28 12:44:10,338 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 51 250.74/218.80 [2019-03-28 12:44:10,341 INFO L427 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 250.74/218.80 [2019-03-28 12:44:10,374 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size 250.74/218.80 [2019-03-28 12:44:10,376 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 250.74/218.80 [2019-03-28 12:44:10,376 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:71, output treesize:75 250.74/218.80 [2019-03-28 12:44:10,763 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 250.74/218.80 [2019-03-28 12:44:10,763 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 83 treesize of output 73 250.74/218.80 [2019-03-28 12:44:10,764 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 250.74/218.80 [2019-03-28 12:44:10,799 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 250.74/218.80 [2019-03-28 12:44:10,799 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 80 treesize of output 104 250.74/218.80 [2019-03-28 12:44:10,802 INFO L427 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. 250.74/218.80 [2019-03-28 12:44:10,815 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 73 250.74/218.80 [2019-03-28 12:44:10,816 INFO L427 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. 250.74/218.80 [2019-03-28 12:44:10,994 WARN L188 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 71 250.74/218.80 [2019-03-28 12:44:10,995 INFO L497 ElimStorePlain]: treesize reduction 18, result has 92.1 percent of original size 250.74/218.80 [2019-03-28 12:44:10,997 INFO L427 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 3 xjuncts. 250.74/218.80 [2019-03-28 12:44:10,998 INFO L217 ElimStorePlain]: Needed 4 recursive calls to eliminate 7 variables, input treesize:247, output treesize:200 250.74/218.80 [2019-03-28 12:44:11,566 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 250.74/218.80 [2019-03-28 12:44:11,567 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 75 treesize of output 110 250.74/218.80 [2019-03-28 12:44:11,569 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 250.74/218.80 [2019-03-28 12:44:11,607 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 250.74/218.80 [2019-03-28 12:44:11,608 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 97 250.74/218.80 [2019-03-28 12:44:11,609 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 250.74/218.80 [2019-03-28 12:44:11,650 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 250.74/218.80 [2019-03-28 12:44:11,650 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 78 treesize of output 105 250.74/218.80 [2019-03-28 12:44:11,652 INFO L427 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. 250.74/218.80 [2019-03-28 12:44:11,682 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 250.74/218.80 [2019-03-28 12:44:11,683 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 78 treesize of output 105 250.74/218.80 [2019-03-28 12:44:11,684 INFO L427 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. 250.74/218.80 [2019-03-28 12:44:12,029 WARN L188 SmtUtils]: Spent 343.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 104 250.74/218.80 [2019-03-28 12:44:12,029 INFO L497 ElimStorePlain]: treesize reduction 100, result has 78.1 percent of original size 250.74/218.80 [2019-03-28 12:44:12,035 INFO L427 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 1 dim-2 vars, End of recursive call: 10 dim-0 vars, and 4 xjuncts. 250.74/218.80 [2019-03-28 12:44:12,035 INFO L217 ElimStorePlain]: Needed 5 recursive calls to eliminate 9 variables, input treesize:305, output treesize:356 250.74/218.80 [2019-03-28 12:44:12,595 WARN L188 SmtUtils]: Spent 302.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 105 250.74/218.80 [2019-03-28 12:44:13,151 WARN L188 SmtUtils]: Spent 319.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 108 250.74/218.80 [2019-03-28 12:44:13,218 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 250.74/218.80 [2019-03-28 12:44:13,219 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 72 treesize of output 142 250.74/218.80 [2019-03-28 12:44:13,259 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. 250.74/218.80 [2019-03-28 12:44:13,302 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 250.74/218.80 [2019-03-28 12:44:13,302 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 60 treesize of output 93 250.74/218.80 [2019-03-28 12:44:13,306 INFO L427 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. 250.74/218.80 [2019-03-28 12:44:13,408 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 250.74/218.80 [2019-03-28 12:44:13,409 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 85 treesize of output 196 250.74/218.80 [2019-03-28 12:44:13,632 INFO L427 ElimStorePlain]: Start of recursive call 4: 9 dim-0 vars, End of recursive call: 9 dim-0 vars, and 1 xjuncts. 250.74/218.80 [2019-03-28 12:44:13,759 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 250.74/218.80 [2019-03-28 12:44:13,760 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 85 treesize of output 196 250.74/218.80 [2019-03-28 12:44:14,021 INFO L427 ElimStorePlain]: Start of recursive call 5: 11 dim-0 vars, End of recursive call: 13 dim-0 vars, and 1 xjuncts. 250.74/218.80 [2019-03-28 12:44:14,142 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 250.74/218.80 [2019-03-28 12:44:14,143 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 69 treesize of output 143 250.74/218.80 [2019-03-28 12:44:14,156 INFO L427 ElimStorePlain]: Start of recursive call 6: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. 250.74/218.80 [2019-03-28 12:44:14,251 INFO L340 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size 250.74/218.80 [2019-03-28 12:44:14,251 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 69 treesize of output 143 250.74/218.80 [2019-03-28 12:44:14,265 INFO L427 ElimStorePlain]: Start of recursive call 7: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. 250.74/218.80 [2019-03-28 12:44:17,212 WARN L188 SmtUtils]: Spent 2.95 s on a formula simplification. DAG size of input: 481 DAG size of output: 316 250.74/218.80 [2019-03-28 12:44:17,213 INFO L497 ElimStorePlain]: treesize reduction 1180, result has 54.2 percent of original size 250.74/218.80 [2019-03-28 12:44:17,286 INFO L427 ElimStorePlain]: Start of recursive call 1: 12 dim-0 vars, 1 dim-2 vars, End of recursive call: 88 dim-0 vars, and 6 xjuncts. 250.74/218.80 [2019-03-28 12:44:17,287 INFO L217 ElimStorePlain]: Needed 7 recursive calls to eliminate 13 variables, input treesize:441, output treesize:1755 250.74/218.80 [2019-03-28 12:46:17,721 WARN L188 SmtUtils]: Spent 1.48 m on a formula simplification. DAG size of input: 634 DAG size of output: 236 250.74/218.80 [2019-03-28 12:46:25,587 WARN L188 SmtUtils]: Spent 2.01 s on a formula simplification. DAG size of input: 248 DAG size of output: 147 250.74/218.80 [2019-03-28 12:46:31,376 WARN L188 SmtUtils]: Spent 386.00 ms on a formula simplification that was a NOOP. DAG size: 156 250.74/218.80 [2019-03-28 12:46:37,463 WARN L188 SmtUtils]: Spent 668.00 ms on a formula simplification that was a NOOP. DAG size: 158 250.74/218.80 [2019-03-28 12:46:48,831 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 250.74/218.80 [2019-03-28 12:46:52,790 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 250.74/218.80 [2019-03-28 12:47:20,042 WARN L194 Executor]: External (z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000) stderr output: (error "out of memory") 250.74/218.80 250.74/218.80 [2019-03-28 12:47:20,043 FATAL L265 ToolchainWalker]: An unrecoverable error occured during an interaction with an SMT solver: 250.74/218.80 de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000)Received EOF on stdin. stderr output: (error "out of memory") 250.74/218.80 250.74/218.80 at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:208) 250.74/218.80 at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:225) 250.74/218.80 at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:155) 250.74/218.80 at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.WrapperScript.checkSat(WrapperScript.java:116) 250.74/218.80 at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.managedscript.ManagedScript.checkSat(ManagedScript.java:141) 250.74/218.80 at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:84) 250.74/218.80 at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:934) 250.74/218.80 at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:773) 250.74/218.80 at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:345) 250.74/218.80 at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:305) 250.74/218.80 at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.cannibalize(PredicateUnifier.java:478) 250.74/218.80 at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.cannibalizeAll(PredicateUnifier.java:489) 250.74/218.80 at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LoopCannibalizer.cannibalize(LoopCannibalizer.java:134) 250.74/218.80 at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LoopCannibalizer.(LoopCannibalizer.java:97) 250.74/218.80 at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.RefineBuchi.buildBuchiInterpolantAutomatonForOnDemandConstruction(RefineBuchi.java:420) 250.74/218.80 at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.RefineBuchi.refineBuchi(RefineBuchi.java:239) 250.74/218.80 at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.refineBuchi(BuchiCegarLoop.java:756) 250.74/218.80 at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.iterate(BuchiCegarLoop.java:569) 250.74/218.80 at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:145) 250.74/218.80 at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:384) 250.74/218.80 at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) 250.74/218.80 at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) 250.74/218.80 at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) 250.74/218.80 at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) 250.74/218.80 at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) 250.74/218.80 at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) 250.74/218.80 at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) 250.74/218.80 at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:317) 250.74/218.80 at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) 250.74/218.80 at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) 250.74/218.80 Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF 250.74/218.80 at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1427) 250.74/218.80 at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:630) 250.74/218.80 at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:419) 250.74/218.80 at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:205) 250.74/218.80 ... 29 more 250.74/218.80 [2019-03-28 12:47:20,046 INFO L168 Benchmark]: Toolchain (without parser) took 214648.04 ms. Allocated memory was 649.6 MB in the beginning and 929.0 MB in the end (delta: 279.4 MB). Free memory was 559.1 MB in the beginning and 508.0 MB in the end (delta: 51.2 MB). Peak memory consumption was 330.6 MB. Max. memory is 50.3 GB. 250.74/218.80 [2019-03-28 12:47:20,047 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 649.6 MB. Free memory is still 580.0 MB. There was no memory consumed. Max. memory is 50.3 GB. 250.74/218.80 [2019-03-28 12:47:20,047 INFO L168 Benchmark]: CACSL2BoogieTranslator took 314.82 ms. Allocated memory was 649.6 MB in the beginning and 669.0 MB in the end (delta: 19.4 MB). Free memory was 559.1 MB in the beginning and 635.8 MB in the end (delta: -76.6 MB). Peak memory consumption was 30.4 MB. Max. memory is 50.3 GB. 250.74/218.80 [2019-03-28 12:47:20,048 INFO L168 Benchmark]: Boogie Procedure Inliner took 46.34 ms. Allocated memory is still 669.0 MB. Free memory was 635.8 MB in the beginning and 631.9 MB in the end (delta: 3.9 MB). Peak memory consumption was 3.9 MB. Max. memory is 50.3 GB. 250.74/218.80 [2019-03-28 12:47:20,048 INFO L168 Benchmark]: Boogie Preprocessor took 27.78 ms. Allocated memory is still 669.0 MB. Free memory was 631.9 MB in the beginning and 630.8 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 50.3 GB. 250.74/218.80 [2019-03-28 12:47:20,049 INFO L168 Benchmark]: RCFGBuilder took 442.81 ms. Allocated memory is still 669.0 MB. Free memory was 629.7 MB in the beginning and 598.9 MB in the end (delta: 30.8 MB). Peak memory consumption was 30.8 MB. Max. memory is 50.3 GB. 250.74/218.80 [2019-03-28 12:47:20,049 INFO L168 Benchmark]: BlockEncodingV2 took 191.77 ms. Allocated memory is still 669.0 MB. Free memory was 598.9 MB in the beginning and 580.6 MB in the end (delta: 18.4 MB). Peak memory consumption was 18.4 MB. Max. memory is 50.3 GB. 250.74/218.80 [2019-03-28 12:47:20,050 INFO L168 Benchmark]: TraceAbstraction took 3833.94 ms. Allocated memory was 669.0 MB in the beginning and 740.8 MB in the end (delta: 71.8 MB). Free memory was 580.6 MB in the beginning and 374.8 MB in the end (delta: 205.8 MB). Peak memory consumption was 277.6 MB. Max. memory is 50.3 GB. 250.74/218.80 [2019-03-28 12:47:20,050 INFO L168 Benchmark]: BuchiAutomizer took 209784.94 ms. Allocated memory was 740.8 MB in the beginning and 929.0 MB in the end (delta: 188.2 MB). Free memory was 374.8 MB in the beginning and 508.0 MB in the end (delta: -133.2 MB). Peak memory consumption was 55.0 MB. Max. memory is 50.3 GB. 250.74/218.80 [2019-03-28 12:47:20,054 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### 250.74/218.80 --- Results --- 250.74/218.80 * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: 250.74/218.80 - StatisticsResult: Initial Icfg 250.74/218.80 70 locations, 72 edges 250.74/218.80 - StatisticsResult: Encoded RCFG 250.74/218.80 60 locations, 130 edges 250.74/218.80 * Results from de.uni_freiburg.informatik.ultimate.core: 250.74/218.80 - StatisticsResult: Toolchain Benchmarks 250.74/218.80 Benchmark results are: 250.74/218.80 * CDTParser took 0.17 ms. Allocated memory is still 649.6 MB. Free memory is still 580.0 MB. There was no memory consumed. Max. memory is 50.3 GB. 250.74/218.80 * CACSL2BoogieTranslator took 314.82 ms. Allocated memory was 649.6 MB in the beginning and 669.0 MB in the end (delta: 19.4 MB). Free memory was 559.1 MB in the beginning and 635.8 MB in the end (delta: -76.6 MB). Peak memory consumption was 30.4 MB. Max. memory is 50.3 GB. 250.74/218.80 * Boogie Procedure Inliner took 46.34 ms. Allocated memory is still 669.0 MB. Free memory was 635.8 MB in the beginning and 631.9 MB in the end (delta: 3.9 MB). Peak memory consumption was 3.9 MB. Max. memory is 50.3 GB. 250.74/218.80 * Boogie Preprocessor took 27.78 ms. Allocated memory is still 669.0 MB. Free memory was 631.9 MB in the beginning and 630.8 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 50.3 GB. 250.74/218.80 * RCFGBuilder took 442.81 ms. Allocated memory is still 669.0 MB. Free memory was 629.7 MB in the beginning and 598.9 MB in the end (delta: 30.8 MB). Peak memory consumption was 30.8 MB. Max. memory is 50.3 GB. 250.74/218.80 * BlockEncodingV2 took 191.77 ms. Allocated memory is still 669.0 MB. Free memory was 598.9 MB in the beginning and 580.6 MB in the end (delta: 18.4 MB). Peak memory consumption was 18.4 MB. Max. memory is 50.3 GB. 250.74/218.80 * TraceAbstraction took 3833.94 ms. Allocated memory was 669.0 MB in the beginning and 740.8 MB in the end (delta: 71.8 MB). Free memory was 580.6 MB in the beginning and 374.8 MB in the end (delta: 205.8 MB). Peak memory consumption was 277.6 MB. Max. memory is 50.3 GB. 250.74/218.80 * BuchiAutomizer took 209784.94 ms. Allocated memory was 740.8 MB in the beginning and 929.0 MB in the end (delta: 188.2 MB). Free memory was 374.8 MB in the beginning and 508.0 MB in the end (delta: -133.2 MB). Peak memory consumption was 55.0 MB. Max. memory is 50.3 GB. 250.74/218.80 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: 250.74/218.80 - GenericResult: Unfinished Backtranslation 250.74/218.80 unknown boogie variable #length 250.74/218.80 - GenericResult: Unfinished Backtranslation 250.74/218.80 unknown boogie variable #length 250.74/218.80 - GenericResult: Unfinished Backtranslation 250.74/218.80 unknown boogie variable #length 250.74/218.80 - GenericResult: Unfinished Backtranslation 250.74/218.80 unknown boogie variable #length 250.74/218.80 - GenericResult: Unfinished Backtranslation 250.74/218.80 unknown boogie variable #length 250.74/218.80 - GenericResult: Unfinished Backtranslation 250.74/218.80 unknown boogie variable #length 250.74/218.80 - GenericResult: Unfinished Backtranslation 250.74/218.80 unknown boogie variable #length 250.74/218.80 - GenericResult: Unfinished Backtranslation 250.74/218.80 unknown boogie variable #length 250.74/218.80 - GenericResult: Unfinished Backtranslation 250.74/218.80 unknown boogie variable #length 250.74/218.80 - GenericResult: Unfinished Backtranslation 250.74/218.80 unknown boogie variable #length 250.74/218.80 - GenericResult: Unfinished Backtranslation 250.74/218.80 unknown boogie variable #memory_int 250.74/218.80 - GenericResult: Unfinished Backtranslation 250.74/218.80 unknown boogie variable #memory_int 250.74/218.80 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: 250.74/218.80 - PositiveResult [Line: 18]: pointer dereference always succeeds 250.74/218.80 For all program executions holds that pointer dereference always succeeds at this location 250.74/218.80 - PositiveResult [Line: 18]: pointer dereference always succeeds 250.74/218.80 For all program executions holds that pointer dereference always succeeds at this location 250.74/218.80 - PositiveResult [Line: 18]: pointer dereference always succeeds 250.74/218.80 For all program executions holds that pointer dereference always succeeds at this location 250.74/218.80 - PositiveResult [Line: 24]: pointer dereference always succeeds 250.74/218.80 For all program executions holds that pointer dereference always succeeds at this location 250.74/218.80 - PositiveResult [Line: 18]: pointer dereference always succeeds 250.74/218.80 For all program executions holds that pointer dereference always succeeds at this location 250.74/218.80 - PositiveResult [Line: 24]: pointer dereference always succeeds 250.74/218.80 For all program executions holds that pointer dereference always succeeds at this location 250.74/218.80 - PositiveResult [Line: 17]: pointer dereference always succeeds 250.74/218.80 For all program executions holds that pointer dereference always succeeds at this location 250.74/218.80 - PositiveResult [Line: 12]: pointer dereference always succeeds 250.74/218.80 For all program executions holds that pointer dereference always succeeds at this location 250.74/218.80 - PositiveResult [Line: 20]: pointer dereference always succeeds 250.74/218.80 For all program executions holds that pointer dereference always succeeds at this location 250.74/218.80 - PositiveResult [Line: 12]: pointer dereference always succeeds 250.74/218.80 For all program executions holds that pointer dereference always succeeds at this location 250.74/218.80 - PositiveResult [Line: 19]: pointer dereference always succeeds 250.74/218.80 For all program executions holds that pointer dereference always succeeds at this location 250.74/218.80 - PositiveResult [Line: 19]: pointer dereference always succeeds 250.74/218.80 For all program executions holds that pointer dereference always succeeds at this location 250.74/218.80 - PositiveResult [Line: 19]: pointer dereference always succeeds 250.74/218.80 For all program executions holds that pointer dereference always succeeds at this location 250.74/218.80 - PositiveResult [Line: 19]: pointer dereference always succeeds 250.74/218.80 For all program executions holds that pointer dereference always succeeds at this location 250.74/218.80 - PositiveResult [Line: 15]: pointer dereference always succeeds 250.74/218.80 For all program executions holds that pointer dereference always succeeds at this location 250.74/218.80 - PositiveResult [Line: 21]: pointer dereference always succeeds 250.74/218.80 For all program executions holds that pointer dereference always succeeds at this location 250.74/218.80 - PositiveResult [Line: 21]: pointer dereference always succeeds 250.74/218.80 For all program executions holds that pointer dereference always succeeds at this location 250.74/218.80 - PositiveResult [Line: 21]: pointer dereference always succeeds 250.74/218.80 For all program executions holds that pointer dereference always succeeds at this location 250.74/218.80 - PositiveResult [Line: 14]: pointer dereference always succeeds 250.74/218.80 For all program executions holds that pointer dereference always succeeds at this location 250.74/218.80 - PositiveResult [Line: 13]: pointer dereference always succeeds 250.74/218.80 For all program executions holds that pointer dereference always succeeds at this location 250.74/218.80 - PositiveResult [Line: 14]: pointer dereference always succeeds 250.74/218.80 For all program executions holds that pointer dereference always succeeds at this location 250.74/218.80 - PositiveResult [Line: 20]: pointer dereference always succeeds 250.74/218.80 For all program executions holds that pointer dereference always succeeds at this location 250.74/218.80 - PositiveResult [Line: 20]: pointer dereference always succeeds 250.74/218.80 For all program executions holds that pointer dereference always succeeds at this location 250.74/218.80 - PositiveResult [Line: 13]: pointer dereference always succeeds 250.74/218.80 For all program executions holds that pointer dereference always succeeds at this location 250.74/218.80 - PositiveResult [Line: 20]: pointer dereference always succeeds 250.74/218.80 For all program executions holds that pointer dereference always succeeds at this location 250.74/218.80 - PositiveResult [Line: 17]: pointer dereference always succeeds 250.74/218.80 For all program executions holds that pointer dereference always succeeds at this location 250.74/218.80 - PositiveResult [Line: 17]: pointer dereference always succeeds 250.74/218.80 For all program executions holds that pointer dereference always succeeds at this location 250.74/218.80 - PositiveResult [Line: 22]: pointer dereference always succeeds 250.74/218.80 For all program executions holds that pointer dereference always succeeds at this location 250.74/218.80 - PositiveResult [Line: 17]: pointer dereference always succeeds 250.74/218.80 For all program executions holds that pointer dereference always succeeds at this location 250.74/218.80 - PositiveResult [Line: 22]: pointer dereference always succeeds 250.74/218.80 For all program executions holds that pointer dereference always succeeds at this location 250.74/218.80 - PositiveResult [Line: 22]: pointer dereference always succeeds 250.74/218.80 For all program executions holds that pointer dereference always succeeds at this location 250.74/218.80 - PositiveResult [Line: 22]: pointer dereference always succeeds 250.74/218.80 For all program executions holds that pointer dereference always succeeds at this location 250.74/218.80 - PositiveResult [Line: 16]: pointer dereference always succeeds 250.74/218.80 For all program executions holds that pointer dereference always succeeds at this location 250.74/218.80 - PositiveResult [Line: 15]: pointer dereference always succeeds 250.74/218.80 For all program executions holds that pointer dereference always succeeds at this location 250.74/218.80 - PositiveResult [Line: 16]: pointer dereference always succeeds 250.74/218.80 For all program executions holds that pointer dereference always succeeds at this location 250.74/218.80 - PositiveResult [Line: 21]: pointer dereference always succeeds 250.74/218.80 For all program executions holds that pointer dereference always succeeds at this location 250.74/218.80 - AllSpecificationsHoldResult: All specifications hold 250.74/218.80 36 specifications checked. All of them hold 250.74/218.80 - InvariantResult [Line: 16]: Loop Invariant 250.74/218.80 [2019-03-28 12:47:20,064 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 250.74/218.80 [2019-03-28 12:47:20,064 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 250.74/218.80 [2019-03-28 12:47:20,065 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 250.74/218.80 [2019-03-28 12:47:20,065 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 250.74/218.80 [2019-03-28 12:47:20,065 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 250.74/218.80 [2019-03-28 12:47:20,066 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 250.74/218.80 [2019-03-28 12:47:20,067 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 250.74/218.80 [2019-03-28 12:47:20,067 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 250.74/218.80 [2019-03-28 12:47:20,067 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 250.74/218.80 [2019-03-28 12:47:20,067 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length 250.74/218.80 Derived loop invariant: (((((((((((((4 == unknown-#length-unknown[k_ref] && 1 == \valid[tmp_ref]) && 4 == unknown-#length-unknown[tmp_ref]) && tmp_ref == 0) && unknown-#length-unknown[j_ref] == 4) && 1 == \valid[c]) && 0 == i_ref) && 0 == c) && 0 == k_ref) && 0 == j_ref) && unknown-#length-unknown[i_ref] == 4) && \valid[i_ref] == 1) && 4 == unknown-#length-unknown[c]) && 1 == \valid[j_ref]) && 1 == \valid[k_ref] 250.74/218.80 - StatisticsResult: Ultimate Automizer benchmark data 250.74/218.80 CFG has 1 procedures, 60 locations, 36 error locations. SAFE Result, 3.7s OverallTime, 14 OverallIterations, 1 TraceHistogramMax, 2.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 124 SDtfs, 778 SDslu, 9 SDs, 0 SdLazy, 1148 SolverSat, 492 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 28 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=60occurred 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, 14 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 1 NumberOfFragments, 66 HoareAnnotationTreeSize, 1 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 1 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 69 NumberOfCodeBlocks, 69 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 55 ConstructedInterpolants, 0 QuantifiedInterpolants, 1185 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available 250.74/218.80 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: 250.74/218.80 - ExceptionOrErrorResult: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000)Received EOF on stdin. stderr output: (error "out of memory") 250.74/218.80 250.74/218.80 de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000)Received EOF on stdin. stderr output: (error "out of memory") 250.74/218.80 : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:208) 250.74/218.80 RESULT: Ultimate could not prove your program: Toolchain returned no result. 250.74/218.80 !SESSION 2019-03-28 12:43:42.081 ----------------------------------------------- 250.74/218.80 eclipse.buildId=unknown 250.74/218.80 java.version=1.8.0_181 250.74/218.80 java.vendor=Oracle Corporation 250.74/218.80 BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US 250.74/218.80 Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox/benchmark/theBenchmark.c 250.74/218.80 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 250.74/218.80 250.74/218.80 !ENTRY org.eclipse.core.resources 2 10035 2019-03-28 12:47:20.091 250.74/218.80 !MESSAGE The workspace will exit with unsaved changes in this session. 250.74/218.80 Received shutdown request... 250.74/218.80 Ultimate: 250.74/218.80 GTK+ Version Check 250.74/218.80 EOF