./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/c.01_assume-alloca_true-termination_true-no-overflow.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_47fa782f-b229-409d-b6de-e77330964619/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_47fa782f-b229-409d-b6de-e77330964619/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_47fa782f-b229-409d-b6de-e77330964619/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_47fa782f-b229-409d-b6de-e77330964619/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/c.01_assume-alloca_true-termination_true-no-overflow.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_47fa782f-b229-409d-b6de-e77330964619/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_47fa782f-b229-409d-b6de-e77330964619/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash b4afea49cf97a69d20f4a5a7301b61ef07ffc206 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Using bit-precise analysis No suitable file found in config dir /tmp/vcloud-vcloud-master/worker/working_dir_47fa782f-b229-409d-b6de-e77330964619/bin-2019/uautomizer/config using search string *Termination*64bit*_Bitvector*.epf No suitable settings file found using Termination*64bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000)Received EOF on stdin. stderr output: (error "out of memory") --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-10 09:02:21,655 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 09:02:21,656 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 09:02:21,663 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 09:02:21,663 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 09:02:21,664 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 09:02:21,664 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 09:02:21,665 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 09:02:21,666 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 09:02:21,667 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 09:02:21,668 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 09:02:21,668 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 09:02:21,668 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 09:02:21,669 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 09:02:21,670 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 09:02:21,670 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 09:02:21,671 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 09:02:21,672 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 09:02:21,673 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 09:02:21,674 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 09:02:21,675 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 09:02:21,676 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 09:02:21,677 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 09:02:21,677 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 09:02:21,678 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 09:02:21,678 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 09:02:21,679 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 09:02:21,680 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 09:02:21,680 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 09:02:21,681 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 09:02:21,681 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 09:02:21,682 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 09:02:21,682 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 09:02:21,682 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 09:02:21,682 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 09:02:21,683 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 09:02:21,683 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_47fa782f-b229-409d-b6de-e77330964619/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-10 09:02:21,694 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 09:02:21,694 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 09:02:21,695 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 09:02:21,695 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 09:02:21,695 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 09:02:21,695 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-10 09:02:21,695 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-10 09:02:21,695 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-10 09:02:21,696 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-10 09:02:21,696 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-10 09:02:21,696 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-10 09:02:21,696 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 09:02:21,696 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-10 09:02:21,696 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 09:02:21,696 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 09:02:21,696 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-10 09:02:21,697 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-10 09:02:21,697 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-10 09:02:21,697 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 09:02:21,697 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-10 09:02:21,697 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-10 09:02:21,697 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 09:02:21,697 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 09:02:21,697 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-10 09:02:21,698 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 09:02:21,698 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 09:02:21,698 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-10 09:02:21,698 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-10 09:02:21,698 INFO L133 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_47fa782f-b229-409d-b6de-e77330964619/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b4afea49cf97a69d20f4a5a7301b61ef07ffc206 [2018-11-10 09:02:21,721 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 09:02:21,729 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 09:02:21,731 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 09:02:21,732 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 09:02:21,732 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 09:02:21,732 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_47fa782f-b229-409d-b6de-e77330964619/bin-2019/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/c.01_assume-alloca_true-termination_true-no-overflow.c.i [2018-11-10 09:02:21,768 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_47fa782f-b229-409d-b6de-e77330964619/bin-2019/uautomizer/data/f8520d0bd/3a058d5f0fb44cafa4d131833818b8b9/FLAGa5e37853b [2018-11-10 09:02:22,202 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 09:02:22,203 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_47fa782f-b229-409d-b6de-e77330964619/sv-benchmarks/c/termination-memory-alloca/c.01_assume-alloca_true-termination_true-no-overflow.c.i [2018-11-10 09:02:22,213 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_47fa782f-b229-409d-b6de-e77330964619/bin-2019/uautomizer/data/f8520d0bd/3a058d5f0fb44cafa4d131833818b8b9/FLAGa5e37853b [2018-11-10 09:02:22,223 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_47fa782f-b229-409d-b6de-e77330964619/bin-2019/uautomizer/data/f8520d0bd/3a058d5f0fb44cafa4d131833818b8b9 [2018-11-10 09:02:22,226 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 09:02:22,226 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 09:02:22,227 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 09:02:22,227 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 09:02:22,229 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 09:02:22,230 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 09:02:22" (1/1) ... [2018-11-10 09:02:22,231 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@584d7dc5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:02:22, skipping insertion in model container [2018-11-10 09:02:22,232 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 09:02:22" (1/1) ... [2018-11-10 09:02:22,238 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 09:02:22,264 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 09:02:22,443 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 09:02:22,451 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 09:02:22,478 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 09:02:22,500 INFO L193 MainTranslator]: Completed translation [2018-11-10 09:02:22,500 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:02:22 WrapperNode [2018-11-10 09:02:22,500 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 09:02:22,501 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 09:02:22,501 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 09:02:22,501 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 09:02:22,506 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:02:22" (1/1) ... [2018-11-10 09:02:22,556 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:02:22" (1/1) ... [2018-11-10 09:02:22,571 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 09:02:22,571 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 09:02:22,572 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 09:02:22,572 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 09:02:22,577 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:02:22" (1/1) ... [2018-11-10 09:02:22,577 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:02:22" (1/1) ... [2018-11-10 09:02:22,579 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:02:22" (1/1) ... [2018-11-10 09:02:22,579 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:02:22" (1/1) ... [2018-11-10 09:02:22,581 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:02:22" (1/1) ... [2018-11-10 09:02:22,584 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:02:22" (1/1) ... [2018-11-10 09:02:22,585 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:02:22" (1/1) ... [2018-11-10 09:02:22,586 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 09:02:22,587 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 09:02:22,587 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 09:02:22,587 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 09:02:22,587 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:02:22" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_47fa782f-b229-409d-b6de-e77330964619/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 09:02:22,622 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-10 09:02:22,622 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-10 09:02:22,622 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 09:02:22,623 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 09:02:22,795 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 09:02:22,795 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 09:02:22 BoogieIcfgContainer [2018-11-10 09:02:22,795 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 09:02:22,796 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-10 09:02:22,796 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-10 09:02:22,798 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-10 09:02:22,798 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 09:02:22,799 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.11 09:02:22" (1/3) ... [2018-11-10 09:02:22,799 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@be832db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 09:02:22, skipping insertion in model container [2018-11-10 09:02:22,799 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 09:02:22,799 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:02:22" (2/3) ... [2018-11-10 09:02:22,800 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@be832db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 09:02:22, skipping insertion in model container [2018-11-10 09:02:22,800 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 09:02:22,800 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 09:02:22" (3/3) ... [2018-11-10 09:02:22,801 INFO L375 chiAutomizerObserver]: Analyzing ICFG c.01_assume-alloca_true-termination_true-no-overflow.c.i [2018-11-10 09:02:22,846 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 09:02:22,846 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-10 09:02:22,846 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-10 09:02:22,846 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-10 09:02:22,846 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 09:02:22,847 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 09:02:22,847 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-10 09:02:22,847 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 09:02:22,847 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-10 09:02:22,855 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states. [2018-11-10 09:02:22,872 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 20 [2018-11-10 09:02:22,872 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 09:02:22,872 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 09:02:22,878 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-10 09:02:22,878 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:02:22,878 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-10 09:02:22,878 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states. [2018-11-10 09:02:22,880 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 20 [2018-11-10 09:02:22,880 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 09:02:22,880 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 09:02:22,880 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-10 09:02:22,881 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:02:22,886 INFO L793 eck$LassoCheckResult]: Stem: 26#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 10#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet14, main_#t~nondet15, main_#t~ret16;assume { :begin_inline_test_fun } true;test_fun_#in~x, test_fun_#in~y := main_#t~nondet14, main_#t~nondet15;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~mem9, test_fun_#t~mem10, test_fun_#t~mem11, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~short8, test_fun_#t~mem12, test_fun_#t~mem4, test_fun_#t~mem13, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset; 29#L551true SUMMARY for call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L551 31#L551-1true SUMMARY for call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L551-1 32#L553-3true [2018-11-10 09:02:22,887 INFO L795 eck$LassoCheckResult]: Loop: 32#L553-3true assume true; 24#L553true SUMMARY for call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L553 27#L553-1true assume !!(test_fun_#t~mem4 >= 0);havoc test_fun_#t~mem4; 23#L554true SUMMARY for call write~int(1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L554 19#L555-9true assume !true; 21#L555-10true SUMMARY for call test_fun_#t~mem12 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L555-10 14#L561true SUMMARY for call write~int(test_fun_#t~mem12 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L561 16#L561-1true havoc test_fun_#t~mem12; 32#L553-3true [2018-11-10 09:02:22,890 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:02:22,891 INFO L82 PathProgramCache]: Analyzing trace with hash 925540, now seen corresponding path program 1 times [2018-11-10 09:02:22,892 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:02:22,892 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:02:22,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:02:22,925 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:02:22,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:02:22,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:02:22,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:02:22,982 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:02:22,982 INFO L82 PathProgramCache]: Analyzing trace with hash -19016633, now seen corresponding path program 1 times [2018-11-10 09:02:22,982 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:02:22,982 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:02:22,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:02:22,983 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:02:22,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:02:22,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:02:23,006 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:02:23,007 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 09:02:23,007 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 09:02:23,010 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 09:02:23,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-10 09:02:23,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-10 09:02:23,020 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 2 states. [2018-11-10 09:02:23,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:02:23,026 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2018-11-10 09:02:23,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-10 09:02:23,027 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 35 transitions. [2018-11-10 09:02:23,028 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 20 [2018-11-10 09:02:23,030 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 24 states and 26 transitions. [2018-11-10 09:02:23,031 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2018-11-10 09:02:23,031 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2018-11-10 09:02:23,031 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 26 transitions. [2018-11-10 09:02:23,032 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 09:02:23,032 INFO L705 BuchiCegarLoop]: Abstraction has 24 states and 26 transitions. [2018-11-10 09:02:23,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 26 transitions. [2018-11-10 09:02:23,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-11-10 09:02:23,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-10 09:02:23,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2018-11-10 09:02:23,050 INFO L728 BuchiCegarLoop]: Abstraction has 24 states and 26 transitions. [2018-11-10 09:02:23,050 INFO L608 BuchiCegarLoop]: Abstraction has 24 states and 26 transitions. [2018-11-10 09:02:23,050 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-10 09:02:23,050 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 26 transitions. [2018-11-10 09:02:23,050 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 20 [2018-11-10 09:02:23,051 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 09:02:23,051 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 09:02:23,051 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-10 09:02:23,051 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:02:23,051 INFO L793 eck$LassoCheckResult]: Stem: 90#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 85#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet14, main_#t~nondet15, main_#t~ret16;assume { :begin_inline_test_fun } true;test_fun_#in~x, test_fun_#in~y := main_#t~nondet14, main_#t~nondet15;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~mem9, test_fun_#t~mem10, test_fun_#t~mem11, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~short8, test_fun_#t~mem12, test_fun_#t~mem4, test_fun_#t~mem13, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset; 86#L551 SUMMARY for call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L551 92#L551-1 SUMMARY for call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L551-1 95#L553-3 [2018-11-10 09:02:23,052 INFO L795 eck$LassoCheckResult]: Loop: 95#L553-3 assume true; 87#L553 SUMMARY for call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L553 88#L553-1 assume !!(test_fun_#t~mem4 >= 0);havoc test_fun_#t~mem4; 83#L554 SUMMARY for call write~int(1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L554 77#L555-9 assume true; 78#L555 SUMMARY for call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L555 82#L555-1 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L555-1 84#L555-2 test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 89#L555-3 assume !test_fun_#t~short8; 72#L555-7 assume !test_fun_#t~short8;havoc test_fun_#t~mem6;havoc test_fun_#t~short8;havoc test_fun_#t~mem7;havoc test_fun_#t~mem5; 73#L555-10 SUMMARY for call test_fun_#t~mem12 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L555-10 80#L561 SUMMARY for call write~int(test_fun_#t~mem12 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L561 94#L561-1 havoc test_fun_#t~mem12; 95#L553-3 [2018-11-10 09:02:23,052 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:02:23,052 INFO L82 PathProgramCache]: Analyzing trace with hash 925540, now seen corresponding path program 2 times [2018-11-10 09:02:23,052 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:02:23,052 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:02:23,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:02:23,054 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:02:23,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:02:23,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:02:23,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:02:23,076 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:02:23,076 INFO L82 PathProgramCache]: Analyzing trace with hash 251638538, now seen corresponding path program 1 times [2018-11-10 09:02:23,076 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:02:23,076 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:02:23,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:02:23,077 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 09:02:23,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:02:23,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:02:23,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:02:23,099 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:02:23,099 INFO L82 PathProgramCache]: Analyzing trace with hash 1239477383, now seen corresponding path program 1 times [2018-11-10 09:02:23,099 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:02:23,099 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:02:23,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:02:23,101 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:02:23,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:02:23,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:02:23,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:02:23,264 WARN L179 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 53 [2018-11-10 09:02:23,439 WARN L179 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 77 [2018-11-10 09:02:23,517 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 09:02:23,518 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 09:02:23,518 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 09:02:23,518 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 09:02:23,518 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 09:02:23,518 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 09:02:23,519 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 09:02:23,519 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 09:02:23,519 INFO L131 ssoRankerPreferences]: Filename of dumped script: c.01_assume-alloca_true-termination_true-no-overflow.c.i_Iteration2_Lasso [2018-11-10 09:02:23,519 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 09:02:23,519 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 09:02:23,534 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:02:23,537 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:02:23,538 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:02:23,540 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:02:23,541 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:02:23,544 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:02:23,545 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:02:23,547 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:02:23,549 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:02:23,551 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:02:23,552 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:02:23,553 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:02:23,554 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:02:23,555 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:02:23,557 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:02:23,559 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:02:23,741 WARN L179 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 77 [2018-11-10 09:02:23,809 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:02:23,810 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:02:23,812 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:02:23,813 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:02:24,163 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 09:02:24,167 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 09:02:24,168 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:02:24,169 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:02:24,169 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:02:24,169 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:02:24,170 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:02:24,170 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:02:24,171 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:02:24,171 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:02:24,173 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:02:24,173 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:02:24,174 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:02:24,174 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:02:24,174 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:02:24,174 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:02:24,174 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:02:24,175 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:02:24,175 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:02:24,175 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:02:24,175 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:02:24,176 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:02:24,176 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:02:24,176 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:02:24,176 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:02:24,176 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:02:24,176 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:02:24,176 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:02:24,177 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:02:24,177 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:02:24,178 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:02:24,178 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:02:24,178 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:02:24,178 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:02:24,178 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:02:24,178 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:02:24,178 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:02:24,179 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:02:24,179 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:02:24,179 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:02:24,180 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:02:24,180 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:02:24,180 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:02:24,181 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 09:02:24,181 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 09:02:24,184 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:02:24,185 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:02:24,185 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:02:24,185 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:02:24,185 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:02:24,185 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:02:24,186 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:02:24,186 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:02:24,186 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:02:24,187 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:02:24,187 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:02:24,187 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:02:24,187 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:02:24,187 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:02:24,187 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:02:24,188 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 09:02:24,189 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 09:02:24,193 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:02:24,194 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:02:24,194 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:02:24,194 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:02:24,195 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:02:24,195 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:02:24,195 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:02:24,195 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:02:24,195 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:02:24,196 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:02:24,196 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:02:24,197 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:02:24,197 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:02:24,197 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:02:24,197 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:02:24,198 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 09:02:24,198 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 09:02:24,201 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:02:24,201 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:02:24,202 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:02:24,202 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:02:24,202 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:02:24,202 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:02:24,202 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:02:24,203 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:02:24,203 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:02:24,203 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:02:24,204 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:02:24,204 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:02:24,204 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:02:24,204 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:02:24,204 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:02:24,204 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:02:24,205 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:02:24,205 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:02:24,205 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:02:24,206 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:02:24,206 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:02:24,206 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:02:24,209 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:02:24,210 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:02:24,210 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:02:24,210 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:02:24,210 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:02:24,211 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:02:24,211 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:02:24,212 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:02:24,212 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:02:24,212 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:02:24,212 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:02:24,212 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:02:24,212 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:02:24,213 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:02:24,213 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:02:24,214 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:02:24,214 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:02:24,214 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:02:24,214 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:02:24,214 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:02:24,215 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 09:02:24,215 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 09:02:24,217 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:02:24,218 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:02:24,218 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:02:24,218 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:02:24,219 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:02:24,219 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:02:24,220 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 09:02:24,220 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 09:02:24,222 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:02:24,223 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:02:24,223 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:02:24,223 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:02:24,223 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:02:24,223 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:02:24,227 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 09:02:24,227 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 09:02:24,240 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:02:24,240 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:02:24,241 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:02:24,241 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:02:24,241 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:02:24,241 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:02:24,246 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 09:02:24,246 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 09:02:24,267 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:02:24,268 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:02:24,268 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:02:24,268 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:02:24,269 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:02:24,269 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:02:24,270 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 09:02:24,270 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 09:02:24,274 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:02:24,275 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:02:24,275 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:02:24,275 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:02:24,275 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:02:24,275 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:02:24,276 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 09:02:24,277 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 09:02:24,281 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:02:24,282 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:02:24,282 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:02:24,282 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 09:02:24,283 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:02:24,283 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:02:24,284 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 09:02:24,284 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 09:02:24,293 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:02:24,293 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:02:24,294 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:02:24,294 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:02:24,294 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:02:24,294 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:02:24,297 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 09:02:24,297 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 09:02:24,306 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 09:02:24,316 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-10 09:02:24,316 INFO L444 ModelExtractionUtils]: 10 out of 16 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-11-10 09:02:24,318 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 09:02:24,319 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 09:02:24,319 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 09:02:24,320 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_1) = 2*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_1 + 1 Supporting invariants [] [2018-11-10 09:02:24,351 INFO L297 tatePredicateManager]: 9 out of 11 supporting invariants were superfluous and have been removed [2018-11-10 09:02:24,359 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 09:02:24,382 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:02:24,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:02:24,397 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:02:24,424 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-10 09:02:24,425 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 09:02:24,432 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:02:24,432 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-10 09:02:24,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:02:24,444 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:02:24,478 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 31 [2018-11-10 09:02:24,480 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 09:02:24,480 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 09:02:24,485 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:02:24,492 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 09:02:24,492 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:33 [2018-11-10 09:02:24,560 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 09:02:24,562 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 49 [2018-11-10 09:02:24,566 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 29 [2018-11-10 09:02:24,568 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 09:02:24,580 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 09:02:24,600 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-10 09:02:24,600 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:53, output treesize:34 [2018-11-10 09:02:24,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:02:24,633 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 6 loop predicates [2018-11-10 09:02:24,634 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24 states and 26 transitions. cyclomatic complexity: 3 Second operand 9 states. [2018-11-10 09:02:24,727 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 24 states and 26 transitions. cyclomatic complexity: 3. Second operand 9 states. Result 93 states and 103 transitions. Complement of second has 14 states. [2018-11-10 09:02:24,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 2 stem states 5 non-accepting loop states 1 accepting loop states [2018-11-10 09:02:24,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-10 09:02:24,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 42 transitions. [2018-11-10 09:02:24,731 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 42 transitions. Stem has 4 letters. Loop has 13 letters. [2018-11-10 09:02:24,732 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 09:02:24,733 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 42 transitions. Stem has 17 letters. Loop has 13 letters. [2018-11-10 09:02:24,733 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 09:02:24,733 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 42 transitions. Stem has 4 letters. Loop has 26 letters. [2018-11-10 09:02:24,733 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 09:02:24,734 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 93 states and 103 transitions. [2018-11-10 09:02:24,736 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 33 [2018-11-10 09:02:24,737 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 93 states to 72 states and 80 transitions. [2018-11-10 09:02:24,737 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 55 [2018-11-10 09:02:24,737 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 57 [2018-11-10 09:02:24,738 INFO L73 IsDeterministic]: Start isDeterministic. Operand 72 states and 80 transitions. [2018-11-10 09:02:24,738 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 09:02:24,738 INFO L705 BuchiCegarLoop]: Abstraction has 72 states and 80 transitions. [2018-11-10 09:02:24,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states and 80 transitions. [2018-11-10 09:02:24,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 52. [2018-11-10 09:02:24,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-11-10 09:02:24,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 58 transitions. [2018-11-10 09:02:24,742 INFO L728 BuchiCegarLoop]: Abstraction has 52 states and 58 transitions. [2018-11-10 09:02:24,742 INFO L608 BuchiCegarLoop]: Abstraction has 52 states and 58 transitions. [2018-11-10 09:02:24,742 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-10 09:02:24,742 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 52 states and 58 transitions. [2018-11-10 09:02:24,743 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 20 [2018-11-10 09:02:24,743 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 09:02:24,743 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 09:02:24,743 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:02:24,743 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:02:24,743 INFO L793 eck$LassoCheckResult]: Stem: 358#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 350#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet14, main_#t~nondet15, main_#t~ret16;assume { :begin_inline_test_fun } true;test_fun_#in~x, test_fun_#in~y := main_#t~nondet14, main_#t~nondet15;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~mem9, test_fun_#t~mem10, test_fun_#t~mem11, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~short8, test_fun_#t~mem12, test_fun_#t~mem4, test_fun_#t~mem13, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset; 351#L551 SUMMARY for call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L551 364#L551-1 SUMMARY for call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L551-1 369#L553-3 assume true; 352#L553 SUMMARY for call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L553 353#L553-1 assume !!(test_fun_#t~mem4 >= 0);havoc test_fun_#t~mem4; 361#L554 SUMMARY for call write~int(1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L554 335#L555-9 assume true; 336#L555 SUMMARY for call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L555 344#L555-1 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L555-1 346#L555-2 test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 356#L555-3 assume !test_fun_#t~short8; 328#L555-7 assume !!test_fun_#t~short8;havoc test_fun_#t~mem6;havoc test_fun_#t~short8;havoc test_fun_#t~mem7;havoc test_fun_#t~mem5; 329#L556 [2018-11-10 09:02:24,744 INFO L795 eck$LassoCheckResult]: Loop: 329#L556 SUMMARY for call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L556 339#L556-1 assume !(test_fun_#t~mem9 <= 0);havoc test_fun_#t~mem9; 343#L559 SUMMARY for call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L559 332#L559-1 SUMMARY for call write~int(2 * test_fun_#t~mem11, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L559-1 333#L559-2 havoc test_fun_#t~mem11; 334#L555-9 assume true; 377#L555 SUMMARY for call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L555 376#L555-1 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L555-1 375#L555-2 test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 373#L555-3 assume !test_fun_#t~short8; 371#L555-7 assume !!test_fun_#t~short8;havoc test_fun_#t~mem6;havoc test_fun_#t~short8;havoc test_fun_#t~mem7;havoc test_fun_#t~mem5; 329#L556 [2018-11-10 09:02:24,744 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:02:24,745 INFO L82 PathProgramCache]: Analyzing trace with hash -1770509680, now seen corresponding path program 1 times [2018-11-10 09:02:24,745 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:02:24,745 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:02:24,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:02:24,746 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:02:24,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:02:24,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:02:24,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:02:24,767 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 09:02:24,767 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 09:02:24,767 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 09:02:24,767 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:02:24,767 INFO L82 PathProgramCache]: Analyzing trace with hash -675471408, now seen corresponding path program 1 times [2018-11-10 09:02:24,767 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:02:24,768 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:02:24,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:02:24,768 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:02:24,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:02:24,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:02:24,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:02:24,783 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 09:02:24,783 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 09:02:24,783 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 09:02:24,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 09:02:24,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 09:02:24,784 INFO L87 Difference]: Start difference. First operand 52 states and 58 transitions. cyclomatic complexity: 8 Second operand 3 states. [2018-11-10 09:02:24,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:02:24,798 INFO L93 Difference]: Finished difference Result 55 states and 60 transitions. [2018-11-10 09:02:24,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 09:02:24,798 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 55 states and 60 transitions. [2018-11-10 09:02:24,799 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 21 [2018-11-10 09:02:24,800 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 55 states to 54 states and 59 transitions. [2018-11-10 09:02:24,800 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 38 [2018-11-10 09:02:24,800 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 38 [2018-11-10 09:02:24,801 INFO L73 IsDeterministic]: Start isDeterministic. Operand 54 states and 59 transitions. [2018-11-10 09:02:24,801 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 09:02:24,801 INFO L705 BuchiCegarLoop]: Abstraction has 54 states and 59 transitions. [2018-11-10 09:02:24,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states and 59 transitions. [2018-11-10 09:02:24,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 53. [2018-11-10 09:02:24,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-11-10 09:02:24,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 58 transitions. [2018-11-10 09:02:24,803 INFO L728 BuchiCegarLoop]: Abstraction has 53 states and 58 transitions. [2018-11-10 09:02:24,803 INFO L608 BuchiCegarLoop]: Abstraction has 53 states and 58 transitions. [2018-11-10 09:02:24,803 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-10 09:02:24,804 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 53 states and 58 transitions. [2018-11-10 09:02:24,804 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 21 [2018-11-10 09:02:24,804 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 09:02:24,804 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 09:02:24,805 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:02:24,805 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:02:24,805 INFO L793 eck$LassoCheckResult]: Stem: 471#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 463#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet14, main_#t~nondet15, main_#t~ret16;assume { :begin_inline_test_fun } true;test_fun_#in~x, test_fun_#in~y := main_#t~nondet14, main_#t~nondet15;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~mem9, test_fun_#t~mem10, test_fun_#t~mem11, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~short8, test_fun_#t~mem12, test_fun_#t~mem4, test_fun_#t~mem13, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset; 464#L551 SUMMARY for call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L551 475#L551-1 SUMMARY for call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L551-1 480#L553-3 assume true; 494#L553 SUMMARY for call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L553 493#L553-1 assume !!(test_fun_#t~mem4 >= 0);havoc test_fun_#t~mem4; 492#L554 SUMMARY for call write~int(1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L554 491#L555-9 assume true; 490#L555 SUMMARY for call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L555 489#L555-1 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L555-1 488#L555-2 test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 487#L555-3 assume test_fun_#t~short8; 486#L555-4 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L555-4 485#L555-5 test_fun_#t~short8 := test_fun_#t~mem7 < 1073741824; 442#L555-7 assume !!test_fun_#t~short8;havoc test_fun_#t~mem6;havoc test_fun_#t~short8;havoc test_fun_#t~mem7;havoc test_fun_#t~mem5; 443#L556 [2018-11-10 09:02:24,805 INFO L795 eck$LassoCheckResult]: Loop: 443#L556 SUMMARY for call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L556 452#L556-1 assume !(test_fun_#t~mem9 <= 0);havoc test_fun_#t~mem9; 458#L559 SUMMARY for call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L559 446#L559-1 SUMMARY for call write~int(2 * test_fun_#t~mem11, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L559-1 447#L559-2 havoc test_fun_#t~mem11; 448#L555-9 assume true; 449#L555 SUMMARY for call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L555 456#L555-1 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L555-1 461#L555-2 test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 469#L555-3 assume test_fun_#t~short8; 472#L555-4 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L555-4 476#L555-5 test_fun_#t~short8 := test_fun_#t~mem7 < 1073741824; 483#L555-7 assume !!test_fun_#t~short8;havoc test_fun_#t~mem6;havoc test_fun_#t~short8;havoc test_fun_#t~mem7;havoc test_fun_#t~mem5; 443#L556 [2018-11-10 09:02:24,805 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:02:24,806 INFO L82 PathProgramCache]: Analyzing trace with hash -652880141, now seen corresponding path program 1 times [2018-11-10 09:02:24,806 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:02:24,806 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:02:24,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:02:24,811 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:02:24,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:02:24,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:02:24,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:02:24,835 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:02:24,835 INFO L82 PathProgramCache]: Analyzing trace with hash -588088269, now seen corresponding path program 1 times [2018-11-10 09:02:24,835 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:02:24,836 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:02:24,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:02:24,836 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:02:24,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:02:24,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:02:24,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:02:24,848 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:02:24,848 INFO L82 PathProgramCache]: Analyzing trace with hash 405864065, now seen corresponding path program 1 times [2018-11-10 09:02:24,849 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:02:24,849 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:02:24,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:02:24,849 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:02:24,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:02:24,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:02:24,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:02:25,179 WARN L179 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 99 [2018-11-10 09:02:25,236 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 09:02:25,236 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 09:02:25,236 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 09:02:25,236 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 09:02:25,236 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 09:02:25,236 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 09:02:25,236 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 09:02:25,237 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 09:02:25,237 INFO L131 ssoRankerPreferences]: Filename of dumped script: c.01_assume-alloca_true-termination_true-no-overflow.c.i_Iteration4_Lasso [2018-11-10 09:02:25,237 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 09:02:25,237 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 09:02:25,240 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:02:25,243 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:02:25,244 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:02:25,245 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:02:25,248 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:02:25,249 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:02:25,251 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:02:25,252 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:02:25,254 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:02:25,255 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:02:25,256 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:02:25,257 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:02:25,258 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:02:25,259 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:02:25,262 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:02:25,264 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:02:25,265 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:02:25,267 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:02:25,268 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:02:25,269 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:02:25,270 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:02:25,415 WARN L179 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 73 [2018-11-10 09:02:25,776 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 09:02:25,776 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 09:02:25,776 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:02:25,777 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:02:25,777 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:02:25,777 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:02:25,777 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:02:25,777 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:02:25,777 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:02:25,778 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:02:25,778 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:02:25,779 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:02:25,779 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:02:25,779 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:02:25,779 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:02:25,779 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:02:25,780 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 09:02:25,780 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 09:02:25,781 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:02:25,782 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:02:25,782 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:02:25,782 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:02:25,782 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:02:25,782 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:02:25,782 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:02:25,783 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:02:25,783 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:02:25,783 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:02:25,783 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:02:25,784 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:02:25,784 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:02:25,784 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:02:25,784 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:02:25,784 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 09:02:25,784 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 09:02:25,785 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:02:25,786 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:02:25,786 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:02:25,786 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:02:25,786 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:02:25,786 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:02:25,787 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 09:02:25,787 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 09:02:25,789 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:02:25,789 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:02:25,789 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:02:25,789 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:02:25,789 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:02:25,790 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:02:25,790 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:02:25,790 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:02:25,790 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:02:25,791 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:02:25,791 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:02:25,791 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:02:25,791 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:02:25,791 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:02:25,791 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:02:25,792 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:02:25,792 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:02:25,792 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:02:25,792 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:02:25,793 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:02:25,793 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:02:25,793 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:02:25,793 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:02:25,793 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:02:25,794 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 09:02:25,794 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 09:02:25,795 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:02:25,795 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:02:25,795 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:02:25,796 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:02:25,796 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:02:25,796 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:02:25,796 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:02:25,796 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:02:25,796 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:02:25,797 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:02:25,797 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:02:25,797 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:02:25,797 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:02:25,797 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:02:25,797 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:02:25,797 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:02:25,798 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:02:25,798 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:02:25,798 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:02:25,798 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:02:25,799 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:02:25,799 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:02:25,799 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:02:25,799 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:02:25,799 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:02:25,799 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:02:25,800 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:02:25,800 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:02:25,800 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:02:25,800 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:02:25,800 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:02:25,801 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:02:25,801 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:02:25,801 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:02:25,801 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:02:25,801 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:02:25,801 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:02:25,802 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:02:25,802 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:02:25,802 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:02:25,802 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:02:25,802 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:02:25,802 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:02:25,803 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:02:25,803 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:02:25,803 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:02:25,803 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:02:25,804 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:02:25,804 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:02:25,804 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:02:25,804 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:02:25,805 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 09:02:25,805 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 09:02:25,806 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:02:25,806 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:02:25,807 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:02:25,807 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:02:25,807 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:02:25,807 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:02:25,807 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:02:25,807 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:02:25,807 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:02:25,808 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:02:25,808 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:02:25,808 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:02:25,808 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:02:25,809 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:02:25,809 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:02:25,809 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:02:25,809 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:02:25,809 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:02:25,809 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:02:25,810 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:02:25,810 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:02:25,810 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:02:25,810 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:02:25,810 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:02:25,811 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 09:02:25,811 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 09:02:25,812 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:02:25,812 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:02:25,813 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:02:25,813 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:02:25,813 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:02:25,813 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:02:25,813 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:02:25,813 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:02:25,813 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:02:25,814 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:02:25,814 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:02:25,814 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:02:25,814 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:02:25,814 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:02:25,814 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:02:25,815 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 09:02:25,815 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 09:02:25,817 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:02:25,817 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:02:25,817 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:02:25,817 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:02:25,817 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:02:25,818 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:02:25,818 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:02:25,818 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:02:25,818 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:02:25,818 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:02:25,819 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:02:25,819 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:02:25,819 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:02:25,819 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:02:25,819 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:02:25,820 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 09:02:25,820 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 09:02:25,821 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:02:25,821 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:02:25,822 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:02:25,822 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:02:25,822 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:02:25,822 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:02:25,824 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 09:02:25,824 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 09:02:25,843 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 09:02:25,873 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2018-11-10 09:02:25,873 INFO L444 ModelExtractionUtils]: 11 out of 19 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-11-10 09:02:25,873 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 09:02:25,874 INFO L440 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2018-11-10 09:02:25,875 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 09:02:25,875 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_2, ULTIMATE.start_test_fun_#in~x) = -1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_2 + 268435456*ULTIMATE.start_test_fun_#in~x Supporting invariants [1*ULTIMATE.start_test_fun_#in~x - 2 >= 0] [2018-11-10 09:02:25,921 INFO L297 tatePredicateManager]: 11 out of 12 supporting invariants were superfluous and have been removed [2018-11-10 09:02:25,923 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 09:02:25,951 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:02:25,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:02:25,972 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:02:25,981 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-10 09:02:25,982 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 09:02:25,986 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:02:25,987 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-10 09:02:26,001 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-10 09:02:26,004 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 09:02:26,005 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 09:02:26,007 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:02:26,013 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:02:26,013 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:13 [2018-11-10 09:02:26,032 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-11-10 09:02:26,035 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 09:02:26,035 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 09:02:26,039 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:02:26,044 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:02:26,044 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:13 [2018-11-10 09:02:26,050 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-11-10 09:02:26,055 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 09:02:26,055 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 09:02:26,059 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:02:26,064 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:02:26,064 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:24, output treesize:20 [2018-11-10 09:02:26,097 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 25 [2018-11-10 09:02:26,102 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-11-10 09:02:26,103 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 09:02:26,112 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-10 09:02:26,112 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 09:02:26,116 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:02:26,120 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:02:26,120 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:34, output treesize:8 [2018-11-10 09:02:26,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:02:26,162 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:02:26,219 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 09:02:26,220 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 38 [2018-11-10 09:02:26,224 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 29 [2018-11-10 09:02:26,226 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-10 09:02:26,241 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:02:26,245 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 09:02:26,245 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:42, output treesize:23 [2018-11-10 09:02:26,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:02:26,332 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.8 stem predicates 7 loop predicates [2018-11-10 09:02:26,332 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 53 states and 58 transitions. cyclomatic complexity: 7 Second operand 15 states. [2018-11-10 09:02:26,886 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 53 states and 58 transitions. cyclomatic complexity: 7. Second operand 15 states. Result 142 states and 154 transitions. Complement of second has 28 states. [2018-11-10 09:02:26,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 20 states 11 stem states 7 non-accepting loop states 2 accepting loop states [2018-11-10 09:02:26,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-10 09:02:26,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 75 transitions. [2018-11-10 09:02:26,888 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 75 transitions. Stem has 16 letters. Loop has 13 letters. [2018-11-10 09:02:26,888 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 09:02:26,888 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 75 transitions. Stem has 29 letters. Loop has 13 letters. [2018-11-10 09:02:26,888 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 09:02:26,889 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 75 transitions. Stem has 16 letters. Loop has 26 letters. [2018-11-10 09:02:26,889 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 09:02:26,889 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 142 states and 154 transitions. [2018-11-10 09:02:26,890 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 21 [2018-11-10 09:02:26,891 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 142 states to 139 states and 150 transitions. [2018-11-10 09:02:26,891 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 77 [2018-11-10 09:02:26,891 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 79 [2018-11-10 09:02:26,891 INFO L73 IsDeterministic]: Start isDeterministic. Operand 139 states and 150 transitions. [2018-11-10 09:02:26,891 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 09:02:26,891 INFO L705 BuchiCegarLoop]: Abstraction has 139 states and 150 transitions. [2018-11-10 09:02:26,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states and 150 transitions. [2018-11-10 09:02:26,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 113. [2018-11-10 09:02:26,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-11-10 09:02:26,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 124 transitions. [2018-11-10 09:02:26,898 INFO L728 BuchiCegarLoop]: Abstraction has 113 states and 124 transitions. [2018-11-10 09:02:26,898 INFO L608 BuchiCegarLoop]: Abstraction has 113 states and 124 transitions. [2018-11-10 09:02:26,898 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-10 09:02:26,898 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 113 states and 124 transitions. [2018-11-10 09:02:26,899 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 21 [2018-11-10 09:02:26,899 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 09:02:26,899 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 09:02:26,899 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:02:26,900 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:02:26,900 INFO L793 eck$LassoCheckResult]: Stem: 900#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 892#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet14, main_#t~nondet15, main_#t~ret16;assume { :begin_inline_test_fun } true;test_fun_#in~x, test_fun_#in~y := main_#t~nondet14, main_#t~nondet15;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~mem9, test_fun_#t~mem10, test_fun_#t~mem11, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~short8, test_fun_#t~mem12, test_fun_#t~mem4, test_fun_#t~mem13, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset; 893#L551 SUMMARY for call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L551 905#L551-1 SUMMARY for call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L551-1 912#L553-3 assume true; 896#L553 SUMMARY for call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L553 897#L553-1 assume !!(test_fun_#t~mem4 >= 0);havoc test_fun_#t~mem4; 889#L554 SUMMARY for call write~int(1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L554 890#L555-9 assume true; 961#L555 SUMMARY for call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L555 959#L555-1 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L555-1 957#L555-2 test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 955#L555-3 assume test_fun_#t~short8; 929#L555-4 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L555-4 926#L555-5 test_fun_#t~short8 := test_fun_#t~mem7 < 1073741824; 918#L555-7 assume !!test_fun_#t~short8;havoc test_fun_#t~mem6;havoc test_fun_#t~short8;havoc test_fun_#t~mem7;havoc test_fun_#t~mem5; 917#L556 SUMMARY for call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L556 880#L556-1 assume !(test_fun_#t~mem9 <= 0);havoc test_fun_#t~mem9; 947#L559 SUMMARY for call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L559 946#L559-1 SUMMARY for call write~int(2 * test_fun_#t~mem11, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L559-1 870#L559-2 havoc test_fun_#t~mem11; 871#L555-9 assume true; 873#L555 SUMMARY for call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L555 883#L555-1 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L555-1 887#L555-2 test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 894#L555-3 assume !test_fun_#t~short8; 862#L555-7 [2018-11-10 09:02:26,900 INFO L795 eck$LassoCheckResult]: Loop: 862#L555-7 assume !test_fun_#t~short8;havoc test_fun_#t~mem6;havoc test_fun_#t~short8;havoc test_fun_#t~mem7;havoc test_fun_#t~mem5; 863#L555-10 SUMMARY for call test_fun_#t~mem12 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L555-10 881#L561 SUMMARY for call write~int(test_fun_#t~mem12 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L561 906#L561-1 havoc test_fun_#t~mem12; 913#L553-3 assume true; 949#L553 SUMMARY for call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L553 948#L553-1 assume !!(test_fun_#t~mem4 >= 0);havoc test_fun_#t~mem4; 944#L554 SUMMARY for call write~int(1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L554 942#L555-9 assume true; 940#L555 SUMMARY for call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L555 938#L555-1 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L555-1 936#L555-2 test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 934#L555-3 assume !test_fun_#t~short8; 862#L555-7 [2018-11-10 09:02:26,900 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:02:26,900 INFO L82 PathProgramCache]: Analyzing trace with hash -871493785, now seen corresponding path program 1 times [2018-11-10 09:02:26,900 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:02:26,900 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:02:26,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:02:26,901 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:02:26,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:02:26,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:02:26,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:02:26,921 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:02:26,922 INFO L82 PathProgramCache]: Analyzing trace with hash 1335004710, now seen corresponding path program 2 times [2018-11-10 09:02:26,922 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:02:26,922 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:02:26,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:02:26,924 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:02:26,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:02:26,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:02:26,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:02:26,932 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:02:26,932 INFO L82 PathProgramCache]: Analyzing trace with hash 124990592, now seen corresponding path program 1 times [2018-11-10 09:02:26,933 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:02:26,933 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:02:26,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:02:26,933 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 09:02:26,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:02:26,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:02:26,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:02:27,375 WARN L179 SmtUtils]: Spent 325.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 121 [2018-11-10 09:02:27,434 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 09:02:27,434 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 09:02:27,435 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 09:02:27,435 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 09:02:27,435 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 09:02:27,435 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 09:02:27,435 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 09:02:27,435 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 09:02:27,435 INFO L131 ssoRankerPreferences]: Filename of dumped script: c.01_assume-alloca_true-termination_true-no-overflow.c.i_Iteration5_Lasso [2018-11-10 09:02:27,435 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 09:02:27,435 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 09:02:27,437 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:02:27,439 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:02:27,442 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:02:27,443 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:02:27,445 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:02:27,448 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:02:27,449 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:02:27,450 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:02:27,451 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:02:27,452 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:02:27,453 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:02:27,454 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:02:27,457 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:02:27,458 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:02:27,459 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:02:27,460 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:02:27,461 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:02:27,617 WARN L179 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 81 [2018-11-10 09:02:27,676 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:02:27,957 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 09:02:27,957 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 09:02:27,957 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:02:27,958 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:02:27,958 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:02:27,958 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:02:27,958 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:02:27,958 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:02:27,958 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:02:27,958 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:02:27,959 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:02:27,959 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:02:27,959 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:02:27,960 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:02:27,960 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:02:27,960 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:02:27,960 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 09:02:27,960 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 09:02:27,961 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:02:27,962 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:02:27,962 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:02:27,962 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:02:27,962 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:02:27,962 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:02:27,962 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:02:27,963 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:02:27,963 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:02:27,963 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:02:27,963 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:02:27,963 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:02:27,964 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:02:27,964 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:02:27,964 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:02:27,964 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:02:27,964 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:02:27,964 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:02:27,964 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:02:27,965 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:02:27,965 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:02:27,965 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:02:27,965 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:02:27,965 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:02:27,966 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 09:02:27,966 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 09:02:27,967 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:02:27,967 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:02:27,968 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:02:27,968 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:02:27,968 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:02:27,968 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:02:27,968 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:02:27,968 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:02:27,968 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:02:27,969 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:02:27,969 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:02:27,969 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:02:27,969 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:02:27,969 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:02:27,969 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:02:27,970 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 09:02:27,970 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 09:02:27,971 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:02:27,971 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:02:27,972 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:02:27,972 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:02:27,972 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:02:27,972 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:02:27,972 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:02:27,972 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:02:27,972 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:02:27,973 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:02:27,973 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:02:27,973 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:02:27,973 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:02:27,973 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:02:27,973 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:02:27,974 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 09:02:27,974 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 09:02:27,975 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:02:27,975 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:02:27,975 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:02:27,975 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:02:27,976 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:02:27,976 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:02:27,976 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:02:27,976 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:02:27,976 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:02:27,976 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:02:27,977 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:02:27,977 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:02:27,977 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:02:27,977 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:02:27,977 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:02:27,977 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:02:27,977 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:02:27,977 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:02:27,978 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:02:27,978 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:02:27,978 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:02:27,978 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:02:27,979 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:02:27,979 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:02:27,979 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 09:02:27,979 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 09:02:27,980 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:02:27,981 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:02:27,981 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:02:27,981 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:02:27,981 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:02:27,981 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:02:27,981 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:02:27,981 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:02:27,981 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:02:27,982 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:02:27,982 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:02:27,982 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:02:27,982 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:02:27,982 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:02:27,982 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:02:27,983 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 09:02:27,983 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 09:02:27,984 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:02:27,984 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:02:27,984 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:02:27,984 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:02:27,985 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:02:27,985 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:02:27,985 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:02:27,985 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:02:27,985 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:02:27,985 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:02:27,986 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:02:27,986 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:02:27,986 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:02:27,986 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:02:27,986 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:02:27,986 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:02:27,986 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:02:27,986 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:02:27,987 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:02:27,987 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:02:27,987 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:02:27,987 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:02:27,988 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:02:27,988 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:02:27,989 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 09:02:27,989 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 09:02:27,997 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:02:27,997 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:02:27,997 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:02:27,998 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 09:02:27,998 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:02:27,998 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:02:27,999 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 09:02:27,999 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 09:02:28,002 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:02:28,002 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:02:28,002 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:02:28,002 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:02:28,003 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:02:28,003 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:02:28,003 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 09:02:28,003 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 09:02:28,004 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:02:28,005 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:02:28,005 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:02:28,005 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:02:28,005 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:02:28,005 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:02:28,006 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 09:02:28,006 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 09:02:28,007 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:02:28,008 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:02:28,008 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:02:28,008 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 09:02:28,008 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:02:28,008 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:02:28,009 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 09:02:28,009 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 09:02:28,011 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:02:28,012 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:02:28,012 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:02:28,012 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:02:28,012 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:02:28,012 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:02:28,013 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 09:02:28,013 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 09:02:28,014 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:02:28,014 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:02:28,014 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:02:28,014 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:02:28,015 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:02:28,015 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:02:28,016 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 09:02:28,016 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 09:02:28,028 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 09:02:28,033 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-10 09:02:28,033 INFO L444 ModelExtractionUtils]: 20 out of 25 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-11-10 09:02:28,034 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 09:02:28,034 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 09:02:28,034 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 09:02:28,034 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_3) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_3 Supporting invariants [] [2018-11-10 09:02:28,092 INFO L297 tatePredicateManager]: 9 out of 11 supporting invariants were superfluous and have been removed [2018-11-10 09:02:28,094 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 09:02:28,107 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:02:28,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:02:28,117 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:02:28,123 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-10 09:02:28,123 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 09:02:28,126 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:02:28,126 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-10 09:02:28,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:02:28,135 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:02:28,149 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 09:02:28,149 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 29 [2018-11-10 09:02:28,151 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 22 [2018-11-10 09:02:28,152 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 09:02:28,156 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:02:28,160 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:02:28,160 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:17 [2018-11-10 09:02:28,192 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 29 [2018-11-10 09:02:28,196 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 09:02:28,196 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 09:02:28,202 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:02:28,208 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 09:02:28,208 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:31 [2018-11-10 09:02:28,224 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:02:28,224 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 6 loop predicates [2018-11-10 09:02:28,224 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 113 states and 124 transitions. cyclomatic complexity: 15 Second operand 9 states. [2018-11-10 09:02:28,295 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 113 states and 124 transitions. cyclomatic complexity: 15. Second operand 9 states. Result 286 states and 316 transitions. Complement of second has 11 states. [2018-11-10 09:02:28,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2018-11-10 09:02:28,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-10 09:02:28,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 49 transitions. [2018-11-10 09:02:28,297 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 49 transitions. Stem has 26 letters. Loop has 13 letters. [2018-11-10 09:02:28,298 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 09:02:28,298 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 49 transitions. Stem has 39 letters. Loop has 13 letters. [2018-11-10 09:02:28,299 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 09:02:28,299 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 49 transitions. Stem has 26 letters. Loop has 26 letters. [2018-11-10 09:02:28,299 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 09:02:28,299 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 286 states and 316 transitions. [2018-11-10 09:02:28,304 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 33 [2018-11-10 09:02:28,305 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 286 states to 211 states and 231 transitions. [2018-11-10 09:02:28,305 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 73 [2018-11-10 09:02:28,305 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 75 [2018-11-10 09:02:28,305 INFO L73 IsDeterministic]: Start isDeterministic. Operand 211 states and 231 transitions. [2018-11-10 09:02:28,305 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 09:02:28,306 INFO L705 BuchiCegarLoop]: Abstraction has 211 states and 231 transitions. [2018-11-10 09:02:28,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states and 231 transitions. [2018-11-10 09:02:28,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 191. [2018-11-10 09:02:28,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2018-11-10 09:02:28,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 210 transitions. [2018-11-10 09:02:28,316 INFO L728 BuchiCegarLoop]: Abstraction has 191 states and 210 transitions. [2018-11-10 09:02:28,316 INFO L608 BuchiCegarLoop]: Abstraction has 191 states and 210 transitions. [2018-11-10 09:02:28,317 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-10 09:02:28,317 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 191 states and 210 transitions. [2018-11-10 09:02:28,319 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 33 [2018-11-10 09:02:28,320 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 09:02:28,320 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 09:02:28,320 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:02:28,320 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:02:28,320 INFO L793 eck$LassoCheckResult]: Stem: 1502#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1493#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet14, main_#t~nondet15, main_#t~ret16;assume { :begin_inline_test_fun } true;test_fun_#in~x, test_fun_#in~y := main_#t~nondet14, main_#t~nondet15;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~mem9, test_fun_#t~mem10, test_fun_#t~mem11, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~short8, test_fun_#t~mem12, test_fun_#t~mem4, test_fun_#t~mem13, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset; 1494#L551 SUMMARY for call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L551 1508#L551-1 SUMMARY for call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L551-1 1514#L553-3 assume true; 1600#L553 SUMMARY for call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L553 1639#L553-1 assume !!(test_fun_#t~mem4 >= 0);havoc test_fun_#t~mem4; 1638#L554 SUMMARY for call write~int(1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L554 1637#L555-9 assume true; 1636#L555 SUMMARY for call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L555 1635#L555-1 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L555-1 1634#L555-2 test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 1633#L555-3 assume !test_fun_#t~short8; 1628#L555-7 assume !test_fun_#t~short8;havoc test_fun_#t~mem6;havoc test_fun_#t~short8;havoc test_fun_#t~mem7;havoc test_fun_#t~mem5; 1481#L555-10 SUMMARY for call test_fun_#t~mem12 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L555-10 1482#L561 SUMMARY for call write~int(test_fun_#t~mem12 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L561 1546#L561-1 havoc test_fun_#t~mem12; 1547#L553-3 assume true; 1623#L553 SUMMARY for call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L553 1622#L553-1 assume !!(test_fun_#t~mem4 >= 0);havoc test_fun_#t~mem4; 1621#L554 SUMMARY for call write~int(1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L554 1471#L555-9 [2018-11-10 09:02:28,321 INFO L795 eck$LassoCheckResult]: Loop: 1471#L555-9 assume true; 1473#L555 SUMMARY for call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L555 1483#L555-1 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L555-1 1491#L555-2 test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 1499#L555-3 assume test_fun_#t~short8; 1505#L555-4 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L555-4 1509#L555-5 test_fun_#t~short8 := test_fun_#t~mem7 < 1073741824; 1518#L555-7 assume !!test_fun_#t~short8;havoc test_fun_#t~mem6;havoc test_fun_#t~short8;havoc test_fun_#t~mem7;havoc test_fun_#t~mem5; 1545#L556 SUMMARY for call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L556 1544#L556-1 assume !(test_fun_#t~mem9 <= 0);havoc test_fun_#t~mem9; 1542#L559 SUMMARY for call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L559 1541#L559-1 SUMMARY for call write~int(2 * test_fun_#t~mem11, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L559-1 1470#L559-2 havoc test_fun_#t~mem11; 1471#L555-9 [2018-11-10 09:02:28,321 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:02:28,321 INFO L82 PathProgramCache]: Analyzing trace with hash 1593645930, now seen corresponding path program 2 times [2018-11-10 09:02:28,321 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:02:28,321 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:02:28,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:02:28,322 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:02:28,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:02:28,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:02:28,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:02:28,335 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:02:28,335 INFO L82 PathProgramCache]: Analyzing trace with hash -1274383525, now seen corresponding path program 2 times [2018-11-10 09:02:28,335 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:02:28,335 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:02:28,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:02:28,336 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 09:02:28,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:02:28,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:02:28,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:02:28,342 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:02:28,346 INFO L82 PathProgramCache]: Analyzing trace with hash 1617488530, now seen corresponding path program 2 times [2018-11-10 09:02:28,346 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:02:28,346 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:02:28,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:02:28,347 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 09:02:28,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:02:28,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:02:28,518 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:02:28,518 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 09:02:28,518 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_47fa782f-b229-409d-b6de-e77330964619/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 09:02:28,528 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-10 09:02:28,546 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-10 09:02:28,547 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 09:02:28,549 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:02:28,556 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-10 09:02:28,557 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 09:02:28,558 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:02:28,558 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:8, output treesize:4 [2018-11-10 09:02:28,561 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-10 09:02:28,562 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 09:02:28,563 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 09:02:28,565 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:02:28,567 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:02:28,568 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:16, output treesize:12 [2018-11-10 09:02:28,651 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 09:02:28,653 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2018-11-10 09:02:28,657 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 26 [2018-11-10 09:02:28,657 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 09:02:28,662 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:02:28,668 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:02:28,668 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:43, output treesize:25 [2018-11-10 09:02:28,680 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 09:02:28,681 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2018-11-10 09:02:28,683 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 7 [2018-11-10 09:02:28,683 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 09:02:28,690 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:02:28,694 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:02:28,694 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:30, output treesize:19 [2018-11-10 09:02:28,712 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 25 [2018-11-10 09:02:28,714 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-11-10 09:02:28,715 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 09:02:28,720 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-10 09:02:28,720 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 09:02:28,723 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:02:28,726 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:02:28,726 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:33, output treesize:7 [2018-11-10 09:02:28,741 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:02:28,757 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 09:02:28,757 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 21 [2018-11-10 09:02:28,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-10 09:02:28,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=340, Unknown=0, NotChecked=0, Total=420 [2018-11-10 09:02:28,821 INFO L87 Difference]: Start difference. First operand 191 states and 210 transitions. cyclomatic complexity: 27 Second operand 21 states. [2018-11-10 09:02:29,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:02:29,096 INFO L93 Difference]: Finished difference Result 252 states and 270 transitions. [2018-11-10 09:02:29,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-10 09:02:29,098 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 252 states and 270 transitions. [2018-11-10 09:02:29,100 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 52 [2018-11-10 09:02:29,101 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 252 states to 180 states and 193 transitions. [2018-11-10 09:02:29,101 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 101 [2018-11-10 09:02:29,101 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 101 [2018-11-10 09:02:29,101 INFO L73 IsDeterministic]: Start isDeterministic. Operand 180 states and 193 transitions. [2018-11-10 09:02:29,102 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 09:02:29,102 INFO L705 BuchiCegarLoop]: Abstraction has 180 states and 193 transitions. [2018-11-10 09:02:29,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states and 193 transitions. [2018-11-10 09:02:29,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 123. [2018-11-10 09:02:29,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-11-10 09:02:29,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 133 transitions. [2018-11-10 09:02:29,108 INFO L728 BuchiCegarLoop]: Abstraction has 123 states and 133 transitions. [2018-11-10 09:02:29,108 INFO L608 BuchiCegarLoop]: Abstraction has 123 states and 133 transitions. [2018-11-10 09:02:29,108 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-10 09:02:29,109 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 123 states and 133 transitions. [2018-11-10 09:02:29,109 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 38 [2018-11-10 09:02:29,109 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 09:02:29,109 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 09:02:29,110 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:02:29,110 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:02:29,110 INFO L793 eck$LassoCheckResult]: Stem: 2095#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2085#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet14, main_#t~nondet15, main_#t~ret16;assume { :begin_inline_test_fun } true;test_fun_#in~x, test_fun_#in~y := main_#t~nondet14, main_#t~nondet15;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~mem9, test_fun_#t~mem10, test_fun_#t~mem11, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~short8, test_fun_#t~mem12, test_fun_#t~mem4, test_fun_#t~mem13, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset; 2086#L551 SUMMARY for call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L551 2102#L551-1 SUMMARY for call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L551-1 2108#L553-3 assume true; 2129#L553 SUMMARY for call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L553 2141#L553-1 assume !!(test_fun_#t~mem4 >= 0);havoc test_fun_#t~mem4; 2138#L554 SUMMARY for call write~int(1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L554 2139#L555-9 assume true; 2166#L555 SUMMARY for call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L555 2165#L555-1 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L555-1 2164#L555-2 test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 2163#L555-3 assume test_fun_#t~short8; 2162#L555-4 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L555-4 2161#L555-5 test_fun_#t~short8 := test_fun_#t~mem7 < 1073741824; 2160#L555-7 assume !!test_fun_#t~short8;havoc test_fun_#t~mem6;havoc test_fun_#t~short8;havoc test_fun_#t~mem7;havoc test_fun_#t~mem5; 2158#L556 SUMMARY for call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L556 2159#L556-1 assume !(test_fun_#t~mem9 <= 0);havoc test_fun_#t~mem9; 2170#L559 SUMMARY for call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L559 2169#L559-1 SUMMARY for call write~int(2 * test_fun_#t~mem11, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L559-1 2056#L559-2 havoc test_fun_#t~mem11; 2057#L555-9 assume true; 2071#L555 SUMMARY for call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L555 2072#L555-1 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L555-1 2119#L555-2 test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 2120#L555-3 assume test_fun_#t~short8; 2168#L555-4 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L555-4 2167#L555-5 test_fun_#t~short8 := test_fun_#t~mem7 < 1073741824; 2110#L555-7 assume !test_fun_#t~short8;havoc test_fun_#t~mem6;havoc test_fun_#t~short8;havoc test_fun_#t~mem7;havoc test_fun_#t~mem5; 2068#L555-10 [2018-11-10 09:02:29,110 INFO L795 eck$LassoCheckResult]: Loop: 2068#L555-10 SUMMARY for call test_fun_#t~mem12 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L555-10 2069#L561 SUMMARY for call write~int(test_fun_#t~mem12 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L561 2103#L561-1 havoc test_fun_#t~mem12; 2106#L553-3 assume true; 2091#L553 SUMMARY for call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L553 2092#L553-1 assume !!(test_fun_#t~mem4 >= 0);havoc test_fun_#t~mem4; 2081#L554 SUMMARY for call write~int(1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L554 2082#L555-9 assume true; 2152#L555 SUMMARY for call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L555 2150#L555-1 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L555-1 2148#L555-2 test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 2118#L555-3 assume test_fun_#t~short8; 2115#L555-4 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L555-4 2111#L555-5 test_fun_#t~short8 := test_fun_#t~mem7 < 1073741824; 2112#L555-7 assume !test_fun_#t~short8;havoc test_fun_#t~mem6;havoc test_fun_#t~short8;havoc test_fun_#t~mem7;havoc test_fun_#t~mem5; 2068#L555-10 [2018-11-10 09:02:29,110 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:02:29,110 INFO L82 PathProgramCache]: Analyzing trace with hash 405864063, now seen corresponding path program 1 times [2018-11-10 09:02:29,110 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:02:29,110 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:02:29,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:02:29,111 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 09:02:29,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:02:29,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:02:29,166 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:02:29,166 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 09:02:29,166 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_47fa782f-b229-409d-b6de-e77330964619/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 09:02:29,186 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:02:29,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:02:29,197 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:02:29,203 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-10 09:02:29,204 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 09:02:29,205 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 09:02:29,206 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:02:29,207 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:02:29,207 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2018-11-10 09:02:29,218 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 09:02:29,219 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 29 [2018-11-10 09:02:29,220 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 19 [2018-11-10 09:02:29,221 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 09:02:29,224 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:02:29,226 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 09:02:29,227 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:13 [2018-11-10 09:02:29,239 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-11-10 09:02:29,240 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-11-10 09:02:29,240 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 09:02:29,242 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:02:29,244 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 09:02:29,244 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:20, output treesize:9 [2018-11-10 09:02:29,254 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:02:29,270 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 09:02:29,270 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 9 [2018-11-10 09:02:29,270 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 09:02:29,270 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:02:29,270 INFO L82 PathProgramCache]: Analyzing trace with hash -1446953535, now seen corresponding path program 1 times [2018-11-10 09:02:29,271 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:02:29,271 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:02:29,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:02:29,271 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:02:29,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:02:29,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:02:29,294 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:02:29,294 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 09:02:29,295 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-10 09:02:29,295 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 09:02:29,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 09:02:29,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-11-10 09:02:29,295 INFO L87 Difference]: Start difference. First operand 123 states and 133 transitions. cyclomatic complexity: 15 Second operand 7 states. [2018-11-10 09:02:29,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:02:29,333 INFO L93 Difference]: Finished difference Result 150 states and 158 transitions. [2018-11-10 09:02:29,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 09:02:29,334 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 150 states and 158 transitions. [2018-11-10 09:02:29,335 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 45 [2018-11-10 09:02:29,336 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 150 states to 139 states and 147 transitions. [2018-11-10 09:02:29,336 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 90 [2018-11-10 09:02:29,336 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 90 [2018-11-10 09:02:29,336 INFO L73 IsDeterministic]: Start isDeterministic. Operand 139 states and 147 transitions. [2018-11-10 09:02:29,336 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 09:02:29,336 INFO L705 BuchiCegarLoop]: Abstraction has 139 states and 147 transitions. [2018-11-10 09:02:29,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states and 147 transitions. [2018-11-10 09:02:29,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 113. [2018-11-10 09:02:29,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-11-10 09:02:29,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 121 transitions. [2018-11-10 09:02:29,340 INFO L728 BuchiCegarLoop]: Abstraction has 113 states and 121 transitions. [2018-11-10 09:02:29,340 INFO L608 BuchiCegarLoop]: Abstraction has 113 states and 121 transitions. [2018-11-10 09:02:29,340 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-10 09:02:29,340 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 113 states and 121 transitions. [2018-11-10 09:02:29,340 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 41 [2018-11-10 09:02:29,340 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 09:02:29,340 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 09:02:29,341 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:02:29,341 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:02:29,341 INFO L793 eck$LassoCheckResult]: Stem: 2464#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2456#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet14, main_#t~nondet15, main_#t~ret16;assume { :begin_inline_test_fun } true;test_fun_#in~x, test_fun_#in~y := main_#t~nondet14, main_#t~nondet15;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~mem9, test_fun_#t~mem10, test_fun_#t~mem11, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~short8, test_fun_#t~mem12, test_fun_#t~mem4, test_fun_#t~mem13, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset; 2457#L551 SUMMARY for call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L551 2472#L551-1 SUMMARY for call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L551-1 2480#L553-3 assume true; 2519#L553 SUMMARY for call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L553 2468#L553-1 assume !!(test_fun_#t~mem4 >= 0);havoc test_fun_#t~mem4; 2469#L554 SUMMARY for call write~int(1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L554 2518#L555-9 assume true; 2517#L555 SUMMARY for call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L555 2516#L555-1 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L555-1 2515#L555-2 test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 2514#L555-3 assume test_fun_#t~short8; 2513#L555-4 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L555-4 2512#L555-5 test_fun_#t~short8 := test_fun_#t~mem7 < 1073741824; 2511#L555-7 assume !!test_fun_#t~short8;havoc test_fun_#t~mem6;havoc test_fun_#t~short8;havoc test_fun_#t~mem7;havoc test_fun_#t~mem5; 2510#L556 SUMMARY for call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L556 2442#L556-1 assume !(test_fun_#t~mem9 <= 0);havoc test_fun_#t~mem9; 2539#L559 SUMMARY for call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L559 2538#L559-1 SUMMARY for call write~int(2 * test_fun_#t~mem11, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L559-1 2526#L559-2 havoc test_fun_#t~mem11; 2527#L555-9 assume true; 2522#L555 SUMMARY for call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L555 2523#L555-1 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L555-1 2487#L555-2 test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 2488#L555-3 assume test_fun_#t~short8; 2504#L555-4 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L555-4 2505#L555-5 test_fun_#t~short8 := test_fun_#t~mem7 < 1073741824; 2482#L555-7 assume !test_fun_#t~short8;havoc test_fun_#t~mem6;havoc test_fun_#t~short8;havoc test_fun_#t~mem7;havoc test_fun_#t~mem5; 2443#L555-10 [2018-11-10 09:02:29,341 INFO L795 eck$LassoCheckResult]: Loop: 2443#L555-10 SUMMARY for call test_fun_#t~mem12 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L555-10 2444#L561 SUMMARY for call write~int(test_fun_#t~mem12 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L561 2473#L561-1 havoc test_fun_#t~mem12; 2478#L553-3 assume true; 2460#L553 SUMMARY for call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L553 2461#L553-1 assume !!(test_fun_#t~mem4 >= 0);havoc test_fun_#t~mem4; 2453#L554 SUMMARY for call write~int(1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L554 2454#L555-9 assume true; 2537#L555 SUMMARY for call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L555 2536#L555-1 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L555-1 2535#L555-2 test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 2534#L555-3 assume test_fun_#t~short8; 2533#L555-4 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L555-4 2532#L555-5 test_fun_#t~short8 := test_fun_#t~mem7 < 1073741824; 2427#L555-7 assume !!test_fun_#t~short8;havoc test_fun_#t~mem6;havoc test_fun_#t~short8;havoc test_fun_#t~mem7;havoc test_fun_#t~mem5; 2428#L556 SUMMARY for call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L556 2440#L556-1 assume !(test_fun_#t~mem9 <= 0);havoc test_fun_#t~mem9; 2447#L559 SUMMARY for call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L559 2481#L559-1 SUMMARY for call write~int(2 * test_fun_#t~mem11, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L559-1 2528#L559-2 havoc test_fun_#t~mem11; 2524#L555-9 assume true; 2525#L555 SUMMARY for call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L555 2520#L555-1 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L555-1 2521#L555-2 test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 2485#L555-3 assume test_fun_#t~short8; 2486#L555-4 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L555-4 2501#L555-5 test_fun_#t~short8 := test_fun_#t~mem7 < 1073741824; 2502#L555-7 assume !test_fun_#t~short8;havoc test_fun_#t~mem6;havoc test_fun_#t~short8;havoc test_fun_#t~mem7;havoc test_fun_#t~mem5; 2443#L555-10 [2018-11-10 09:02:29,342 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:02:29,342 INFO L82 PathProgramCache]: Analyzing trace with hash 405864063, now seen corresponding path program 2 times [2018-11-10 09:02:29,342 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:02:29,342 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:02:29,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:02:29,343 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:02:29,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:02:29,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:02:29,386 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:02:29,386 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 09:02:29,386 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_47fa782f-b229-409d-b6de-e77330964619/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 09:02:29,393 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-10 09:02:29,403 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-10 09:02:29,403 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 09:02:29,405 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:02:29,407 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-10 09:02:29,408 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 09:02:29,409 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 09:02:29,411 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:02:29,412 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:02:29,412 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2018-11-10 09:02:29,421 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 09:02:29,422 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 29 [2018-11-10 09:02:29,424 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 19 [2018-11-10 09:02:29,424 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 09:02:29,427 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:02:29,430 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 09:02:29,430 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:13 [2018-11-10 09:02:29,447 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-11-10 09:02:29,448 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-11-10 09:02:29,448 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 09:02:29,451 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:02:29,471 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 09:02:29,471 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:20, output treesize:9 [2018-11-10 09:02:29,478 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:02:29,503 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 09:02:29,503 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 9 [2018-11-10 09:02:29,503 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 09:02:29,503 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:02:29,503 INFO L82 PathProgramCache]: Analyzing trace with hash -672192081, now seen corresponding path program 1 times [2018-11-10 09:02:29,503 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:02:29,503 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:02:29,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:02:29,504 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 09:02:29,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:02:29,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:02:29,546 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:02:29,546 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 09:02:29,546 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_47fa782f-b229-409d-b6de-e77330964619/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 09:02:29,568 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:02:29,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:02:29,582 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:02:29,586 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-10 09:02:29,588 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 09:02:29,589 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 09:02:29,590 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:02:29,603 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:02:29,603 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2018-11-10 09:02:29,622 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 09:02:29,622 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 29 [2018-11-10 09:02:29,624 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 19 [2018-11-10 09:02:29,624 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 09:02:29,628 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:02:29,631 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 09:02:29,631 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:13 [2018-11-10 09:02:29,645 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-11-10 09:02:29,647 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-11-10 09:02:29,647 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 09:02:29,648 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:02:29,650 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 09:02:29,650 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:20, output treesize:9 [2018-11-10 09:02:29,657 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:02:29,673 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 09:02:29,673 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 9 [2018-11-10 09:02:29,673 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 09:02:29,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-10 09:02:29,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2018-11-10 09:02:29,674 INFO L87 Difference]: Start difference. First operand 113 states and 121 transitions. cyclomatic complexity: 12 Second operand 10 states. [2018-11-10 09:02:29,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:02:29,835 INFO L93 Difference]: Finished difference Result 207 states and 218 transitions. [2018-11-10 09:02:29,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-10 09:02:29,839 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 207 states and 218 transitions. [2018-11-10 09:02:29,840 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 58 [2018-11-10 09:02:29,840 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 207 states to 204 states and 215 transitions. [2018-11-10 09:02:29,841 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 126 [2018-11-10 09:02:29,841 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 126 [2018-11-10 09:02:29,841 INFO L73 IsDeterministic]: Start isDeterministic. Operand 204 states and 215 transitions. [2018-11-10 09:02:29,841 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 09:02:29,841 INFO L705 BuchiCegarLoop]: Abstraction has 204 states and 215 transitions. [2018-11-10 09:02:29,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states and 215 transitions. [2018-11-10 09:02:29,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 148. [2018-11-10 09:02:29,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-11-10 09:02:29,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 158 transitions. [2018-11-10 09:02:29,845 INFO L728 BuchiCegarLoop]: Abstraction has 148 states and 158 transitions. [2018-11-10 09:02:29,845 INFO L608 BuchiCegarLoop]: Abstraction has 148 states and 158 transitions. [2018-11-10 09:02:29,845 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-11-10 09:02:29,845 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 148 states and 158 transitions. [2018-11-10 09:02:29,845 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 54 [2018-11-10 09:02:29,845 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 09:02:29,845 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 09:02:29,847 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:02:29,847 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:02:29,847 INFO L793 eck$LassoCheckResult]: Stem: 2987#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2979#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet14, main_#t~nondet15, main_#t~ret16;assume { :begin_inline_test_fun } true;test_fun_#in~x, test_fun_#in~y := main_#t~nondet14, main_#t~nondet15;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~mem9, test_fun_#t~mem10, test_fun_#t~mem11, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~short8, test_fun_#t~mem12, test_fun_#t~mem4, test_fun_#t~mem13, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset; 2980#L551 SUMMARY for call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L551 2992#L551-1 SUMMARY for call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L551-1 2997#L553-3 assume true; 2981#L553 SUMMARY for call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L553 2982#L553-1 assume !!(test_fun_#t~mem4 >= 0);havoc test_fun_#t~mem4; 2973#L554 SUMMARY for call write~int(1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L554 2974#L555-9 assume true; 3080#L555 SUMMARY for call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L555 3081#L555-1 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L555-1 3076#L555-2 test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 3077#L555-3 assume test_fun_#t~short8; 3072#L555-4 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L555-4 3073#L555-5 test_fun_#t~short8 := test_fun_#t~mem7 < 1073741824; 3066#L555-7 assume !!test_fun_#t~short8;havoc test_fun_#t~mem6;havoc test_fun_#t~short8;havoc test_fun_#t~mem7;havoc test_fun_#t~mem5; 3067#L556 SUMMARY for call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L556 3060#L556-1 assume !(test_fun_#t~mem9 <= 0);havoc test_fun_#t~mem9; 3061#L559 SUMMARY for call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L559 3055#L559-1 SUMMARY for call write~int(2 * test_fun_#t~mem11, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L559-1 3056#L559-2 havoc test_fun_#t~mem11; 3049#L555-9 assume true; 3050#L555 SUMMARY for call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L555 3043#L555-1 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L555-1 3044#L555-2 test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 3009#L555-3 assume !test_fun_#t~short8; 3006#L555-7 assume !test_fun_#t~short8;havoc test_fun_#t~mem6;havoc test_fun_#t~short8;havoc test_fun_#t~mem7;havoc test_fun_#t~mem5; 2967#L555-10 SUMMARY for call test_fun_#t~mem12 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L555-10 2968#L561 SUMMARY for call write~int(test_fun_#t~mem12 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L561 2996#L561-1 havoc test_fun_#t~mem12; 3000#L553-3 assume true; 2983#L553 SUMMARY for call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L553 2984#L553-1 assume !!(test_fun_#t~mem4 >= 0);havoc test_fun_#t~mem4; 2975#L554 SUMMARY for call write~int(1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L554 2957#L555-9 [2018-11-10 09:02:29,847 INFO L795 eck$LassoCheckResult]: Loop: 2957#L555-9 assume true; 2959#L555 SUMMARY for call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L555 2969#L555-1 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L555-1 2977#L555-2 test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 2985#L555-3 assume test_fun_#t~short8; 2990#L555-4 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L555-4 2993#L555-5 test_fun_#t~short8 := test_fun_#t~mem7 < 1073741824; 2949#L555-7 assume !!test_fun_#t~short8;havoc test_fun_#t~mem6;havoc test_fun_#t~short8;havoc test_fun_#t~mem7;havoc test_fun_#t~mem5; 2950#L556 SUMMARY for call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L556 3085#L556-1 assume !(test_fun_#t~mem9 <= 0);havoc test_fun_#t~mem9; 3084#L559 SUMMARY for call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L559 2953#L559-1 SUMMARY for call write~int(2 * test_fun_#t~mem11, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L559-1 2954#L559-2 havoc test_fun_#t~mem11; 2957#L555-9 [2018-11-10 09:02:29,847 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:02:29,847 INFO L82 PathProgramCache]: Analyzing trace with hash -669877092, now seen corresponding path program 3 times [2018-11-10 09:02:29,847 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:02:29,847 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:02:29,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:02:29,848 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:02:29,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:02:29,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:02:29,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:02:29,868 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:02:29,868 INFO L82 PathProgramCache]: Analyzing trace with hash -1274383525, now seen corresponding path program 3 times [2018-11-10 09:02:29,868 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:02:29,868 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:02:29,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:02:29,869 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 09:02:29,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:02:29,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:02:29,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:02:29,879 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:02:29,879 INFO L82 PathProgramCache]: Analyzing trace with hash 942312096, now seen corresponding path program 4 times [2018-11-10 09:02:29,879 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:02:29,879 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:02:29,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:02:29,880 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 09:02:29,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:02:29,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:02:30,100 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 7 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:02:30,100 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 09:02:30,100 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_47fa782f-b229-409d-b6de-e77330964619/bin-2019/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 09:02:30,111 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-10 09:02:30,127 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-10 09:02:30,127 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 09:02:30,129 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:02:30,135 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-10 09:02:30,136 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 09:02:30,137 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:02:30,137 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:8, output treesize:4 [2018-11-10 09:02:30,141 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-10 09:02:30,143 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 09:02:30,143 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 09:02:30,147 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:02:30,153 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:02:30,153 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:16, output treesize:12 [2018-11-10 09:02:30,170 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 09:02:30,171 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 29 [2018-11-10 09:02:30,174 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 19 [2018-11-10 09:02:30,175 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 09:02:30,178 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:02:30,182 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 09:02:30,182 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:17 [2018-11-10 09:02:30,354 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 09:02:30,356 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 46 [2018-11-10 09:02:30,357 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 26 [2018-11-10 09:02:30,358 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 09:02:30,363 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:02:30,368 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 09:02:30,369 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:48, output treesize:30 [2018-11-10 09:02:30,396 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 09:02:30,396 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 37 [2018-11-10 09:02:30,398 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 25 [2018-11-10 09:02:30,399 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 09:02:30,404 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:02:30,409 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 09:02:30,409 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:26 [2018-11-10 09:02:30,522 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 15 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:02:30,538 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 09:02:30,538 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16] total 29 [2018-11-10 09:02:30,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-11-10 09:02:30,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=693, Unknown=0, NotChecked=0, Total=812 [2018-11-10 09:02:30,609 INFO L87 Difference]: Start difference. First operand 148 states and 158 transitions. cyclomatic complexity: 14 Second operand 29 states. [2018-11-10 09:02:31,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:02:31,121 INFO L93 Difference]: Finished difference Result 219 states and 229 transitions. [2018-11-10 09:02:31,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-10 09:02:31,123 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 219 states and 229 transitions. [2018-11-10 09:02:31,123 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 58 [2018-11-10 09:02:31,124 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 219 states to 191 states and 199 transitions. [2018-11-10 09:02:31,124 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 116 [2018-11-10 09:02:31,125 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 116 [2018-11-10 09:02:31,125 INFO L73 IsDeterministic]: Start isDeterministic. Operand 191 states and 199 transitions. [2018-11-10 09:02:31,125 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 09:02:31,125 INFO L705 BuchiCegarLoop]: Abstraction has 191 states and 199 transitions. [2018-11-10 09:02:31,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states and 199 transitions. [2018-11-10 09:02:31,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 139. [2018-11-10 09:02:31,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-11-10 09:02:31,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 146 transitions. [2018-11-10 09:02:31,128 INFO L728 BuchiCegarLoop]: Abstraction has 139 states and 146 transitions. [2018-11-10 09:02:31,128 INFO L608 BuchiCegarLoop]: Abstraction has 139 states and 146 transitions. [2018-11-10 09:02:31,128 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-11-10 09:02:31,128 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 139 states and 146 transitions. [2018-11-10 09:02:31,129 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 54 [2018-11-10 09:02:31,129 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 09:02:31,129 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 09:02:31,130 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:02:31,130 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:02:31,130 INFO L793 eck$LassoCheckResult]: Stem: 3553#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 3545#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet14, main_#t~nondet15, main_#t~ret16;assume { :begin_inline_test_fun } true;test_fun_#in~x, test_fun_#in~y := main_#t~nondet14, main_#t~nondet15;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~mem9, test_fun_#t~mem10, test_fun_#t~mem11, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~short8, test_fun_#t~mem12, test_fun_#t~mem4, test_fun_#t~mem13, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset; 3546#L551 SUMMARY for call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L551 3561#L551-1 SUMMARY for call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L551-1 3564#L553-3 assume true; 3565#L553 SUMMARY for call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L553 3557#L553-1 assume !!(test_fun_#t~mem4 >= 0);havoc test_fun_#t~mem4; 3558#L554 SUMMARY for call write~int(1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L554 3627#L555-9 assume true; 3626#L555 SUMMARY for call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L555 3625#L555-1 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L555-1 3624#L555-2 test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 3623#L555-3 assume test_fun_#t~short8; 3622#L555-4 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L555-4 3621#L555-5 test_fun_#t~short8 := test_fun_#t~mem7 < 1073741824; 3620#L555-7 assume !!test_fun_#t~short8;havoc test_fun_#t~mem6;havoc test_fun_#t~short8;havoc test_fun_#t~mem7;havoc test_fun_#t~mem5; 3619#L556 SUMMARY for call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L556 3529#L556-1 assume !(test_fun_#t~mem9 <= 0);havoc test_fun_#t~mem9; 3536#L559 SUMMARY for call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L559 3522#L559-1 SUMMARY for call write~int(2 * test_fun_#t~mem11, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L559-1 3523#L559-2 havoc test_fun_#t~mem11; 3525#L555-9 assume true; 3527#L555 SUMMARY for call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L555 3538#L555-1 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L555-1 3540#L555-2 test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 3548#L555-3 assume test_fun_#t~short8; 3556#L555-4 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L555-4 3560#L555-5 test_fun_#t~short8 := test_fun_#t~mem7 < 1073741824; 3518#L555-7 assume !!test_fun_#t~short8;havoc test_fun_#t~mem6;havoc test_fun_#t~short8;havoc test_fun_#t~mem7;havoc test_fun_#t~mem5; 3519#L556 SUMMARY for call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L556 3530#L556-1 assume !(test_fun_#t~mem9 <= 0);havoc test_fun_#t~mem9; 3535#L559 SUMMARY for call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L559 3628#L559-1 SUMMARY for call write~int(2 * test_fun_#t~mem11, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L559-1 3643#L559-2 havoc test_fun_#t~mem11; 3642#L555-9 assume true; 3640#L555 SUMMARY for call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L555 3639#L555-1 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L555-1 3584#L555-2 test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 3585#L555-3 assume test_fun_#t~short8; 3592#L555-4 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L555-4 3593#L555-5 test_fun_#t~short8 := test_fun_#t~mem7 < 1073741824; 3569#L555-7 assume !test_fun_#t~short8;havoc test_fun_#t~mem6;havoc test_fun_#t~short8;havoc test_fun_#t~mem7;havoc test_fun_#t~mem5; 3531#L555-10 [2018-11-10 09:02:31,130 INFO L795 eck$LassoCheckResult]: Loop: 3531#L555-10 SUMMARY for call test_fun_#t~mem12 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L555-10 3532#L561 SUMMARY for call write~int(test_fun_#t~mem12 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L561 3562#L561-1 havoc test_fun_#t~mem12; 3567#L553-3 assume true; 3549#L553 SUMMARY for call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L553 3550#L553-1 assume !!(test_fun_#t~mem4 >= 0);havoc test_fun_#t~mem4; 3541#L554 SUMMARY for call write~int(1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L554 3542#L555-9 assume true; 3653#L555 SUMMARY for call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L555 3652#L555-1 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L555-1 3651#L555-2 test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 3650#L555-3 assume test_fun_#t~short8; 3649#L555-4 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L555-4 3648#L555-5 test_fun_#t~short8 := test_fun_#t~mem7 < 1073741824; 3647#L555-7 assume !!test_fun_#t~short8;havoc test_fun_#t~mem6;havoc test_fun_#t~short8;havoc test_fun_#t~mem7;havoc test_fun_#t~mem5; 3646#L556 SUMMARY for call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L556 3645#L556-1 assume !(test_fun_#t~mem9 <= 0);havoc test_fun_#t~mem9; 3644#L559 SUMMARY for call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L559 3641#L559-1 SUMMARY for call write~int(2 * test_fun_#t~mem11, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L559-1 3638#L559-2 havoc test_fun_#t~mem11; 3637#L555-9 assume true; 3636#L555 SUMMARY for call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L555 3635#L555-1 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L555-1 3634#L555-2 test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 3554#L555-3 assume test_fun_#t~short8; 3555#L555-4 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L555-4 3559#L555-5 test_fun_#t~short8 := test_fun_#t~mem7 < 1073741824; 3516#L555-7 assume !!test_fun_#t~short8;havoc test_fun_#t~mem6;havoc test_fun_#t~short8;havoc test_fun_#t~mem7;havoc test_fun_#t~mem5; 3517#L556 SUMMARY for call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L556 3528#L556-1 assume !(test_fun_#t~mem9 <= 0);havoc test_fun_#t~mem9; 3654#L559 SUMMARY for call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L559 3597#L559-1 SUMMARY for call write~int(2 * test_fun_#t~mem11, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L559-1 3595#L559-2 havoc test_fun_#t~mem11; 3594#L555-9 assume true; 3591#L555 SUMMARY for call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L555 3587#L555-1 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L555-1 3588#L555-2 test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 3572#L555-3 assume test_fun_#t~short8; 3573#L555-4 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L555-4 3589#L555-5 test_fun_#t~short8 := test_fun_#t~mem7 < 1073741824; 3590#L555-7 assume !test_fun_#t~short8;havoc test_fun_#t~mem6;havoc test_fun_#t~short8;havoc test_fun_#t~mem7;havoc test_fun_#t~mem5; 3531#L555-10 [2018-11-10 09:02:31,130 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:02:31,130 INFO L82 PathProgramCache]: Analyzing trace with hash -1884090959, now seen corresponding path program 3 times [2018-11-10 09:02:31,130 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:02:31,130 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:02:31,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:02:31,131 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 09:02:31,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:02:31,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:02:31,205 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:02:31,205 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 09:02:31,205 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_47fa782f-b229-409d-b6de-e77330964619/bin-2019/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 09:02:31,219 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-10 09:02:31,236 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-10 09:02:31,236 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 09:02:31,237 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:02:31,242 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-10 09:02:31,243 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 09:02:31,243 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 09:02:31,244 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:02:31,245 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:02:31,245 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2018-11-10 09:02:31,255 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 09:02:31,256 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 29 [2018-11-10 09:02:31,257 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 19 [2018-11-10 09:02:31,258 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 09:02:31,261 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:02:31,264 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 09:02:31,264 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:13 [2018-11-10 09:02:31,289 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 23 [2018-11-10 09:02:31,292 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-11-10 09:02:31,292 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 09:02:31,295 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:02:31,298 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-10 09:02:31,298 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:33, output treesize:18 [2018-11-10 09:02:31,313 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-11-10 09:02:31,314 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-11-10 09:02:31,314 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 09:02:31,316 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:02:31,319 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-10 09:02:31,319 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:25, output treesize:14 [2018-11-10 09:02:31,328 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:02:31,344 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 09:02:31,344 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 14 [2018-11-10 09:02:31,344 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 09:02:31,344 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:02:31,345 INFO L82 PathProgramCache]: Analyzing trace with hash 1864929409, now seen corresponding path program 2 times [2018-11-10 09:02:31,345 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:02:31,345 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:02:31,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:02:31,345 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 09:02:31,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:02:31,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:02:31,409 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:02:31,410 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 09:02:31,410 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_47fa782f-b229-409d-b6de-e77330964619/bin-2019/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 09:02:31,416 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-10 09:02:31,429 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-10 09:02:31,429 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 09:02:31,430 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:02:31,432 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-10 09:02:31,433 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 09:02:31,434 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 09:02:31,435 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:02:31,435 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:02:31,436 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2018-11-10 09:02:31,445 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 09:02:31,445 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 29 [2018-11-10 09:02:31,449 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 19 [2018-11-10 09:02:31,449 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 09:02:31,452 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:02:31,455 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 09:02:31,455 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:13 [2018-11-10 09:02:31,488 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 23 [2018-11-10 09:02:31,507 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-11-10 09:02:31,507 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 09:02:31,511 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:02:31,515 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-10 09:02:31,515 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:33, output treesize:18 [2018-11-10 09:02:31,541 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-11-10 09:02:31,542 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-11-10 09:02:31,543 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 09:02:31,545 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:02:31,548 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-10 09:02:31,548 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:25, output treesize:14 [2018-11-10 09:02:31,557 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:02:31,573 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 09:02:31,573 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 14 [2018-11-10 09:02:31,573 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 09:02:31,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-10 09:02:31,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2018-11-10 09:02:31,574 INFO L87 Difference]: Start difference. First operand 139 states and 146 transitions. cyclomatic complexity: 11 Second operand 15 states. [2018-11-10 09:02:31,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:02:31,835 INFO L93 Difference]: Finished difference Result 259 states and 270 transitions. [2018-11-10 09:02:31,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-10 09:02:31,836 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 259 states and 270 transitions. [2018-11-10 09:02:31,838 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 71 [2018-11-10 09:02:31,839 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 259 states to 256 states and 267 transitions. [2018-11-10 09:02:31,839 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 152 [2018-11-10 09:02:31,839 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 152 [2018-11-10 09:02:31,839 INFO L73 IsDeterministic]: Start isDeterministic. Operand 256 states and 267 transitions. [2018-11-10 09:02:31,839 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 09:02:31,839 INFO L705 BuchiCegarLoop]: Abstraction has 256 states and 267 transitions. [2018-11-10 09:02:31,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states and 267 transitions. [2018-11-10 09:02:31,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 187. [2018-11-10 09:02:31,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2018-11-10 09:02:31,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 197 transitions. [2018-11-10 09:02:31,847 INFO L728 BuchiCegarLoop]: Abstraction has 187 states and 197 transitions. [2018-11-10 09:02:31,847 INFO L608 BuchiCegarLoop]: Abstraction has 187 states and 197 transitions. [2018-11-10 09:02:31,847 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2018-11-10 09:02:31,847 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 187 states and 197 transitions. [2018-11-10 09:02:31,848 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 67 [2018-11-10 09:02:31,848 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 09:02:31,848 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 09:02:31,848 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:02:31,848 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:02:31,849 INFO L793 eck$LassoCheckResult]: Stem: 4249#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 4241#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet14, main_#t~nondet15, main_#t~ret16;assume { :begin_inline_test_fun } true;test_fun_#in~x, test_fun_#in~y := main_#t~nondet14, main_#t~nondet15;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~mem9, test_fun_#t~mem10, test_fun_#t~mem11, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~short8, test_fun_#t~mem12, test_fun_#t~mem4, test_fun_#t~mem13, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset; 4242#L551 SUMMARY for call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L551 4256#L551-1 SUMMARY for call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L551-1 4259#L553-3 assume true; 4260#L553 SUMMARY for call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L553 4252#L553-1 assume !!(test_fun_#t~mem4 >= 0);havoc test_fun_#t~mem4; 4253#L554 SUMMARY for call write~int(1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L554 4380#L555-9 assume true; 4378#L555 SUMMARY for call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L555 4376#L555-1 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L555-1 4374#L555-2 test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 4372#L555-3 assume test_fun_#t~short8; 4370#L555-4 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L555-4 4368#L555-5 test_fun_#t~short8 := test_fun_#t~mem7 < 1073741824; 4366#L555-7 assume !!test_fun_#t~short8;havoc test_fun_#t~mem6;havoc test_fun_#t~short8;havoc test_fun_#t~mem7;havoc test_fun_#t~mem5; 4364#L556 SUMMARY for call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L556 4362#L556-1 assume !(test_fun_#t~mem9 <= 0);havoc test_fun_#t~mem9; 4360#L559 SUMMARY for call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L559 4358#L559-1 SUMMARY for call write~int(2 * test_fun_#t~mem11, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L559-1 4356#L559-2 havoc test_fun_#t~mem11; 4354#L555-9 assume true; 4352#L555 SUMMARY for call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L555 4350#L555-1 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L555-1 4348#L555-2 test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 4346#L555-3 assume test_fun_#t~short8; 4344#L555-4 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L555-4 4342#L555-5 test_fun_#t~short8 := test_fun_#t~mem7 < 1073741824; 4340#L555-7 assume !!test_fun_#t~short8;havoc test_fun_#t~mem6;havoc test_fun_#t~short8;havoc test_fun_#t~mem7;havoc test_fun_#t~mem5; 4337#L556 SUMMARY for call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L556 4338#L556-1 assume !(test_fun_#t~mem9 <= 0);havoc test_fun_#t~mem9; 4398#L559 SUMMARY for call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L559 4397#L559-1 SUMMARY for call write~int(2 * test_fun_#t~mem11, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L559-1 4396#L559-2 havoc test_fun_#t~mem11; 4395#L555-9 assume true; 4394#L555 SUMMARY for call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L555 4393#L555-1 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L555-1 4392#L555-2 test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 4269#L555-3 assume !test_fun_#t~short8; 4266#L555-7 assume !test_fun_#t~short8;havoc test_fun_#t~mem6;havoc test_fun_#t~short8;havoc test_fun_#t~mem7;havoc test_fun_#t~mem5; 4229#L555-10 SUMMARY for call test_fun_#t~mem12 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L555-10 4230#L561 SUMMARY for call write~int(test_fun_#t~mem12 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L561 4258#L561-1 havoc test_fun_#t~mem12; 4261#L553-3 assume true; 4247#L553 SUMMARY for call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L553 4248#L553-1 assume !!(test_fun_#t~mem4 >= 0);havoc test_fun_#t~mem4; 4239#L554 SUMMARY for call write~int(1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L554 4220#L555-9 [2018-11-10 09:02:31,849 INFO L795 eck$LassoCheckResult]: Loop: 4220#L555-9 assume true; 4222#L555 SUMMARY for call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L555 4233#L555-1 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L555-1 4235#L555-2 test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 4243#L555-3 assume test_fun_#t~short8; 4250#L555-4 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L555-4 4254#L555-5 test_fun_#t~short8 := test_fun_#t~mem7 < 1073741824; 4212#L555-7 assume !!test_fun_#t~short8;havoc test_fun_#t~mem6;havoc test_fun_#t~short8;havoc test_fun_#t~mem7;havoc test_fun_#t~mem5; 4213#L556 SUMMARY for call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L556 4224#L556-1 assume !(test_fun_#t~mem9 <= 0);havoc test_fun_#t~mem9; 4231#L559 SUMMARY for call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L559 4216#L559-1 SUMMARY for call write~int(2 * test_fun_#t~mem11, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L559-1 4217#L559-2 havoc test_fun_#t~mem11; 4220#L555-9 [2018-11-10 09:02:31,849 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:02:31,849 INFO L82 PathProgramCache]: Analyzing trace with hash -1345053526, now seen corresponding path program 5 times [2018-11-10 09:02:31,849 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:02:31,849 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:02:31,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:02:31,850 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 09:02:31,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:02:31,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:02:31,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:02:31,873 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:02:31,873 INFO L82 PathProgramCache]: Analyzing trace with hash -1274383525, now seen corresponding path program 4 times [2018-11-10 09:02:31,873 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:02:31,873 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:02:31,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:02:31,874 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 09:02:31,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:02:31,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:02:31,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:02:31,879 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:02:31,879 INFO L82 PathProgramCache]: Analyzing trace with hash -1171394222, now seen corresponding path program 6 times [2018-11-10 09:02:31,879 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:02:31,879 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:02:31,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:02:31,880 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 09:02:31,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:02:31,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:02:31,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:02:33,105 WARN L179 SmtUtils]: Spent 1.11 s on a formula simplification. DAG size of input: 201 DAG size of output: 159 [2018-11-10 09:02:33,192 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 09:02:33,193 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 09:02:33,193 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 09:02:33,193 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 09:02:33,193 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 09:02:33,193 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 09:02:33,193 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 09:02:33,193 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 09:02:33,193 INFO L131 ssoRankerPreferences]: Filename of dumped script: c.01_assume-alloca_true-termination_true-no-overflow.c.i_Iteration11_Lasso [2018-11-10 09:02:33,193 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 09:02:33,193 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 09:02:33,195 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:02:33,196 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:02:33,197 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:02:33,198 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:02:33,199 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:02:33,201 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:02:33,202 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:02:33,203 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:02:33,204 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:02:33,205 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:02:33,206 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:02:33,207 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:02:33,208 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:02:33,209 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:02:33,209 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:02:33,210 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:02:33,211 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:02:33,212 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:02:33,356 WARN L179 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 78 [2018-11-10 09:02:33,414 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:02:33,417 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 09:02:33,689 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 09:02:33,690 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 09:02:33,690 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:02:33,690 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:02:33,690 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:02:33,690 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:02:33,691 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:02:33,691 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:02:33,691 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:02:33,691 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:02:33,691 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:02:33,692 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:02:33,692 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:02:33,692 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:02:33,692 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:02:33,692 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:02:33,692 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:02:33,692 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:02:33,692 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:02:33,693 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:02:33,693 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:02:33,693 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:02:33,693 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:02:33,693 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:02:33,693 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:02:33,694 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:02:33,694 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:02:33,694 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:02:33,694 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:02:33,694 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:02:33,695 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:02:33,695 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:02:33,695 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:02:33,695 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:02:33,695 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 09:02:33,695 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 09:02:33,696 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:02:33,696 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:02:33,697 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:02:33,697 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:02:33,697 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:02:33,697 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:02:33,697 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:02:33,697 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:02:33,697 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:02:33,698 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:02:33,698 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:02:33,698 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:02:33,698 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:02:33,698 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:02:33,698 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:02:33,698 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:02:33,698 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:02:33,698 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:02:33,699 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:02:33,699 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:02:33,699 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:02:33,699 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:02:33,699 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:02:33,699 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:02:33,699 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:02:33,700 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:02:33,700 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:02:33,700 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:02:33,700 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:02:33,700 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:02:33,700 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:02:33,700 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:02:33,700 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:02:33,700 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 09:02:33,701 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 09:02:33,701 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:02:33,701 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:02:33,701 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:02:33,701 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:02:33,701 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:02:33,702 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:02:33,702 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:02:33,702 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:02:33,702 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:02:33,702 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:02:33,702 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:02:33,702 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:02:33,702 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:02:33,703 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:02:33,703 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:02:33,703 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:02:33,703 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:02:33,703 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:02:33,703 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:02:33,704 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:02:33,704 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:02:33,704 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:02:33,704 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:02:33,704 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:02:33,704 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:02:33,704 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:02:33,704 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:02:33,705 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:02:33,705 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:02:33,705 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:02:33,705 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:02:33,705 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:02:33,705 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:02:33,706 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 09:02:33,706 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 09:02:33,707 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:02:33,707 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:02:33,708 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:02:33,708 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:02:33,708 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:02:33,708 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:02:33,708 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:02:33,708 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:02:33,708 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:02:33,708 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:02:33,709 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:02:33,709 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:02:33,709 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:02:33,709 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:02:33,709 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:02:33,709 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:02:33,709 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:02:33,709 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:02:33,709 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:02:33,709 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:02:33,710 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:02:33,710 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:02:33,710 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:02:33,710 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:02:33,710 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:02:33,710 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:02:33,710 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:02:33,710 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:02:33,710 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:02:33,711 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:02:33,711 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:02:33,711 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:02:33,711 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:02:33,711 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 09:02:33,711 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 09:02:33,711 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:02:33,712 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:02:33,712 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:02:33,712 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 09:02:33,712 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:02:33,712 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:02:33,712 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:02:33,712 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 09:02:33,712 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 09:02:33,712 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:02:33,713 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:02:33,713 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:02:33,713 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:02:33,713 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:02:33,713 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:02:33,713 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 09:02:33,713 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 09:02:33,714 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:02:33,715 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:02:33,715 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:02:33,715 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:02:33,715 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:02:33,715 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:02:33,716 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 09:02:33,716 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 09:02:33,717 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:02:33,717 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:02:33,718 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:02:33,718 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:02:33,718 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:02:33,718 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:02:33,718 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 09:02:33,719 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 09:02:33,720 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:02:33,720 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:02:33,720 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:02:33,721 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:02:33,721 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:02:33,721 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:02:33,721 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 09:02:33,721 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 09:02:33,723 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:02:33,724 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:02:33,724 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:02:33,724 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 09:02:33,724 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:02:33,724 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:02:33,725 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 09:02:33,725 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 09:02:33,727 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:02:33,728 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:02:33,728 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:02:33,728 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:02:33,728 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:02:33,728 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:02:33,729 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 09:02:33,729 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 09:02:33,732 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:02:33,732 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:02:33,733 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:02:33,733 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 09:02:33,733 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:02:33,733 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:02:33,734 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 09:02:33,734 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 09:02:33,736 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 09:02:33,737 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 09:02:33,737 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 09:02:33,737 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 09:02:33,737 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 09:02:33,737 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 09:02:33,738 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 09:02:33,739 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 09:02:33,750 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 09:02:33,755 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 09:02:33,756 INFO L444 ModelExtractionUtils]: 14 out of 19 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-10 09:02:33,756 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 09:02:33,756 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 09:02:33,757 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 09:02:33,757 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_4) = -2*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_4 + 2147483647 Supporting invariants [] [2018-11-10 09:02:33,865 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2018-11-10 09:02:33,866 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 09:02:33,878 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:02:33,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:02:33,895 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:02:33,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:02:33,902 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:02:33,969 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 09:02:33,970 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 43 [2018-11-10 09:02:33,972 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2018-11-10 09:02:33,972 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 09:02:33,978 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 09:02:33,984 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-10 09:02:33,984 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:46, output treesize:26 [2018-11-10 09:02:33,997 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:02:33,997 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 8 loop predicates [2018-11-10 09:02:33,997 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 187 states and 197 transitions. cyclomatic complexity: 14 Second operand 10 states. [2018-11-10 09:02:34,071 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 187 states and 197 transitions. cyclomatic complexity: 14. Second operand 10 states. Result 248 states and 260 transitions. Complement of second has 19 states. [2018-11-10 09:02:34,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 10 states 1 stem states 8 non-accepting loop states 1 accepting loop states [2018-11-10 09:02:34,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-10 09:02:34,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 26 transitions. [2018-11-10 09:02:34,072 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 26 transitions. Stem has 47 letters. Loop has 13 letters. [2018-11-10 09:02:34,072 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 09:02:34,072 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 09:02:34,079 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:02:34,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:02:34,092 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:02:34,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:02:34,099 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:02:34,151 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 09:02:34,151 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 43 [2018-11-10 09:02:34,154 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2018-11-10 09:02:34,154 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 09:02:34,162 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 09:02:34,167 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-10 09:02:34,167 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:46, output treesize:26 [2018-11-10 09:02:34,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:02:34,178 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 8 loop predicates [2018-11-10 09:02:34,178 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 187 states and 197 transitions. cyclomatic complexity: 14 Second operand 10 states. [2018-11-10 09:02:34,265 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 187 states and 197 transitions. cyclomatic complexity: 14. Second operand 10 states. Result 248 states and 260 transitions. Complement of second has 21 states. [2018-11-10 09:02:34,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 11 states 1 stem states 9 non-accepting loop states 1 accepting loop states [2018-11-10 09:02:34,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-10 09:02:34,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 25 transitions. [2018-11-10 09:02:34,266 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 25 transitions. Stem has 47 letters. Loop has 13 letters. [2018-11-10 09:02:34,266 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 09:02:34,266 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 09:02:34,278 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:02:34,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:02:34,298 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:02:34,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:02:34,305 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:02:34,381 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 09:02:34,381 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 43 [2018-11-10 09:02:34,383 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2018-11-10 09:02:34,384 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 09:02:34,393 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 09:02:34,399 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-10 09:02:34,399 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:46, output treesize:26 [2018-11-10 09:02:34,411 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:02:34,412 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 8 loop predicates [2018-11-10 09:02:34,412 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 187 states and 197 transitions. cyclomatic complexity: 14 Second operand 10 states. [2018-11-10 09:02:34,511 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 187 states and 197 transitions. cyclomatic complexity: 14. Second operand 10 states. Result 346 states and 366 transitions. Complement of second has 18 states. [2018-11-10 09:02:34,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 10 states 1 stem states 8 non-accepting loop states 1 accepting loop states [2018-11-10 09:02:34,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-10 09:02:34,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 45 transitions. [2018-11-10 09:02:34,511 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 45 transitions. Stem has 47 letters. Loop has 13 letters. [2018-11-10 09:02:34,512 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 09:02:34,512 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 45 transitions. Stem has 60 letters. Loop has 13 letters. [2018-11-10 09:02:34,512 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 09:02:34,512 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 45 transitions. Stem has 47 letters. Loop has 26 letters. [2018-11-10 09:02:34,513 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 09:02:34,513 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 346 states and 366 transitions. [2018-11-10 09:02:34,515 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 62 [2018-11-10 09:02:34,515 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 346 states to 117 states and 119 transitions. [2018-11-10 09:02:34,515 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 31 [2018-11-10 09:02:34,515 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 37 [2018-11-10 09:02:34,515 INFO L73 IsDeterministic]: Start isDeterministic. Operand 117 states and 119 transitions. [2018-11-10 09:02:34,516 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 09:02:34,516 INFO L705 BuchiCegarLoop]: Abstraction has 117 states and 119 transitions. [2018-11-10 09:02:34,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states and 119 transitions. [2018-11-10 09:02:34,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 101. [2018-11-10 09:02:34,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-11-10 09:02:34,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 103 transitions. [2018-11-10 09:02:34,517 INFO L728 BuchiCegarLoop]: Abstraction has 101 states and 103 transitions. [2018-11-10 09:02:34,517 INFO L608 BuchiCegarLoop]: Abstraction has 101 states and 103 transitions. [2018-11-10 09:02:34,517 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2018-11-10 09:02:34,518 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 101 states and 103 transitions. [2018-11-10 09:02:34,518 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 54 [2018-11-10 09:02:34,518 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 09:02:34,518 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 09:02:34,520 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:02:34,520 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:02:34,520 INFO L793 eck$LassoCheckResult]: Stem: 5977#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 5970#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet14, main_#t~nondet15, main_#t~ret16;assume { :begin_inline_test_fun } true;test_fun_#in~x, test_fun_#in~y := main_#t~nondet14, main_#t~nondet15;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~mem9, test_fun_#t~mem10, test_fun_#t~mem11, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~short8, test_fun_#t~mem12, test_fun_#t~mem4, test_fun_#t~mem13, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset; 5971#L551 SUMMARY for call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L551 5985#L551-1 SUMMARY for call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L551-1 5989#L553-3 assume true; 5975#L553 SUMMARY for call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L553 5976#L553-1 assume !!(test_fun_#t~mem4 >= 0);havoc test_fun_#t~mem4; 6026#L554 SUMMARY for call write~int(1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L554 6025#L555-9 assume true; 6024#L555 SUMMARY for call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L555 6023#L555-1 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L555-1 6022#L555-2 test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 6021#L555-3 assume test_fun_#t~short8; 6020#L555-4 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L555-4 6019#L555-5 test_fun_#t~short8 := test_fun_#t~mem7 < 1073741824; 6018#L555-7 assume !!test_fun_#t~short8;havoc test_fun_#t~mem6;havoc test_fun_#t~short8;havoc test_fun_#t~mem7;havoc test_fun_#t~mem5; 6017#L556 SUMMARY for call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L556 6016#L556-1 assume !(test_fun_#t~mem9 <= 0);havoc test_fun_#t~mem9; 6015#L559 SUMMARY for call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L559 6014#L559-1 SUMMARY for call write~int(2 * test_fun_#t~mem11, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L559-1 6013#L559-2 havoc test_fun_#t~mem11; 6012#L555-9 assume true; 6011#L555 SUMMARY for call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L555 6010#L555-1 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L555-1 6009#L555-2 test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 6008#L555-3 assume test_fun_#t~short8; 6007#L555-4 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L555-4 6006#L555-5 test_fun_#t~short8 := test_fun_#t~mem7 < 1073741824; 6005#L555-7 assume !!test_fun_#t~short8;havoc test_fun_#t~mem6;havoc test_fun_#t~short8;havoc test_fun_#t~mem7;havoc test_fun_#t~mem5; 6004#L556 SUMMARY for call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L556 5992#L556-1 assume !(test_fun_#t~mem9 <= 0);havoc test_fun_#t~mem9; 6003#L559 SUMMARY for call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L559 6002#L559-1 SUMMARY for call write~int(2 * test_fun_#t~mem11, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L559-1 6001#L559-2 havoc test_fun_#t~mem11; 6000#L555-9 assume true; 5999#L555 SUMMARY for call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L555 5998#L555-1 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L555-1 5997#L555-2 test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 5996#L555-3 assume test_fun_#t~short8; 5995#L555-4 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L555-4 5994#L555-5 test_fun_#t~short8 := test_fun_#t~mem7 < 1073741824; 5993#L555-7 assume !!test_fun_#t~short8;havoc test_fun_#t~mem6;havoc test_fun_#t~short8;havoc test_fun_#t~mem7;havoc test_fun_#t~mem5; 5991#L556 SUMMARY for call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L556 5964#L556-1 assume !(test_fun_#t~mem9 <= 0);havoc test_fun_#t~mem9; 5965#L559 SUMMARY for call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L559 5948#L559-1 SUMMARY for call write~int(2 * test_fun_#t~mem11, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L559-1 5949#L559-2 havoc test_fun_#t~mem11; 5952#L555-9 [2018-11-10 09:02:34,520 INFO L795 eck$LassoCheckResult]: Loop: 5952#L555-9 assume true; 5961#L555 SUMMARY for call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L555 5962#L555-1 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L555-1 5967#L555-2 test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 5972#L555-3 assume test_fun_#t~short8; 5978#L555-4 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L555-4 5982#L555-5 test_fun_#t~short8 := test_fun_#t~mem7 < 1073741824; 5944#L555-7 assume !test_fun_#t~short8;havoc test_fun_#t~mem6;havoc test_fun_#t~short8;havoc test_fun_#t~mem7;havoc test_fun_#t~mem5; 5945#L555-10 SUMMARY for call test_fun_#t~mem12 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L555-10 5960#L561 SUMMARY for call write~int(test_fun_#t~mem12 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L561 5986#L561-1 havoc test_fun_#t~mem12; 5990#L553-3 assume true; 6027#L553 SUMMARY for call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L553 5981#L553-1 assume !!(test_fun_#t~mem4 >= 0);havoc test_fun_#t~mem4; 5969#L554 SUMMARY for call write~int(1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L554 5955#L555-9 assume true; 5956#L555 SUMMARY for call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L555 6037#L555-1 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L555-1 6038#L555-2 test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 5979#L555-3 assume test_fun_#t~short8; 5980#L555-4 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L555-4 5987#L555-5 test_fun_#t~short8 := test_fun_#t~mem7 < 1073741824; 5988#L555-7 assume !!test_fun_#t~short8;havoc test_fun_#t~mem6;havoc test_fun_#t~short8;havoc test_fun_#t~mem7;havoc test_fun_#t~mem5; 5958#L556 SUMMARY for call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L556 5959#L556-1 assume !(test_fun_#t~mem9 <= 0);havoc test_fun_#t~mem9; 5966#L559 SUMMARY for call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L559 5950#L559-1 SUMMARY for call write~int(2 * test_fun_#t~mem11, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L559-1 5951#L559-2 havoc test_fun_#t~mem11; 6041#L555-9 assume true; 6039#L555 SUMMARY for call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L555 6040#L555-1 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L555-1 5973#L555-2 test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 5974#L555-3 assume test_fun_#t~short8; 5983#L555-4 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L555-4 5984#L555-5 test_fun_#t~short8 := test_fun_#t~mem7 < 1073741824; 5946#L555-7 assume !!test_fun_#t~short8;havoc test_fun_#t~mem6;havoc test_fun_#t~short8;havoc test_fun_#t~mem7;havoc test_fun_#t~mem5; 5947#L556 SUMMARY for call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L556 6044#L556-1 assume !(test_fun_#t~mem9 <= 0);havoc test_fun_#t~mem9; 6043#L559 SUMMARY for call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L559 6042#L559-1 SUMMARY for call write~int(2 * test_fun_#t~mem11, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L559-1 5953#L559-2 havoc test_fun_#t~mem11; 5954#L555-9 assume true; 5957#L555 SUMMARY for call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L555 5963#L555-1 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L555-1 5968#L555-2 test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 6036#L555-3 assume test_fun_#t~short8; 6035#L555-4 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L555-4 6034#L555-5 test_fun_#t~short8 := test_fun_#t~mem7 < 1073741824; 6033#L555-7 assume !!test_fun_#t~short8;havoc test_fun_#t~mem6;havoc test_fun_#t~short8;havoc test_fun_#t~mem7;havoc test_fun_#t~mem5; 6032#L556 SUMMARY for call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L556 6031#L556-1 assume !(test_fun_#t~mem9 <= 0);havoc test_fun_#t~mem9; 6030#L559 SUMMARY for call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L559 6029#L559-1 SUMMARY for call write~int(2 * test_fun_#t~mem11, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L559-1 6028#L559-2 havoc test_fun_#t~mem11; 5952#L555-9 [2018-11-10 09:02:34,520 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:02:34,521 INFO L82 PathProgramCache]: Analyzing trace with hash -1429393771, now seen corresponding path program 2 times [2018-11-10 09:02:34,521 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:02:34,521 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:02:34,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:02:34,521 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 09:02:34,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:02:34,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:02:34,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:02:34,538 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:02:34,538 INFO L82 PathProgramCache]: Analyzing trace with hash -980559505, now seen corresponding path program 3 times [2018-11-10 09:02:34,538 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:02:34,538 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:02:34,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:02:34,539 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 09:02:34,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:02:34,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:02:34,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:02:34,555 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:02:34,555 INFO L82 PathProgramCache]: Analyzing trace with hash 1085133059, now seen corresponding path program 1 times [2018-11-10 09:02:34,555 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:02:34,555 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:02:34,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:02:34,556 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 09:02:34,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:02:34,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:02:34,680 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 145 proven. 63 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-11-10 09:02:34,680 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 09:02:34,680 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_47fa782f-b229-409d-b6de-e77330964619/bin-2019/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 09:02:34,688 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:02:34,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:02:34,716 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:02:34,718 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-10 09:02:34,719 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 09:02:34,719 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 09:02:34,723 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:02:34,727 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:02:34,727 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2018-11-10 09:02:34,737 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 09:02:34,738 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 29 [2018-11-10 09:02:34,740 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 19 [2018-11-10 09:02:34,741 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 09:02:34,753 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:02:34,757 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 09:02:34,757 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:13 [2018-11-10 09:02:34,795 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 23 [2018-11-10 09:02:34,797 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-11-10 09:02:34,797 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 09:02:34,800 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:02:34,803 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-10 09:02:34,803 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:33, output treesize:18 [2018-11-10 09:02:34,840 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 23 [2018-11-10 09:02:34,843 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-11-10 09:02:34,843 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 09:02:34,847 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:02:34,851 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-11-10 09:02:34,852 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:38, output treesize:23 [2018-11-10 09:02:34,871 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-11-10 09:02:34,873 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-11-10 09:02:34,873 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 09:02:34,887 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:02:34,892 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-11-10 09:02:34,892 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:30, output treesize:19 [2018-11-10 09:02:34,914 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 145 proven. 63 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-11-10 09:02:34,931 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 09:02:34,931 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 20 [2018-11-10 09:02:35,580 WARN L179 SmtUtils]: Spent 647.00 ms on a formula simplification. DAG size of input: 172 DAG size of output: 121 [2018-11-10 09:02:35,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-10 09:02:35,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=296, Unknown=0, NotChecked=0, Total=380 [2018-11-10 09:02:35,619 INFO L87 Difference]: Start difference. First operand 101 states and 103 transitions. cyclomatic complexity: 4 Second operand 20 states. [2018-11-10 09:02:35,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:02:35,924 INFO L93 Difference]: Finished difference Result 170 states and 174 transitions. [2018-11-10 09:02:35,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-10 09:02:35,924 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 170 states and 174 transitions. [2018-11-10 09:02:35,925 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 79 [2018-11-10 09:02:35,925 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 170 states to 158 states and 161 transitions. [2018-11-10 09:02:35,926 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 32 [2018-11-10 09:02:35,926 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 32 [2018-11-10 09:02:35,926 INFO L73 IsDeterministic]: Start isDeterministic. Operand 158 states and 161 transitions. [2018-11-10 09:02:35,926 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 09:02:35,926 INFO L705 BuchiCegarLoop]: Abstraction has 158 states and 161 transitions. [2018-11-10 09:02:35,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states and 161 transitions. [2018-11-10 09:02:35,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 127. [2018-11-10 09:02:35,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-11-10 09:02:35,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 129 transitions. [2018-11-10 09:02:35,928 INFO L728 BuchiCegarLoop]: Abstraction has 127 states and 129 transitions. [2018-11-10 09:02:35,928 INFO L608 BuchiCegarLoop]: Abstraction has 127 states and 129 transitions. [2018-11-10 09:02:35,928 INFO L442 BuchiCegarLoop]: ======== Iteration 13============ [2018-11-10 09:02:35,928 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 127 states and 129 transitions. [2018-11-10 09:02:35,929 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 67 [2018-11-10 09:02:35,929 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 09:02:35,929 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 09:02:35,930 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:02:35,930 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:02:35,930 INFO L793 eck$LassoCheckResult]: Stem: 6606#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 6600#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet14, main_#t~nondet15, main_#t~ret16;assume { :begin_inline_test_fun } true;test_fun_#in~x, test_fun_#in~y := main_#t~nondet14, main_#t~nondet15;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~mem9, test_fun_#t~mem10, test_fun_#t~mem11, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~short8, test_fun_#t~mem12, test_fun_#t~mem4, test_fun_#t~mem13, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset; 6601#L551 SUMMARY for call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L551 6613#L551-1 SUMMARY for call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L551-1 6615#L553-3 assume true; 6616#L553 SUMMARY for call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L553 6609#L553-1 assume !!(test_fun_#t~mem4 >= 0);havoc test_fun_#t~mem4; 6610#L554 SUMMARY for call write~int(1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L554 6583#L555-9 assume true; 6584#L555 SUMMARY for call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L555 6591#L555-1 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L555-1 6694#L555-2 test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 6695#L555-3 assume test_fun_#t~short8; 6690#L555-4 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L555-4 6691#L555-5 test_fun_#t~short8 := test_fun_#t~mem7 < 1073741824; 6686#L555-7 assume !!test_fun_#t~short8;havoc test_fun_#t~mem6;havoc test_fun_#t~short8;havoc test_fun_#t~mem7;havoc test_fun_#t~mem5; 6687#L556 SUMMARY for call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L556 6682#L556-1 assume !(test_fun_#t~mem9 <= 0);havoc test_fun_#t~mem9; 6683#L559 SUMMARY for call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L559 6578#L559-1 SUMMARY for call write~int(2 * test_fun_#t~mem11, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L559-1 6579#L559-2 havoc test_fun_#t~mem11; 6585#L555-9 assume true; 6586#L555 SUMMARY for call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L555 6696#L555-1 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L555-1 6697#L555-2 test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 6692#L555-3 assume test_fun_#t~short8; 6693#L555-4 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L555-4 6688#L555-5 test_fun_#t~short8 := test_fun_#t~mem7 < 1073741824; 6689#L555-7 assume !!test_fun_#t~short8;havoc test_fun_#t~mem6;havoc test_fun_#t~short8;havoc test_fun_#t~mem7;havoc test_fun_#t~mem5; 6684#L556 SUMMARY for call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L556 6685#L556-1 assume !(test_fun_#t~mem9 <= 0);havoc test_fun_#t~mem9; 6680#L559 SUMMARY for call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L559 6681#L559-1 SUMMARY for call write~int(2 * test_fun_#t~mem11, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L559-1 6581#L559-2 havoc test_fun_#t~mem11; 6582#L555-9 assume true; 6698#L555 SUMMARY for call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L555 6596#L555-1 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L555-1 6597#L555-2 test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 6603#L555-3 assume test_fun_#t~short8; 6608#L555-4 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L555-4 6612#L555-5 test_fun_#t~short8 := test_fun_#t~mem7 < 1073741824; 6574#L555-7 assume !!test_fun_#t~short8;havoc test_fun_#t~mem6;havoc test_fun_#t~short8;havoc test_fun_#t~mem7;havoc test_fun_#t~mem5; 6575#L556 SUMMARY for call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L556 6587#L556-1 assume !(test_fun_#t~mem9 <= 0);havoc test_fun_#t~mem9; 6594#L559 SUMMARY for call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L559 6618#L559-1 SUMMARY for call write~int(2 * test_fun_#t~mem11, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L559-1 6640#L559-2 havoc test_fun_#t~mem11; 6638#L555-9 assume true; 6636#L555 SUMMARY for call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L555 6634#L555-1 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L555-1 6632#L555-2 test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 6630#L555-3 assume test_fun_#t~short8; 6628#L555-4 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L555-4 6626#L555-5 test_fun_#t~short8 := test_fun_#t~mem7 < 1073741824; 6624#L555-7 assume !!test_fun_#t~short8;havoc test_fun_#t~mem6;havoc test_fun_#t~short8;havoc test_fun_#t~mem7;havoc test_fun_#t~mem5; 6622#L556 SUMMARY for call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L556 6592#L556-1 assume !(test_fun_#t~mem9 <= 0);havoc test_fun_#t~mem9; 6593#L559 SUMMARY for call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L559 6576#L559-1 SUMMARY for call write~int(2 * test_fun_#t~mem11, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L559-1 6577#L559-2 havoc test_fun_#t~mem11; 6580#L555-9 [2018-11-10 09:02:35,930 INFO L795 eck$LassoCheckResult]: Loop: 6580#L555-9 assume true; 6589#L555 SUMMARY for call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L555 6590#L555-1 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L555-1 6595#L555-2 test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 6602#L555-3 assume test_fun_#t~short8; 6607#L555-4 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L555-4 6611#L555-5 test_fun_#t~short8 := test_fun_#t~mem7 < 1073741824; 6572#L555-7 assume !test_fun_#t~short8;havoc test_fun_#t~mem6;havoc test_fun_#t~short8;havoc test_fun_#t~mem7;havoc test_fun_#t~mem5; 6573#L555-10 SUMMARY for call test_fun_#t~mem12 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L555-10 6588#L561 SUMMARY for call write~int(test_fun_#t~mem12 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L561 6614#L561-1 havoc test_fun_#t~mem12; 6617#L553-3 assume true; 6604#L553 SUMMARY for call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L553 6605#L553-1 assume !!(test_fun_#t~mem4 >= 0);havoc test_fun_#t~mem4; 6598#L554 SUMMARY for call write~int(1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L554 6599#L555-9 assume true; 6679#L555 SUMMARY for call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L555 6678#L555-1 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L555-1 6677#L555-2 test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 6676#L555-3 assume test_fun_#t~short8; 6675#L555-4 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L555-4 6674#L555-5 test_fun_#t~short8 := test_fun_#t~mem7 < 1073741824; 6673#L555-7 assume !!test_fun_#t~short8;havoc test_fun_#t~mem6;havoc test_fun_#t~short8;havoc test_fun_#t~mem7;havoc test_fun_#t~mem5; 6672#L556 SUMMARY for call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L556 6671#L556-1 assume !(test_fun_#t~mem9 <= 0);havoc test_fun_#t~mem9; 6670#L559 SUMMARY for call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L559 6669#L559-1 SUMMARY for call write~int(2 * test_fun_#t~mem11, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L559-1 6668#L559-2 havoc test_fun_#t~mem11; 6667#L555-9 assume true; 6666#L555 SUMMARY for call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L555 6665#L555-1 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L555-1 6664#L555-2 test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 6663#L555-3 assume test_fun_#t~short8; 6662#L555-4 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L555-4 6661#L555-5 test_fun_#t~short8 := test_fun_#t~mem7 < 1073741824; 6660#L555-7 assume !!test_fun_#t~short8;havoc test_fun_#t~mem6;havoc test_fun_#t~short8;havoc test_fun_#t~mem7;havoc test_fun_#t~mem5; 6659#L556 SUMMARY for call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L556 6658#L556-1 assume !(test_fun_#t~mem9 <= 0);havoc test_fun_#t~mem9; 6657#L559 SUMMARY for call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L559 6656#L559-1 SUMMARY for call write~int(2 * test_fun_#t~mem11, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L559-1 6655#L559-2 havoc test_fun_#t~mem11; 6654#L555-9 assume true; 6653#L555 SUMMARY for call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L555 6652#L555-1 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L555-1 6651#L555-2 test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 6650#L555-3 assume test_fun_#t~short8; 6649#L555-4 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L555-4 6648#L555-5 test_fun_#t~short8 := test_fun_#t~mem7 < 1073741824; 6647#L555-7 assume !!test_fun_#t~short8;havoc test_fun_#t~mem6;havoc test_fun_#t~short8;havoc test_fun_#t~mem7;havoc test_fun_#t~mem5; 6646#L556 SUMMARY for call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L556 6645#L556-1 assume !(test_fun_#t~mem9 <= 0);havoc test_fun_#t~mem9; 6644#L559 SUMMARY for call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L559 6643#L559-1 SUMMARY for call write~int(2 * test_fun_#t~mem11, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L559-1 6642#L559-2 havoc test_fun_#t~mem11; 6620#L555-9 assume true; 6641#L555 SUMMARY for call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L555 6639#L555-1 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L555-1 6637#L555-2 test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 6635#L555-3 assume test_fun_#t~short8; 6633#L555-4 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L555-4 6631#L555-5 test_fun_#t~short8 := test_fun_#t~mem7 < 1073741824; 6629#L555-7 assume !!test_fun_#t~short8;havoc test_fun_#t~mem6;havoc test_fun_#t~short8;havoc test_fun_#t~mem7;havoc test_fun_#t~mem5; 6627#L556 SUMMARY for call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L556 6625#L556-1 assume !(test_fun_#t~mem9 <= 0);havoc test_fun_#t~mem9; 6623#L559 SUMMARY for call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L559 6621#L559-1 SUMMARY for call write~int(2 * test_fun_#t~mem11, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L559-1 6619#L559-2 havoc test_fun_#t~mem11; 6580#L555-9 [2018-11-10 09:02:35,930 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:02:35,930 INFO L82 PathProgramCache]: Analyzing trace with hash 751867207, now seen corresponding path program 3 times [2018-11-10 09:02:35,931 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:02:35,931 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:02:35,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:02:35,931 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:02:35,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:02:35,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:02:35,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:02:35,953 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:02:35,953 INFO L82 PathProgramCache]: Analyzing trace with hash 684842157, now seen corresponding path program 4 times [2018-11-10 09:02:35,953 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:02:35,953 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:02:35,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:02:35,954 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 09:02:35,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:02:35,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:02:35,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:02:35,977 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:02:35,977 INFO L82 PathProgramCache]: Analyzing trace with hash 1408772519, now seen corresponding path program 2 times [2018-11-10 09:02:35,977 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:02:35,978 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:02:35,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:02:35,978 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 09:02:35,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:02:35,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:02:36,104 INFO L134 CoverageAnalysis]: Checked inductivity of 432 backedges. 244 proven. 110 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-11-10 09:02:36,104 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 09:02:36,104 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_47fa782f-b229-409d-b6de-e77330964619/bin-2019/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 09:02:36,111 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-10 09:02:36,141 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-10 09:02:36,141 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 09:02:36,143 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:02:36,147 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-10 09:02:36,148 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 09:02:36,148 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 09:02:36,150 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:02:36,154 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:02:36,155 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2018-11-10 09:02:36,172 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 09:02:36,173 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 29 [2018-11-10 09:02:36,174 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 19 [2018-11-10 09:02:36,174 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 09:02:36,178 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:02:36,180 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 09:02:36,181 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:13 [2018-11-10 09:02:36,212 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 23 [2018-11-10 09:02:36,215 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-11-10 09:02:36,215 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 09:02:36,219 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:02:36,222 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-10 09:02:36,223 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:33, output treesize:18 [2018-11-10 09:02:36,267 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 23 [2018-11-10 09:02:36,269 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-11-10 09:02:36,269 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 09:02:36,272 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:02:36,276 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-11-10 09:02:36,276 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:38, output treesize:23 [2018-11-10 09:02:36,331 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 23 [2018-11-10 09:02:36,333 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-11-10 09:02:36,334 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 09:02:36,336 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:02:36,342 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-11-10 09:02:36,343 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:43, output treesize:28 [2018-11-10 09:02:36,643 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-11-10 09:02:36,645 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-11-10 09:02:36,645 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 09:02:36,648 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:02:36,654 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-11-10 09:02:36,654 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:35, output treesize:24 [2018-11-10 09:02:36,695 INFO L134 CoverageAnalysis]: Checked inductivity of 432 backedges. 244 proven. 110 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-11-10 09:02:36,711 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 09:02:36,711 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 13] total 25 [2018-11-10 09:02:37,509 WARN L179 SmtUtils]: Spent 795.00 ms on a formula simplification. DAG size of input: 207 DAG size of output: 142 [2018-11-10 09:02:37,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-11-10 09:02:37,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=470, Unknown=0, NotChecked=0, Total=600 [2018-11-10 09:02:37,529 INFO L87 Difference]: Start difference. First operand 127 states and 129 transitions. cyclomatic complexity: 4 Second operand 25 states. [2018-11-10 09:02:38,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:02:38,407 INFO L93 Difference]: Finished difference Result 196 states and 200 transitions. [2018-11-10 09:02:38,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-11-10 09:02:38,408 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 196 states and 200 transitions. [2018-11-10 09:02:38,408 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 92 [2018-11-10 09:02:38,409 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 196 states to 184 states and 187 transitions. [2018-11-10 09:02:38,409 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 32 [2018-11-10 09:02:38,409 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 32 [2018-11-10 09:02:38,409 INFO L73 IsDeterministic]: Start isDeterministic. Operand 184 states and 187 transitions. [2018-11-10 09:02:38,410 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 09:02:38,410 INFO L705 BuchiCegarLoop]: Abstraction has 184 states and 187 transitions. [2018-11-10 09:02:38,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states and 187 transitions. [2018-11-10 09:02:38,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 153. [2018-11-10 09:02:38,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-11-10 09:02:38,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 155 transitions. [2018-11-10 09:02:38,412 INFO L728 BuchiCegarLoop]: Abstraction has 153 states and 155 transitions. [2018-11-10 09:02:38,412 INFO L608 BuchiCegarLoop]: Abstraction has 153 states and 155 transitions. [2018-11-10 09:02:38,412 INFO L442 BuchiCegarLoop]: ======== Iteration 14============ [2018-11-10 09:02:38,412 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 153 states and 155 transitions. [2018-11-10 09:02:38,413 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 80 [2018-11-10 09:02:38,413 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 09:02:38,413 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 09:02:38,414 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:02:38,414 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:02:38,414 INFO L793 eck$LassoCheckResult]: Stem: 7378#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 7372#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet14, main_#t~nondet15, main_#t~ret16;assume { :begin_inline_test_fun } true;test_fun_#in~x, test_fun_#in~y := main_#t~nondet14, main_#t~nondet15;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~mem9, test_fun_#t~mem10, test_fun_#t~mem11, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~short8, test_fun_#t~mem12, test_fun_#t~mem4, test_fun_#t~mem13, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset; 7373#L551 SUMMARY for call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L551 7386#L551-1 SUMMARY for call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L551-1 7390#L553-3 assume true; 7376#L553 SUMMARY for call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L553 7377#L553-1 assume !!(test_fun_#t~mem4 >= 0);havoc test_fun_#t~mem4; 7382#L554 SUMMARY for call write~int(1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L554 7355#L555-9 assume true; 7356#L555 SUMMARY for call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L555 7496#L555-1 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L555-1 7495#L555-2 test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 7380#L555-3 assume test_fun_#t~short8; 7381#L555-4 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L555-4 7494#L555-5 test_fun_#t~short8 := test_fun_#t~mem7 < 1073741824; 7493#L555-7 assume !!test_fun_#t~short8;havoc test_fun_#t~mem6;havoc test_fun_#t~short8;havoc test_fun_#t~mem7;havoc test_fun_#t~mem5; 7492#L556 SUMMARY for call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L556 7363#L556-1 assume !(test_fun_#t~mem9 <= 0);havoc test_fun_#t~mem9; 7364#L559 SUMMARY for call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L559 7350#L559-1 SUMMARY for call write~int(2 * test_fun_#t~mem11, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L559-1 7351#L559-2 havoc test_fun_#t~mem11; 7357#L555-9 assume true; 7358#L555 SUMMARY for call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L555 7367#L555-1 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L555-1 7369#L555-2 test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 7375#L555-3 assume test_fun_#t~short8; 7384#L555-4 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L555-4 7385#L555-5 test_fun_#t~short8 := test_fun_#t~mem7 < 1073741824; 7346#L555-7 assume !!test_fun_#t~short8;havoc test_fun_#t~mem6;havoc test_fun_#t~short8;havoc test_fun_#t~mem7;havoc test_fun_#t~mem5; 7347#L556 SUMMARY for call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L556 7359#L556-1 assume !(test_fun_#t~mem9 <= 0);havoc test_fun_#t~mem9; 7491#L559 SUMMARY for call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L559 7490#L559-1 SUMMARY for call write~int(2 * test_fun_#t~mem11, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L559-1 7353#L559-2 havoc test_fun_#t~mem11; 7354#L555-9 assume true; 7489#L555 SUMMARY for call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L555 7488#L555-1 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L555-1 7487#L555-2 test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 7486#L555-3 assume test_fun_#t~short8; 7485#L555-4 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L555-4 7484#L555-5 test_fun_#t~short8 := test_fun_#t~mem7 < 1073741824; 7483#L555-7 assume !!test_fun_#t~short8;havoc test_fun_#t~mem6;havoc test_fun_#t~short8;havoc test_fun_#t~mem7;havoc test_fun_#t~mem5; 7482#L556 SUMMARY for call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L556 7481#L556-1 assume !(test_fun_#t~mem9 <= 0);havoc test_fun_#t~mem9; 7480#L559 SUMMARY for call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L559 7479#L559-1 SUMMARY for call write~int(2 * test_fun_#t~mem11, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L559-1 7478#L559-2 havoc test_fun_#t~mem11; 7477#L555-9 assume true; 7476#L555 SUMMARY for call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L555 7475#L555-1 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L555-1 7474#L555-2 test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 7473#L555-3 assume test_fun_#t~short8; 7472#L555-4 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L555-4 7471#L555-5 test_fun_#t~short8 := test_fun_#t~mem7 < 1073741824; 7470#L555-7 assume !!test_fun_#t~short8;havoc test_fun_#t~mem6;havoc test_fun_#t~short8;havoc test_fun_#t~mem7;havoc test_fun_#t~mem5; 7469#L556 SUMMARY for call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L556 7398#L556-1 assume !(test_fun_#t~mem9 <= 0);havoc test_fun_#t~mem9; 7468#L559 SUMMARY for call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L559 7467#L559-1 SUMMARY for call write~int(2 * test_fun_#t~mem11, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L559-1 7466#L559-2 havoc test_fun_#t~mem11; 7413#L555-9 assume true; 7412#L555 SUMMARY for call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L555 7410#L555-1 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L555-1 7408#L555-2 test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 7406#L555-3 assume test_fun_#t~short8; 7404#L555-4 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L555-4 7402#L555-5 test_fun_#t~short8 := test_fun_#t~mem7 < 1073741824; 7400#L555-7 assume !!test_fun_#t~short8;havoc test_fun_#t~mem6;havoc test_fun_#t~short8;havoc test_fun_#t~mem7;havoc test_fun_#t~mem5; 7397#L556 SUMMARY for call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L556 7361#L556-1 assume !(test_fun_#t~mem9 <= 0);havoc test_fun_#t~mem9; 7362#L559 SUMMARY for call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L559 7348#L559-1 SUMMARY for call write~int(2 * test_fun_#t~mem11, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L559-1 7349#L559-2 havoc test_fun_#t~mem11; 7352#L555-9 [2018-11-10 09:02:38,414 INFO L795 eck$LassoCheckResult]: Loop: 7352#L555-9 assume true; 7365#L555 SUMMARY for call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L555 7366#L555-1 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L555-1 7368#L555-2 test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 7374#L555-3 assume test_fun_#t~short8; 7379#L555-4 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L555-4 7383#L555-5 test_fun_#t~short8 := test_fun_#t~mem7 < 1073741824; 7344#L555-7 assume !test_fun_#t~short8;havoc test_fun_#t~mem6;havoc test_fun_#t~short8;havoc test_fun_#t~mem7;havoc test_fun_#t~mem5; 7345#L555-10 SUMMARY for call test_fun_#t~mem12 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L555-10 7360#L561 SUMMARY for call write~int(test_fun_#t~mem12 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L561 7387#L561-1 havoc test_fun_#t~mem12; 7388#L553-3 assume true; 7389#L553 SUMMARY for call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L553 7465#L553-1 assume !!(test_fun_#t~mem4 >= 0);havoc test_fun_#t~mem4; 7370#L554 SUMMARY for call write~int(1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L554 7371#L555-9 assume true; 7464#L555 SUMMARY for call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L555 7463#L555-1 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L555-1 7462#L555-2 test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 7461#L555-3 assume test_fun_#t~short8; 7460#L555-4 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L555-4 7459#L555-5 test_fun_#t~short8 := test_fun_#t~mem7 < 1073741824; 7458#L555-7 assume !!test_fun_#t~short8;havoc test_fun_#t~mem6;havoc test_fun_#t~short8;havoc test_fun_#t~mem7;havoc test_fun_#t~mem5; 7457#L556 SUMMARY for call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L556 7456#L556-1 assume !(test_fun_#t~mem9 <= 0);havoc test_fun_#t~mem9; 7455#L559 SUMMARY for call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L559 7454#L559-1 SUMMARY for call write~int(2 * test_fun_#t~mem11, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L559-1 7453#L559-2 havoc test_fun_#t~mem11; 7452#L555-9 assume true; 7451#L555 SUMMARY for call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L555 7450#L555-1 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L555-1 7449#L555-2 test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 7448#L555-3 assume test_fun_#t~short8; 7447#L555-4 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L555-4 7446#L555-5 test_fun_#t~short8 := test_fun_#t~mem7 < 1073741824; 7445#L555-7 assume !!test_fun_#t~short8;havoc test_fun_#t~mem6;havoc test_fun_#t~short8;havoc test_fun_#t~mem7;havoc test_fun_#t~mem5; 7444#L556 SUMMARY for call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L556 7443#L556-1 assume !(test_fun_#t~mem9 <= 0);havoc test_fun_#t~mem9; 7442#L559 SUMMARY for call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L559 7441#L559-1 SUMMARY for call write~int(2 * test_fun_#t~mem11, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L559-1 7440#L559-2 havoc test_fun_#t~mem11; 7439#L555-9 assume true; 7438#L555 SUMMARY for call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L555 7437#L555-1 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L555-1 7436#L555-2 test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 7435#L555-3 assume test_fun_#t~short8; 7434#L555-4 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L555-4 7433#L555-5 test_fun_#t~short8 := test_fun_#t~mem7 < 1073741824; 7432#L555-7 assume !!test_fun_#t~short8;havoc test_fun_#t~mem6;havoc test_fun_#t~short8;havoc test_fun_#t~mem7;havoc test_fun_#t~mem5; 7431#L556 SUMMARY for call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L556 7430#L556-1 assume !(test_fun_#t~mem9 <= 0);havoc test_fun_#t~mem9; 7429#L559 SUMMARY for call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L559 7428#L559-1 SUMMARY for call write~int(2 * test_fun_#t~mem11, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L559-1 7427#L559-2 havoc test_fun_#t~mem11; 7426#L555-9 assume true; 7425#L555 SUMMARY for call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L555 7424#L555-1 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L555-1 7423#L555-2 test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 7422#L555-3 assume test_fun_#t~short8; 7421#L555-4 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L555-4 7420#L555-5 test_fun_#t~short8 := test_fun_#t~mem7 < 1073741824; 7419#L555-7 assume !!test_fun_#t~short8;havoc test_fun_#t~mem6;havoc test_fun_#t~short8;havoc test_fun_#t~mem7;havoc test_fun_#t~mem5; 7418#L556 SUMMARY for call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L556 7417#L556-1 assume !(test_fun_#t~mem9 <= 0);havoc test_fun_#t~mem9; 7416#L559 SUMMARY for call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L559 7415#L559-1 SUMMARY for call write~int(2 * test_fun_#t~mem11, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L559-1 7414#L559-2 havoc test_fun_#t~mem11; 7392#L555-9 assume true; 7411#L555 SUMMARY for call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L555 7409#L555-1 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L555-1 7407#L555-2 test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 7405#L555-3 assume test_fun_#t~short8; 7403#L555-4 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L555-4 7401#L555-5 test_fun_#t~short8 := test_fun_#t~mem7 < 1073741824; 7399#L555-7 assume !!test_fun_#t~short8;havoc test_fun_#t~mem6;havoc test_fun_#t~short8;havoc test_fun_#t~mem7;havoc test_fun_#t~mem5; 7396#L556 SUMMARY for call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L556 7395#L556-1 assume !(test_fun_#t~mem9 <= 0);havoc test_fun_#t~mem9; 7394#L559 SUMMARY for call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L559 7393#L559-1 SUMMARY for call write~int(2 * test_fun_#t~mem11, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L559-1 7391#L559-2 havoc test_fun_#t~mem11; 7352#L555-9 [2018-11-10 09:02:38,415 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:02:38,415 INFO L82 PathProgramCache]: Analyzing trace with hash -1304879147, now seen corresponding path program 4 times [2018-11-10 09:02:38,415 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:02:38,415 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:02:38,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:02:38,416 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 09:02:38,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:02:38,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:02:38,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:02:38,439 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:02:38,440 INFO L82 PathProgramCache]: Analyzing trace with hash -2128507345, now seen corresponding path program 5 times [2018-11-10 09:02:38,440 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:02:38,440 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:02:38,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:02:38,441 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 09:02:38,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:02:38,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:02:38,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:02:38,465 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:02:38,465 INFO L82 PathProgramCache]: Analyzing trace with hash -281025021, now seen corresponding path program 3 times [2018-11-10 09:02:38,466 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:02:38,466 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:02:38,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:02:38,466 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 09:02:38,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:02:38,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:02:38,664 INFO L134 CoverageAnalysis]: Checked inductivity of 669 backedges. 369 proven. 170 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2018-11-10 09:02:38,664 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 09:02:38,664 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_47fa782f-b229-409d-b6de-e77330964619/bin-2019/uautomizer/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 09:02:38,672 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-10 09:02:38,863 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-11-10 09:02:38,863 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 09:02:38,866 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:02:38,869 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-10 09:02:38,870 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 09:02:38,870 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 09:02:38,871 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:02:38,873 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:02:38,873 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2018-11-10 09:02:38,884 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 09:02:38,885 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 29 [2018-11-10 09:02:38,886 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 19 [2018-11-10 09:02:38,886 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 09:02:38,889 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:02:38,892 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 09:02:38,892 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:13 [2018-11-10 09:02:38,920 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 23 [2018-11-10 09:02:38,922 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-11-10 09:02:38,923 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 09:02:38,925 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:02:38,928 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-10 09:02:38,929 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:33, output treesize:18 [2018-11-10 09:02:38,964 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 23 [2018-11-10 09:02:38,966 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-11-10 09:02:38,967 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 09:02:38,969 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:02:38,974 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-11-10 09:02:38,974 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:38, output treesize:23 [2018-11-10 09:02:39,030 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 23 [2018-11-10 09:02:39,032 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-11-10 09:02:39,033 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 09:02:39,038 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:02:39,049 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-11-10 09:02:39,049 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:43, output treesize:28 [2018-11-10 09:02:39,679 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 23 [2018-11-10 09:02:39,681 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-11-10 09:02:39,681 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 09:02:39,684 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:02:39,691 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2018-11-10 09:02:39,691 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:48, output treesize:33 [2018-11-10 09:02:40,279 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-11-10 09:02:40,281 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-11-10 09:02:40,281 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 09:02:40,282 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:02:40,288 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2018-11-10 09:02:40,288 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:40, output treesize:29 [2018-11-10 09:02:40,340 INFO L134 CoverageAnalysis]: Checked inductivity of 669 backedges. 369 proven. 170 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2018-11-10 09:02:40,356 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 09:02:40,356 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 15] total 30 [2018-11-10 09:02:42,534 WARN L179 SmtUtils]: Spent 2.17 s on a formula simplification. DAG size of input: 242 DAG size of output: 163 [2018-11-10 09:02:42,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-11-10 09:02:42,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=684, Unknown=0, NotChecked=0, Total=870 [2018-11-10 09:02:42,552 INFO L87 Difference]: Start difference. First operand 153 states and 155 transitions. cyclomatic complexity: 4 Second operand 30 states. [2018-11-10 09:02:46,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:02:46,188 INFO L93 Difference]: Finished difference Result 222 states and 226 transitions. [2018-11-10 09:02:46,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-11-10 09:02:46,188 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 222 states and 226 transitions. [2018-11-10 09:02:46,189 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 105 [2018-11-10 09:02:46,190 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 222 states to 210 states and 213 transitions. [2018-11-10 09:02:46,190 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 32 [2018-11-10 09:02:46,190 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 32 [2018-11-10 09:02:46,190 INFO L73 IsDeterministic]: Start isDeterministic. Operand 210 states and 213 transitions. [2018-11-10 09:02:46,190 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 09:02:46,190 INFO L705 BuchiCegarLoop]: Abstraction has 210 states and 213 transitions. [2018-11-10 09:02:46,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states and 213 transitions. [2018-11-10 09:02:46,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 179. [2018-11-10 09:02:46,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2018-11-10 09:02:46,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 181 transitions. [2018-11-10 09:02:46,193 INFO L728 BuchiCegarLoop]: Abstraction has 179 states and 181 transitions. [2018-11-10 09:02:46,193 INFO L608 BuchiCegarLoop]: Abstraction has 179 states and 181 transitions. [2018-11-10 09:02:46,193 INFO L442 BuchiCegarLoop]: ======== Iteration 15============ [2018-11-10 09:02:46,193 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 179 states and 181 transitions. [2018-11-10 09:02:46,193 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 93 [2018-11-10 09:02:46,194 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 09:02:46,194 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 09:02:46,195 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:02:46,195 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:02:46,195 INFO L793 eck$LassoCheckResult]: Stem: 8294#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 8288#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet14, main_#t~nondet15, main_#t~ret16;assume { :begin_inline_test_fun } true;test_fun_#in~x, test_fun_#in~y := main_#t~nondet14, main_#t~nondet15;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~mem9, test_fun_#t~mem10, test_fun_#t~mem11, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~short8, test_fun_#t~mem12, test_fun_#t~mem4, test_fun_#t~mem13, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset; 8289#L551 SUMMARY for call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L551 8300#L551-1 SUMMARY for call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L551-1 8302#L553-3 assume true; 8292#L553 SUMMARY for call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L553 8293#L553-1 assume !!(test_fun_#t~mem4 >= 0);havoc test_fun_#t~mem4; 8297#L554 SUMMARY for call write~int(1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L554 8271#L555-9 assume true; 8272#L555 SUMMARY for call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L555 8283#L555-1 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L555-1 8285#L555-2 test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 8291#L555-3 assume test_fun_#t~short8; 8296#L555-4 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L555-4 8299#L555-5 test_fun_#t~short8 := test_fun_#t~mem7 < 1073741824; 8262#L555-7 assume !!test_fun_#t~short8;havoc test_fun_#t~mem6;havoc test_fun_#t~short8;havoc test_fun_#t~mem7;havoc test_fun_#t~mem5; 8263#L556 SUMMARY for call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L556 8432#L556-1 assume !(test_fun_#t~mem9 <= 0);havoc test_fun_#t~mem9; 8305#L559 SUMMARY for call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L559 8266#L559-1 SUMMARY for call write~int(2 * test_fun_#t~mem11, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L559-1 8267#L559-2 havoc test_fun_#t~mem11; 8273#L555-9 assume true; 8274#L555 SUMMARY for call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L555 8438#L555-1 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L555-1 8437#L555-2 test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 8436#L555-3 assume test_fun_#t~short8; 8435#L555-4 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L555-4 8434#L555-5 test_fun_#t~short8 := test_fun_#t~mem7 < 1073741824; 8433#L555-7 assume !!test_fun_#t~short8;havoc test_fun_#t~mem6;havoc test_fun_#t~short8;havoc test_fun_#t~mem7;havoc test_fun_#t~mem5; 8275#L556 SUMMARY for call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L556 8276#L556-1 assume !(test_fun_#t~mem9 <= 0);havoc test_fun_#t~mem9; 8280#L559 SUMMARY for call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L559 8431#L559-1 SUMMARY for call write~int(2 * test_fun_#t~mem11, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L559-1 8269#L559-2 havoc test_fun_#t~mem11; 8270#L555-9 assume true; 8430#L555 SUMMARY for call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L555 8429#L555-1 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L555-1 8428#L555-2 test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 8427#L555-3 assume test_fun_#t~short8; 8426#L555-4 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L555-4 8425#L555-5 test_fun_#t~short8 := test_fun_#t~mem7 < 1073741824; 8424#L555-7 assume !!test_fun_#t~short8;havoc test_fun_#t~mem6;havoc test_fun_#t~short8;havoc test_fun_#t~mem7;havoc test_fun_#t~mem5; 8423#L556 SUMMARY for call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L556 8422#L556-1 assume !(test_fun_#t~mem9 <= 0);havoc test_fun_#t~mem9; 8421#L559 SUMMARY for call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L559 8420#L559-1 SUMMARY for call write~int(2 * test_fun_#t~mem11, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L559-1 8419#L559-2 havoc test_fun_#t~mem11; 8418#L555-9 assume true; 8417#L555 SUMMARY for call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L555 8416#L555-1 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L555-1 8415#L555-2 test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 8414#L555-3 assume test_fun_#t~short8; 8413#L555-4 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L555-4 8412#L555-5 test_fun_#t~short8 := test_fun_#t~mem7 < 1073741824; 8411#L555-7 assume !!test_fun_#t~short8;havoc test_fun_#t~mem6;havoc test_fun_#t~short8;havoc test_fun_#t~mem7;havoc test_fun_#t~mem5; 8410#L556 SUMMARY for call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L556 8409#L556-1 assume !(test_fun_#t~mem9 <= 0);havoc test_fun_#t~mem9; 8408#L559 SUMMARY for call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L559 8407#L559-1 SUMMARY for call write~int(2 * test_fun_#t~mem11, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L559-1 8406#L559-2 havoc test_fun_#t~mem11; 8405#L555-9 assume true; 8404#L555 SUMMARY for call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L555 8403#L555-1 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L555-1 8402#L555-2 test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 8401#L555-3 assume test_fun_#t~short8; 8400#L555-4 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L555-4 8399#L555-5 test_fun_#t~short8 := test_fun_#t~mem7 < 1073741824; 8398#L555-7 assume !!test_fun_#t~short8;havoc test_fun_#t~mem6;havoc test_fun_#t~short8;havoc test_fun_#t~mem7;havoc test_fun_#t~mem5; 8397#L556 SUMMARY for call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L556 8313#L556-1 assume !(test_fun_#t~mem9 <= 0);havoc test_fun_#t~mem9; 8396#L559 SUMMARY for call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L559 8395#L559-1 SUMMARY for call write~int(2 * test_fun_#t~mem11, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L559-1 8394#L559-2 havoc test_fun_#t~mem11; 8328#L555-9 assume true; 8327#L555 SUMMARY for call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L555 8325#L555-1 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L555-1 8323#L555-2 test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 8321#L555-3 assume test_fun_#t~short8; 8319#L555-4 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L555-4 8317#L555-5 test_fun_#t~short8 := test_fun_#t~mem7 < 1073741824; 8315#L555-7 assume !!test_fun_#t~short8;havoc test_fun_#t~mem6;havoc test_fun_#t~short8;havoc test_fun_#t~mem7;havoc test_fun_#t~mem5; 8312#L556 SUMMARY for call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L556 8278#L556-1 assume !(test_fun_#t~mem9 <= 0);havoc test_fun_#t~mem9; 8279#L559 SUMMARY for call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L559 8264#L559-1 SUMMARY for call write~int(2 * test_fun_#t~mem11, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L559-1 8265#L559-2 havoc test_fun_#t~mem11; 8268#L555-9 [2018-11-10 09:02:46,195 INFO L795 eck$LassoCheckResult]: Loop: 8268#L555-9 assume true; 8281#L555 SUMMARY for call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L555 8282#L555-1 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L555-1 8284#L555-2 test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 8290#L555-3 assume test_fun_#t~short8; 8295#L555-4 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L555-4 8298#L555-5 test_fun_#t~short8 := test_fun_#t~mem7 < 1073741824; 8260#L555-7 assume !test_fun_#t~short8;havoc test_fun_#t~mem6;havoc test_fun_#t~short8;havoc test_fun_#t~mem7;havoc test_fun_#t~mem5; 8261#L555-10 SUMMARY for call test_fun_#t~mem12 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L555-10 8277#L561 SUMMARY for call write~int(test_fun_#t~mem12 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L561 8301#L561-1 havoc test_fun_#t~mem12; 8303#L553-3 assume true; 8304#L553 SUMMARY for call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L553 8393#L553-1 assume !!(test_fun_#t~mem4 >= 0);havoc test_fun_#t~mem4; 8286#L554 SUMMARY for call write~int(1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L554 8287#L555-9 assume true; 8392#L555 SUMMARY for call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L555 8391#L555-1 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L555-1 8390#L555-2 test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 8389#L555-3 assume test_fun_#t~short8; 8388#L555-4 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L555-4 8387#L555-5 test_fun_#t~short8 := test_fun_#t~mem7 < 1073741824; 8386#L555-7 assume !!test_fun_#t~short8;havoc test_fun_#t~mem6;havoc test_fun_#t~short8;havoc test_fun_#t~mem7;havoc test_fun_#t~mem5; 8385#L556 SUMMARY for call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L556 8384#L556-1 assume !(test_fun_#t~mem9 <= 0);havoc test_fun_#t~mem9; 8383#L559 SUMMARY for call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L559 8382#L559-1 SUMMARY for call write~int(2 * test_fun_#t~mem11, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L559-1 8381#L559-2 havoc test_fun_#t~mem11; 8380#L555-9 assume true; 8379#L555 SUMMARY for call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L555 8378#L555-1 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L555-1 8377#L555-2 test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 8376#L555-3 assume test_fun_#t~short8; 8375#L555-4 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L555-4 8374#L555-5 test_fun_#t~short8 := test_fun_#t~mem7 < 1073741824; 8373#L555-7 assume !!test_fun_#t~short8;havoc test_fun_#t~mem6;havoc test_fun_#t~short8;havoc test_fun_#t~mem7;havoc test_fun_#t~mem5; 8372#L556 SUMMARY for call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L556 8371#L556-1 assume !(test_fun_#t~mem9 <= 0);havoc test_fun_#t~mem9; 8370#L559 SUMMARY for call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L559 8369#L559-1 SUMMARY for call write~int(2 * test_fun_#t~mem11, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L559-1 8368#L559-2 havoc test_fun_#t~mem11; 8367#L555-9 assume true; 8366#L555 SUMMARY for call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L555 8365#L555-1 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L555-1 8364#L555-2 test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 8363#L555-3 assume test_fun_#t~short8; 8362#L555-4 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L555-4 8361#L555-5 test_fun_#t~short8 := test_fun_#t~mem7 < 1073741824; 8360#L555-7 assume !!test_fun_#t~short8;havoc test_fun_#t~mem6;havoc test_fun_#t~short8;havoc test_fun_#t~mem7;havoc test_fun_#t~mem5; 8359#L556 SUMMARY for call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L556 8358#L556-1 assume !(test_fun_#t~mem9 <= 0);havoc test_fun_#t~mem9; 8357#L559 SUMMARY for call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L559 8356#L559-1 SUMMARY for call write~int(2 * test_fun_#t~mem11, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L559-1 8355#L559-2 havoc test_fun_#t~mem11; 8354#L555-9 assume true; 8353#L555 SUMMARY for call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L555 8352#L555-1 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L555-1 8351#L555-2 test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 8350#L555-3 assume test_fun_#t~short8; 8349#L555-4 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L555-4 8348#L555-5 test_fun_#t~short8 := test_fun_#t~mem7 < 1073741824; 8347#L555-7 assume !!test_fun_#t~short8;havoc test_fun_#t~mem6;havoc test_fun_#t~short8;havoc test_fun_#t~mem7;havoc test_fun_#t~mem5; 8346#L556 SUMMARY for call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L556 8345#L556-1 assume !(test_fun_#t~mem9 <= 0);havoc test_fun_#t~mem9; 8344#L559 SUMMARY for call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L559 8343#L559-1 SUMMARY for call write~int(2 * test_fun_#t~mem11, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L559-1 8342#L559-2 havoc test_fun_#t~mem11; 8341#L555-9 assume true; 8340#L555 SUMMARY for call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L555 8339#L555-1 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L555-1 8338#L555-2 test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 8337#L555-3 assume test_fun_#t~short8; 8336#L555-4 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L555-4 8335#L555-5 test_fun_#t~short8 := test_fun_#t~mem7 < 1073741824; 8334#L555-7 assume !!test_fun_#t~short8;havoc test_fun_#t~mem6;havoc test_fun_#t~short8;havoc test_fun_#t~mem7;havoc test_fun_#t~mem5; 8333#L556 SUMMARY for call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L556 8332#L556-1 assume !(test_fun_#t~mem9 <= 0);havoc test_fun_#t~mem9; 8331#L559 SUMMARY for call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L559 8330#L559-1 SUMMARY for call write~int(2 * test_fun_#t~mem11, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L559-1 8329#L559-2 havoc test_fun_#t~mem11; 8307#L555-9 assume true; 8326#L555 SUMMARY for call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L555 8324#L555-1 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L555-1 8322#L555-2 test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 8320#L555-3 assume test_fun_#t~short8; 8318#L555-4 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L555-4 8316#L555-5 test_fun_#t~short8 := test_fun_#t~mem7 < 1073741824; 8314#L555-7 assume !!test_fun_#t~short8;havoc test_fun_#t~mem6;havoc test_fun_#t~short8;havoc test_fun_#t~mem7;havoc test_fun_#t~mem5; 8311#L556 SUMMARY for call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L556 8310#L556-1 assume !(test_fun_#t~mem9 <= 0);havoc test_fun_#t~mem9; 8309#L559 SUMMARY for call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L559 8308#L559-1 SUMMARY for call write~int(2 * test_fun_#t~mem11, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L559-1 8306#L559-2 havoc test_fun_#t~mem11; 8268#L555-9 [2018-11-10 09:02:46,195 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:02:46,196 INFO L82 PathProgramCache]: Analyzing trace with hash 226929671, now seen corresponding path program 5 times [2018-11-10 09:02:46,196 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:02:46,196 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:02:46,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:02:46,196 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 09:02:46,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:02:46,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:02:46,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:02:46,228 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:02:46,228 INFO L82 PathProgramCache]: Analyzing trace with hash 1815732205, now seen corresponding path program 6 times [2018-11-10 09:02:46,229 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:02:46,229 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:02:46,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:02:46,229 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 09:02:46,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:02:46,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:02:46,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:02:46,263 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:02:46,263 INFO L82 PathProgramCache]: Analyzing trace with hash -2052855385, now seen corresponding path program 4 times [2018-11-10 09:02:46,263 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:02:46,263 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:02:46,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:02:46,264 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 09:02:46,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:02:46,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:02:46,470 INFO L134 CoverageAnalysis]: Checked inductivity of 958 backedges. 520 proven. 243 refuted. 0 times theorem prover too weak. 195 trivial. 0 not checked. [2018-11-10 09:02:46,471 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 09:02:46,471 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_47fa782f-b229-409d-b6de-e77330964619/bin-2019/uautomizer/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 09:02:46,478 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-10 09:02:46,606 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-10 09:02:46,606 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 09:02:46,610 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:02:46,612 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-10 09:02:46,614 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 09:02:46,614 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 09:02:46,615 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:02:46,616 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:02:46,617 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2018-11-10 09:02:46,629 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 09:02:46,629 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 29 [2018-11-10 09:02:46,632 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 19 [2018-11-10 09:02:46,632 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 09:02:46,636 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:02:46,639 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 09:02:46,639 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:13 [2018-11-10 09:02:46,677 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 23 [2018-11-10 09:02:46,679 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-11-10 09:02:46,679 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 09:02:46,682 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:02:46,686 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-10 09:02:46,686 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:33, output treesize:18 [2018-11-10 09:02:46,767 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 23 [2018-11-10 09:02:46,770 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-11-10 09:02:46,770 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 09:02:46,777 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:02:46,783 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-11-10 09:02:46,783 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:38, output treesize:23 [2018-11-10 09:02:46,863 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 23 [2018-11-10 09:02:46,866 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-11-10 09:02:46,867 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 09:02:46,870 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:02:46,876 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-11-10 09:02:46,876 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:43, output treesize:28 [2018-11-10 09:02:47,767 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 23 [2018-11-10 09:02:47,770 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-11-10 09:02:47,770 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 09:02:47,773 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:02:47,780 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2018-11-10 09:02:47,780 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:48, output treesize:33 [2018-11-10 09:02:54,173 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 23 [2018-11-10 09:02:54,176 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-11-10 09:02:54,176 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 09:02:54,179 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:02:54,186 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2018-11-10 09:02:54,186 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:53, output treesize:38 [2018-11-10 09:02:55,702 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-11-10 09:02:55,704 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-11-10 09:02:55,704 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 09:02:55,705 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:02:55,712 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2018-11-10 09:02:55,712 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:45, output treesize:34 [2018-11-10 09:02:55,773 INFO L134 CoverageAnalysis]: Checked inductivity of 958 backedges. 520 proven. 243 refuted. 0 times theorem prover too weak. 195 trivial. 0 not checked. [2018-11-10 09:02:55,789 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 09:02:55,789 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 17] total 35 [2018-11-10 09:02:58,875 WARN L179 SmtUtils]: Spent 3.08 s on a formula simplification. DAG size of input: 277 DAG size of output: 184 [2018-11-10 09:02:58,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-11-10 09:02:58,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=250, Invalid=938, Unknown=2, NotChecked=0, Total=1190 [2018-11-10 09:02:58,898 INFO L87 Difference]: Start difference. First operand 179 states and 181 transitions. cyclomatic complexity: 4 Second operand 35 states. [2018-11-10 09:03:01,737 WARN L179 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 22 [2018-11-10 09:03:39,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:03:39,211 INFO L93 Difference]: Finished difference Result 248 states and 252 transitions. [2018-11-10 09:03:39,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-11-10 09:03:39,211 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 248 states and 252 transitions. [2018-11-10 09:03:39,212 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 118 [2018-11-10 09:03:39,212 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 248 states to 236 states and 239 transitions. [2018-11-10 09:03:39,212 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 32 [2018-11-10 09:03:39,213 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 32 [2018-11-10 09:03:39,213 INFO L73 IsDeterministic]: Start isDeterministic. Operand 236 states and 239 transitions. [2018-11-10 09:03:39,213 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 09:03:39,213 INFO L705 BuchiCegarLoop]: Abstraction has 236 states and 239 transitions. [2018-11-10 09:03:39,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states and 239 transitions. [2018-11-10 09:03:39,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 205. [2018-11-10 09:03:39,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2018-11-10 09:03:39,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 207 transitions. [2018-11-10 09:03:39,215 INFO L728 BuchiCegarLoop]: Abstraction has 205 states and 207 transitions. [2018-11-10 09:03:39,215 INFO L608 BuchiCegarLoop]: Abstraction has 205 states and 207 transitions. [2018-11-10 09:03:39,215 INFO L442 BuchiCegarLoop]: ======== Iteration 16============ [2018-11-10 09:03:39,215 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 205 states and 207 transitions. [2018-11-10 09:03:39,215 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 106 [2018-11-10 09:03:39,215 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 09:03:39,215 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 09:03:39,216 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:03:39,216 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:03:39,217 INFO L793 eck$LassoCheckResult]: Stem: 9359#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 9352#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet14, main_#t~nondet15, main_#t~ret16;assume { :begin_inline_test_fun } true;test_fun_#in~x, test_fun_#in~y := main_#t~nondet14, main_#t~nondet15;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~mem9, test_fun_#t~mem10, test_fun_#t~mem11, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~short8, test_fun_#t~mem12, test_fun_#t~mem4, test_fun_#t~mem13, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset; 9353#L551 SUMMARY for call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L551 9366#L551-1 SUMMARY for call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L551-1 9368#L553-3 assume true; 9369#L553 SUMMARY for call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L553 9360#L553-1 assume !!(test_fun_#t~mem4 >= 0);havoc test_fun_#t~mem4; 9361#L554 SUMMARY for call write~int(1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L554 9337#L555-9 assume true; 9338#L555 SUMMARY for call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L555 9344#L555-1 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L555-1 9351#L555-2 test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 9529#L555-3 assume test_fun_#t~short8; 9528#L555-4 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L555-4 9527#L555-5 test_fun_#t~short8 := test_fun_#t~mem7 < 1073741824; 9526#L555-7 assume !!test_fun_#t~short8;havoc test_fun_#t~mem6;havoc test_fun_#t~short8;havoc test_fun_#t~mem7;havoc test_fun_#t~mem5; 9525#L556 SUMMARY for call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L556 9524#L556-1 assume !(test_fun_#t~mem9 <= 0);havoc test_fun_#t~mem9; 9523#L559 SUMMARY for call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L559 9522#L559-1 SUMMARY for call write~int(2 * test_fun_#t~mem11, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L559-1 9335#L559-2 havoc test_fun_#t~mem11; 9336#L555-9 assume true; 9339#L555 SUMMARY for call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L555 9530#L555-1 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L555-1 9357#L555-2 test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 9358#L555-3 assume test_fun_#t~short8; 9363#L555-4 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L555-4 9365#L555-5 test_fun_#t~short8 := test_fun_#t~mem7 < 1073741824; 9328#L555-7 assume !!test_fun_#t~short8;havoc test_fun_#t~mem6;havoc test_fun_#t~short8;havoc test_fun_#t~mem7;havoc test_fun_#t~mem5; 9329#L556 SUMMARY for call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L556 9340#L556-1 assume !(test_fun_#t~mem9 <= 0);havoc test_fun_#t~mem9; 9347#L559 SUMMARY for call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L559 9332#L559-1 SUMMARY for call write~int(2 * test_fun_#t~mem11, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L559-1 9333#L559-2 havoc test_fun_#t~mem11; 9521#L555-9 assume true; 9520#L555 SUMMARY for call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L555 9519#L555-1 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L555-1 9518#L555-2 test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 9517#L555-3 assume test_fun_#t~short8; 9516#L555-4 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L555-4 9515#L555-5 test_fun_#t~short8 := test_fun_#t~mem7 < 1073741824; 9514#L555-7 assume !!test_fun_#t~short8;havoc test_fun_#t~mem6;havoc test_fun_#t~short8;havoc test_fun_#t~mem7;havoc test_fun_#t~mem5; 9513#L556 SUMMARY for call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L556 9512#L556-1 assume !(test_fun_#t~mem9 <= 0);havoc test_fun_#t~mem9; 9511#L559 SUMMARY for call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L559 9510#L559-1 SUMMARY for call write~int(2 * test_fun_#t~mem11, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L559-1 9509#L559-2 havoc test_fun_#t~mem11; 9508#L555-9 assume true; 9507#L555 SUMMARY for call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L555 9506#L555-1 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L555-1 9505#L555-2 test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 9504#L555-3 assume test_fun_#t~short8; 9503#L555-4 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L555-4 9502#L555-5 test_fun_#t~short8 := test_fun_#t~mem7 < 1073741824; 9501#L555-7 assume !!test_fun_#t~short8;havoc test_fun_#t~mem6;havoc test_fun_#t~short8;havoc test_fun_#t~mem7;havoc test_fun_#t~mem5; 9500#L556 SUMMARY for call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L556 9499#L556-1 assume !(test_fun_#t~mem9 <= 0);havoc test_fun_#t~mem9; 9498#L559 SUMMARY for call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L559 9497#L559-1 SUMMARY for call write~int(2 * test_fun_#t~mem11, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L559-1 9496#L559-2 havoc test_fun_#t~mem11; 9495#L555-9 assume true; 9494#L555 SUMMARY for call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L555 9493#L555-1 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L555-1 9492#L555-2 test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 9491#L555-3 assume test_fun_#t~short8; 9490#L555-4 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L555-4 9489#L555-5 test_fun_#t~short8 := test_fun_#t~mem7 < 1073741824; 9488#L555-7 assume !!test_fun_#t~short8;havoc test_fun_#t~mem6;havoc test_fun_#t~short8;havoc test_fun_#t~mem7;havoc test_fun_#t~mem5; 9487#L556 SUMMARY for call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L556 9486#L556-1 assume !(test_fun_#t~mem9 <= 0);havoc test_fun_#t~mem9; 9485#L559 SUMMARY for call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L559 9484#L559-1 SUMMARY for call write~int(2 * test_fun_#t~mem11, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L559-1 9483#L559-2 havoc test_fun_#t~mem11; 9482#L555-9 assume true; 9481#L555 SUMMARY for call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L555 9480#L555-1 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L555-1 9479#L555-2 test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 9478#L555-3 assume test_fun_#t~short8; 9477#L555-4 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L555-4 9476#L555-5 test_fun_#t~short8 := test_fun_#t~mem7 < 1073741824; 9475#L555-7 assume !!test_fun_#t~short8;havoc test_fun_#t~mem6;havoc test_fun_#t~short8;havoc test_fun_#t~mem7;havoc test_fun_#t~mem5; 9474#L556 SUMMARY for call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L556 9376#L556-1 assume !(test_fun_#t~mem9 <= 0);havoc test_fun_#t~mem9; 9473#L559 SUMMARY for call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L559 9395#L559-1 SUMMARY for call write~int(2 * test_fun_#t~mem11, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L559-1 9394#L559-2 havoc test_fun_#t~mem11; 9392#L555-9 assume true; 9390#L555 SUMMARY for call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L555 9388#L555-1 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L555-1 9386#L555-2 test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 9384#L555-3 assume test_fun_#t~short8; 9382#L555-4 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L555-4 9380#L555-5 test_fun_#t~short8 := test_fun_#t~mem7 < 1073741824; 9378#L555-7 assume !!test_fun_#t~short8;havoc test_fun_#t~mem6;havoc test_fun_#t~short8;havoc test_fun_#t~mem7;havoc test_fun_#t~mem5; 9375#L556 SUMMARY for call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L556 9345#L556-1 assume !(test_fun_#t~mem9 <= 0);havoc test_fun_#t~mem9; 9346#L559 SUMMARY for call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L559 9330#L559-1 SUMMARY for call write~int(2 * test_fun_#t~mem11, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L559-1 9331#L559-2 havoc test_fun_#t~mem11; 9334#L555-9 [2018-11-10 09:03:39,217 INFO L795 eck$LassoCheckResult]: Loop: 9334#L555-9 assume true; 9342#L555 SUMMARY for call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L555 9343#L555-1 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L555-1 9350#L555-2 test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 9356#L555-3 assume test_fun_#t~short8; 9362#L555-4 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L555-4 9364#L555-5 test_fun_#t~short8 := test_fun_#t~mem7 < 1073741824; 9326#L555-7 assume !test_fun_#t~short8;havoc test_fun_#t~mem6;havoc test_fun_#t~short8;havoc test_fun_#t~mem7;havoc test_fun_#t~mem5; 9327#L555-10 SUMMARY for call test_fun_#t~mem12 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L555-10 9341#L561 SUMMARY for call write~int(test_fun_#t~mem12 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L561 9367#L561-1 havoc test_fun_#t~mem12; 9370#L553-3 assume true; 9354#L553 SUMMARY for call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L553 9355#L553-1 assume !!(test_fun_#t~mem4 >= 0);havoc test_fun_#t~mem4; 9348#L554 SUMMARY for call write~int(1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L554 9349#L555-9 assume true; 9472#L555 SUMMARY for call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L555 9471#L555-1 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L555-1 9470#L555-2 test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 9469#L555-3 assume test_fun_#t~short8; 9468#L555-4 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L555-4 9467#L555-5 test_fun_#t~short8 := test_fun_#t~mem7 < 1073741824; 9466#L555-7 assume !!test_fun_#t~short8;havoc test_fun_#t~mem6;havoc test_fun_#t~short8;havoc test_fun_#t~mem7;havoc test_fun_#t~mem5; 9465#L556 SUMMARY for call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L556 9464#L556-1 assume !(test_fun_#t~mem9 <= 0);havoc test_fun_#t~mem9; 9463#L559 SUMMARY for call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L559 9462#L559-1 SUMMARY for call write~int(2 * test_fun_#t~mem11, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L559-1 9461#L559-2 havoc test_fun_#t~mem11; 9460#L555-9 assume true; 9459#L555 SUMMARY for call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L555 9458#L555-1 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L555-1 9457#L555-2 test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 9456#L555-3 assume test_fun_#t~short8; 9455#L555-4 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L555-4 9454#L555-5 test_fun_#t~short8 := test_fun_#t~mem7 < 1073741824; 9453#L555-7 assume !!test_fun_#t~short8;havoc test_fun_#t~mem6;havoc test_fun_#t~short8;havoc test_fun_#t~mem7;havoc test_fun_#t~mem5; 9452#L556 SUMMARY for call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L556 9451#L556-1 assume !(test_fun_#t~mem9 <= 0);havoc test_fun_#t~mem9; 9450#L559 SUMMARY for call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L559 9449#L559-1 SUMMARY for call write~int(2 * test_fun_#t~mem11, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L559-1 9448#L559-2 havoc test_fun_#t~mem11; 9447#L555-9 assume true; 9446#L555 SUMMARY for call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L555 9445#L555-1 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L555-1 9444#L555-2 test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 9443#L555-3 assume test_fun_#t~short8; 9442#L555-4 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L555-4 9441#L555-5 test_fun_#t~short8 := test_fun_#t~mem7 < 1073741824; 9440#L555-7 assume !!test_fun_#t~short8;havoc test_fun_#t~mem6;havoc test_fun_#t~short8;havoc test_fun_#t~mem7;havoc test_fun_#t~mem5; 9439#L556 SUMMARY for call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L556 9438#L556-1 assume !(test_fun_#t~mem9 <= 0);havoc test_fun_#t~mem9; 9437#L559 SUMMARY for call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L559 9436#L559-1 SUMMARY for call write~int(2 * test_fun_#t~mem11, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L559-1 9435#L559-2 havoc test_fun_#t~mem11; 9434#L555-9 assume true; 9433#L555 SUMMARY for call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L555 9432#L555-1 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L555-1 9431#L555-2 test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 9430#L555-3 assume test_fun_#t~short8; 9429#L555-4 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L555-4 9428#L555-5 test_fun_#t~short8 := test_fun_#t~mem7 < 1073741824; 9427#L555-7 assume !!test_fun_#t~short8;havoc test_fun_#t~mem6;havoc test_fun_#t~short8;havoc test_fun_#t~mem7;havoc test_fun_#t~mem5; 9426#L556 SUMMARY for call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L556 9425#L556-1 assume !(test_fun_#t~mem9 <= 0);havoc test_fun_#t~mem9; 9424#L559 SUMMARY for call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L559 9423#L559-1 SUMMARY for call write~int(2 * test_fun_#t~mem11, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L559-1 9422#L559-2 havoc test_fun_#t~mem11; 9421#L555-9 assume true; 9420#L555 SUMMARY for call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L555 9419#L555-1 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L555-1 9418#L555-2 test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 9417#L555-3 assume test_fun_#t~short8; 9416#L555-4 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L555-4 9415#L555-5 test_fun_#t~short8 := test_fun_#t~mem7 < 1073741824; 9414#L555-7 assume !!test_fun_#t~short8;havoc test_fun_#t~mem6;havoc test_fun_#t~short8;havoc test_fun_#t~mem7;havoc test_fun_#t~mem5; 9413#L556 SUMMARY for call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L556 9412#L556-1 assume !(test_fun_#t~mem9 <= 0);havoc test_fun_#t~mem9; 9411#L559 SUMMARY for call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L559 9410#L559-1 SUMMARY for call write~int(2 * test_fun_#t~mem11, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L559-1 9409#L559-2 havoc test_fun_#t~mem11; 9408#L555-9 assume true; 9407#L555 SUMMARY for call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L555 9406#L555-1 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L555-1 9405#L555-2 test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 9404#L555-3 assume test_fun_#t~short8; 9403#L555-4 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L555-4 9402#L555-5 test_fun_#t~short8 := test_fun_#t~mem7 < 1073741824; 9401#L555-7 assume !!test_fun_#t~short8;havoc test_fun_#t~mem6;havoc test_fun_#t~short8;havoc test_fun_#t~mem7;havoc test_fun_#t~mem5; 9400#L556 SUMMARY for call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L556 9399#L556-1 assume !(test_fun_#t~mem9 <= 0);havoc test_fun_#t~mem9; 9398#L559 SUMMARY for call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L559 9397#L559-1 SUMMARY for call write~int(2 * test_fun_#t~mem11, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L559-1 9396#L559-2 havoc test_fun_#t~mem11; 9372#L555-9 assume true; 9393#L555 SUMMARY for call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L555 9391#L555-1 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L555-1 9389#L555-2 test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 9387#L555-3 assume test_fun_#t~short8; 9385#L555-4 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L555-4 9383#L555-5 test_fun_#t~short8 := test_fun_#t~mem7 < 1073741824; 9381#L555-7 assume !!test_fun_#t~short8;havoc test_fun_#t~mem6;havoc test_fun_#t~short8;havoc test_fun_#t~mem7;havoc test_fun_#t~mem5; 9379#L556 SUMMARY for call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L556 9377#L556-1 assume !(test_fun_#t~mem9 <= 0);havoc test_fun_#t~mem9; 9374#L559 SUMMARY for call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L559 9373#L559-1 SUMMARY for call write~int(2 * test_fun_#t~mem11, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L559-1 9371#L559-2 havoc test_fun_#t~mem11; 9334#L555-9 [2018-11-10 09:03:39,217 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:03:39,217 INFO L82 PathProgramCache]: Analyzing trace with hash -1628569323, now seen corresponding path program 6 times [2018-11-10 09:03:39,217 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:03:39,217 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:03:39,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:03:39,218 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 09:03:39,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:03:39,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:03:39,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:03:39,247 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:03:39,247 INFO L82 PathProgramCache]: Analyzing trace with hash 394842863, now seen corresponding path program 7 times [2018-11-10 09:03:39,247 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:03:39,248 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:03:39,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:03:39,248 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 09:03:39,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:03:39,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:03:39,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 09:03:39,295 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:03:39,295 INFO L82 PathProgramCache]: Analyzing trace with hash -348677373, now seen corresponding path program 5 times [2018-11-10 09:03:39,295 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 09:03:39,295 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 09:03:39,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:03:39,296 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:03:39,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:03:39,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:03:39,559 INFO L134 CoverageAnalysis]: Checked inductivity of 1299 backedges. 697 proven. 329 refuted. 0 times theorem prover too weak. 273 trivial. 0 not checked. [2018-11-10 09:03:39,559 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 09:03:39,559 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_47fa782f-b229-409d-b6de-e77330964619/bin-2019/uautomizer/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 09:03:39,565 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-10 09:03:39,725 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2018-11-10 09:03:39,726 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 09:03:39,730 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 09:03:39,733 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-10 09:03:39,736 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 09:03:39,736 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 09:03:39,739 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:03:39,743 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:03:39,743 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2018-11-10 09:03:39,791 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 09:03:39,792 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 29 [2018-11-10 09:03:39,795 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 19 [2018-11-10 09:03:39,795 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 09:03:39,820 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:03:39,823 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 09:03:39,823 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:13 [2018-11-10 09:03:39,859 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 23 [2018-11-10 09:03:39,861 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-11-10 09:03:39,861 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 09:03:39,864 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:03:39,867 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-10 09:03:39,867 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:33, output treesize:18 [2018-11-10 09:03:39,905 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 23 [2018-11-10 09:03:39,907 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-11-10 09:03:39,907 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 09:03:39,910 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:03:39,916 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-11-10 09:03:39,916 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:38, output treesize:23 [2018-11-10 09:03:39,961 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 23 [2018-11-10 09:03:39,964 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-11-10 09:03:39,965 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 09:03:39,968 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:03:39,974 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-11-10 09:03:39,974 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:43, output treesize:28 [2018-11-10 09:03:40,800 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 23 [2018-11-10 09:03:40,803 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-11-10 09:03:40,803 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 09:03:40,805 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:03:40,812 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2018-11-10 09:03:40,812 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:48, output treesize:33 [2018-11-10 09:03:50,817 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 23 [2018-11-10 09:03:50,820 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-11-10 09:03:50,820 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 09:03:50,823 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:03:50,831 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2018-11-10 09:03:50,831 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:53, output treesize:38 [2018-11-10 09:04:28,883 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 23 [2018-11-10 09:04:28,886 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-11-10 09:04:28,886 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 09:04:28,889 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:04:28,898 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-2 vars, End of recursive call: 7 dim-0 vars, and 1 xjuncts. [2018-11-10 09:04:28,898 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:58, output treesize:43 [2018-11-10 09:04:49,762 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-11-10 09:04:49,764 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-11-10 09:04:49,765 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 09:04:49,769 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 09:04:49,793 INFO L267 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 1 dim-2 vars, End of recursive call: 7 dim-0 vars, and 1 xjuncts. [2018-11-10 09:04:49,793 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 10 variables, input treesize:50, output treesize:39 [2018-11-10 09:04:49,885 INFO L134 CoverageAnalysis]: Checked inductivity of 1299 backedges. 697 proven. 329 refuted. 0 times theorem prover too weak. 273 trivial. 0 not checked. [2018-11-10 09:04:49,902 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 09:04:49,902 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 19] total 40 [2018-11-10 09:04:53,959 WARN L179 SmtUtils]: Spent 4.05 s on a formula simplification. DAG size of input: 312 DAG size of output: 205 [2018-11-10 09:04:53,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-11-10 09:04:53,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=316, Invalid=1232, Unknown=12, NotChecked=0, Total=1560 [2018-11-10 09:04:53,996 INFO L87 Difference]: Start difference. First operand 205 states and 207 transitions. cyclomatic complexity: 4 Second operand 40 states. [2018-11-10 09:05:11,097 WARN L179 SmtUtils]: Spent 13.72 s on a formula simplification. DAG size of input: 40 DAG size of output: 25 [2018-11-10 09:05:15,739 WARN L179 SmtUtils]: Spent 1.53 s on a formula simplification. DAG size of input: 38 DAG size of output: 22 [2018-11-10 09:05:36,552 WARN L179 SmtUtils]: Spent 20.39 s on a formula simplification. DAG size of input: 42 DAG size of output: 37 [2018-11-10 09:05:56,750 WARN L179 SmtUtils]: Spent 20.16 s on a formula simplification. DAG size of input: 43 DAG size of output: 38 [2018-11-10 09:06:05,968 WARN L194 Executor]: External (z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000) stderr output: (error "out of memory") [2018-11-10 09:06:05,969 FATAL L265 ToolchainWalker]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000)Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:208) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:225) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:155) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.WrapperScript.checkSat(WrapperScript.java:116) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.WrapperScript.checkSat(WrapperScript.java:116) at de.uni_freiburg.informatik.ultimate.logic.Util.checkSat(Util.java:61) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA.getRedundancy(SimplifyDDA.java:621) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.SimplifyDDAWithTimeout.getRedundancy(SimplifyDDAWithTimeout.java:122) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA$Simplifier.walk(SimplifyDDA.java:371) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:122) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:113) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA.simplifyOnce(SimplifyDDA.java:650) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.SimplifyDDAWithTimeout.getSimplifiedTerm(SimplifyDDAWithTimeout.java:187) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.SmtUtils.simplify(SmtUtils.java:150) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:354) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:382) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.getOrConstructPredicate(DeterministicInterpolantAutomaton.java:281) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.constructSuccessorsAndTransitions(DeterministicInterpolantAutomaton.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:78) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:234) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:213) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.internalSuccessors(ComplementDeterministicNwa.java:121) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:216) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:208) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addInternalsAndSuccessors(NestedWordAutomatonReachableStates.java:1066) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:968) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:188) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.refineFinite(BuchiCegarLoop.java:980) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.iterate(BuchiCegarLoop.java:549) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:145) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:384) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1427) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:630) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:419) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:205) ... 45 more [2018-11-10 09:06:05,972 INFO L168 Benchmark]: Toolchain (without parser) took 223745.95 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 340.8 MB). Free memory was 957.6 MB in the beginning and 1.0 GB in the end (delta: -80.7 MB). Peak memory consumption was 260.1 MB. Max. memory is 11.5 GB. [2018-11-10 09:06:05,972 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 09:06:05,972 INFO L168 Benchmark]: CACSL2BoogieTranslator took 273.70 ms. Allocated memory is still 1.0 GB. Free memory was 957.6 MB in the beginning and 936.2 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. [2018-11-10 09:06:05,972 INFO L168 Benchmark]: Boogie Procedure Inliner took 70.30 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.6 MB). Free memory was 936.2 MB in the beginning and 1.1 GB in the end (delta: -195.9 MB). Peak memory consumption was 15.8 MB. Max. memory is 11.5 GB. [2018-11-10 09:06:05,973 INFO L168 Benchmark]: Boogie Preprocessor took 14.95 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-10 09:06:05,973 INFO L168 Benchmark]: RCFGBuilder took 208.88 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 20.8 MB). Peak memory consumption was 20.8 MB. Max. memory is 11.5 GB. [2018-11-10 09:06:05,973 INFO L168 Benchmark]: BuchiAutomizer took 223175.64 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 208.1 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 67.6 MB). Peak memory consumption was 275.7 MB. Max. memory is 11.5 GB. [2018-11-10 09:06:05,974 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 273.70 ms. Allocated memory is still 1.0 GB. Free memory was 957.6 MB in the beginning and 936.2 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 70.30 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.6 MB). Free memory was 936.2 MB in the beginning and 1.1 GB in the end (delta: -195.9 MB). Peak memory consumption was 15.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 14.95 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 208.88 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 20.8 MB). Peak memory consumption was 20.8 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 223175.64 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 208.1 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 67.6 MB). Peak memory consumption was 275.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000)Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000)Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:208) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...