./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_3e61184c-37d6-4916-a088-a2ff8eeb73b2/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_3e61184c-37d6-4916-a088-a2ff8eeb73b2/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_3e61184c-37d6-4916-a088-a2ff8eeb73b2/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_3e61184c-37d6-4916-a088-a2ff8eeb73b2/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_3e61184c-37d6-4916-a088-a2ff8eeb73b2/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_3e61184c-37d6-4916-a088-a2ff8eeb73b2/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_3e61184c-37d6-4916-a088-a2ff8eeb73b2/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-10-27 06:09:27,128 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-27 06:09:27,130 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-27 06:09:27,139 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-27 06:09:27,139 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-27 06:09:27,140 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-27 06:09:27,140 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-27 06:09:27,142 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-27 06:09:27,143 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-27 06:09:27,144 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-27 06:09:27,144 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-27 06:09:27,145 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-27 06:09:27,146 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-27 06:09:27,147 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-27 06:09:27,148 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-27 06:09:27,148 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-27 06:09:27,150 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-27 06:09:27,151 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-27 06:09:27,152 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-27 06:09:27,154 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-27 06:09:27,155 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-27 06:09:27,156 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-27 06:09:27,158 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-27 06:09:27,158 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-27 06:09:27,158 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-27 06:09:27,159 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-27 06:09:27,160 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-27 06:09:27,161 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-27 06:09:27,162 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-27 06:09:27,163 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-27 06:09:27,163 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-27 06:09:27,163 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-27 06:09:27,164 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-27 06:09:27,164 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-27 06:09:27,165 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-27 06:09:27,166 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-27 06:09:27,166 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_3e61184c-37d6-4916-a088-a2ff8eeb73b2/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-10-27 06:09:27,178 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-27 06:09:27,178 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-27 06:09:27,179 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-27 06:09:27,179 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-27 06:09:27,179 INFO L133 SettingsManager]: * Use SBE=true [2018-10-27 06:09:27,179 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-10-27 06:09:27,180 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-10-27 06:09:27,180 INFO L133 SettingsManager]: * Use old map elimination=false [2018-10-27 06:09:27,180 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-10-27 06:09:27,180 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-10-27 06:09:27,180 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-10-27 06:09:27,181 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-27 06:09:27,182 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-10-27 06:09:27,182 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-27 06:09:27,182 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-27 06:09:27,182 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-10-27 06:09:27,182 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-10-27 06:09:27,182 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-10-27 06:09:27,182 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-27 06:09:27,183 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-10-27 06:09:27,183 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-10-27 06:09:27,183 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-27 06:09:27,183 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-27 06:09:27,183 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-10-27 06:09:27,183 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-27 06:09:27,183 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-27 06:09:27,184 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-10-27 06:09:27,186 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-27 06:09:27,186 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_3e61184c-37d6-4916-a088-a2ff8eeb73b2/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-10-27 06:09:27,212 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-27 06:09:27,221 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-27 06:09:27,224 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-27 06:09:27,225 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-27 06:09:27,226 INFO L276 PluginConnector]: CDTParser initialized [2018-10-27 06:09:27,226 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_3e61184c-37d6-4916-a088-a2ff8eeb73b2/bin-2019/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/c.01_assume-alloca_true-termination_true-no-overflow.c.i [2018-10-27 06:09:27,268 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_3e61184c-37d6-4916-a088-a2ff8eeb73b2/bin-2019/uautomizer/data/938529e32/77feaa251eab4128ac7debc7b9e8dc9b/FLAG50aca4cb6 [2018-10-27 06:09:27,661 INFO L298 CDTParser]: Found 1 translation units. [2018-10-27 06:09:27,662 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_3e61184c-37d6-4916-a088-a2ff8eeb73b2/sv-benchmarks/c/termination-memory-alloca/c.01_assume-alloca_true-termination_true-no-overflow.c.i [2018-10-27 06:09:27,670 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_3e61184c-37d6-4916-a088-a2ff8eeb73b2/bin-2019/uautomizer/data/938529e32/77feaa251eab4128ac7debc7b9e8dc9b/FLAG50aca4cb6 [2018-10-27 06:09:27,681 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_3e61184c-37d6-4916-a088-a2ff8eeb73b2/bin-2019/uautomizer/data/938529e32/77feaa251eab4128ac7debc7b9e8dc9b [2018-10-27 06:09:27,684 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-27 06:09:27,685 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-10-27 06:09:27,686 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-27 06:09:27,686 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-27 06:09:27,689 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-27 06:09:27,690 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 06:09:27" (1/1) ... [2018-10-27 06:09:27,692 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@717667f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:09:27, skipping insertion in model container [2018-10-27 06:09:27,692 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 06:09:27" (1/1) ... [2018-10-27 06:09:27,701 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-27 06:09:27,732 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-27 06:09:27,983 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 06:09:27,992 INFO L189 MainTranslator]: Completed pre-run [2018-10-27 06:09:28,030 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 06:09:28,064 INFO L193 MainTranslator]: Completed translation [2018-10-27 06:09:28,064 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:09:28 WrapperNode [2018-10-27 06:09:28,065 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-27 06:09:28,065 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-27 06:09:28,065 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-27 06:09:28,066 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-27 06:09:28,073 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:09:28" (1/1) ... [2018-10-27 06:09:28,085 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:09:28" (1/1) ... [2018-10-27 06:09:28,164 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-27 06:09:28,164 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-27 06:09:28,164 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-27 06:09:28,164 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-27 06:09:28,170 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:09:28" (1/1) ... [2018-10-27 06:09:28,171 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:09:28" (1/1) ... [2018-10-27 06:09:28,174 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:09:28" (1/1) ... [2018-10-27 06:09:28,174 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:09:28" (1/1) ... [2018-10-27 06:09:28,179 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:09:28" (1/1) ... [2018-10-27 06:09:28,188 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:09:28" (1/1) ... [2018-10-27 06:09:28,192 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:09:28" (1/1) ... [2018-10-27 06:09:28,194 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-27 06:09:28,194 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-27 06:09:28,194 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-27 06:09:28,195 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-27 06:09:28,195 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:09:28" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3e61184c-37d6-4916-a088-a2ff8eeb73b2/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-10-27 06:09:28,260 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-10-27 06:09:28,260 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-10-27 06:09:28,260 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-27 06:09:28,260 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-27 06:09:28,742 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-27 06:09:28,742 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 06:09:28 BoogieIcfgContainer [2018-10-27 06:09:28,742 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-27 06:09:28,743 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-10-27 06:09:28,743 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-10-27 06:09:28,746 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-10-27 06:09:28,747 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-10-27 06:09:28,747 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 27.10 06:09:27" (1/3) ... [2018-10-27 06:09:28,748 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@23d63ab7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 27.10 06:09:28, skipping insertion in model container [2018-10-27 06:09:28,748 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-10-27 06:09:28,748 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:09:28" (2/3) ... [2018-10-27 06:09:28,749 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@23d63ab7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 27.10 06:09:28, skipping insertion in model container [2018-10-27 06:09:28,749 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-10-27 06:09:28,749 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 06:09:28" (3/3) ... [2018-10-27 06:09:28,750 INFO L375 chiAutomizerObserver]: Analyzing ICFG c.01_assume-alloca_true-termination_true-no-overflow.c.i [2018-10-27 06:09:28,800 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-27 06:09:28,800 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-10-27 06:09:28,801 INFO L375 BuchiCegarLoop]: Hoare is false [2018-10-27 06:09:28,801 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-10-27 06:09:28,801 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-27 06:09:28,801 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-27 06:09:28,801 INFO L379 BuchiCegarLoop]: Difference is false [2018-10-27 06:09:28,801 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-27 06:09:28,801 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-10-27 06:09:28,814 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states. [2018-10-27 06:09:28,833 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 20 [2018-10-27 06:09:28,833 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:09:28,833 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:09:28,839 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-10-27 06:09:28,840 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:09:28,840 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-10-27 06:09:28,840 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states. [2018-10-27 06:09:28,842 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 20 [2018-10-27 06:09:28,842 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:09:28,842 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:09:28,842 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-10-27 06:09:28,842 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:09:28,849 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-10-27 06:09:28,850 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-10-27 06:09:28,854 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:09:28,855 INFO L82 PathProgramCache]: Analyzing trace with hash 925540, now seen corresponding path program 1 times [2018-10-27 06:09:28,856 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:09:28,857 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:09:28,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:28,905 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:09:28,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:28,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:09:28,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:09:28,973 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:09:28,973 INFO L82 PathProgramCache]: Analyzing trace with hash -19016633, now seen corresponding path program 1 times [2018-10-27 06:09:28,973 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:09:28,973 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:09:28,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:28,975 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:09:28,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:28,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:09:29,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:09:29,005 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 06:09:29,006 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-27 06:09:29,009 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-10-27 06:09:29,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-10-27 06:09:29,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-10-27 06:09:29,024 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 2 states. [2018-10-27 06:09:29,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:09:29,031 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2018-10-27 06:09:29,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-10-27 06:09:29,035 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 35 transitions. [2018-10-27 06:09:29,036 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 20 [2018-10-27 06:09:29,040 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 24 states and 26 transitions. [2018-10-27 06:09:29,043 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2018-10-27 06:09:29,043 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2018-10-27 06:09:29,043 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 26 transitions. [2018-10-27 06:09:29,044 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-10-27 06:09:29,044 INFO L705 BuchiCegarLoop]: Abstraction has 24 states and 26 transitions. [2018-10-27 06:09:29,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 26 transitions. [2018-10-27 06:09:29,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-10-27 06:09:29,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-10-27 06:09:29,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2018-10-27 06:09:29,070 INFO L728 BuchiCegarLoop]: Abstraction has 24 states and 26 transitions. [2018-10-27 06:09:29,070 INFO L608 BuchiCegarLoop]: Abstraction has 24 states and 26 transitions. [2018-10-27 06:09:29,070 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-10-27 06:09:29,070 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 26 transitions. [2018-10-27 06:09:29,071 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 20 [2018-10-27 06:09:29,071 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:09:29,071 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:09:29,071 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-10-27 06:09:29,071 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:09:29,072 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-10-27 06:09:29,072 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~mem7;havoc test_fun_#t~mem6;havoc test_fun_#t~short8;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-10-27 06:09:29,072 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:09:29,072 INFO L82 PathProgramCache]: Analyzing trace with hash 925540, now seen corresponding path program 2 times [2018-10-27 06:09:29,072 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:09:29,072 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:09:29,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:29,075 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:09:29,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:29,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:09:29,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:09:29,113 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:09:29,113 INFO L82 PathProgramCache]: Analyzing trace with hash 251638538, now seen corresponding path program 1 times [2018-10-27 06:09:29,113 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:09:29,113 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:09:29,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:29,115 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:09:29,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:29,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:09:29,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:09:29,153 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:09:29,154 INFO L82 PathProgramCache]: Analyzing trace with hash 1239477383, now seen corresponding path program 1 times [2018-10-27 06:09:29,154 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:09:29,154 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:09:29,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:29,155 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:09:29,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:29,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:09:29,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:09:29,445 WARN L179 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 53 [2018-10-27 06:09:30,065 WARN L179 SmtUtils]: Spent 522.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 77 [2018-10-27 06:09:30,238 WARN L179 SmtUtils]: Spent 171.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2018-10-27 06:09:30,246 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:09:30,247 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:09:30,247 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:09:30,247 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:09:30,248 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-10-27 06:09:30,248 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:09:30,248 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:09:30,248 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:09:30,248 INFO L131 ssoRankerPreferences]: Filename of dumped script: c.01_assume-alloca_true-termination_true-no-overflow.c.i_Iteration2_Lasso [2018-10-27 06:09:30,249 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:09:30,249 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:09:30,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-10-27 06:09:30,280 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:30,285 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:30,289 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:30,293 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:30,297 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:30,301 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:30,306 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:30,309 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:30,340 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:30,342 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:30,355 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:30,356 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:30,358 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:30,360 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:30,366 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:30,721 WARN L179 SmtUtils]: Spent 277.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 77 [2018-10-27 06:09:30,807 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:30,837 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:30,839 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:30,840 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:31,351 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:09:31,355 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-10-27 06:09:31,357 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-10-27 06:09:31,358 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:31,359 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:31,359 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:31,359 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:31,359 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:31,361 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:31,361 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:31,363 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:31,364 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-10-27 06:09:31,364 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:31,364 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:31,364 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:31,364 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:31,365 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:31,365 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:31,365 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:31,366 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:31,366 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-10-27 06:09:31,366 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:31,367 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:31,367 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:31,367 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:31,367 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:31,367 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:31,367 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:31,368 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:31,368 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-10-27 06:09:31,369 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:31,369 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:31,369 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:31,369 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:31,369 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:31,369 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:31,370 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:31,370 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:31,370 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-10-27 06:09:31,371 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:31,371 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:31,371 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:31,371 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:31,373 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:09:31,373 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:09:31,376 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:31,376 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:31,377 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:31,377 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:31,377 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:31,377 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:31,377 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:31,378 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:31,378 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:31,379 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:31,379 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-10-27 06:09:31,380 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:31,380 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:31,380 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:31,380 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:31,381 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:09:31,382 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:09:31,386 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:31,386 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-10-27 06:09:31,387 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:31,387 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:31,387 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:31,387 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:31,387 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:31,388 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:31,388 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:31,389 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:31,389 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-10-27 06:09:31,389 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:31,389 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:31,389 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:31,390 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:31,391 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:09:31,391 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:09:31,394 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:31,394 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-10-27 06:09:31,394 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:31,395 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:31,395 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:31,395 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:31,395 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:31,395 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:31,395 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:31,396 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:31,396 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-10-27 06:09:31,397 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:31,397 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:31,397 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:31,397 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:31,397 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:31,397 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:31,398 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:31,398 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:31,398 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-10-27 06:09:31,399 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:31,399 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:31,399 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:31,399 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:31,399 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:31,400 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:31,400 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:31,400 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:31,401 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-10-27 06:09:31,401 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:31,401 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:31,401 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:31,401 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:31,401 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:31,402 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:31,402 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:31,403 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:31,403 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-10-27 06:09:31,403 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:31,404 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:31,404 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:31,404 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:31,405 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:09:31,405 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:09:31,408 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:31,408 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-10-27 06:09:31,409 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:31,409 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:31,409 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:31,409 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:31,410 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:09:31,410 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:09:31,413 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:31,413 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-10-27 06:09:31,414 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:31,414 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:31,414 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:31,414 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:31,416 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:09:31,417 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:09:31,437 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:31,437 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-10-27 06:09:31,438 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:31,438 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:31,438 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:31,438 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:31,447 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:09:31,452 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:09:31,505 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:31,506 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-10-27 06:09:31,506 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:31,507 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:31,507 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:31,507 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:31,508 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:09:31,508 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:09:31,511 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:31,511 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-10-27 06:09:31,512 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:31,512 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:31,512 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:31,512 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:31,515 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:09:31,515 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:09:31,518 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:31,519 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-10-27 06:09:31,519 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:31,519 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-10-27 06:09:31,520 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:31,520 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:31,526 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-10-27 06:09:31,526 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:09:31,536 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:31,536 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-10-27 06:09:31,546 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:31,546 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:31,547 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:31,547 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:31,548 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:09:31,548 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:09:31,562 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-10-27 06:09:31,578 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-10-27 06:09:31,579 INFO L444 ModelExtractionUtils]: 10 out of 16 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-10-27 06:09:31,583 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-10-27 06:09:31,584 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-10-27 06:09:31,585 INFO L517 LassoAnalysis]: Proved termination. [2018-10-27 06:09:31,585 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-10-27 06:09:31,686 INFO L297 tatePredicateManager]: 9 out of 11 supporting invariants were superfluous and have been removed [2018-10-27 06:09:31,693 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-27 06:09:31,719 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:09:31,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:09:31,735 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:09:31,769 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-10-27 06:09:31,769 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 06:09:31,794 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:09:31,794 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-10-27 06:09:31,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:09:31,829 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:09:31,901 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-10-27 06:09:31,903 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-10-27 06:09:31,904 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:09:31,917 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:09:31,923 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-10-27 06:09:31,923 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:33 [2018-10-27 06:09:32,053 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:09:32,073 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-10-27 06:09:32,079 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-10-27 06:09:32,081 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 06:09:32,094 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 06:09:32,107 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-10-27 06:09:32,107 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:53, output treesize:34 [2018-10-27 06:09:32,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:09:32,129 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-10-27 06:09:32,130 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24 states and 26 transitions. cyclomatic complexity: 3 Second operand 9 states. [2018-10-27 06:09:32,266 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-10-27 06:09:32,268 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-10-27 06:09:32,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-10-27 06:09:32,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 42 transitions. [2018-10-27 06:09:32,270 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 42 transitions. Stem has 4 letters. Loop has 13 letters. [2018-10-27 06:09:32,271 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:09:32,272 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 42 transitions. Stem has 17 letters. Loop has 13 letters. [2018-10-27 06:09:32,272 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:09:32,272 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 42 transitions. Stem has 4 letters. Loop has 26 letters. [2018-10-27 06:09:32,272 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:09:32,273 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 93 states and 103 transitions. [2018-10-27 06:09:32,275 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 33 [2018-10-27 06:09:32,276 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 93 states to 72 states and 80 transitions. [2018-10-27 06:09:32,276 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 55 [2018-10-27 06:09:32,277 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 57 [2018-10-27 06:09:32,277 INFO L73 IsDeterministic]: Start isDeterministic. Operand 72 states and 80 transitions. [2018-10-27 06:09:32,277 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:09:32,277 INFO L705 BuchiCegarLoop]: Abstraction has 72 states and 80 transitions. [2018-10-27 06:09:32,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states and 80 transitions. [2018-10-27 06:09:32,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 52. [2018-10-27 06:09:32,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-10-27 06:09:32,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 58 transitions. [2018-10-27 06:09:32,281 INFO L728 BuchiCegarLoop]: Abstraction has 52 states and 58 transitions. [2018-10-27 06:09:32,281 INFO L608 BuchiCegarLoop]: Abstraction has 52 states and 58 transitions. [2018-10-27 06:09:32,281 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-10-27 06:09:32,281 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 52 states and 58 transitions. [2018-10-27 06:09:32,283 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 20 [2018-10-27 06:09:32,283 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:09:32,283 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:09:32,283 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:09:32,284 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:09:32,284 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~mem7;havoc test_fun_#t~mem6;havoc test_fun_#t~short8;havoc test_fun_#t~mem5; 329#L556 [2018-10-27 06:09:32,284 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~mem7;havoc test_fun_#t~mem6;havoc test_fun_#t~short8;havoc test_fun_#t~mem5; 329#L556 [2018-10-27 06:09:32,284 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:09:32,284 INFO L82 PathProgramCache]: Analyzing trace with hash -1770509680, now seen corresponding path program 1 times [2018-10-27 06:09:32,284 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:09:32,285 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:09:32,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:32,286 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:09:32,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:32,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:09:32,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:09:32,370 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 06:09:32,370 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-27 06:09:32,370 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-10-27 06:09:32,370 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:09:32,370 INFO L82 PathProgramCache]: Analyzing trace with hash -675471408, now seen corresponding path program 1 times [2018-10-27 06:09:32,370 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:09:32,370 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:09:32,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:32,371 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:09:32,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:32,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:09:32,450 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:09:32,450 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 06:09:32,450 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-27 06:09:32,450 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-10-27 06:09:32,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 06:09:32,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 06:09:32,451 INFO L87 Difference]: Start difference. First operand 52 states and 58 transitions. cyclomatic complexity: 8 Second operand 3 states. [2018-10-27 06:09:32,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:09:32,543 INFO L93 Difference]: Finished difference Result 55 states and 60 transitions. [2018-10-27 06:09:32,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 06:09:32,544 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 55 states and 60 transitions. [2018-10-27 06:09:32,546 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 21 [2018-10-27 06:09:32,547 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 55 states to 54 states and 59 transitions. [2018-10-27 06:09:32,547 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 38 [2018-10-27 06:09:32,547 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 38 [2018-10-27 06:09:32,547 INFO L73 IsDeterministic]: Start isDeterministic. Operand 54 states and 59 transitions. [2018-10-27 06:09:32,547 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:09:32,547 INFO L705 BuchiCegarLoop]: Abstraction has 54 states and 59 transitions. [2018-10-27 06:09:32,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states and 59 transitions. [2018-10-27 06:09:32,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 53. [2018-10-27 06:09:32,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-10-27 06:09:32,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 58 transitions. [2018-10-27 06:09:32,552 INFO L728 BuchiCegarLoop]: Abstraction has 53 states and 58 transitions. [2018-10-27 06:09:32,552 INFO L608 BuchiCegarLoop]: Abstraction has 53 states and 58 transitions. [2018-10-27 06:09:32,552 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-10-27 06:09:32,552 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 53 states and 58 transitions. [2018-10-27 06:09:32,553 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 21 [2018-10-27 06:09:32,553 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:09:32,553 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:09:32,553 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:09:32,553 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:09:32,553 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~mem7;havoc test_fun_#t~mem6;havoc test_fun_#t~short8;havoc test_fun_#t~mem5; 443#L556 [2018-10-27 06:09:32,554 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~mem7;havoc test_fun_#t~mem6;havoc test_fun_#t~short8;havoc test_fun_#t~mem5; 443#L556 [2018-10-27 06:09:32,554 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:09:32,554 INFO L82 PathProgramCache]: Analyzing trace with hash -652880141, now seen corresponding path program 1 times [2018-10-27 06:09:32,554 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:09:32,554 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:09:32,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:32,555 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:09:32,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:32,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:09:32,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:09:32,581 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:09:32,581 INFO L82 PathProgramCache]: Analyzing trace with hash -588088269, now seen corresponding path program 1 times [2018-10-27 06:09:32,582 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:09:32,582 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:09:32,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:32,583 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:09:32,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:32,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:09:32,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:09:32,595 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:09:32,595 INFO L82 PathProgramCache]: Analyzing trace with hash 405864065, now seen corresponding path program 1 times [2018-10-27 06:09:32,595 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:09:32,595 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:09:32,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:32,596 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:09:32,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:32,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:09:32,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:09:33,015 WARN L179 SmtUtils]: Spent 392.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 52 [2018-10-27 06:09:33,303 WARN L179 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 99 [2018-10-27 06:09:33,359 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:09:33,359 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:09:33,359 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:09:33,359 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:09:33,359 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-10-27 06:09:33,359 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:09:33,359 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:09:33,359 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:09:33,359 INFO L131 ssoRankerPreferences]: Filename of dumped script: c.01_assume-alloca_true-termination_true-no-overflow.c.i_Iteration4_Lasso [2018-10-27 06:09:33,359 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:09:33,359 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:09:33,362 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:33,377 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:33,378 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:33,379 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:33,381 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:33,383 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:33,384 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:33,385 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:33,388 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:33,389 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:33,390 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:33,391 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:33,392 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:33,394 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:33,396 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:33,398 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:33,399 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:33,401 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:33,403 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:33,404 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:33,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-10-27 06:09:33,862 WARN L179 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 73 [2018-10-27 06:09:34,352 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:09:34,353 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-10-27 06:09:34,353 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-10-27 06:09:34,354 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:34,354 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:34,354 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:34,354 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:34,354 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:34,354 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:34,354 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:34,355 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:34,355 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-10-27 06:09:34,356 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:34,356 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:34,356 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:34,356 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:34,362 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:09:34,362 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:09:34,363 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:34,364 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-10-27 06:09:34,364 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:34,364 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:34,364 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:34,364 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:34,364 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:34,367 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:34,367 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:34,368 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:34,368 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-10-27 06:09:34,369 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:34,369 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:34,369 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:34,369 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:34,370 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:09:34,370 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:09:34,371 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:34,372 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:34,372 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:34,372 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:34,372 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:34,372 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:34,378 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:09:34,378 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:09:34,380 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:34,381 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:34,381 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:34,381 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:34,381 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:34,381 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:34,381 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:34,382 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:34,382 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:34,382 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:34,383 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-10-27 06:09:34,383 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:34,383 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:34,383 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:34,383 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:34,383 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:34,383 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:34,384 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:34,384 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:34,384 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-10-27 06:09:34,393 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:34,393 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:34,393 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:34,393 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:34,394 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:09:34,394 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:09:34,396 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:34,396 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-10-27 06:09:34,396 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:34,399 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:34,399 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:34,399 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:34,400 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:34,400 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:34,400 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:34,400 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:34,401 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-10-27 06:09:34,401 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:34,401 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:34,401 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:34,401 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:34,401 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:34,402 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:34,402 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:34,402 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:34,402 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-10-27 06:09:34,403 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:34,403 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:34,403 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:34,403 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:34,403 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:34,403 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:34,403 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:34,404 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:34,404 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-10-27 06:09:34,414 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:34,414 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:34,414 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:34,414 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:34,414 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:34,415 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:34,415 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:34,415 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:34,416 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:34,417 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:34,417 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:34,417 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:34,417 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:34,417 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:34,418 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:34,418 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:34,418 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:34,419 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-10-27 06:09:34,419 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:34,419 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:34,419 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:34,419 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:34,420 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:09:34,420 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:09:34,428 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:34,429 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:34,429 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:34,429 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:34,429 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:34,429 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:34,429 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:34,430 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:34,430 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:34,430 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:34,431 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-10-27 06:09:34,431 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:34,431 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:34,431 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:34,431 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:34,431 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:34,432 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:34,432 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:34,432 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:34,439 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-10-27 06:09:34,439 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:34,439 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:34,439 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:34,440 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:34,440 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:09:34,440 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:09:34,441 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:34,442 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-10-27 06:09:34,442 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:34,442 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:34,442 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:34,442 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:34,442 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:34,443 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:34,443 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:34,443 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:34,443 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-10-27 06:09:34,444 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:34,444 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:34,444 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:34,444 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:34,445 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:09:34,445 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:09:34,446 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:34,447 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-10-27 06:09:34,447 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:34,447 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:34,447 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:34,447 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:34,447 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:34,448 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:34,448 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:34,448 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:34,461 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-10-27 06:09:34,461 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:34,461 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:34,461 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:34,461 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:34,462 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:09:34,462 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:09:34,464 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:34,464 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-10-27 06:09:34,465 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:34,465 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:34,465 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:34,465 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:34,467 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:09:34,467 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:09:34,509 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-10-27 06:09:34,568 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2018-10-27 06:09:34,569 INFO L444 ModelExtractionUtils]: 11 out of 19 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-10-27 06:09:34,570 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-10-27 06:09:34,571 INFO L440 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2018-10-27 06:09:34,571 INFO L517 LassoAnalysis]: Proved termination. [2018-10-27 06:09:34,571 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-10-27 06:09:34,774 INFO L297 tatePredicateManager]: 11 out of 12 supporting invariants were superfluous and have been removed [2018-10-27 06:09:34,775 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-27 06:09:34,797 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:09:34,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:09:34,810 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:09:34,818 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-10-27 06:09:34,818 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 06:09:34,825 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:09:34,825 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-10-27 06:09:34,842 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-10-27 06:09:34,845 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-10-27 06:09:34,845 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:09:34,847 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:09:34,851 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:09:34,852 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:13 [2018-10-27 06:09:34,870 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-10-27 06:09:34,885 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-10-27 06:09:34,885 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:09:34,891 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:09:34,899 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:09:34,899 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:13 [2018-10-27 06:09:34,906 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-10-27 06:09:34,908 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-10-27 06:09:34,909 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:09:34,913 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:09:34,920 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:09:34,920 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:24, output treesize:20 [2018-10-27 06:09:34,976 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-10-27 06:09:34,984 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-10-27 06:09:34,984 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:09:34,992 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-10-27 06:09:34,993 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-27 06:09:34,996 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:09:35,000 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:09:35,000 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:34, output treesize:8 [2018-10-27 06:09:35,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:09:35,067 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:09:35,205 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:09:35,206 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-10-27 06:09:35,210 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-10-27 06:09:35,211 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-10-27 06:09:35,231 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:09:35,236 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-10-27 06:09:35,236 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:42, output treesize:23 [2018-10-27 06:09:35,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:09:35,390 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-10-27 06:09:35,390 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 53 states and 58 transitions. cyclomatic complexity: 7 Second operand 15 states. [2018-10-27 06:09:36,238 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-10-27 06:09:36,240 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-10-27 06:09:36,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-10-27 06:09:36,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 75 transitions. [2018-10-27 06:09:36,241 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 75 transitions. Stem has 16 letters. Loop has 13 letters. [2018-10-27 06:09:36,242 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:09:36,242 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 75 transitions. Stem has 29 letters. Loop has 13 letters. [2018-10-27 06:09:36,242 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:09:36,242 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 75 transitions. Stem has 16 letters. Loop has 26 letters. [2018-10-27 06:09:36,242 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:09:36,242 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 142 states and 154 transitions. [2018-10-27 06:09:36,244 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 21 [2018-10-27 06:09:36,248 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 142 states to 139 states and 150 transitions. [2018-10-27 06:09:36,248 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 77 [2018-10-27 06:09:36,248 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 79 [2018-10-27 06:09:36,248 INFO L73 IsDeterministic]: Start isDeterministic. Operand 139 states and 150 transitions. [2018-10-27 06:09:36,248 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:09:36,249 INFO L705 BuchiCegarLoop]: Abstraction has 139 states and 150 transitions. [2018-10-27 06:09:36,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states and 150 transitions. [2018-10-27 06:09:36,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 113. [2018-10-27 06:09:36,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-10-27 06:09:36,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 124 transitions. [2018-10-27 06:09:36,256 INFO L728 BuchiCegarLoop]: Abstraction has 113 states and 124 transitions. [2018-10-27 06:09:36,256 INFO L608 BuchiCegarLoop]: Abstraction has 113 states and 124 transitions. [2018-10-27 06:09:36,257 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-10-27 06:09:36,257 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 113 states and 124 transitions. [2018-10-27 06:09:36,258 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 21 [2018-10-27 06:09:36,258 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:09:36,258 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:09:36,259 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-10-27 06:09:36,259 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:09:36,259 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~mem7;havoc test_fun_#t~mem6;havoc test_fun_#t~short8;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-10-27 06:09:36,259 INFO L795 eck$LassoCheckResult]: Loop: 862#L555-7 assume !test_fun_#t~short8;havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;havoc test_fun_#t~short8;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-10-27 06:09:36,259 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:09:36,259 INFO L82 PathProgramCache]: Analyzing trace with hash -871493785, now seen corresponding path program 1 times [2018-10-27 06:09:36,259 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:09:36,260 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:09:36,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:36,268 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:09:36,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:36,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:09:36,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:09:36,290 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:09:36,290 INFO L82 PathProgramCache]: Analyzing trace with hash 1335004710, now seen corresponding path program 2 times [2018-10-27 06:09:36,290 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:09:36,290 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:09:36,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:36,291 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:09:36,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:36,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:09:36,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:09:36,302 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:09:36,302 INFO L82 PathProgramCache]: Analyzing trace with hash 124990592, now seen corresponding path program 1 times [2018-10-27 06:09:36,303 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:09:36,303 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:09:36,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:36,303 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:09:36,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:36,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:09:36,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:09:37,080 WARN L179 SmtUtils]: Spent 749.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 57 [2018-10-27 06:09:37,500 WARN L179 SmtUtils]: Spent 392.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 121 [2018-10-27 06:09:37,573 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:09:37,573 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:09:37,573 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:09:37,574 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:09:37,574 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-10-27 06:09:37,574 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:09:37,574 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:09:37,574 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:09:37,574 INFO L131 ssoRankerPreferences]: Filename of dumped script: c.01_assume-alloca_true-termination_true-no-overflow.c.i_Iteration5_Lasso [2018-10-27 06:09:37,574 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:09:37,574 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:09:37,577 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:37,585 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:37,587 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:37,588 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:37,589 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:37,592 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:37,593 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:37,595 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:37,596 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:37,597 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:37,598 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:37,600 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:37,603 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:37,613 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:37,615 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:37,616 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:37,617 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:37,904 WARN L179 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 81 [2018-10-27 06:09:37,967 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:38,336 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:09:38,337 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-10-27 06:09:38,337 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-10-27 06:09:38,337 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:38,338 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:38,338 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:38,338 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:38,338 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:38,338 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:38,338 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:38,339 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:38,340 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-10-27 06:09:38,340 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:38,340 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:38,340 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:38,340 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:38,347 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:09:38,348 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:09:38,349 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:38,349 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-10-27 06:09:38,349 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:38,349 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:38,350 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:38,350 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:38,350 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:38,350 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:38,350 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:38,350 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:38,351 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-10-27 06:09:38,351 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:38,351 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:38,351 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:38,351 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:38,351 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:38,351 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:38,352 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:38,352 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:38,352 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-10-27 06:09:38,353 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:38,353 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:38,353 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:38,353 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:38,353 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:09:38,354 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:09:38,355 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:38,355 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-10-27 06:09:38,355 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:38,355 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:38,356 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:38,356 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:38,356 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:38,356 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:38,356 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:38,356 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:38,361 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-10-27 06:09:38,361 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:38,361 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:38,361 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:38,361 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:38,362 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:09:38,362 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:09:38,363 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:38,364 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-10-27 06:09:38,364 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:38,364 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:38,364 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:38,364 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:38,364 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:38,364 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:38,365 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:38,365 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:38,365 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:38,365 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:38,365 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:38,366 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:38,366 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:38,366 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:09:38,366 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:09:38,367 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:38,367 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-10-27 06:09:38,368 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:38,368 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:38,368 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:38,368 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:38,368 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:38,368 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:38,368 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:38,384 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:38,385 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-10-27 06:09:38,385 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:38,385 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:38,385 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:38,386 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:38,386 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:38,386 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:38,386 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:38,386 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:38,387 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-10-27 06:09:38,387 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:38,387 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:38,387 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:38,387 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:38,388 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:09:38,388 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:09:38,390 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:38,390 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-10-27 06:09:38,390 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:38,391 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:38,391 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:38,391 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:38,391 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:38,391 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:38,391 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:38,391 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:38,392 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-10-27 06:09:38,392 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:38,392 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:38,392 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:38,392 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:38,396 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:09:38,396 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:09:38,397 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:38,397 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-10-27 06:09:38,398 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:38,398 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:38,398 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:38,398 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:38,398 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:38,398 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:38,398 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:38,398 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:38,399 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-10-27 06:09:38,399 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:38,399 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:38,399 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:38,399 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:38,399 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:38,399 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:38,400 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:38,400 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:38,400 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-10-27 06:09:38,412 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:38,413 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:38,413 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:38,413 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:38,415 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:09:38,415 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:09:38,425 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:38,425 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-10-27 06:09:38,425 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:38,426 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-10-27 06:09:38,426 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:38,426 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:38,427 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-10-27 06:09:38,427 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:09:38,434 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:38,434 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:38,434 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:38,434 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:38,434 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:38,435 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:38,435 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:09:38,435 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:09:38,440 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:38,441 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-10-27 06:09:38,441 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:38,441 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:38,441 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:38,442 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:38,442 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:09:38,442 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:09:38,443 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:38,444 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-10-27 06:09:38,444 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:38,444 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-10-27 06:09:38,444 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:38,444 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:38,453 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-10-27 06:09:38,454 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:09:38,456 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:38,457 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-10-27 06:09:38,457 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:38,457 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:38,457 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:38,457 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:38,458 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:09:38,458 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:09:38,459 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:38,459 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-10-27 06:09:38,459 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:38,460 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:38,460 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:38,460 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:38,469 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:09:38,469 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:09:38,484 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-10-27 06:09:38,499 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-10-27 06:09:38,499 INFO L444 ModelExtractionUtils]: 17 out of 25 variables were initially zero. Simplification set additionally 6 variables to zero. [2018-10-27 06:09:38,499 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-10-27 06:09:38,500 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-10-27 06:09:38,500 INFO L517 LassoAnalysis]: Proved termination. [2018-10-27 06:09:38,500 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-10-27 06:09:38,582 INFO L297 tatePredicateManager]: 9 out of 11 supporting invariants were superfluous and have been removed [2018-10-27 06:09:38,586 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-27 06:09:38,612 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:09:38,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:09:38,626 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:09:38,633 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-10-27 06:09:38,633 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 06:09:38,636 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:09:38,636 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-10-27 06:09:38,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:09:38,648 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:09:38,664 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:09:38,665 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-10-27 06:09:38,670 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-10-27 06:09:38,671 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:09:38,677 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:09:38,682 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:09:38,682 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:17 [2018-10-27 06:09:38,728 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-10-27 06:09:38,732 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-10-27 06:09:38,732 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:09:38,736 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:09:38,743 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-10-27 06:09:38,743 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:31 [2018-10-27 06:09:38,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:09:38,772 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-10-27 06:09:38,772 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 113 states and 124 transitions. cyclomatic complexity: 15 Second operand 9 states. [2018-10-27 06:09:38,876 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-10-27 06:09:38,877 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-10-27 06:09:38,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-10-27 06:09:38,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 49 transitions. [2018-10-27 06:09:38,878 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 49 transitions. Stem has 26 letters. Loop has 13 letters. [2018-10-27 06:09:38,878 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:09:38,878 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 49 transitions. Stem has 39 letters. Loop has 13 letters. [2018-10-27 06:09:38,879 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:09:38,879 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 49 transitions. Stem has 26 letters. Loop has 26 letters. [2018-10-27 06:09:38,879 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:09:38,880 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 286 states and 316 transitions. [2018-10-27 06:09:38,886 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 33 [2018-10-27 06:09:38,888 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 286 states to 211 states and 231 transitions. [2018-10-27 06:09:38,888 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 73 [2018-10-27 06:09:38,888 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 75 [2018-10-27 06:09:38,888 INFO L73 IsDeterministic]: Start isDeterministic. Operand 211 states and 231 transitions. [2018-10-27 06:09:38,888 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:09:38,888 INFO L705 BuchiCegarLoop]: Abstraction has 211 states and 231 transitions. [2018-10-27 06:09:38,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states and 231 transitions. [2018-10-27 06:09:38,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 191. [2018-10-27 06:09:38,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2018-10-27 06:09:38,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 210 transitions. [2018-10-27 06:09:38,901 INFO L728 BuchiCegarLoop]: Abstraction has 191 states and 210 transitions. [2018-10-27 06:09:38,903 INFO L608 BuchiCegarLoop]: Abstraction has 191 states and 210 transitions. [2018-10-27 06:09:38,903 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-10-27 06:09:38,903 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 191 states and 210 transitions. [2018-10-27 06:09:38,904 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 33 [2018-10-27 06:09:38,904 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:09:38,904 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:09:38,905 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:09:38,905 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:09:38,905 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~mem7;havoc test_fun_#t~mem6;havoc test_fun_#t~short8;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-10-27 06:09:38,905 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~mem7;havoc test_fun_#t~mem6;havoc test_fun_#t~short8;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-10-27 06:09:38,905 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:09:38,905 INFO L82 PathProgramCache]: Analyzing trace with hash 1593645930, now seen corresponding path program 2 times [2018-10-27 06:09:38,905 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:09:38,905 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:09:38,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:38,906 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:09:38,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:38,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:09:38,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:09:38,927 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:09:38,927 INFO L82 PathProgramCache]: Analyzing trace with hash -1274383525, now seen corresponding path program 2 times [2018-10-27 06:09:38,927 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:09:38,928 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:09:38,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:38,928 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:09:38,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:38,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:09:38,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:09:38,938 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:09:38,938 INFO L82 PathProgramCache]: Analyzing trace with hash 1617488530, now seen corresponding path program 2 times [2018-10-27 06:09:38,938 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:09:38,938 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:09:38,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:38,939 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:09:38,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:38,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:09:39,516 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:09:39,516 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:09:39,516 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3e61184c-37d6-4916-a088-a2ff8eeb73b2/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-10-27 06:09:39,524 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-27 06:09:39,576 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-27 06:09:39,577 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 06:09:39,579 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:09:39,589 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-10-27 06:09:39,589 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 06:09:39,591 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:09:39,592 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:8, output treesize:4 [2018-10-27 06:09:39,598 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-10-27 06:09:39,600 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-10-27 06:09:39,600 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:09:39,602 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:09:39,605 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:09:39,605 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:16, output treesize:12 [2018-10-27 06:09:39,704 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:09:39,705 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-10-27 06:09:39,729 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-10-27 06:09:39,730 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:09:39,767 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:09:39,772 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:09:39,772 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:43, output treesize:25 [2018-10-27 06:09:39,784 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 06:09:39,785 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-10-27 06:09:39,787 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-10-27 06:09:39,787 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:09:39,791 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:09:39,795 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:09:39,795 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:30, output treesize:19 [2018-10-27 06:09:39,832 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-10-27 06:09:39,853 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-10-27 06:09:39,853 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:09:39,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 11 treesize of output 3 [2018-10-27 06:09:39,873 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-27 06:09:39,925 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:09:39,931 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:09:39,931 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:33, output treesize:7 [2018-10-27 06:09:39,952 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:09:39,980 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 06:09:39,980 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 21 [2018-10-27 06:09:40,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-10-27 06:09:40,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=340, Unknown=0, NotChecked=0, Total=420 [2018-10-27 06:09:40,063 INFO L87 Difference]: Start difference. First operand 191 states and 210 transitions. cyclomatic complexity: 27 Second operand 21 states. [2018-10-27 06:09:40,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:09:40,640 INFO L93 Difference]: Finished difference Result 252 states and 270 transitions. [2018-10-27 06:09:40,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-27 06:09:40,641 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 252 states and 270 transitions. [2018-10-27 06:09:40,643 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 52 [2018-10-27 06:09:40,644 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 252 states to 180 states and 193 transitions. [2018-10-27 06:09:40,644 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 101 [2018-10-27 06:09:40,644 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 101 [2018-10-27 06:09:40,644 INFO L73 IsDeterministic]: Start isDeterministic. Operand 180 states and 193 transitions. [2018-10-27 06:09:40,644 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:09:40,644 INFO L705 BuchiCegarLoop]: Abstraction has 180 states and 193 transitions. [2018-10-27 06:09:40,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states and 193 transitions. [2018-10-27 06:09:40,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 123. [2018-10-27 06:09:40,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-10-27 06:09:40,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 133 transitions. [2018-10-27 06:09:40,649 INFO L728 BuchiCegarLoop]: Abstraction has 123 states and 133 transitions. [2018-10-27 06:09:40,649 INFO L608 BuchiCegarLoop]: Abstraction has 123 states and 133 transitions. [2018-10-27 06:09:40,650 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-10-27 06:09:40,650 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 123 states and 133 transitions. [2018-10-27 06:09:40,650 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 38 [2018-10-27 06:09:40,650 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:09:40,651 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:09:40,651 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-10-27 06:09:40,651 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:09:40,651 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~mem7;havoc test_fun_#t~mem6;havoc test_fun_#t~short8;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~mem7;havoc test_fun_#t~mem6;havoc test_fun_#t~short8;havoc test_fun_#t~mem5; 2068#L555-10 [2018-10-27 06:09:40,652 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~mem7;havoc test_fun_#t~mem6;havoc test_fun_#t~short8;havoc test_fun_#t~mem5; 2068#L555-10 [2018-10-27 06:09:40,652 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:09:40,652 INFO L82 PathProgramCache]: Analyzing trace with hash 405864063, now seen corresponding path program 1 times [2018-10-27 06:09:40,652 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:09:40,652 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:09:40,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:40,661 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:09:40,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:40,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:09:40,885 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:09:40,885 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:09:40,885 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3e61184c-37d6-4916-a088-a2ff8eeb73b2/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-10-27 06:09:40,892 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:09:40,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:09:40,917 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:09:40,945 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-10-27 06:09:40,949 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-10-27 06:09:40,949 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:09:40,953 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:09:40,954 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:09:40,954 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2018-10-27 06:09:40,984 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:09:40,984 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-10-27 06:09:40,986 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-10-27 06:09:40,986 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:09:40,994 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:09:41,005 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-10-27 06:09:41,005 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:13 [2018-10-27 06:09:41,026 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-10-27 06:09:41,049 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-10-27 06:09:41,049 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:09:41,073 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:09:41,085 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-10-27 06:09:41,085 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:20, output treesize:9 [2018-10-27 06:09:41,098 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:09:41,115 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 06:09:41,115 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 9 [2018-10-27 06:09:41,115 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-10-27 06:09:41,115 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:09:41,116 INFO L82 PathProgramCache]: Analyzing trace with hash -1446953535, now seen corresponding path program 1 times [2018-10-27 06:09:41,116 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:09:41,116 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:09:41,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:41,117 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:09:41,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:41,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:09:41,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:09:41,158 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 06:09:41,158 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-27 06:09:41,159 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-10-27 06:09:41,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-27 06:09:41,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-10-27 06:09:41,159 INFO L87 Difference]: Start difference. First operand 123 states and 133 transitions. cyclomatic complexity: 15 Second operand 7 states. [2018-10-27 06:09:41,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:09:41,211 INFO L93 Difference]: Finished difference Result 150 states and 158 transitions. [2018-10-27 06:09:41,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-27 06:09:41,213 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 150 states and 158 transitions. [2018-10-27 06:09:41,214 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 45 [2018-10-27 06:09:41,215 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 150 states to 139 states and 147 transitions. [2018-10-27 06:09:41,215 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 90 [2018-10-27 06:09:41,215 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 90 [2018-10-27 06:09:41,215 INFO L73 IsDeterministic]: Start isDeterministic. Operand 139 states and 147 transitions. [2018-10-27 06:09:41,215 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:09:41,215 INFO L705 BuchiCegarLoop]: Abstraction has 139 states and 147 transitions. [2018-10-27 06:09:41,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states and 147 transitions. [2018-10-27 06:09:41,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 113. [2018-10-27 06:09:41,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-10-27 06:09:41,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 121 transitions. [2018-10-27 06:09:41,224 INFO L728 BuchiCegarLoop]: Abstraction has 113 states and 121 transitions. [2018-10-27 06:09:41,224 INFO L608 BuchiCegarLoop]: Abstraction has 113 states and 121 transitions. [2018-10-27 06:09:41,224 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-10-27 06:09:41,224 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 113 states and 121 transitions. [2018-10-27 06:09:41,225 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 41 [2018-10-27 06:09:41,225 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:09:41,225 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:09:41,226 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-10-27 06:09:41,226 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-10-27 06:09:41,226 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~mem7;havoc test_fun_#t~mem6;havoc test_fun_#t~short8;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~mem7;havoc test_fun_#t~mem6;havoc test_fun_#t~short8;havoc test_fun_#t~mem5; 2443#L555-10 [2018-10-27 06:09:41,226 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~mem7;havoc test_fun_#t~mem6;havoc test_fun_#t~short8;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~mem7;havoc test_fun_#t~mem6;havoc test_fun_#t~short8;havoc test_fun_#t~mem5; 2443#L555-10 [2018-10-27 06:09:41,226 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:09:41,226 INFO L82 PathProgramCache]: Analyzing trace with hash 405864063, now seen corresponding path program 2 times [2018-10-27 06:09:41,226 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:09:41,226 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:09:41,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:41,227 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:09:41,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:41,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:09:41,364 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:09:41,364 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:09:41,364 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3e61184c-37d6-4916-a088-a2ff8eeb73b2/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-10-27 06:09:41,373 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-27 06:09:41,391 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-27 06:09:41,391 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 06:09:41,392 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:09:41,405 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-10-27 06:09:41,409 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-10-27 06:09:41,409 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:09:41,413 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:09:41,417 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:09:41,417 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2018-10-27 06:09:41,441 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:09:41,441 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-10-27 06:09:41,446 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-10-27 06:09:41,446 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:09:41,450 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:09:41,453 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-10-27 06:09:41,453 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:13 [2018-10-27 06:09:41,485 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-10-27 06:09:41,497 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-10-27 06:09:41,498 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:09:41,499 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:09:41,501 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-10-27 06:09:41,502 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:20, output treesize:9 [2018-10-27 06:09:41,515 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:09:41,541 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 06:09:41,541 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 9 [2018-10-27 06:09:41,541 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-10-27 06:09:41,541 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:09:41,542 INFO L82 PathProgramCache]: Analyzing trace with hash -672192081, now seen corresponding path program 1 times [2018-10-27 06:09:41,542 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:09:41,542 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:09:41,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:41,542 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:09:41,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:41,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:09:41,627 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:09:41,627 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:09:41,627 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3e61184c-37d6-4916-a088-a2ff8eeb73b2/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-10-27 06:09:41,635 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:09:41,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:09:41,654 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:09:41,681 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-10-27 06:09:41,685 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-10-27 06:09:41,685 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:09:41,687 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:09:41,688 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:09:41,688 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2018-10-27 06:09:41,702 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:09:41,702 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-10-27 06:09:41,704 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-10-27 06:09:41,705 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:09:41,708 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:09:41,712 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-10-27 06:09:41,712 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:13 [2018-10-27 06:09:41,744 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-10-27 06:09:41,746 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-10-27 06:09:41,746 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:09:41,751 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:09:41,753 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-10-27 06:09:41,753 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:20, output treesize:9 [2018-10-27 06:09:41,771 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:09:41,787 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 06:09:41,787 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 9 [2018-10-27 06:09:41,788 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-10-27 06:09:41,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-27 06:09:41,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2018-10-27 06:09:41,788 INFO L87 Difference]: Start difference. First operand 113 states and 121 transitions. cyclomatic complexity: 12 Second operand 10 states. [2018-10-27 06:09:42,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:09:42,028 INFO L93 Difference]: Finished difference Result 207 states and 218 transitions. [2018-10-27 06:09:42,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-27 06:09:42,029 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 207 states and 218 transitions. [2018-10-27 06:09:42,030 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 58 [2018-10-27 06:09:42,031 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 207 states to 204 states and 215 transitions. [2018-10-27 06:09:42,031 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 126 [2018-10-27 06:09:42,031 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 126 [2018-10-27 06:09:42,031 INFO L73 IsDeterministic]: Start isDeterministic. Operand 204 states and 215 transitions. [2018-10-27 06:09:42,032 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:09:42,032 INFO L705 BuchiCegarLoop]: Abstraction has 204 states and 215 transitions. [2018-10-27 06:09:42,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states and 215 transitions. [2018-10-27 06:09:42,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 148. [2018-10-27 06:09:42,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-10-27 06:09:42,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 158 transitions. [2018-10-27 06:09:42,036 INFO L728 BuchiCegarLoop]: Abstraction has 148 states and 158 transitions. [2018-10-27 06:09:42,036 INFO L608 BuchiCegarLoop]: Abstraction has 148 states and 158 transitions. [2018-10-27 06:09:42,036 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-10-27 06:09:42,036 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 148 states and 158 transitions. [2018-10-27 06:09:42,040 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 54 [2018-10-27 06:09:42,041 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:09:42,041 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:09:42,043 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-10-27 06:09:42,043 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:09:42,043 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~mem7;havoc test_fun_#t~mem6;havoc test_fun_#t~short8;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~mem7;havoc test_fun_#t~mem6;havoc test_fun_#t~short8;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-10-27 06:09:42,043 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~mem7;havoc test_fun_#t~mem6;havoc test_fun_#t~short8;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-10-27 06:09:42,043 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:09:42,043 INFO L82 PathProgramCache]: Analyzing trace with hash -669877092, now seen corresponding path program 3 times [2018-10-27 06:09:42,043 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:09:42,043 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:09:42,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:42,044 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:09:42,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:42,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:09:42,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:09:42,072 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:09:42,072 INFO L82 PathProgramCache]: Analyzing trace with hash -1274383525, now seen corresponding path program 3 times [2018-10-27 06:09:42,072 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:09:42,072 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:09:42,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:42,073 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:09:42,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:42,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:09:42,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:09:42,078 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:09:42,078 INFO L82 PathProgramCache]: Analyzing trace with hash 942312096, now seen corresponding path program 4 times [2018-10-27 06:09:42,078 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:09:42,078 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:09:42,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:42,079 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:09:42,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:42,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:09:42,418 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 7 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:09:42,418 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:09:42,418 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3e61184c-37d6-4916-a088-a2ff8eeb73b2/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-10-27 06:09:42,427 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-27 06:09:42,452 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-27 06:09:42,452 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 06:09:42,454 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:09:42,479 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-10-27 06:09:42,479 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 06:09:42,481 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:09:42,481 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:8, output treesize:4 [2018-10-27 06:09:42,485 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-10-27 06:09:42,488 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-10-27 06:09:42,488 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:09:42,493 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:09:42,501 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:09:42,502 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:16, output treesize:12 [2018-10-27 06:09:42,524 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:09:42,525 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-10-27 06:09:42,527 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-10-27 06:09:42,528 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:09:42,538 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:09:42,542 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-10-27 06:09:42,543 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:17 [2018-10-27 06:09:42,722 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:09:42,724 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-10-27 06:09:42,728 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-10-27 06:09:42,728 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:09:42,733 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:09:42,743 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-10-27 06:09:42,743 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:48, output treesize:30 [2018-10-27 06:09:42,776 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:09:42,777 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-10-27 06:09:42,779 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-10-27 06:09:42,779 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:09:42,799 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:09:42,804 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-10-27 06:09:42,804 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:26 [2018-10-27 06:09:42,987 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 15 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:09:43,011 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 06:09:43,011 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16] total 29 [2018-10-27 06:09:43,141 WARN L179 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 50 [2018-10-27 06:09:43,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-10-27 06:09:43,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=693, Unknown=0, NotChecked=0, Total=812 [2018-10-27 06:09:43,158 INFO L87 Difference]: Start difference. First operand 148 states and 158 transitions. cyclomatic complexity: 14 Second operand 29 states. [2018-10-27 06:09:43,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:09:43,713 INFO L93 Difference]: Finished difference Result 219 states and 229 transitions. [2018-10-27 06:09:43,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-27 06:09:43,718 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 219 states and 229 transitions. [2018-10-27 06:09:43,720 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 58 [2018-10-27 06:09:43,720 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 219 states to 191 states and 199 transitions. [2018-10-27 06:09:43,720 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 116 [2018-10-27 06:09:43,721 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 116 [2018-10-27 06:09:43,721 INFO L73 IsDeterministic]: Start isDeterministic. Operand 191 states and 199 transitions. [2018-10-27 06:09:43,721 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:09:43,721 INFO L705 BuchiCegarLoop]: Abstraction has 191 states and 199 transitions. [2018-10-27 06:09:43,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states and 199 transitions. [2018-10-27 06:09:43,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 139. [2018-10-27 06:09:43,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-10-27 06:09:43,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 146 transitions. [2018-10-27 06:09:43,728 INFO L728 BuchiCegarLoop]: Abstraction has 139 states and 146 transitions. [2018-10-27 06:09:43,728 INFO L608 BuchiCegarLoop]: Abstraction has 139 states and 146 transitions. [2018-10-27 06:09:43,729 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-10-27 06:09:43,729 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 139 states and 146 transitions. [2018-10-27 06:09:43,729 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 54 [2018-10-27 06:09:43,729 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:09:43,729 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:09:43,730 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-10-27 06:09:43,730 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-10-27 06:09:43,731 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~mem7;havoc test_fun_#t~mem6;havoc test_fun_#t~short8;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~mem7;havoc test_fun_#t~mem6;havoc test_fun_#t~short8;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~mem7;havoc test_fun_#t~mem6;havoc test_fun_#t~short8;havoc test_fun_#t~mem5; 3531#L555-10 [2018-10-27 06:09:43,731 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~mem7;havoc test_fun_#t~mem6;havoc test_fun_#t~short8;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~mem7;havoc test_fun_#t~mem6;havoc test_fun_#t~short8;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~mem7;havoc test_fun_#t~mem6;havoc test_fun_#t~short8;havoc test_fun_#t~mem5; 3531#L555-10 [2018-10-27 06:09:43,731 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:09:43,731 INFO L82 PathProgramCache]: Analyzing trace with hash -1884090959, now seen corresponding path program 3 times [2018-10-27 06:09:43,731 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:09:43,731 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:09:43,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:43,732 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:09:43,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:43,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:09:43,855 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:09:43,855 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:09:43,855 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3e61184c-37d6-4916-a088-a2ff8eeb73b2/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-10-27 06:09:43,872 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-27 06:09:43,890 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-10-27 06:09:43,890 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 06:09:43,892 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:09:43,895 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-10-27 06:09:43,896 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-10-27 06:09:43,897 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:09:43,899 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:09:43,900 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:09:43,900 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2018-10-27 06:09:43,914 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:09:43,915 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-10-27 06:09:43,917 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-10-27 06:09:43,917 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:09:43,922 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:09:43,925 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-10-27 06:09:43,925 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:13 [2018-10-27 06:09:43,954 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-10-27 06:09:43,960 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-10-27 06:09:43,960 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:09:43,963 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:09:43,967 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-10-27 06:09:43,968 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:33, output treesize:18 [2018-10-27 06:09:43,988 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-10-27 06:09:43,989 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-10-27 06:09:43,990 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:09:43,992 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:09:43,996 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-10-27 06:09:43,996 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:25, output treesize:14 [2018-10-27 06:09:44,007 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:09:44,023 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 06:09:44,024 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 14 [2018-10-27 06:09:44,024 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-10-27 06:09:44,024 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:09:44,024 INFO L82 PathProgramCache]: Analyzing trace with hash 1864929409, now seen corresponding path program 2 times [2018-10-27 06:09:44,024 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:09:44,024 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:09:44,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:44,025 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:09:44,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:44,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:09:44,156 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:09:44,156 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:09:44,156 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3e61184c-37d6-4916-a088-a2ff8eeb73b2/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-10-27 06:09:44,163 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-27 06:09:44,200 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-27 06:09:44,201 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 06:09:44,203 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:09:44,206 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-10-27 06:09:44,208 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-10-27 06:09:44,208 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:09:44,209 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:09:44,211 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:09:44,211 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2018-10-27 06:09:44,222 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:09:44,223 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-10-27 06:09:44,226 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-10-27 06:09:44,226 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:09:44,234 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:09:44,237 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-10-27 06:09:44,237 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:13 [2018-10-27 06:09:44,272 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-10-27 06:09:44,276 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-10-27 06:09:44,277 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:09:44,281 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:09:44,285 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-10-27 06:09:44,285 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:33, output treesize:18 [2018-10-27 06:09:44,353 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-10-27 06:09:44,357 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-10-27 06:09:44,357 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:09:44,359 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:09:44,363 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-10-27 06:09:44,363 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:25, output treesize:14 [2018-10-27 06:09:44,373 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:09:44,389 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 06:09:44,389 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 14 [2018-10-27 06:09:44,389 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-10-27 06:09:44,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-27 06:09:44,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2018-10-27 06:09:44,391 INFO L87 Difference]: Start difference. First operand 139 states and 146 transitions. cyclomatic complexity: 11 Second operand 15 states. [2018-10-27 06:09:44,945 WARN L179 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 19 [2018-10-27 06:09:45,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:09:45,100 INFO L93 Difference]: Finished difference Result 259 states and 270 transitions. [2018-10-27 06:09:45,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-10-27 06:09:45,109 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 259 states and 270 transitions. [2018-10-27 06:09:45,110 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 71 [2018-10-27 06:09:45,111 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 259 states to 256 states and 267 transitions. [2018-10-27 06:09:45,111 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 152 [2018-10-27 06:09:45,111 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 152 [2018-10-27 06:09:45,111 INFO L73 IsDeterministic]: Start isDeterministic. Operand 256 states and 267 transitions. [2018-10-27 06:09:45,112 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:09:45,112 INFO L705 BuchiCegarLoop]: Abstraction has 256 states and 267 transitions. [2018-10-27 06:09:45,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states and 267 transitions. [2018-10-27 06:09:45,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 187. [2018-10-27 06:09:45,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2018-10-27 06:09:45,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 197 transitions. [2018-10-27 06:09:45,122 INFO L728 BuchiCegarLoop]: Abstraction has 187 states and 197 transitions. [2018-10-27 06:09:45,122 INFO L608 BuchiCegarLoop]: Abstraction has 187 states and 197 transitions. [2018-10-27 06:09:45,122 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2018-10-27 06:09:45,122 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 187 states and 197 transitions. [2018-10-27 06:09:45,122 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 67 [2018-10-27 06:09:45,122 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:09:45,123 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:09:45,123 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-10-27 06:09:45,123 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:09:45,123 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~mem7;havoc test_fun_#t~mem6;havoc test_fun_#t~short8;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~mem7;havoc test_fun_#t~mem6;havoc test_fun_#t~short8;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~mem7;havoc test_fun_#t~mem6;havoc test_fun_#t~short8;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-10-27 06:09:45,124 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~mem7;havoc test_fun_#t~mem6;havoc test_fun_#t~short8;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-10-27 06:09:45,124 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:09:45,124 INFO L82 PathProgramCache]: Analyzing trace with hash -1345053526, now seen corresponding path program 5 times [2018-10-27 06:09:45,124 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:09:45,124 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:09:45,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:45,137 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:09:45,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:45,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:09:45,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:09:45,164 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:09:45,164 INFO L82 PathProgramCache]: Analyzing trace with hash -1274383525, now seen corresponding path program 4 times [2018-10-27 06:09:45,164 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:09:45,164 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:09:45,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:45,165 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:09:45,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:45,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:09:45,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:09:45,176 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:09:45,180 INFO L82 PathProgramCache]: Analyzing trace with hash -1171394222, now seen corresponding path program 6 times [2018-10-27 06:09:45,180 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:09:45,180 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:09:45,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:45,181 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:09:45,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:45,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:09:45,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:09:45,359 WARN L179 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 50 [2018-10-27 06:09:46,351 WARN L179 SmtUtils]: Spent 976.00 ms on a formula simplification. DAG size of input: 201 DAG size of output: 159 [2018-10-27 06:09:46,431 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:09:46,431 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:09:46,431 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:09:46,431 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:09:46,432 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-10-27 06:09:46,432 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:09:46,432 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:09:46,432 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:09:46,432 INFO L131 ssoRankerPreferences]: Filename of dumped script: c.01_assume-alloca_true-termination_true-no-overflow.c.i_Iteration11_Lasso [2018-10-27 06:09:46,432 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:09:46,432 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:09:46,434 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:46,438 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:46,440 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:46,441 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:46,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-10-27 06:09:46,447 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:46,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-10-27 06:09:46,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-10-27 06:09:46,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-10-27 06:09:46,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-10-27 06:09:46,455 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:46,456 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:46,466 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:46,468 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:46,469 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:46,470 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:46,481 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:46,482 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:46,660 WARN L179 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 78 [2018-10-27 06:09:46,725 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:46,734 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:47,370 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:09:47,370 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-10-27 06:09:47,370 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-10-27 06:09:47,370 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:47,371 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:47,371 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:47,371 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:47,371 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:47,371 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:47,371 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:47,372 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:47,372 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:47,372 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:47,372 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:47,372 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:47,380 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:47,381 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:47,381 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:47,381 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:47,381 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:47,382 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-10-27 06:09:47,382 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:47,382 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:47,382 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:47,382 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:47,382 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:47,382 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:47,382 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:47,383 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:47,383 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-10-27 06:09:47,383 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:47,383 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:47,383 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:47,383 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:47,384 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:09:47,384 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:09:47,385 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:47,385 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-10-27 06:09:47,386 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:47,386 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:47,386 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:47,386 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:47,386 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:47,386 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:47,386 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:47,386 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:47,387 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-10-27 06:09:47,387 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:47,387 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:47,387 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:47,387 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:47,387 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:47,388 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:47,388 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:47,388 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:47,388 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-10-27 06:09:47,390 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:47,391 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:47,391 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:47,391 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:47,391 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:47,391 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:47,391 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:47,392 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:47,392 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-10-27 06:09:47,392 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:47,392 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:47,392 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:47,392 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:47,393 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:09:47,393 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:09:47,394 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:47,394 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-10-27 06:09:47,394 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:47,394 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:47,394 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:47,395 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:47,395 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:47,395 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:47,395 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:47,395 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:47,395 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-10-27 06:09:47,396 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:47,396 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:47,396 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:47,396 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:47,396 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:47,396 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:47,396 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:47,397 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:47,397 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-10-27 06:09:47,398 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:47,398 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:47,398 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:47,398 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:47,398 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:47,398 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:47,398 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:47,398 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:47,399 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-10-27 06:09:47,399 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:47,399 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:47,399 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:47,399 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:47,400 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:09:47,400 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:09:47,409 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:47,417 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-10-27 06:09:47,417 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:47,417 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:47,417 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:47,417 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:47,417 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:47,417 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:47,418 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:47,418 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:47,418 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-10-27 06:09:47,418 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:47,418 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:47,419 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:47,419 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:47,419 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:47,419 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:47,419 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:47,419 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:47,419 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-10-27 06:09:47,420 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:47,420 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:47,420 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:47,420 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:47,420 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:47,420 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:47,420 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:47,422 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:47,423 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-10-27 06:09:47,423 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:47,423 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:47,423 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:47,423 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:47,424 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:09:47,424 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:09:47,425 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:47,425 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-10-27 06:09:47,425 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:47,425 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:47,425 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:47,425 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:47,425 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:47,426 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:47,426 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:47,426 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:47,426 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-10-27 06:09:47,427 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:47,427 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:47,427 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:47,427 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:47,428 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:09:47,428 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:09:47,429 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:47,429 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:47,429 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:47,430 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:47,430 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:47,430 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:47,430 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:09:47,430 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:09:47,431 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:47,431 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-10-27 06:09:47,432 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:47,432 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:47,432 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:47,432 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:47,439 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:09:47,439 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:09:47,449 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:47,449 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-10-27 06:09:47,450 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:47,450 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:47,450 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:47,450 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:47,450 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:09:47,450 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:09:47,454 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:47,454 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-10-27 06:09:47,455 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:47,455 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-10-27 06:09:47,456 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:47,456 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:47,456 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-10-27 06:09:47,456 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:09:47,458 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:47,459 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-10-27 06:09:47,459 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:47,459 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:47,459 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:47,459 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:47,460 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:09:47,460 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:09:47,475 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:47,476 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-10-27 06:09:47,476 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:47,476 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-10-27 06:09:47,476 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:47,476 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:47,477 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-10-27 06:09:47,477 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:09:47,480 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:47,480 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-10-27 06:09:47,488 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:47,489 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:47,489 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:47,489 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:47,490 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:09:47,490 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:09:47,510 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-10-27 06:09:47,535 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-10-27 06:09:47,535 INFO L444 ModelExtractionUtils]: 14 out of 19 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-10-27 06:09:47,536 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-10-27 06:09:47,536 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-10-27 06:09:47,536 INFO L517 LassoAnalysis]: Proved termination. [2018-10-27 06:09:47,536 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-10-27 06:09:47,642 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2018-10-27 06:09:47,643 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-27 06:09:47,651 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:09:47,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:09:47,679 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:09:47,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:09:47,709 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:09:47,911 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:09:47,912 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-10-27 06:09:47,914 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-10-27 06:09:47,915 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 06:09:47,950 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 06:09:47,956 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-10-27 06:09:47,956 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:46, output treesize:26 [2018-10-27 06:09:47,974 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:09:47,974 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-10-27 06:09:47,974 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 187 states and 197 transitions. cyclomatic complexity: 14 Second operand 10 states. [2018-10-27 06:09:48,522 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-10-27 06:09:48,523 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-10-27 06:09:48,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-10-27 06:09:48,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 26 transitions. [2018-10-27 06:09:48,523 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 26 transitions. Stem has 47 letters. Loop has 13 letters. [2018-10-27 06:09:48,524 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:09:48,524 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-10-27 06:09:48,533 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:09:48,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:09:48,553 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:09:48,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:09:48,561 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:09:48,627 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:09:48,628 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-10-27 06:09:48,631 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-10-27 06:09:48,632 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 06:09:48,638 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 06:09:48,644 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-10-27 06:09:48,644 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:46, output treesize:26 [2018-10-27 06:09:48,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:09:48,657 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-10-27 06:09:48,658 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 187 states and 197 transitions. cyclomatic complexity: 14 Second operand 10 states. [2018-10-27 06:09:48,791 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-10-27 06:09:48,792 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-10-27 06:09:48,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-10-27 06:09:48,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 25 transitions. [2018-10-27 06:09:48,792 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 25 transitions. Stem has 47 letters. Loop has 13 letters. [2018-10-27 06:09:48,792 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:09:48,792 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-10-27 06:09:48,802 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:09:48,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:09:48,838 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:09:48,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:09:48,862 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:09:48,968 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:09:48,968 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-10-27 06:09:48,970 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-10-27 06:09:48,971 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 06:09:48,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-10-27 06:09:48,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-10-27 06:09:48,984 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:46, output treesize:26 [2018-10-27 06:09:49,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:09:49,018 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-10-27 06:09:49,019 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 187 states and 197 transitions. cyclomatic complexity: 14 Second operand 10 states. [2018-10-27 06:09:49,142 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-10-27 06:09:49,149 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-10-27 06:09:49,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-10-27 06:09:49,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 45 transitions. [2018-10-27 06:09:49,149 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 45 transitions. Stem has 47 letters. Loop has 13 letters. [2018-10-27 06:09:49,150 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:09:49,150 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 45 transitions. Stem has 60 letters. Loop has 13 letters. [2018-10-27 06:09:49,150 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:09:49,150 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 45 transitions. Stem has 47 letters. Loop has 26 letters. [2018-10-27 06:09:49,151 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:09:49,151 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 346 states and 366 transitions. [2018-10-27 06:09:49,158 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 62 [2018-10-27 06:09:49,159 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 346 states to 117 states and 119 transitions. [2018-10-27 06:09:49,159 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 31 [2018-10-27 06:09:49,159 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 37 [2018-10-27 06:09:49,159 INFO L73 IsDeterministic]: Start isDeterministic. Operand 117 states and 119 transitions. [2018-10-27 06:09:49,159 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:09:49,159 INFO L705 BuchiCegarLoop]: Abstraction has 117 states and 119 transitions. [2018-10-27 06:09:49,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states and 119 transitions. [2018-10-27 06:09:49,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 101. [2018-10-27 06:09:49,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-10-27 06:09:49,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 103 transitions. [2018-10-27 06:09:49,165 INFO L728 BuchiCegarLoop]: Abstraction has 101 states and 103 transitions. [2018-10-27 06:09:49,165 INFO L608 BuchiCegarLoop]: Abstraction has 101 states and 103 transitions. [2018-10-27 06:09:49,165 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2018-10-27 06:09:49,165 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 101 states and 103 transitions. [2018-10-27 06:09:49,166 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 54 [2018-10-27 06:09:49,166 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:09:49,166 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:09:49,167 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-10-27 06:09:49,167 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-10-27 06:09:49,167 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~mem7;havoc test_fun_#t~mem6;havoc test_fun_#t~short8;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~mem7;havoc test_fun_#t~mem6;havoc test_fun_#t~short8;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~mem7;havoc test_fun_#t~mem6;havoc test_fun_#t~short8;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-10-27 06:09:49,172 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~mem7;havoc test_fun_#t~mem6;havoc test_fun_#t~short8;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~mem7;havoc test_fun_#t~mem6;havoc test_fun_#t~short8;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~mem7;havoc test_fun_#t~mem6;havoc test_fun_#t~short8;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~mem7;havoc test_fun_#t~mem6;havoc test_fun_#t~short8;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-10-27 06:09:49,173 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:09:49,173 INFO L82 PathProgramCache]: Analyzing trace with hash -1429393771, now seen corresponding path program 2 times [2018-10-27 06:09:49,173 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:09:49,173 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:09:49,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:49,174 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:09:49,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:49,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:09:49,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:09:49,199 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:09:49,199 INFO L82 PathProgramCache]: Analyzing trace with hash -980559505, now seen corresponding path program 3 times [2018-10-27 06:09:49,199 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:09:49,199 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:09:49,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:49,200 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:09:49,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:49,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:09:49,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:09:49,222 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:09:49,222 INFO L82 PathProgramCache]: Analyzing trace with hash 1085133059, now seen corresponding path program 1 times [2018-10-27 06:09:49,222 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:09:49,222 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:09:49,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:49,223 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:09:49,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:49,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:09:49,410 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 145 proven. 63 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-10-27 06:09:49,410 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:09:49,410 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3e61184c-37d6-4916-a088-a2ff8eeb73b2/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-10-27 06:09:49,418 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:09:49,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:09:49,461 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:09:49,465 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-10-27 06:09:49,469 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-10-27 06:09:49,469 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:09:49,473 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:09:49,476 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:09:49,477 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2018-10-27 06:09:49,522 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:09:49,523 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-10-27 06:09:49,549 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-10-27 06:09:49,549 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:09:49,579 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:09:49,583 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-10-27 06:09:49,583 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:13 [2018-10-27 06:09:49,617 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-10-27 06:09:49,626 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-10-27 06:09:49,626 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:09:49,629 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:09:49,633 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-10-27 06:09:49,633 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:33, output treesize:18 [2018-10-27 06:09:49,831 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-10-27 06:09:49,833 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-10-27 06:09:49,833 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:09:49,837 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:09:49,842 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-10-27 06:09:49,842 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:38, output treesize:23 [2018-10-27 06:09:49,904 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-10-27 06:09:49,905 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-10-27 06:09:49,905 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:09:49,907 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:09:49,911 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-10-27 06:09:49,911 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:30, output treesize:19 [2018-10-27 06:09:49,938 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 145 proven. 63 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-10-27 06:09:49,954 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 06:09:49,954 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 20 [2018-10-27 06:09:50,598 WARN L179 SmtUtils]: Spent 641.00 ms on a formula simplification. DAG size of input: 172 DAG size of output: 121 [2018-10-27 06:09:50,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-10-27 06:09:50,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=296, Unknown=0, NotChecked=0, Total=380 [2018-10-27 06:09:50,705 INFO L87 Difference]: Start difference. First operand 101 states and 103 transitions. cyclomatic complexity: 4 Second operand 20 states. [2018-10-27 06:09:51,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:09:51,074 INFO L93 Difference]: Finished difference Result 170 states and 174 transitions. [2018-10-27 06:09:51,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-10-27 06:09:51,075 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 170 states and 174 transitions. [2018-10-27 06:09:51,076 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 79 [2018-10-27 06:09:51,077 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 170 states to 158 states and 161 transitions. [2018-10-27 06:09:51,077 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 32 [2018-10-27 06:09:51,077 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 32 [2018-10-27 06:09:51,077 INFO L73 IsDeterministic]: Start isDeterministic. Operand 158 states and 161 transitions. [2018-10-27 06:09:51,077 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:09:51,077 INFO L705 BuchiCegarLoop]: Abstraction has 158 states and 161 transitions. [2018-10-27 06:09:51,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states and 161 transitions. [2018-10-27 06:09:51,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 127. [2018-10-27 06:09:51,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-10-27 06:09:51,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 129 transitions. [2018-10-27 06:09:51,079 INFO L728 BuchiCegarLoop]: Abstraction has 127 states and 129 transitions. [2018-10-27 06:09:51,079 INFO L608 BuchiCegarLoop]: Abstraction has 127 states and 129 transitions. [2018-10-27 06:09:51,080 INFO L442 BuchiCegarLoop]: ======== Iteration 13============ [2018-10-27 06:09:51,080 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 127 states and 129 transitions. [2018-10-27 06:09:51,080 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 67 [2018-10-27 06:09:51,080 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:09:51,080 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:09:51,081 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-10-27 06:09:51,081 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-10-27 06:09:51,081 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~mem7;havoc test_fun_#t~mem6;havoc test_fun_#t~short8;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~mem7;havoc test_fun_#t~mem6;havoc test_fun_#t~short8;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~mem7;havoc test_fun_#t~mem6;havoc test_fun_#t~short8;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~mem7;havoc test_fun_#t~mem6;havoc test_fun_#t~short8;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-10-27 06:09:51,081 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~mem7;havoc test_fun_#t~mem6;havoc test_fun_#t~short8;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~mem7;havoc test_fun_#t~mem6;havoc test_fun_#t~short8;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~mem7;havoc test_fun_#t~mem6;havoc test_fun_#t~short8;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~mem7;havoc test_fun_#t~mem6;havoc test_fun_#t~short8;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~mem7;havoc test_fun_#t~mem6;havoc test_fun_#t~short8;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-10-27 06:09:51,082 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:09:51,082 INFO L82 PathProgramCache]: Analyzing trace with hash 751867207, now seen corresponding path program 3 times [2018-10-27 06:09:51,082 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:09:51,082 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:09:51,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:51,083 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:09:51,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:51,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:09:51,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:09:51,103 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:09:51,103 INFO L82 PathProgramCache]: Analyzing trace with hash 684842157, now seen corresponding path program 4 times [2018-10-27 06:09:51,103 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:09:51,103 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:09:51,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:51,104 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:09:51,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:51,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:09:51,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:09:51,135 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:09:51,135 INFO L82 PathProgramCache]: Analyzing trace with hash 1408772519, now seen corresponding path program 2 times [2018-10-27 06:09:51,135 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:09:51,135 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:09:51,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:51,136 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:09:51,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:51,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:09:51,417 WARN L179 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 8 DAG size of output: 3 [2018-10-27 06:09:51,645 INFO L134 CoverageAnalysis]: Checked inductivity of 432 backedges. 244 proven. 110 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-10-27 06:09:51,645 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:09:51,645 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3e61184c-37d6-4916-a088-a2ff8eeb73b2/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-10-27 06:09:51,668 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-27 06:09:51,716 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-27 06:09:51,716 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 06:09:51,718 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:09:51,721 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-10-27 06:09:51,723 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-10-27 06:09:51,723 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:09:51,725 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:09:51,729 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:09:51,729 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2018-10-27 06:09:51,746 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:09:51,746 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-10-27 06:09:51,748 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-10-27 06:09:51,748 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:09:51,755 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:09:51,765 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-10-27 06:09:51,765 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:13 [2018-10-27 06:09:52,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, 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-10-27 06:09:52,189 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-10-27 06:09:52,189 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:09:52,261 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:09:52,367 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-10-27 06:09:52,368 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:33, output treesize:18 [2018-10-27 06:09:53,077 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-10-27 06:09:53,113 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-10-27 06:09:53,114 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:09:53,189 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:09:53,313 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-10-27 06:09:53,313 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:38, output treesize:23 [2018-10-27 06:09:54,032 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-10-27 06:09:54,037 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-10-27 06:09:54,037 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:09:54,042 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:09:54,048 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-10-27 06:09:54,049 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:43, output treesize:28 [2018-10-27 06:09:54,361 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-10-27 06:09:54,375 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-10-27 06:09:54,375 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:09:54,378 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:09:54,384 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-10-27 06:09:54,384 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:35, output treesize:24 [2018-10-27 06:09:54,423 INFO L134 CoverageAnalysis]: Checked inductivity of 432 backedges. 244 proven. 110 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-10-27 06:09:54,440 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 06:09:54,440 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 13] total 25 [2018-10-27 06:09:55,449 WARN L179 SmtUtils]: Spent 1.01 s on a formula simplification. DAG size of input: 207 DAG size of output: 142 [2018-10-27 06:09:55,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-10-27 06:09:55,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=470, Unknown=0, NotChecked=0, Total=600 [2018-10-27 06:09:55,476 INFO L87 Difference]: Start difference. First operand 127 states and 129 transitions. cyclomatic complexity: 4 Second operand 25 states. [2018-10-27 06:09:57,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:09:57,046 INFO L93 Difference]: Finished difference Result 196 states and 200 transitions. [2018-10-27 06:09:57,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-10-27 06:09:57,048 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 196 states and 200 transitions. [2018-10-27 06:09:57,049 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 92 [2018-10-27 06:09:57,050 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 196 states to 184 states and 187 transitions. [2018-10-27 06:09:57,050 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 32 [2018-10-27 06:09:57,050 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 32 [2018-10-27 06:09:57,050 INFO L73 IsDeterministic]: Start isDeterministic. Operand 184 states and 187 transitions. [2018-10-27 06:09:57,050 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:09:57,050 INFO L705 BuchiCegarLoop]: Abstraction has 184 states and 187 transitions. [2018-10-27 06:09:57,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states and 187 transitions. [2018-10-27 06:09:57,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 153. [2018-10-27 06:09:57,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-10-27 06:09:57,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 155 transitions. [2018-10-27 06:09:57,052 INFO L728 BuchiCegarLoop]: Abstraction has 153 states and 155 transitions. [2018-10-27 06:09:57,052 INFO L608 BuchiCegarLoop]: Abstraction has 153 states and 155 transitions. [2018-10-27 06:09:57,052 INFO L442 BuchiCegarLoop]: ======== Iteration 14============ [2018-10-27 06:09:57,052 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 153 states and 155 transitions. [2018-10-27 06:09:57,053 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 80 [2018-10-27 06:09:57,053 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:09:57,053 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:09:57,054 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-10-27 06:09:57,054 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-10-27 06:09:57,054 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~mem7;havoc test_fun_#t~mem6;havoc test_fun_#t~short8;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~mem7;havoc test_fun_#t~mem6;havoc test_fun_#t~short8;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~mem7;havoc test_fun_#t~mem6;havoc test_fun_#t~short8;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~mem7;havoc test_fun_#t~mem6;havoc test_fun_#t~short8;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~mem7;havoc test_fun_#t~mem6;havoc test_fun_#t~short8;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-10-27 06:09:57,054 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~mem7;havoc test_fun_#t~mem6;havoc test_fun_#t~short8;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~mem7;havoc test_fun_#t~mem6;havoc test_fun_#t~short8;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~mem7;havoc test_fun_#t~mem6;havoc test_fun_#t~short8;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~mem7;havoc test_fun_#t~mem6;havoc test_fun_#t~short8;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~mem7;havoc test_fun_#t~mem6;havoc test_fun_#t~short8;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~mem7;havoc test_fun_#t~mem6;havoc test_fun_#t~short8;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-10-27 06:09:57,055 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:09:57,055 INFO L82 PathProgramCache]: Analyzing trace with hash -1304879147, now seen corresponding path program 4 times [2018-10-27 06:09:57,055 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:09:57,055 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:09:57,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:57,056 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:09:57,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:57,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:09:57,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:09:57,079 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:09:57,079 INFO L82 PathProgramCache]: Analyzing trace with hash -2128507345, now seen corresponding path program 5 times [2018-10-27 06:09:57,079 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:09:57,079 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:09:57,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:57,080 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:09:57,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:57,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:09:57,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:09:57,104 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:09:57,105 INFO L82 PathProgramCache]: Analyzing trace with hash -281025021, now seen corresponding path program 3 times [2018-10-27 06:09:57,105 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:09:57,105 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:09:57,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:57,105 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:09:57,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:57,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:09:57,361 WARN L179 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 8 DAG size of output: 3 [2018-10-27 06:09:57,491 INFO L134 CoverageAnalysis]: Checked inductivity of 669 backedges. 369 proven. 170 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2018-10-27 06:09:57,491 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:09:57,491 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3e61184c-37d6-4916-a088-a2ff8eeb73b2/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-10-27 06:09:57,499 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-27 06:09:57,659 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-10-27 06:09:57,659 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 06:09:57,662 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:09:57,685 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-10-27 06:09:57,686 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-10-27 06:09:57,687 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:09:57,688 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:09:57,690 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:09:57,690 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2018-10-27 06:09:57,701 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:09:57,702 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-10-27 06:09:57,704 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-10-27 06:09:57,705 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:09:57,711 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:09:57,714 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-10-27 06:09:57,714 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:13 [2018-10-27 06:09:57,755 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-10-27 06:09:57,757 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-10-27 06:09:57,758 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:09:57,761 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:09:57,765 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-10-27 06:09:57,765 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:33, output treesize:18 [2018-10-27 06:09:57,811 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-10-27 06:09:57,814 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-10-27 06:09:57,814 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:09:57,818 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:09:57,823 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-10-27 06:09:57,823 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:38, output treesize:23 [2018-10-27 06:09:57,914 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-10-27 06:09:57,917 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-10-27 06:09:57,917 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:09:57,920 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:09:57,926 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-10-27 06:09:57,926 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:43, output treesize:28 [2018-10-27 06:09:58,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-10-27 06:09:58,885 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-10-27 06:09:58,886 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:09:58,890 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:09:58,897 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-10-27 06:09:58,897 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:48, output treesize:33 [2018-10-27 06:09:59,819 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-10-27 06:09:59,821 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-10-27 06:09:59,821 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:09:59,824 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:09:59,831 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-10-27 06:09:59,831 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:40, output treesize:29 [2018-10-27 06:09:59,876 INFO L134 CoverageAnalysis]: Checked inductivity of 669 backedges. 369 proven. 170 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2018-10-27 06:09:59,893 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 06:09:59,893 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 15] total 30 [2018-10-27 06:10:02,095 WARN L179 SmtUtils]: Spent 2.20 s on a formula simplification. DAG size of input: 242 DAG size of output: 163 [2018-10-27 06:10:02,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-10-27 06:10:02,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=684, Unknown=0, NotChecked=0, Total=870 [2018-10-27 06:10:02,129 INFO L87 Difference]: Start difference. First operand 153 states and 155 transitions. cyclomatic complexity: 4 Second operand 30 states. [2018-10-27 06:10:06,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:10:06,839 INFO L93 Difference]: Finished difference Result 222 states and 226 transitions. [2018-10-27 06:10:06,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-10-27 06:10:06,841 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 222 states and 226 transitions. [2018-10-27 06:10:06,842 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 105 [2018-10-27 06:10:06,842 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 222 states to 210 states and 213 transitions. [2018-10-27 06:10:06,843 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 32 [2018-10-27 06:10:06,843 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 32 [2018-10-27 06:10:06,843 INFO L73 IsDeterministic]: Start isDeterministic. Operand 210 states and 213 transitions. [2018-10-27 06:10:06,843 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:10:06,843 INFO L705 BuchiCegarLoop]: Abstraction has 210 states and 213 transitions. [2018-10-27 06:10:06,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states and 213 transitions. [2018-10-27 06:10:06,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 179. [2018-10-27 06:10:06,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2018-10-27 06:10:06,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 181 transitions. [2018-10-27 06:10:06,854 INFO L728 BuchiCegarLoop]: Abstraction has 179 states and 181 transitions. [2018-10-27 06:10:06,854 INFO L608 BuchiCegarLoop]: Abstraction has 179 states and 181 transitions. [2018-10-27 06:10:06,857 INFO L442 BuchiCegarLoop]: ======== Iteration 15============ [2018-10-27 06:10:06,857 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 179 states and 181 transitions. [2018-10-27 06:10:06,858 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 93 [2018-10-27 06:10:06,858 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:10:06,858 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:10:06,859 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-10-27 06:10:06,859 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-10-27 06:10:06,859 INFO L793 eck$LassoCheckResult]: Stem: 8291#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 8285#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; 8286#L551 SUMMARY for call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L551 8298#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 8301#L553-3 assume true; 8302#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 8294#L553-1 assume !!(test_fun_#t~mem4 >= 0);havoc test_fun_#t~mem4; 8295#L554 SUMMARY for call write~int(1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L554 8270#L555-9 assume true; 8271#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 8437#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 8436#L555-2 test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 8435#L555-3 assume test_fun_#t~short8; 8434#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 8300#L555-5 test_fun_#t~short8 := test_fun_#t~mem7 < 1073741824; 8261#L555-7 assume !!test_fun_#t~short8;havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;havoc test_fun_#t~short8;havoc test_fun_#t~mem5; 8262#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 8273#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 8430#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 8268#L559-2 havoc test_fun_#t~mem11; 8269#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 8277#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 8282#L555-2 test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 8288#L555-3 assume test_fun_#t~short8; 8293#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 8297#L555-5 test_fun_#t~short8 := test_fun_#t~mem7 < 1073741824; 8433#L555-7 assume !!test_fun_#t~short8;havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;havoc test_fun_#t~short8;havoc test_fun_#t~mem5; 8432#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 8431#L556-1 assume !(test_fun_#t~mem9 <= 0);havoc test_fun_#t~mem9; 8304#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 8265#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 8266#L559-2 havoc test_fun_#t~mem11; 8429#L555-9 assume true; 8428#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 8427#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 8426#L555-2 test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 8425#L555-3 assume test_fun_#t~short8; 8424#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 8423#L555-5 test_fun_#t~short8 := test_fun_#t~mem7 < 1073741824; 8422#L555-7 assume !!test_fun_#t~short8;havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;havoc test_fun_#t~short8;havoc test_fun_#t~mem5; 8421#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 8420#L556-1 assume !(test_fun_#t~mem9 <= 0);havoc test_fun_#t~mem9; 8419#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 8418#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 8417#L559-2 havoc test_fun_#t~mem11; 8416#L555-9 assume true; 8415#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 8414#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 8413#L555-2 test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 8412#L555-3 assume test_fun_#t~short8; 8411#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 8410#L555-5 test_fun_#t~short8 := test_fun_#t~mem7 < 1073741824; 8409#L555-7 assume !!test_fun_#t~short8;havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;havoc test_fun_#t~short8;havoc test_fun_#t~mem5; 8408#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 8407#L556-1 assume !(test_fun_#t~mem9 <= 0);havoc test_fun_#t~mem9; 8406#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 8405#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 8404#L559-2 havoc test_fun_#t~mem11; 8403#L555-9 assume true; 8402#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 8401#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 8400#L555-2 test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 8399#L555-3 assume test_fun_#t~short8; 8398#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 8397#L555-5 test_fun_#t~short8 := test_fun_#t~mem7 < 1073741824; 8396#L555-7 assume !!test_fun_#t~short8;havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;havoc test_fun_#t~short8;havoc test_fun_#t~mem5; 8395#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 8309#L556-1 assume !(test_fun_#t~mem9 <= 0);havoc test_fun_#t~mem9; 8394#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 8329#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 8327#L559-2 havoc test_fun_#t~mem11; 8325#L555-9 assume true; 8323#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 8321#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 8319#L555-2 test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 8317#L555-3 assume test_fun_#t~short8; 8315#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 8313#L555-5 test_fun_#t~short8 := test_fun_#t~mem7 < 1073741824; 8311#L555-7 assume !!test_fun_#t~short8;havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;havoc test_fun_#t~short8;havoc test_fun_#t~mem5; 8308#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 8263#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 8264#L559-2 havoc test_fun_#t~mem11; 8267#L555-9 [2018-10-27 06:10:06,859 INFO L795 eck$LassoCheckResult]: Loop: 8267#L555-9 assume true; 8275#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 8276#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 8281#L555-2 test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 8287#L555-3 assume test_fun_#t~short8; 8292#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 8296#L555-5 test_fun_#t~short8 := test_fun_#t~mem7 < 1073741824; 8259#L555-7 assume !test_fun_#t~short8;havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;havoc test_fun_#t~short8;havoc test_fun_#t~mem5; 8260#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 8274#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 8299#L561-1 havoc test_fun_#t~mem12; 8303#L553-3 assume true; 8289#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 8290#L553-1 assume !!(test_fun_#t~mem4 >= 0);havoc test_fun_#t~mem4; 8283#L554 SUMMARY for call write~int(1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L554 8284#L555-9 assume true; 8393#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 8392#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 8391#L555-2 test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 8390#L555-3 assume test_fun_#t~short8; 8389#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 8388#L555-5 test_fun_#t~short8 := test_fun_#t~mem7 < 1073741824; 8387#L555-7 assume !!test_fun_#t~short8;havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;havoc test_fun_#t~short8;havoc test_fun_#t~mem5; 8386#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 8385#L556-1 assume !(test_fun_#t~mem9 <= 0);havoc test_fun_#t~mem9; 8384#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 8383#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 8382#L559-2 havoc test_fun_#t~mem11; 8381#L555-9 assume true; 8380#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 8379#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 8378#L555-2 test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 8377#L555-3 assume test_fun_#t~short8; 8376#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 8375#L555-5 test_fun_#t~short8 := test_fun_#t~mem7 < 1073741824; 8374#L555-7 assume !!test_fun_#t~short8;havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;havoc test_fun_#t~short8;havoc test_fun_#t~mem5; 8373#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 8372#L556-1 assume !(test_fun_#t~mem9 <= 0);havoc test_fun_#t~mem9; 8371#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 8370#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 8369#L559-2 havoc test_fun_#t~mem11; 8368#L555-9 assume true; 8367#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 8366#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 8365#L555-2 test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 8364#L555-3 assume test_fun_#t~short8; 8363#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 8362#L555-5 test_fun_#t~short8 := test_fun_#t~mem7 < 1073741824; 8361#L555-7 assume !!test_fun_#t~short8;havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;havoc test_fun_#t~short8;havoc test_fun_#t~mem5; 8360#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 8359#L556-1 assume !(test_fun_#t~mem9 <= 0);havoc test_fun_#t~mem9; 8358#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 8357#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 8356#L559-2 havoc test_fun_#t~mem11; 8355#L555-9 assume true; 8354#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 8353#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 8352#L555-2 test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 8351#L555-3 assume test_fun_#t~short8; 8350#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 8349#L555-5 test_fun_#t~short8 := test_fun_#t~mem7 < 1073741824; 8348#L555-7 assume !!test_fun_#t~short8;havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;havoc test_fun_#t~short8;havoc test_fun_#t~mem5; 8347#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 8346#L556-1 assume !(test_fun_#t~mem9 <= 0);havoc test_fun_#t~mem9; 8345#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 8344#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 8343#L559-2 havoc test_fun_#t~mem11; 8342#L555-9 assume true; 8341#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 8340#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 8339#L555-2 test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 8338#L555-3 assume test_fun_#t~short8; 8337#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 8336#L555-5 test_fun_#t~short8 := test_fun_#t~mem7 < 1073741824; 8335#L555-7 assume !!test_fun_#t~short8;havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;havoc test_fun_#t~short8;havoc test_fun_#t~mem5; 8334#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 8333#L556-1 assume !(test_fun_#t~mem9 <= 0);havoc test_fun_#t~mem9; 8332#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 8331#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 8330#L559-2 havoc test_fun_#t~mem11; 8306#L555-9 assume true; 8328#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 8326#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 8324#L555-2 test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 8322#L555-3 assume test_fun_#t~short8; 8320#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 8318#L555-5 test_fun_#t~short8 := test_fun_#t~mem7 < 1073741824; 8316#L555-7 assume !!test_fun_#t~short8;havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;havoc test_fun_#t~short8;havoc test_fun_#t~mem5; 8314#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 8312#L556-1 assume !(test_fun_#t~mem9 <= 0);havoc test_fun_#t~mem9; 8310#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 8307#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 8305#L559-2 havoc test_fun_#t~mem11; 8267#L555-9 [2018-10-27 06:10:06,860 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:06,860 INFO L82 PathProgramCache]: Analyzing trace with hash 226929671, now seen corresponding path program 5 times [2018-10-27 06:10:06,860 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:10:06,860 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:10:06,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:06,873 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:10:06,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:06,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:06,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:06,915 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:06,917 INFO L82 PathProgramCache]: Analyzing trace with hash 1815732205, now seen corresponding path program 6 times [2018-10-27 06:10:06,918 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:10:06,918 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:10:06,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:06,920 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:10:06,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:06,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:06,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:06,977 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:06,978 INFO L82 PathProgramCache]: Analyzing trace with hash -2052855385, now seen corresponding path program 4 times [2018-10-27 06:10:06,978 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:10:06,978 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:10:06,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:06,982 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:10:06,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:06,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:10:07,298 INFO L134 CoverageAnalysis]: Checked inductivity of 958 backedges. 520 proven. 243 refuted. 0 times theorem prover too weak. 195 trivial. 0 not checked. [2018-10-27 06:10:07,299 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:10:07,299 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3e61184c-37d6-4916-a088-a2ff8eeb73b2/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-10-27 06:10:07,307 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-27 06:10:07,439 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-27 06:10:07,439 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 06:10:07,443 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:10:07,449 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-10-27 06:10:07,453 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-10-27 06:10:07,453 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:10:07,455 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:10:07,456 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:10:07,456 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2018-10-27 06:10:07,472 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:10:07,473 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-10-27 06:10:07,476 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-10-27 06:10:07,476 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:10:07,486 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:10:07,489 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-10-27 06:10:07,489 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:13 [2018-10-27 06:10:07,571 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-10-27 06:10:07,573 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-10-27 06:10:07,574 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:10:07,578 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:10:07,582 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-10-27 06:10:07,582 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:33, output treesize:18 [2018-10-27 06:10:07,705 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-10-27 06:10:07,742 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-10-27 06:10:07,742 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:10:07,811 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:10:07,816 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-10-27 06:10:07,816 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:38, output treesize:23 [2018-10-27 06:10:07,912 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-10-27 06:10:07,915 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-10-27 06:10:07,915 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:10:07,918 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:10:07,924 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-10-27 06:10:07,924 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:43, output treesize:28 [2018-10-27 06:10:08,760 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-10-27 06:10:08,763 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-10-27 06:10:08,763 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:10:08,767 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:10:08,774 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-10-27 06:10:08,775 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:48, output treesize:33 [2018-10-27 06:10:11,507 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-10-27 06:10:11,510 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-10-27 06:10:11,510 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:10:11,527 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:10:11,536 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-10-27 06:10:11,536 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:53, output treesize:38 [2018-10-27 06:10:13,858 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-10-27 06:10:13,859 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-10-27 06:10:13,860 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:10:13,861 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:10:13,869 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-10-27 06:10:13,869 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:45, output treesize:34 [2018-10-27 06:10:13,945 INFO L134 CoverageAnalysis]: Checked inductivity of 958 backedges. 520 proven. 243 refuted. 0 times theorem prover too weak. 195 trivial. 0 not checked. [2018-10-27 06:10:13,963 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 06:10:13,964 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 17] total 35 [2018-10-27 06:10:17,112 WARN L179 SmtUtils]: Spent 3.15 s on a formula simplification. DAG size of input: 277 DAG size of output: 184 [2018-10-27 06:10:17,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-10-27 06:10:17,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=251, Invalid=938, Unknown=1, NotChecked=0, Total=1190 [2018-10-27 06:10:17,151 INFO L87 Difference]: Start difference. First operand 179 states and 181 transitions. cyclomatic complexity: 4 Second operand 35 states. [2018-10-27 06:10:21,134 WARN L179 SmtUtils]: Spent 439.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 25 [2018-10-27 06:10:58,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:10:58,667 INFO L93 Difference]: Finished difference Result 248 states and 252 transitions. [2018-10-27 06:10:58,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-10-27 06:10:58,667 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 248 states and 252 transitions. [2018-10-27 06:10:58,670 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 118 [2018-10-27 06:10:58,671 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 248 states to 236 states and 239 transitions. [2018-10-27 06:10:58,671 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 32 [2018-10-27 06:10:58,672 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 32 [2018-10-27 06:10:58,672 INFO L73 IsDeterministic]: Start isDeterministic. Operand 236 states and 239 transitions. [2018-10-27 06:10:58,672 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:10:58,672 INFO L705 BuchiCegarLoop]: Abstraction has 236 states and 239 transitions. [2018-10-27 06:10:58,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states and 239 transitions. [2018-10-27 06:10:58,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 205. [2018-10-27 06:10:58,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2018-10-27 06:10:58,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 207 transitions. [2018-10-27 06:10:58,675 INFO L728 BuchiCegarLoop]: Abstraction has 205 states and 207 transitions. [2018-10-27 06:10:58,675 INFO L608 BuchiCegarLoop]: Abstraction has 205 states and 207 transitions. [2018-10-27 06:10:58,675 INFO L442 BuchiCegarLoop]: ======== Iteration 16============ [2018-10-27 06:10:58,675 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 205 states and 207 transitions. [2018-10-27 06:10:58,676 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 106 [2018-10-27 06:10:58,676 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:10:58,676 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:10:58,689 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-10-27 06:10:58,689 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-10-27 06:10:58,689 INFO L793 eck$LassoCheckResult]: Stem: 9353#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 9347#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; 9348#L551 SUMMARY for call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L551 9360#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 9362#L553-3 assume true; 9363#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 9354#L553-1 assume !!(test_fun_#t~mem4 >= 0);havoc test_fun_#t~mem4; 9355#L554 SUMMARY for call write~int(1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L554 9332#L555-9 assume true; 9333#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 9525#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 9524#L555-2 test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 9523#L555-3 assume test_fun_#t~short8; 9522#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 9521#L555-5 test_fun_#t~short8 := test_fun_#t~mem7 < 1073741824; 9520#L555-7 assume !!test_fun_#t~short8;havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;havoc test_fun_#t~short8;havoc test_fun_#t~mem5; 9519#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 9518#L556-1 assume !(test_fun_#t~mem9 <= 0);havoc test_fun_#t~mem9; 9517#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 9516#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 9330#L559-2 havoc test_fun_#t~mem11; 9331#L555-9 assume true; 9334#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 9339#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 9346#L555-2 test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 9350#L555-3 assume test_fun_#t~short8; 9357#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 9359#L555-5 test_fun_#t~short8 := test_fun_#t~mem7 < 1073741824; 9323#L555-7 assume !!test_fun_#t~short8;havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;havoc test_fun_#t~short8;havoc test_fun_#t~mem5; 9324#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 9335#L556-1 assume !(test_fun_#t~mem9 <= 0);havoc test_fun_#t~mem9; 9342#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 9327#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 9328#L559-2 havoc test_fun_#t~mem11; 9515#L555-9 assume true; 9514#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 9513#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 9512#L555-2 test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 9511#L555-3 assume test_fun_#t~short8; 9510#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 9509#L555-5 test_fun_#t~short8 := test_fun_#t~mem7 < 1073741824; 9508#L555-7 assume !!test_fun_#t~short8;havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;havoc test_fun_#t~short8;havoc test_fun_#t~mem5; 9507#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 9506#L556-1 assume !(test_fun_#t~mem9 <= 0);havoc test_fun_#t~mem9; 9505#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 9504#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 9503#L559-2 havoc test_fun_#t~mem11; 9502#L555-9 assume true; 9501#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 9500#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 9499#L555-2 test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 9498#L555-3 assume test_fun_#t~short8; 9497#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 9496#L555-5 test_fun_#t~short8 := test_fun_#t~mem7 < 1073741824; 9495#L555-7 assume !!test_fun_#t~short8;havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;havoc test_fun_#t~short8;havoc test_fun_#t~mem5; 9494#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 9493#L556-1 assume !(test_fun_#t~mem9 <= 0);havoc test_fun_#t~mem9; 9492#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 9491#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 9490#L559-2 havoc test_fun_#t~mem11; 9489#L555-9 assume true; 9488#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 9487#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 9486#L555-2 test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 9485#L555-3 assume test_fun_#t~short8; 9484#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 9483#L555-5 test_fun_#t~short8 := test_fun_#t~mem7 < 1073741824; 9482#L555-7 assume !!test_fun_#t~short8;havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;havoc test_fun_#t~short8;havoc test_fun_#t~mem5; 9481#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 9480#L556-1 assume !(test_fun_#t~mem9 <= 0);havoc test_fun_#t~mem9; 9479#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 9478#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 9477#L559-2 havoc test_fun_#t~mem11; 9476#L555-9 assume true; 9475#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 9474#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 9473#L555-2 test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 9472#L555-3 assume test_fun_#t~short8; 9471#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 9470#L555-5 test_fun_#t~short8 := test_fun_#t~mem7 < 1073741824; 9469#L555-7 assume !!test_fun_#t~short8;havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;havoc test_fun_#t~short8;havoc test_fun_#t~mem5; 9468#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 9370#L556-1 assume !(test_fun_#t~mem9 <= 0);havoc test_fun_#t~mem9; 9467#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 9389#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 9388#L559-2 havoc test_fun_#t~mem11; 9386#L555-9 assume true; 9384#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 9382#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 9380#L555-2 test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 9378#L555-3 assume test_fun_#t~short8; 9376#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 9374#L555-5 test_fun_#t~short8 := test_fun_#t~mem7 < 1073741824; 9372#L555-7 assume !!test_fun_#t~short8;havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;havoc test_fun_#t~short8;havoc test_fun_#t~mem5; 9369#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; 9341#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 9325#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 9326#L559-2 havoc test_fun_#t~mem11; 9329#L555-9 [2018-10-27 06:10:58,690 INFO L795 eck$LassoCheckResult]: Loop: 9329#L555-9 assume true; 9337#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 9338#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 9345#L555-2 test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 9349#L555-3 assume test_fun_#t~short8; 9356#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 9358#L555-5 test_fun_#t~short8 := test_fun_#t~mem7 < 1073741824; 9321#L555-7 assume !test_fun_#t~short8;havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;havoc test_fun_#t~short8;havoc test_fun_#t~mem5; 9322#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 9336#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 9361#L561-1 havoc test_fun_#t~mem12; 9364#L553-3 assume true; 9351#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 9352#L553-1 assume !!(test_fun_#t~mem4 >= 0);havoc test_fun_#t~mem4; 9343#L554 SUMMARY for call write~int(1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L554 9344#L555-9 assume true; 9466#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 9465#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 9464#L555-2 test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 9463#L555-3 assume test_fun_#t~short8; 9462#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 9461#L555-5 test_fun_#t~short8 := test_fun_#t~mem7 < 1073741824; 9460#L555-7 assume !!test_fun_#t~short8;havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;havoc test_fun_#t~short8;havoc test_fun_#t~mem5; 9459#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 9458#L556-1 assume !(test_fun_#t~mem9 <= 0);havoc test_fun_#t~mem9; 9457#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 9456#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 9455#L559-2 havoc test_fun_#t~mem11; 9454#L555-9 assume true; 9453#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 9452#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 9451#L555-2 test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 9450#L555-3 assume test_fun_#t~short8; 9449#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 9448#L555-5 test_fun_#t~short8 := test_fun_#t~mem7 < 1073741824; 9447#L555-7 assume !!test_fun_#t~short8;havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;havoc test_fun_#t~short8;havoc test_fun_#t~mem5; 9446#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 9445#L556-1 assume !(test_fun_#t~mem9 <= 0);havoc test_fun_#t~mem9; 9444#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 9443#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 9442#L559-2 havoc test_fun_#t~mem11; 9441#L555-9 assume true; 9440#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 9439#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 9438#L555-2 test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 9437#L555-3 assume test_fun_#t~short8; 9436#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 9435#L555-5 test_fun_#t~short8 := test_fun_#t~mem7 < 1073741824; 9434#L555-7 assume !!test_fun_#t~short8;havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;havoc test_fun_#t~short8;havoc test_fun_#t~mem5; 9433#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 9432#L556-1 assume !(test_fun_#t~mem9 <= 0);havoc test_fun_#t~mem9; 9431#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 9430#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 9429#L559-2 havoc test_fun_#t~mem11; 9428#L555-9 assume true; 9427#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 9426#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 9425#L555-2 test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 9424#L555-3 assume test_fun_#t~short8; 9423#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 9422#L555-5 test_fun_#t~short8 := test_fun_#t~mem7 < 1073741824; 9421#L555-7 assume !!test_fun_#t~short8;havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;havoc test_fun_#t~short8;havoc test_fun_#t~mem5; 9420#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 9419#L556-1 assume !(test_fun_#t~mem9 <= 0);havoc test_fun_#t~mem9; 9418#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 9417#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 9416#L559-2 havoc test_fun_#t~mem11; 9415#L555-9 assume true; 9414#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 9413#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 9412#L555-2 test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 9411#L555-3 assume test_fun_#t~short8; 9410#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 9409#L555-5 test_fun_#t~short8 := test_fun_#t~mem7 < 1073741824; 9408#L555-7 assume !!test_fun_#t~short8;havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;havoc test_fun_#t~short8;havoc test_fun_#t~mem5; 9407#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 9406#L556-1 assume !(test_fun_#t~mem9 <= 0);havoc test_fun_#t~mem9; 9405#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 9404#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 9403#L559-2 havoc test_fun_#t~mem11; 9402#L555-9 assume true; 9401#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 9400#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 9399#L555-2 test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 9398#L555-3 assume test_fun_#t~short8; 9397#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 9396#L555-5 test_fun_#t~short8 := test_fun_#t~mem7 < 1073741824; 9395#L555-7 assume !!test_fun_#t~short8;havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;havoc test_fun_#t~short8;havoc test_fun_#t~mem5; 9394#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 9393#L556-1 assume !(test_fun_#t~mem9 <= 0);havoc test_fun_#t~mem9; 9392#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 9391#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 9390#L559-2 havoc test_fun_#t~mem11; 9366#L555-9 assume true; 9387#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 9385#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 9383#L555-2 test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 9381#L555-3 assume test_fun_#t~short8; 9379#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 9377#L555-5 test_fun_#t~short8 := test_fun_#t~mem7 < 1073741824; 9375#L555-7 assume !!test_fun_#t~short8;havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;havoc test_fun_#t~short8;havoc test_fun_#t~mem5; 9373#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 9371#L556-1 assume !(test_fun_#t~mem9 <= 0);havoc test_fun_#t~mem9; 9368#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 9367#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 9365#L559-2 havoc test_fun_#t~mem11; 9329#L555-9 [2018-10-27 06:10:58,690 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:58,690 INFO L82 PathProgramCache]: Analyzing trace with hash -1628569323, now seen corresponding path program 6 times [2018-10-27 06:10:58,690 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:10:58,690 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:10:58,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:58,691 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:10:58,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:58,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:58,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:58,748 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:58,748 INFO L82 PathProgramCache]: Analyzing trace with hash 394842863, now seen corresponding path program 7 times [2018-10-27 06:10:58,748 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:10:58,748 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:10:58,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:58,753 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:10:58,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:58,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:58,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:10:58,798 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:10:58,798 INFO L82 PathProgramCache]: Analyzing trace with hash -348677373, now seen corresponding path program 5 times [2018-10-27 06:10:58,798 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:10:58,798 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:10:58,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:58,799 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:10:58,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:10:58,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:10:59,085 WARN L179 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 8 DAG size of output: 3 [2018-10-27 06:10:59,648 INFO L134 CoverageAnalysis]: Checked inductivity of 1299 backedges. 697 proven. 329 refuted. 0 times theorem prover too weak. 273 trivial. 0 not checked. [2018-10-27 06:10:59,648 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:10:59,648 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3e61184c-37d6-4916-a088-a2ff8eeb73b2/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-10-27 06:10:59,657 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-27 06:10:59,851 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2018-10-27 06:10:59,851 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 06:10:59,855 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:10:59,893 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-10-27 06:10:59,907 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-10-27 06:10:59,907 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:10:59,937 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:10:59,961 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:10:59,961 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2018-10-27 06:10:59,975 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:10:59,976 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-10-27 06:10:59,978 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-10-27 06:10:59,978 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:10:59,983 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:10:59,986 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-10-27 06:10:59,987 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:13 [2018-10-27 06:11:00,027 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-10-27 06:11:00,029 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-10-27 06:11:00,030 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:11:00,034 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:11:00,038 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-10-27 06:11:00,038 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:33, output treesize:18 [2018-10-27 06:11:00,109 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-10-27 06:11:00,112 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-10-27 06:11:00,112 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:11:00,116 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:11:00,140 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-10-27 06:11:00,141 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:38, output treesize:23 [2018-10-27 06:11:00,195 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-10-27 06:11:00,198 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-10-27 06:11:00,199 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:11:00,202 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:11:00,209 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-10-27 06:11:00,209 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:43, output treesize:28 [2018-10-27 06:11:00,811 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-10-27 06:11:00,813 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-10-27 06:11:00,814 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:11:00,818 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:11:00,826 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-10-27 06:11:00,826 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:48, output treesize:33 [2018-10-27 06:11:02,155 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-10-27 06:11:02,158 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-10-27 06:11:02,158 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:11:02,162 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:11:02,171 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-10-27 06:11:02,171 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:53, output treesize:38 [2018-10-27 06:11:05,913 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-10-27 06:11:05,916 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-10-27 06:11:05,917 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:11:05,920 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:11:05,931 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-10-27 06:11:05,931 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:58, output treesize:43 [2018-10-27 06:11:33,342 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-10-27 06:11:33,344 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-10-27 06:11:33,344 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:11:33,347 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:11:33,356 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-10-27 06:11:33,356 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 10 variables, input treesize:50, output treesize:39 [2018-10-27 06:11:33,444 INFO L134 CoverageAnalysis]: Checked inductivity of 1299 backedges. 697 proven. 329 refuted. 0 times theorem prover too weak. 273 trivial. 0 not checked. [2018-10-27 06:11:33,460 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-27 06:11:33,461 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 19] total 40 [2018-10-27 06:11:37,674 WARN L179 SmtUtils]: Spent 4.21 s on a formula simplification. DAG size of input: 312 DAG size of output: 205 [2018-10-27 06:11:37,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-10-27 06:11:37,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=1232, Unknown=3, NotChecked=0, Total=1560 [2018-10-27 06:11:37,698 INFO L87 Difference]: Start difference. First operand 205 states and 207 transitions. cyclomatic complexity: 4 Second operand 40 states. [2018-10-27 06:11:38,016 WARN L179 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 14 [2018-10-27 06:11:43,252 WARN L179 SmtUtils]: Spent 316.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 28 [2018-10-27 06:11:56,324 WARN L179 SmtUtils]: Spent 853.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 31 [2018-10-27 06:13:01,398 WARN L179 SmtUtils]: Spent 18.86 s on a formula simplification that was a NOOP. DAG size: 35 [2018-10-27 06:13:04,381 WARN L179 SmtUtils]: Spent 732.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 31 [2018-10-27 06:13:21,669 WARN L179 SmtUtils]: Spent 9.37 s on a formula simplification. DAG size of input: 43 DAG size of output: 35 [2018-10-27 06:14:10,841 WARN L179 SmtUtils]: Spent 12.34 s on a formula simplification that was a NOOP. DAG size: 36 [2018-10-27 06:15:35,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:15:35,137 INFO L93 Difference]: Finished difference Result 274 states and 278 transitions. [2018-10-27 06:15:35,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-10-27 06:15:35,140 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 274 states and 278 transitions. [2018-10-27 06:15:35,141 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 131 [2018-10-27 06:15:35,142 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 274 states to 262 states and 265 transitions. [2018-10-27 06:15:35,142 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 32 [2018-10-27 06:15:35,142 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 32 [2018-10-27 06:15:35,142 INFO L73 IsDeterministic]: Start isDeterministic. Operand 262 states and 265 transitions. [2018-10-27 06:15:35,142 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-10-27 06:15:35,142 INFO L705 BuchiCegarLoop]: Abstraction has 262 states and 265 transitions. [2018-10-27 06:15:35,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states and 265 transitions. [2018-10-27 06:15:35,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 231. [2018-10-27 06:15:35,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2018-10-27 06:15:35,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 233 transitions. [2018-10-27 06:15:35,146 INFO L728 BuchiCegarLoop]: Abstraction has 231 states and 233 transitions. [2018-10-27 06:15:35,146 INFO L608 BuchiCegarLoop]: Abstraction has 231 states and 233 transitions. [2018-10-27 06:15:35,146 INFO L442 BuchiCegarLoop]: ======== Iteration 17============ [2018-10-27 06:15:35,146 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 231 states and 233 transitions. [2018-10-27 06:15:35,147 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 119 [2018-10-27 06:15:35,147 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:15:35,147 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:15:35,148 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:15:35,148 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:15:35,148 INFO L793 eck$LassoCheckResult]: Stem: 10567#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 10561#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; 10562#L551 SUMMARY for call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L551 10573#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 10577#L553-3 assume true; 10565#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 10566#L553-1 assume !!(test_fun_#t~mem4 >= 0);havoc test_fun_#t~mem4; 10570#L554 SUMMARY for call write~int(1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L554 10544#L555-9 assume true; 10545#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 10556#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 10558#L555-2 test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 10564#L555-3 assume test_fun_#t~short8; 10569#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 10572#L555-5 test_fun_#t~short8 := test_fun_#t~mem7 < 1073741824; 10535#L555-7 assume !!test_fun_#t~short8;havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;havoc test_fun_#t~short8;havoc test_fun_#t~mem5; 10536#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 10757#L556-1 assume !(test_fun_#t~mem9 <= 0);havoc test_fun_#t~mem9; 10578#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 10539#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 10540#L559-2 havoc test_fun_#t~mem11; 10546#L555-9 assume true; 10547#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 10763#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 10762#L555-2 test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 10761#L555-3 assume test_fun_#t~short8; 10760#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 10759#L555-5 test_fun_#t~short8 := test_fun_#t~mem7 < 1073741824; 10758#L555-7 assume !!test_fun_#t~short8;havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;havoc test_fun_#t~short8;havoc test_fun_#t~mem5; 10548#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 10549#L556-1 assume !(test_fun_#t~mem9 <= 0);havoc test_fun_#t~mem9; 10553#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 10756#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 10542#L559-2 havoc test_fun_#t~mem11; 10543#L555-9 assume true; 10755#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 10754#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 10753#L555-2 test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 10752#L555-3 assume test_fun_#t~short8; 10751#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 10750#L555-5 test_fun_#t~short8 := test_fun_#t~mem7 < 1073741824; 10749#L555-7 assume !!test_fun_#t~short8;havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;havoc test_fun_#t~short8;havoc test_fun_#t~mem5; 10748#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 10747#L556-1 assume !(test_fun_#t~mem9 <= 0);havoc test_fun_#t~mem9; 10746#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 10745#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 10744#L559-2 havoc test_fun_#t~mem11; 10743#L555-9 assume true; 10742#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 10741#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 10740#L555-2 test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 10739#L555-3 assume test_fun_#t~short8; 10738#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 10737#L555-5 test_fun_#t~short8 := test_fun_#t~mem7 < 1073741824; 10736#L555-7 assume !!test_fun_#t~short8;havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;havoc test_fun_#t~short8;havoc test_fun_#t~mem5; 10735#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 10734#L556-1 assume !(test_fun_#t~mem9 <= 0);havoc test_fun_#t~mem9; 10733#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 10732#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 10731#L559-2 havoc test_fun_#t~mem11; 10730#L555-9 assume true; 10729#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 10728#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 10727#L555-2 test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 10726#L555-3 assume test_fun_#t~short8; 10725#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 10724#L555-5 test_fun_#t~short8 := test_fun_#t~mem7 < 1073741824; 10723#L555-7 assume !!test_fun_#t~short8;havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;havoc test_fun_#t~short8;havoc test_fun_#t~mem5; 10722#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 10721#L556-1 assume !(test_fun_#t~mem9 <= 0);havoc test_fun_#t~mem9; 10720#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 10719#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 10718#L559-2 havoc test_fun_#t~mem11; 10717#L555-9 assume true; 10716#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 10715#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 10714#L555-2 test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 10713#L555-3 assume test_fun_#t~short8; 10712#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 10711#L555-5 test_fun_#t~short8 := test_fun_#t~mem7 < 1073741824; 10710#L555-7 assume !!test_fun_#t~short8;havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;havoc test_fun_#t~short8;havoc test_fun_#t~mem5; 10709#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 10708#L556-1 assume !(test_fun_#t~mem9 <= 0);havoc test_fun_#t~mem9; 10707#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 10706#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 10705#L559-2 havoc test_fun_#t~mem11; 10704#L555-9 assume true; 10703#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 10702#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 10701#L555-2 test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 10700#L555-3 assume test_fun_#t~short8; 10699#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 10698#L555-5 test_fun_#t~short8 := test_fun_#t~mem7 < 1073741824; 10697#L555-7 assume !!test_fun_#t~short8;havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;havoc test_fun_#t~short8;havoc test_fun_#t~mem5; 10696#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 10586#L556-1 assume !(test_fun_#t~mem9 <= 0);havoc test_fun_#t~mem9; 10695#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 10694#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 10693#L559-2 havoc test_fun_#t~mem11; 10601#L555-9 assume true; 10600#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 10598#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 10596#L555-2 test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 10594#L555-3 assume test_fun_#t~short8; 10592#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 10590#L555-5 test_fun_#t~short8 := test_fun_#t~mem7 < 1073741824; 10588#L555-7 assume !!test_fun_#t~short8;havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;havoc test_fun_#t~short8;havoc test_fun_#t~mem5; 10585#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 10551#L556-1 assume !(test_fun_#t~mem9 <= 0);havoc test_fun_#t~mem9; 10552#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 10537#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 10538#L559-2 havoc test_fun_#t~mem11; 10541#L555-9 [2018-10-27 06:15:35,148 INFO L795 eck$LassoCheckResult]: Loop: 10541#L555-9 assume true; 10554#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 10555#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 10557#L555-2 test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 10563#L555-3 assume test_fun_#t~short8; 10568#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 10571#L555-5 test_fun_#t~short8 := test_fun_#t~mem7 < 1073741824; 10533#L555-7 assume !test_fun_#t~short8;havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;havoc test_fun_#t~short8;havoc test_fun_#t~mem5; 10534#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 10550#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 10574#L561-1 havoc test_fun_#t~mem12; 10575#L553-3 assume true; 10576#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 10692#L553-1 assume !!(test_fun_#t~mem4 >= 0);havoc test_fun_#t~mem4; 10559#L554 SUMMARY for call write~int(1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L554 10560#L555-9 assume true; 10691#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 10690#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 10689#L555-2 test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 10688#L555-3 assume test_fun_#t~short8; 10687#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 10686#L555-5 test_fun_#t~short8 := test_fun_#t~mem7 < 1073741824; 10685#L555-7 assume !!test_fun_#t~short8;havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;havoc test_fun_#t~short8;havoc test_fun_#t~mem5; 10684#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 10683#L556-1 assume !(test_fun_#t~mem9 <= 0);havoc test_fun_#t~mem9; 10682#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 10681#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 10680#L559-2 havoc test_fun_#t~mem11; 10679#L555-9 assume true; 10678#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 10677#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 10676#L555-2 test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 10675#L555-3 assume test_fun_#t~short8; 10674#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 10673#L555-5 test_fun_#t~short8 := test_fun_#t~mem7 < 1073741824; 10672#L555-7 assume !!test_fun_#t~short8;havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;havoc test_fun_#t~short8;havoc test_fun_#t~mem5; 10671#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 10670#L556-1 assume !(test_fun_#t~mem9 <= 0);havoc test_fun_#t~mem9; 10669#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 10668#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 10667#L559-2 havoc test_fun_#t~mem11; 10666#L555-9 assume true; 10665#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 10664#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 10663#L555-2 test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 10662#L555-3 assume test_fun_#t~short8; 10661#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 10660#L555-5 test_fun_#t~short8 := test_fun_#t~mem7 < 1073741824; 10659#L555-7 assume !!test_fun_#t~short8;havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;havoc test_fun_#t~short8;havoc test_fun_#t~mem5; 10658#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 10657#L556-1 assume !(test_fun_#t~mem9 <= 0);havoc test_fun_#t~mem9; 10656#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 10655#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 10654#L559-2 havoc test_fun_#t~mem11; 10653#L555-9 assume true; 10652#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 10651#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 10650#L555-2 test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 10649#L555-3 assume test_fun_#t~short8; 10648#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 10647#L555-5 test_fun_#t~short8 := test_fun_#t~mem7 < 1073741824; 10646#L555-7 assume !!test_fun_#t~short8;havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;havoc test_fun_#t~short8;havoc test_fun_#t~mem5; 10645#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 10644#L556-1 assume !(test_fun_#t~mem9 <= 0);havoc test_fun_#t~mem9; 10643#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 10642#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 10641#L559-2 havoc test_fun_#t~mem11; 10640#L555-9 assume true; 10639#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 10638#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 10637#L555-2 test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 10636#L555-3 assume test_fun_#t~short8; 10635#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 10634#L555-5 test_fun_#t~short8 := test_fun_#t~mem7 < 1073741824; 10633#L555-7 assume !!test_fun_#t~short8;havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;havoc test_fun_#t~short8;havoc test_fun_#t~mem5; 10632#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 10631#L556-1 assume !(test_fun_#t~mem9 <= 0);havoc test_fun_#t~mem9; 10630#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 10629#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 10628#L559-2 havoc test_fun_#t~mem11; 10627#L555-9 assume true; 10626#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 10625#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 10624#L555-2 test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 10623#L555-3 assume test_fun_#t~short8; 10622#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 10621#L555-5 test_fun_#t~short8 := test_fun_#t~mem7 < 1073741824; 10620#L555-7 assume !!test_fun_#t~short8;havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;havoc test_fun_#t~short8;havoc test_fun_#t~mem5; 10619#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 10618#L556-1 assume !(test_fun_#t~mem9 <= 0);havoc test_fun_#t~mem9; 10617#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 10616#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 10615#L559-2 havoc test_fun_#t~mem11; 10614#L555-9 assume true; 10613#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 10612#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 10611#L555-2 test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 10610#L555-3 assume test_fun_#t~short8; 10609#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 10608#L555-5 test_fun_#t~short8 := test_fun_#t~mem7 < 1073741824; 10607#L555-7 assume !!test_fun_#t~short8;havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;havoc test_fun_#t~short8;havoc test_fun_#t~mem5; 10606#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 10605#L556-1 assume !(test_fun_#t~mem9 <= 0);havoc test_fun_#t~mem9; 10604#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 10603#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 10602#L559-2 havoc test_fun_#t~mem11; 10580#L555-9 assume true; 10599#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 10597#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 10595#L555-2 test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 10593#L555-3 assume test_fun_#t~short8; 10591#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 10589#L555-5 test_fun_#t~short8 := test_fun_#t~mem7 < 1073741824; 10587#L555-7 assume !!test_fun_#t~short8;havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;havoc test_fun_#t~short8;havoc test_fun_#t~mem5; 10584#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 10583#L556-1 assume !(test_fun_#t~mem9 <= 0);havoc test_fun_#t~mem9; 10582#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 10581#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 10579#L559-2 havoc test_fun_#t~mem11; 10541#L555-9 [2018-10-27 06:15:35,149 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:15:35,149 INFO L82 PathProgramCache]: Analyzing trace with hash -889597241, now seen corresponding path program 7 times [2018-10-27 06:15:35,149 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:15:35,149 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:15:35,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:15:35,150 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:15:35,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:15:35,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:15:35,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:15:35,186 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:15:35,186 INFO L82 PathProgramCache]: Analyzing trace with hash 85480237, now seen corresponding path program 8 times [2018-10-27 06:15:35,186 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:15:35,187 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:15:35,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:15:35,187 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:15:35,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:15:35,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:15:35,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:15:35,258 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:15:35,258 INFO L82 PathProgramCache]: Analyzing trace with hash 1879935399, now seen corresponding path program 6 times [2018-10-27 06:15:35,258 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:15:35,258 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:15:35,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:15:35,259 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:15:35,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:15:35,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:15:35,711 INFO L134 CoverageAnalysis]: Checked inductivity of 1692 backedges. 900 proven. 428 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2018-10-27 06:15:35,712 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 06:15:35,712 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3e61184c-37d6-4916-a088-a2ff8eeb73b2/bin-2019/uautomizer/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 06:15:35,720 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-27 06:15:36,262 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2018-10-27 06:15:36,262 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 06:15:36,267 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:15:36,285 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-10-27 06:15:36,286 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-10-27 06:15:36,286 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:15:36,289 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:15:36,293 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:15:36,293 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2018-10-27 06:15:36,322 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:15:36,322 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-10-27 06:15:36,325 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-10-27 06:15:36,325 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:15:36,330 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:15:36,334 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-10-27 06:15:36,334 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:13 [2018-10-27 06:15:36,400 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-10-27 06:15:36,402 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-10-27 06:15:36,402 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:15:36,407 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:15:36,412 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-10-27 06:15:36,412 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:33, output treesize:18 [2018-10-27 06:15:36,479 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-10-27 06:15:36,482 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-10-27 06:15:36,482 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:15:36,487 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:15:36,492 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-10-27 06:15:36,492 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:38, output treesize:23 [2018-10-27 06:15:36,554 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-10-27 06:15:36,557 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-10-27 06:15:36,557 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:15:36,561 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:15:36,567 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-10-27 06:15:36,567 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:43, output treesize:28 [2018-10-27 06:15:37,233 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-10-27 06:15:37,236 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-10-27 06:15:37,236 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:15:37,240 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:15:37,248 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-10-27 06:15:37,248 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:48, output treesize:33 [2018-10-27 06:15:52,829 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-10-27 06:15:52,832 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-10-27 06:15:52,833 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:15:52,838 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:15:52,848 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-10-27 06:15:52,848 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:53, output treesize:38 [2018-10-27 06:16:28,355 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-10-27 06:16:28,358 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-10-27 06:16:28,359 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:16:28,364 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:16:28,376 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-10-27 06:16:28,377 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:58, output treesize:43 [2018-10-27 06:17:05,751 WARN L179 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2018-10-27 06:17:51,486 WARN L179 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2018-10-27 06:17:51,490 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-10-27 06:17:51,493 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-10-27 06:17:51,494 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:17:51,498 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:17:51,510 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 1 dim-2 vars, End of recursive call: 8 dim-0 vars, and 1 xjuncts. [2018-10-27 06:17:51,510 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:63, output treesize:48 [2018-10-27 06:19:09,763 WARN L194 Executor]: External (z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000) stderr output: (error "out of memory") [2018-10-27 06:19:09,763 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.managedscript.ManagedScript.checkSat(ManagedScript.java:141) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:84) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:928) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:767) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:339) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:299) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp$UnifyPostprocessor.postprocess(TraceCheckSpWp.java:575) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:200) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:286) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructForwardBackward(TraceCheckConstructor.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:188) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.MultiTrackRefinementStrategy.getTraceCheck(MultiTrackRefinementStrategy.java:234) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkFeasibilityAndComputeInterpolants(LassoCheck.java:928) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkConcatFeasibility(LassoCheck.java:898) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.(LassoCheck.java:831) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.(LassoCheck.java:250) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.iterate(BuchiCegarLoop.java:476) 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) ... 39 more [2018-10-27 06:19:09,766 INFO L168 Benchmark]: Toolchain (without parser) took 582081.86 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 285.7 MB). Free memory was 951.8 MB in the beginning and 930.7 MB in the end (delta: 21.1 MB). Peak memory consumption was 306.8 MB. Max. memory is 11.5 GB. [2018-10-27 06:19:09,767 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 979.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-27 06:19:09,767 INFO L168 Benchmark]: CACSL2BoogieTranslator took 378.97 ms. Allocated memory is still 1.0 GB. Free memory was 951.8 MB in the beginning and 930.3 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. [2018-10-27 06:19:09,767 INFO L168 Benchmark]: Boogie Procedure Inliner took 98.46 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.3 MB). Free memory was 930.3 MB in the beginning and 1.1 GB in the end (delta: -215.4 MB). Peak memory consumption was 15.9 MB. Max. memory is 11.5 GB. [2018-10-27 06:19:09,767 INFO L168 Benchmark]: Boogie Preprocessor took 30.16 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-10-27 06:19:09,767 INFO L168 Benchmark]: RCFGBuilder took 548.09 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: 23.7 MB). Peak memory consumption was 23.7 MB. Max. memory is 11.5 GB. [2018-10-27 06:19:09,768 INFO L168 Benchmark]: BuchiAutomizer took 581022.77 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 139.5 MB). Free memory was 1.1 GB in the beginning and 930.7 MB in the end (delta: 188.6 MB). Peak memory consumption was 328.0 MB. Max. memory is 11.5 GB. [2018-10-27 06:19:09,769 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.16 ms. Allocated memory is still 1.0 GB. Free memory is still 979.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 378.97 ms. Allocated memory is still 1.0 GB. Free memory was 951.8 MB in the beginning and 930.3 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 98.46 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.3 MB). Free memory was 930.3 MB in the beginning and 1.1 GB in the end (delta: -215.4 MB). Peak memory consumption was 15.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 30.16 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 548.09 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: 23.7 MB). Peak memory consumption was 23.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 581022.77 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 139.5 MB). Free memory was 1.1 GB in the beginning and 930.7 MB in the end (delta: 188.6 MB). Peak memory consumption was 328.0 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...