./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/c.01-no-inv-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_90d8d520-a9ba-40ca-8940-35d04161bf04/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_90d8d520-a9ba-40ca-8940-35d04161bf04/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_90d8d520-a9ba-40ca-8940-35d04161bf04/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_90d8d520-a9ba-40ca-8940-35d04161bf04/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/c.01-no-inv-alloca_true-termination_true-no-overflow.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_90d8d520-a9ba-40ca-8940-35d04161bf04/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_90d8d520-a9ba-40ca-8940-35d04161bf04/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 36c66c6ef3a2f9350719139a100a5a7260c2a075 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis No suitable file found in config dir /tmp/vcloud-vcloud-master/worker/working_dir_90d8d520-a9ba-40ca-8940-35d04161bf04/bin-2019/uautomizer/config using search string *Termination*64bit*_Bitvector*.epf No suitable settings file found using Termination*64bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000)Received EOF on stdin. stderr output: (error "out of memory") --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-10 10:29:39,495 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 10:29:39,496 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 10:29:39,503 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 10:29:39,503 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 10:29:39,503 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 10:29:39,504 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 10:29:39,505 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 10:29:39,506 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 10:29:39,507 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 10:29:39,507 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 10:29:39,508 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 10:29:39,508 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 10:29:39,509 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 10:29:39,510 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 10:29:39,510 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 10:29:39,511 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 10:29:39,512 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 10:29:39,513 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 10:29:39,514 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 10:29:39,515 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 10:29:39,516 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 10:29:39,517 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 10:29:39,517 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 10:29:39,517 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 10:29:39,518 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 10:29:39,519 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 10:29:39,519 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 10:29:39,520 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 10:29:39,520 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 10:29:39,521 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 10:29:39,521 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 10:29:39,521 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 10:29:39,522 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 10:29:39,522 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 10:29:39,523 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 10:29:39,523 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_90d8d520-a9ba-40ca-8940-35d04161bf04/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-10 10:29:39,533 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 10:29:39,534 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 10:29:39,535 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 10:29:39,535 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 10:29:39,535 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 10:29:39,535 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-10 10:29:39,535 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-10 10:29:39,535 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-10 10:29:39,535 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-10 10:29:39,536 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-10 10:29:39,536 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-10 10:29:39,536 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 10:29:39,536 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-10 10:29:39,536 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 10:29:39,536 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 10:29:39,536 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-10 10:29:39,536 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-10 10:29:39,537 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-10 10:29:39,537 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 10:29:39,537 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-10 10:29:39,537 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-10 10:29:39,537 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 10:29:39,537 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 10:29:39,537 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-10 10:29:39,538 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 10:29:39,538 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 10:29:39,538 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-10 10:29:39,538 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-10 10:29:39,539 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_90d8d520-a9ba-40ca-8940-35d04161bf04/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 -> 36c66c6ef3a2f9350719139a100a5a7260c2a075 [2018-11-10 10:29:39,562 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 10:29:39,571 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 10:29:39,574 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 10:29:39,575 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 10:29:39,575 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 10:29:39,576 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_90d8d520-a9ba-40ca-8940-35d04161bf04/bin-2019/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/c.01-no-inv-alloca_true-termination_true-no-overflow.c.i [2018-11-10 10:29:39,619 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_90d8d520-a9ba-40ca-8940-35d04161bf04/bin-2019/uautomizer/data/9a562e2bd/469f500d5aa340199901a3b319959be1/FLAG0c2f608b0 [2018-11-10 10:29:39,961 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 10:29:39,962 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_90d8d520-a9ba-40ca-8940-35d04161bf04/sv-benchmarks/c/termination-memory-alloca/c.01-no-inv-alloca_true-termination_true-no-overflow.c.i [2018-11-10 10:29:39,971 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_90d8d520-a9ba-40ca-8940-35d04161bf04/bin-2019/uautomizer/data/9a562e2bd/469f500d5aa340199901a3b319959be1/FLAG0c2f608b0 [2018-11-10 10:29:39,982 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_90d8d520-a9ba-40ca-8940-35d04161bf04/bin-2019/uautomizer/data/9a562e2bd/469f500d5aa340199901a3b319959be1 [2018-11-10 10:29:39,985 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 10:29:39,986 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 10:29:39,986 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 10:29:39,987 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 10:29:39,990 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 10:29:39,990 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 10:29:39" (1/1) ... [2018-11-10 10:29:39,992 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a5970c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:29:39, skipping insertion in model container [2018-11-10 10:29:39,992 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 10:29:39" (1/1) ... [2018-11-10 10:29:40,000 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 10:29:40,028 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 10:29:40,210 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 10:29:40,218 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 10:29:40,247 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 10:29:40,276 INFO L193 MainTranslator]: Completed translation [2018-11-10 10:29:40,276 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:29:40 WrapperNode [2018-11-10 10:29:40,276 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 10:29:40,277 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 10:29:40,277 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 10:29:40,277 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 10:29:40,284 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:29:40" (1/1) ... [2018-11-10 10:29:40,296 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:29:40" (1/1) ... [2018-11-10 10:29:40,352 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 10:29:40,352 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 10:29:40,352 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 10:29:40,352 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 10:29:40,358 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:29:40" (1/1) ... [2018-11-10 10:29:40,358 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:29:40" (1/1) ... [2018-11-10 10:29:40,360 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:29:40" (1/1) ... [2018-11-10 10:29:40,360 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:29:40" (1/1) ... [2018-11-10 10:29:40,362 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:29:40" (1/1) ... [2018-11-10 10:29:40,364 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:29:40" (1/1) ... [2018-11-10 10:29:40,365 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:29:40" (1/1) ... [2018-11-10 10:29:40,367 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 10:29:40,367 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 10:29:40,367 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 10:29:40,367 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 10:29:40,368 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:29:40" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_90d8d520-a9ba-40ca-8940-35d04161bf04/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 10:29:40,400 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-10 10:29:40,400 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-10 10:29:40,401 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 10:29:40,401 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 10:29:40,577 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 10:29:40,577 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 10:29:40 BoogieIcfgContainer [2018-11-10 10:29:40,577 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 10:29:40,578 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-10 10:29:40,578 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-10 10:29:40,581 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-10 10:29:40,583 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 10:29:40,583 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.11 10:29:39" (1/3) ... [2018-11-10 10:29:40,584 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7e801a95 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 10:29:40, skipping insertion in model container [2018-11-10 10:29:40,585 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 10:29:40,585 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:29:40" (2/3) ... [2018-11-10 10:29:40,585 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7e801a95 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 10:29:40, skipping insertion in model container [2018-11-10 10:29:40,585 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 10:29:40,585 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 10:29:40" (3/3) ... [2018-11-10 10:29:40,586 INFO L375 chiAutomizerObserver]: Analyzing ICFG c.01-no-inv-alloca_true-termination_true-no-overflow.c.i [2018-11-10 10:29:40,630 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 10:29:40,630 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-10 10:29:40,630 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-10 10:29:40,631 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-10 10:29:40,631 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 10:29:40,631 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 10:29:40,631 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-10 10:29:40,631 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 10:29:40,631 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-10 10:29:40,639 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states. [2018-11-10 10:29:40,655 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 18 [2018-11-10 10:29:40,655 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 10:29:40,655 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 10:29:40,661 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-10 10:29:40,661 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:29:40,661 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-10 10:29:40,662 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states. [2018-11-10 10:29:40,663 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 18 [2018-11-10 10:29:40,663 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 10:29:40,663 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 10:29:40,664 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-10 10:29:40,664 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:29:40,669 INFO L793 eck$LassoCheckResult]: Stem: 23#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 9#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet13, main_#t~nondet14, main_#t~ret15;assume { :begin_inline_test_fun } true;test_fun_#in~x, test_fun_#in~y := main_#t~nondet13, main_#t~nondet14;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~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~mem10, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~mem8, test_fun_#t~short9, test_fun_#t~mem11, test_fun_#t~mem5, test_fun_#t~mem12, 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_~c~0.base, test_fun_~c~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;#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~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset; 10#L552true SUMMARY for call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L552 11#L552-1true SUMMARY for call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L552-1 21#L553true SUMMARY for call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); srcloc: L553 24#L555-3true [2018-11-10 10:29:40,670 INFO L795 eck$LassoCheckResult]: Loop: 24#L555-3true assume true; 5#L555true SUMMARY for call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L555 7#L555-1true assume !!(test_fun_#t~mem5 >= 0);havoc test_fun_#t~mem5; 18#L556true SUMMARY for call write~int(1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L556 14#L557-9true assume !true; 16#L557-10true SUMMARY for call test_fun_#t~mem11 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L557-10 30#L560true SUMMARY for call write~int(test_fun_#t~mem11 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L560 31#L560-1true havoc test_fun_#t~mem11; 24#L555-3true [2018-11-10 10:29:40,673 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:29:40,673 INFO L82 PathProgramCache]: Analyzing trace with hash 28691745, now seen corresponding path program 1 times [2018-11-10 10:29:40,675 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:29:40,675 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:29:40,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:29:40,708 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:29:40,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:29:40,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:29:40,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:29:40,778 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:29:40,778 INFO L82 PathProgramCache]: Analyzing trace with hash -1654332729, now seen corresponding path program 1 times [2018-11-10 10:29:40,778 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:29:40,778 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:29:40,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:29:40,780 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:29:40,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:29:40,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:29:40,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:29:40,806 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:29:40,807 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 10:29:40,809 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 10:29:40,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-10 10:29:40,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-10 10:29:40,819 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 2 states. [2018-11-10 10:29:40,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:29:40,824 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2018-11-10 10:29:40,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-10 10:29:40,825 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 31 transitions. [2018-11-10 10:29:40,826 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 18 [2018-11-10 10:29:40,829 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 23 states and 25 transitions. [2018-11-10 10:29:40,830 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2018-11-10 10:29:40,830 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2018-11-10 10:29:40,831 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 25 transitions. [2018-11-10 10:29:40,831 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 10:29:40,831 INFO L705 BuchiCegarLoop]: Abstraction has 23 states and 25 transitions. [2018-11-10 10:29:40,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 25 transitions. [2018-11-10 10:29:40,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-11-10 10:29:40,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-10 10:29:40,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2018-11-10 10:29:40,850 INFO L728 BuchiCegarLoop]: Abstraction has 23 states and 25 transitions. [2018-11-10 10:29:40,850 INFO L608 BuchiCegarLoop]: Abstraction has 23 states and 25 transitions. [2018-11-10 10:29:40,850 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-10 10:29:40,850 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 25 transitions. [2018-11-10 10:29:40,851 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 18 [2018-11-10 10:29:40,851 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 10:29:40,851 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 10:29:40,851 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-10 10:29:40,851 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:29:40,852 INFO L793 eck$LassoCheckResult]: Stem: 86#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 81#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet13, main_#t~nondet14, main_#t~ret15;assume { :begin_inline_test_fun } true;test_fun_#in~x, test_fun_#in~y := main_#t~nondet13, main_#t~nondet14;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~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~mem10, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~mem8, test_fun_#t~short9, test_fun_#t~mem11, test_fun_#t~mem5, test_fun_#t~mem12, 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_~c~0.base, test_fun_~c~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;#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~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset; 82#L552 SUMMARY for call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L552 87#L552-1 SUMMARY for call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L552-1 83#L553 SUMMARY for call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); srcloc: L553 84#L555-3 [2018-11-10 10:29:40,852 INFO L795 eck$LassoCheckResult]: Loop: 84#L555-3 assume true; 76#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 77#L555-1 assume !!(test_fun_#t~mem5 >= 0);havoc test_fun_#t~mem5; 74#L556 SUMMARY for call write~int(1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L556 66#L557-9 assume true; 67#L557 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L557 72#L557-1 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557-1 75#L557-2 test_fun_#t~short9 := test_fun_#t~mem6 > test_fun_#t~mem7; 78#L557-3 assume !test_fun_#t~short9; 79#L557-7 assume !test_fun_#t~short9;havoc test_fun_#t~mem7;havoc test_fun_#t~short9;havoc test_fun_#t~mem8;havoc test_fun_#t~mem6; 70#L557-10 SUMMARY for call test_fun_#t~mem11 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L557-10 71#L560 SUMMARY for call write~int(test_fun_#t~mem11 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L560 88#L560-1 havoc test_fun_#t~mem11; 84#L555-3 [2018-11-10 10:29:40,852 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:29:40,852 INFO L82 PathProgramCache]: Analyzing trace with hash 28691745, now seen corresponding path program 2 times [2018-11-10 10:29:40,852 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:29:40,853 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:29:40,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:29:40,854 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:29:40,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:29:40,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:29:40,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:29:40,882 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:29:40,882 INFO L82 PathProgramCache]: Analyzing trace with hash -1053711549, now seen corresponding path program 1 times [2018-11-10 10:29:40,882 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:29:40,883 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:29:40,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:29:40,884 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 10:29:40,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:29:40,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:29:40,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:29:40,904 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:29:40,904 INFO L82 PathProgramCache]: Analyzing trace with hash -1010161117, now seen corresponding path program 1 times [2018-11-10 10:29:40,904 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:29:40,904 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:29:40,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:29:40,905 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:29:40,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:29:40,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:29:40,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:29:41,074 WARN L179 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 53 [2018-11-10 10:29:41,324 WARN L179 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 95 [2018-11-10 10:29:41,435 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 10:29:41,436 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 10:29:41,437 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 10:29:41,437 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 10:29:41,437 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 10:29:41,437 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 10:29:41,437 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 10:29:41,437 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 10:29:41,437 INFO L131 ssoRankerPreferences]: Filename of dumped script: c.01-no-inv-alloca_true-termination_true-no-overflow.c.i_Iteration2_Lasso [2018-11-10 10:29:41,438 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 10:29:41,438 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 10:29:41,458 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:29:41,471 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:29:41,480 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:29:41,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-11-10 10:29:41,485 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:29:41,487 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:29:41,489 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:29:41,491 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:29:41,503 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:29:41,765 WARN L179 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 95 [2018-11-10 10:29:41,865 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:29:41,867 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:29:41,868 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:29:41,869 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:29:41,871 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:29:41,872 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:29:41,874 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:29:41,876 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:29:41,878 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:29:42,213 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 10:29:42,216 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 10:29:42,217 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:29:42,218 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:29:42,219 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:29:42,219 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:29:42,219 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:29:42,219 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:29:42,220 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 10:29:42,221 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:29:42,222 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:29:42,223 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:29:42,223 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:29:42,223 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:29:42,223 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:29:42,224 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:29:42,224 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:29:42,224 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 10:29:42,224 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:29:42,225 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:29:42,225 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:29:42,225 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:29:42,226 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:29:42,226 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:29:42,226 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:29:42,227 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 10:29:42,227 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 10:29:42,229 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:29:42,230 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:29:42,230 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:29:42,230 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:29:42,230 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:29:42,231 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:29:42,231 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:29:42,231 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 10:29:42,231 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:29:42,232 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:29:42,232 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:29:42,233 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:29:42,233 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:29:42,233 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:29:42,233 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:29:42,233 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:29:42,234 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 10:29:42,234 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:29:42,235 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:29:42,235 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:29:42,235 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:29:42,235 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:29:42,235 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:29:42,236 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:29:42,237 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 10:29:42,237 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 10:29:42,240 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:29:42,240 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:29:42,241 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:29:42,241 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:29:42,241 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:29:42,241 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:29:42,242 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 10:29:42,242 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 10:29:42,247 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:29:42,247 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:29:42,247 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:29:42,248 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:29:42,248 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:29:42,248 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:29:42,249 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 10:29:42,249 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 10:29:42,251 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:29:42,252 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:29:42,252 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:29:42,252 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:29:42,252 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:29:42,253 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:29:42,255 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 10:29:42,255 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 10:29:42,257 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:29:42,258 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:29:42,258 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:29:42,258 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:29:42,258 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:29:42,258 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:29:42,261 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 10:29:42,261 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 10:29:42,272 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:29:42,272 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:29:42,273 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:29:42,273 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 10:29:42,273 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:29:42,273 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:29:42,274 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 10:29:42,275 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 10:29:42,284 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:29:42,285 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:29:42,285 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:29:42,285 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:29:42,286 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:29:42,286 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:29:42,287 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 10:29:42,287 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 10:29:42,289 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:29:42,289 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:29:42,290 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:29:42,290 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:29:42,290 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:29:42,290 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:29:42,294 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 10:29:42,294 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 10:29:42,315 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:29:42,316 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:29:42,316 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:29:42,316 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 10:29:42,316 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:29:42,316 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:29:42,317 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 10:29:42,317 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 10:29:42,322 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:29:42,322 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:29:42,323 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:29:42,323 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 10:29:42,323 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:29:42,323 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:29:42,324 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 10:29:42,324 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 10:29:42,329 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:29:42,329 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:29:42,329 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:29:42,330 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:29:42,330 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:29:42,330 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:29:42,330 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 10:29:42,331 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 10:29:42,333 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:29:42,333 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:29:42,333 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:29:42,334 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:29:42,334 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:29:42,334 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:29:42,334 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 10:29:42,334 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 10:29:42,336 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:29:42,336 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:29:42,337 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:29:42,337 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:29:42,337 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:29:42,337 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:29:42,338 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 10:29:42,338 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 10:29:42,348 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 10:29:42,358 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-10 10:29:42,358 INFO L444 ModelExtractionUtils]: 10 out of 16 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-11-10 10:29:42,360 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 10:29:42,364 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 10:29:42,364 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 10:29:42,365 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_1) = 2*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_1 + 1 Supporting invariants [] [2018-11-10 10:29:42,429 INFO L297 tatePredicateManager]: 19 out of 20 supporting invariants were superfluous and have been removed [2018-11-10 10:29:42,435 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 10:29:42,456 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:29:42,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:29:42,474 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:29:42,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, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-10 10:29:42,498 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 10:29:42,500 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:29:42,500 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:6 [2018-11-10 10:29:42,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:29:42,514 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:29:42,556 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 31 [2018-11-10 10:29:42,559 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 10:29:42,559 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:29:42,566 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:29:42,573 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:29:42,573 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:30 [2018-11-10 10:29:42,656 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:29:42,659 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 49 [2018-11-10 10:29:42,662 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 29 [2018-11-10 10:29:42,663 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:29:42,675 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:29:42,686 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-10 10:29:42,687 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:50, output treesize:31 [2018-11-10 10:29:42,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:29:42,714 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 6 loop predicates [2018-11-10 10:29:42,715 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 23 states and 25 transitions. cyclomatic complexity: 3 Second operand 9 states. [2018-11-10 10:29:42,824 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 23 states and 25 transitions. cyclomatic complexity: 3. Second operand 9 states. Result 84 states and 94 transitions. Complement of second has 14 states. [2018-11-10 10:29:42,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 2 stem states 5 non-accepting loop states 1 accepting loop states [2018-11-10 10:29:42,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-10 10:29:42,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 39 transitions. [2018-11-10 10:29:42,827 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 39 transitions. Stem has 5 letters. Loop has 13 letters. [2018-11-10 10:29:42,828 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 10:29:42,828 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 39 transitions. Stem has 18 letters. Loop has 13 letters. [2018-11-10 10:29:42,828 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 10:29:42,828 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 39 transitions. Stem has 5 letters. Loop has 26 letters. [2018-11-10 10:29:42,829 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 10:29:42,829 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 84 states and 94 transitions. [2018-11-10 10:29:42,831 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 29 [2018-11-10 10:29:42,832 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 84 states to 67 states and 75 transitions. [2018-11-10 10:29:42,832 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 50 [2018-11-10 10:29:42,832 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 52 [2018-11-10 10:29:42,832 INFO L73 IsDeterministic]: Start isDeterministic. Operand 67 states and 75 transitions. [2018-11-10 10:29:42,832 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 10:29:42,833 INFO L705 BuchiCegarLoop]: Abstraction has 67 states and 75 transitions. [2018-11-10 10:29:42,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states and 75 transitions. [2018-11-10 10:29:42,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 51. [2018-11-10 10:29:42,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-11-10 10:29:42,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 57 transitions. [2018-11-10 10:29:42,835 INFO L728 BuchiCegarLoop]: Abstraction has 51 states and 57 transitions. [2018-11-10 10:29:42,835 INFO L608 BuchiCegarLoop]: Abstraction has 51 states and 57 transitions. [2018-11-10 10:29:42,836 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-10 10:29:42,836 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 51 states and 57 transitions. [2018-11-10 10:29:42,836 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 18 [2018-11-10 10:29:42,837 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 10:29:42,837 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 10:29:42,837 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:29:42,838 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:29:42,838 INFO L793 eck$LassoCheckResult]: Stem: 387#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 381#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet13, main_#t~nondet14, main_#t~ret15;assume { :begin_inline_test_fun } true;test_fun_#in~x, test_fun_#in~y := main_#t~nondet13, main_#t~nondet14;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~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~mem10, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~mem8, test_fun_#t~short9, test_fun_#t~mem11, test_fun_#t~mem5, test_fun_#t~mem12, 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_~c~0.base, test_fun_~c~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;#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~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset; 382#L552 SUMMARY for call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L552 391#L552-1 SUMMARY for call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L552-1 385#L553 SUMMARY for call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); srcloc: L553 386#L555-3 assume true; 389#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 375#L555-1 assume !!(test_fun_#t~mem5 >= 0);havoc test_fun_#t~mem5; 376#L556 SUMMARY for call write~int(1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L556 401#L557-9 assume true; 400#L557 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L557 366#L557-1 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557-1 367#L557-2 test_fun_#t~short9 := test_fun_#t~mem6 > test_fun_#t~mem7; 373#L557-3 assume !test_fun_#t~short9; 377#L557-7 assume !!test_fun_#t~short9;havoc test_fun_#t~mem7;havoc test_fun_#t~short9;havoc test_fun_#t~mem8;havoc test_fun_#t~mem6; 355#L558 [2018-11-10 10:29:42,838 INFO L795 eck$LassoCheckResult]: Loop: 355#L558 SUMMARY for call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L558 356#L558-1 SUMMARY for call write~int(2 * test_fun_#t~mem10, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L558-1 363#L558-2 havoc test_fun_#t~mem10; 351#L557-9 assume true; 352#L557 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L557 361#L557-1 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557-1 399#L557-2 test_fun_#t~short9 := test_fun_#t~mem6 > test_fun_#t~mem7; 396#L557-3 assume !test_fun_#t~short9; 395#L557-7 assume !!test_fun_#t~short9;havoc test_fun_#t~mem7;havoc test_fun_#t~short9;havoc test_fun_#t~mem8;havoc test_fun_#t~mem6; 355#L558 [2018-11-10 10:29:42,838 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:29:42,838 INFO L82 PathProgramCache]: Analyzing trace with hash -1810087763, now seen corresponding path program 1 times [2018-11-10 10:29:42,838 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:29:42,838 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:29:42,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:29:42,839 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:29:42,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:29:42,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:29:42,869 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:29:42,869 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:29:42,869 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 10:29:42,869 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 10:29:42,869 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:29:42,869 INFO L82 PathProgramCache]: Analyzing trace with hash 1676281584, now seen corresponding path program 1 times [2018-11-10 10:29:42,869 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:29:42,870 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:29:42,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:29:42,870 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:29:42,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:29:42,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:29:42,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:29:42,879 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:29:42,879 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 10:29:42,880 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 10:29:42,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 10:29:42,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 10:29:42,880 INFO L87 Difference]: Start difference. First operand 51 states and 57 transitions. cyclomatic complexity: 8 Second operand 3 states. [2018-11-10 10:29:42,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:29:42,889 INFO L93 Difference]: Finished difference Result 54 states and 59 transitions. [2018-11-10 10:29:42,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 10:29:42,890 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 54 states and 59 transitions. [2018-11-10 10:29:42,891 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 19 [2018-11-10 10:29:42,892 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 54 states to 53 states and 58 transitions. [2018-11-10 10:29:42,892 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 37 [2018-11-10 10:29:42,892 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 37 [2018-11-10 10:29:42,892 INFO L73 IsDeterministic]: Start isDeterministic. Operand 53 states and 58 transitions. [2018-11-10 10:29:42,892 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 10:29:42,892 INFO L705 BuchiCegarLoop]: Abstraction has 53 states and 58 transitions. [2018-11-10 10:29:42,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states and 58 transitions. [2018-11-10 10:29:42,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 52. [2018-11-10 10:29:42,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-11-10 10:29:42,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 57 transitions. [2018-11-10 10:29:42,895 INFO L728 BuchiCegarLoop]: Abstraction has 52 states and 57 transitions. [2018-11-10 10:29:42,895 INFO L608 BuchiCegarLoop]: Abstraction has 52 states and 57 transitions. [2018-11-10 10:29:42,895 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-10 10:29:42,896 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 52 states and 57 transitions. [2018-11-10 10:29:42,896 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 19 [2018-11-10 10:29:42,896 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 10:29:42,896 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 10:29:42,897 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:29:42,897 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:29:42,897 INFO L793 eck$LassoCheckResult]: Stem: 496#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 490#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet13, main_#t~nondet14, main_#t~ret15;assume { :begin_inline_test_fun } true;test_fun_#in~x, test_fun_#in~y := main_#t~nondet13, main_#t~nondet14;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~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~mem10, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~mem8, test_fun_#t~short9, test_fun_#t~mem11, test_fun_#t~mem5, test_fun_#t~mem12, 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_~c~0.base, test_fun_~c~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;#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~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset; 491#L552 SUMMARY for call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L552 497#L552-1 SUMMARY for call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L552-1 492#L553 SUMMARY for call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); srcloc: L553 493#L555-3 assume true; 481#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 482#L555-1 assume !!(test_fun_#t~mem5 >= 0);havoc test_fun_#t~mem5; 476#L556 SUMMARY for call write~int(1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L556 463#L557-9 assume true; 464#L557 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L557 473#L557-1 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557-1 478#L557-2 test_fun_#t~short9 := test_fun_#t~mem6 > test_fun_#t~mem7; 485#L557-3 assume test_fun_#t~short9; 487#L557-4 SUMMARY for call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557-4 494#L557-5 test_fun_#t~short9 := test_fun_#t~mem8 < 1073741824; 502#L557-7 assume !!test_fun_#t~short9;havoc test_fun_#t~mem7;havoc test_fun_#t~short9;havoc test_fun_#t~mem8;havoc test_fun_#t~mem6; 467#L558 [2018-11-10 10:29:42,897 INFO L795 eck$LassoCheckResult]: Loop: 467#L558 SUMMARY for call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L558 468#L558-1 SUMMARY for call write~int(2 * test_fun_#t~mem10, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L558-1 475#L558-2 havoc test_fun_#t~mem10; 480#L557-9 assume true; 511#L557 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L557 510#L557-1 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557-1 509#L557-2 test_fun_#t~short9 := test_fun_#t~mem6 > test_fun_#t~mem7; 508#L557-3 assume test_fun_#t~short9; 507#L557-4 SUMMARY for call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557-4 500#L557-5 test_fun_#t~short9 := test_fun_#t~mem8 < 1073741824; 501#L557-7 assume !!test_fun_#t~short9;havoc test_fun_#t~mem7;havoc test_fun_#t~short9;havoc test_fun_#t~mem8;havoc test_fun_#t~mem6; 467#L558 [2018-11-10 10:29:42,898 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:29:42,898 INFO L82 PathProgramCache]: Analyzing trace with hash -32712208, now seen corresponding path program 1 times [2018-11-10 10:29:42,898 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:29:42,898 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:29:42,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:29:42,899 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:29:42,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:29:42,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:29:42,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:29:42,916 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:29:42,916 INFO L82 PathProgramCache]: Analyzing trace with hash 293739379, now seen corresponding path program 1 times [2018-11-10 10:29:42,916 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:29:42,916 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:29:42,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:29:42,917 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:29:42,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:29:42,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:29:42,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:29:42,926 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:29:42,927 INFO L82 PathProgramCache]: Analyzing trace with hash -671283676, now seen corresponding path program 1 times [2018-11-10 10:29:42,927 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:29:42,927 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:29:42,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:29:42,929 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:29:42,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:29:42,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:29:42,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:29:43,462 WARN L179 SmtUtils]: Spent 421.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 120 [2018-11-10 10:29:43,573 WARN L179 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 100 [2018-11-10 10:29:43,574 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 10:29:43,574 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 10:29:43,574 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 10:29:43,575 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 10:29:43,575 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 10:29:43,575 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 10:29:43,575 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 10:29:43,575 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 10:29:43,575 INFO L131 ssoRankerPreferences]: Filename of dumped script: c.01-no-inv-alloca_true-termination_true-no-overflow.c.i_Iteration4_Lasso [2018-11-10 10:29:43,575 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 10:29:43,575 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 10:29:43,578 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:29:43,581 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:29:43,582 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:29:43,583 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:29:43,584 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:29:43,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-11-10 10:29:43,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-11-10 10:29:43,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-11-10 10:29:43,590 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:29:43,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-11-10 10:29:43,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-11-10 10:29:43,594 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:29:43,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-11-10 10:29:43,599 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:29:43,604 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:29:43,605 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:29:43,848 WARN L179 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 95 [2018-11-10 10:29:43,933 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:29:43,935 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:29:43,936 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:29:44,259 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 10:29:44,259 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 10:29:44,260 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:29:44,262 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:29:44,262 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:29:44,262 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:29:44,262 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:29:44,262 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:29:44,263 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 10:29:44,263 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:29:44,265 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:29:44,266 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:29:44,266 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:29:44,266 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:29:44,266 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:29:44,266 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:29:44,266 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:29:44,267 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 10:29:44,267 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:29:44,267 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:29:44,270 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:29:44,271 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:29:44,271 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:29:44,271 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:29:44,271 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:29:44,271 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:29:44,271 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 10:29:44,271 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:29:44,272 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:29:44,272 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:29:44,272 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:29:44,272 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:29:44,272 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:29:44,273 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:29:44,273 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:29:44,273 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 10:29:44,273 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:29:44,273 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:29:44,274 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:29:44,274 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:29:44,274 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:29:44,274 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:29:44,274 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:29:44,275 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 10:29:44,275 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 10:29:44,276 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:29:44,276 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:29:44,277 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:29:44,277 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:29:44,277 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:29:44,277 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:29:44,278 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 10:29:44,278 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 10:29:44,279 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:29:44,279 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:29:44,280 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:29:44,280 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:29:44,280 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:29:44,280 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:29:44,280 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:29:44,280 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 10:29:44,280 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:29:44,281 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:29:44,281 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:29:44,281 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:29:44,281 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:29:44,281 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:29:44,282 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:29:44,282 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 10:29:44,282 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 10:29:44,284 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:29:44,284 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:29:44,284 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:29:44,284 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:29:44,284 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:29:44,285 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:29:44,285 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 10:29:44,285 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 10:29:44,286 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:29:44,287 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:29:44,287 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:29:44,287 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:29:44,287 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:29:44,287 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:29:44,288 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 10:29:44,288 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 10:29:44,289 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:29:44,289 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:29:44,289 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:29:44,290 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:29:44,290 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:29:44,290 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:29:44,290 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:29:44,290 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 10:29:44,290 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:29:44,291 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:29:44,291 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:29:44,291 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:29:44,291 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:29:44,291 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:29:44,291 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:29:44,291 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:29:44,292 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 10:29:44,292 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:29:44,292 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:29:44,292 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:29:44,293 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:29:44,293 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:29:44,293 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:29:44,293 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:29:44,301 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:29:44,301 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 10:29:44,301 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:29:44,302 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:29:44,302 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:29:44,302 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:29:44,302 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:29:44,303 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:29:44,303 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:29:44,303 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:29:44,303 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 10:29:44,303 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:29:44,304 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:29:44,304 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:29:44,304 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:29:44,304 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:29:44,304 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:29:44,304 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:29:44,305 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 10:29:44,305 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 10:29:44,306 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:29:44,306 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:29:44,306 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:29:44,307 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:29:44,307 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:29:44,307 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:29:44,308 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 10:29:44,308 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 10:29:44,309 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:29:44,309 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:29:44,310 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:29:44,310 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 10:29:44,310 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:29:44,310 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:29:44,311 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 10:29:44,311 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 10:29:44,315 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:29:44,315 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:29:44,315 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:29:44,315 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:29:44,315 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:29:44,316 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:29:44,316 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 10:29:44,316 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 10:29:44,317 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:29:44,318 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:29:44,318 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:29:44,318 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 10:29:44,318 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:29:44,318 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:29:44,319 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 10:29:44,319 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 10:29:44,322 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:29:44,322 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:29:44,323 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:29:44,323 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:29:44,323 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:29:44,323 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:29:44,324 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 10:29:44,324 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 10:29:44,325 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:29:44,326 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:29:44,326 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:29:44,326 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:29:44,326 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:29:44,326 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:29:44,328 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 10:29:44,328 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 10:29:44,342 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 10:29:44,350 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 10:29:44,350 INFO L444 ModelExtractionUtils]: 14 out of 19 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-10 10:29:44,350 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 10:29:44,352 INFO L440 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2018-11-10 10:29:44,352 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 10:29:44,352 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)_2, v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_2) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_2 - 2*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_2 Supporting invariants [1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_2 - 1 >= 0] [2018-11-10 10:29:44,419 INFO L297 tatePredicateManager]: 23 out of 24 supporting invariants were superfluous and have been removed [2018-11-10 10:29:44,421 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 10:29:44,422 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 10:29:44,450 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:29:44,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:29:44,465 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:29:44,469 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-10 10:29:44,473 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 10:29:44,474 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:29:44,475 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:29:44,477 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:29:44,478 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-10 10:29:44,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:29:44,491 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:29:44,526 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:29:44,539 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 57 [2018-11-10 10:29:44,547 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 46 treesize of output 37 [2018-11-10 10:29:44,548 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:29:44,585 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:29:44,595 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 51 [2018-11-10 10:29:44,598 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 4 xjuncts. [2018-11-10 10:29:44,639 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 5 xjuncts. [2018-11-10 10:29:44,674 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 7 dim-0 vars, and 5 xjuncts. [2018-11-10 10:29:44,674 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:43, output treesize:164 [2018-11-10 10:29:45,050 WARN L179 SmtUtils]: Spent 356.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 36 [2018-11-10 10:29:46,958 WARN L179 SmtUtils]: Spent 1.81 s on a formula simplification. DAG size of input: 62 DAG size of output: 53 [2018-11-10 10:29:46,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:29:46,983 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 7 loop predicates [2018-11-10 10:29:46,983 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 52 states and 57 transitions. cyclomatic complexity: 7 Second operand 9 states. [2018-11-10 10:29:47,260 WARN L179 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 47 [2018-11-10 10:29:47,298 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 52 states and 57 transitions. cyclomatic complexity: 7. Second operand 9 states. Result 85 states and 93 transitions. Complement of second has 16 states. [2018-11-10 10:29:47,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 2 stem states 6 non-accepting loop states 1 accepting loop states [2018-11-10 10:29:47,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-10 10:29:47,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 39 transitions. [2018-11-10 10:29:47,299 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 39 transitions. Stem has 17 letters. Loop has 11 letters. [2018-11-10 10:29:47,299 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 10:29:47,299 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 39 transitions. Stem has 28 letters. Loop has 11 letters. [2018-11-10 10:29:47,300 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 10:29:47,300 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 39 transitions. Stem has 17 letters. Loop has 22 letters. [2018-11-10 10:29:47,300 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 10:29:47,301 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 85 states and 93 transitions. [2018-11-10 10:29:47,302 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 19 [2018-11-10 10:29:47,303 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 85 states to 80 states and 88 transitions. [2018-11-10 10:29:47,303 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 52 [2018-11-10 10:29:47,303 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 54 [2018-11-10 10:29:47,303 INFO L73 IsDeterministic]: Start isDeterministic. Operand 80 states and 88 transitions. [2018-11-10 10:29:47,303 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 10:29:47,303 INFO L705 BuchiCegarLoop]: Abstraction has 80 states and 88 transitions. [2018-11-10 10:29:47,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states and 88 transitions. [2018-11-10 10:29:47,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 74. [2018-11-10 10:29:47,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-11-10 10:29:47,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 82 transitions. [2018-11-10 10:29:47,307 INFO L728 BuchiCegarLoop]: Abstraction has 74 states and 82 transitions. [2018-11-10 10:29:47,307 INFO L608 BuchiCegarLoop]: Abstraction has 74 states and 82 transitions. [2018-11-10 10:29:47,307 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-10 10:29:47,307 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 74 states and 82 transitions. [2018-11-10 10:29:47,308 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 19 [2018-11-10 10:29:47,308 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 10:29:47,308 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 10:29:47,308 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] [2018-11-10 10:29:47,308 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:29:47,309 INFO L793 eck$LassoCheckResult]: Stem: 869#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 862#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet13, main_#t~nondet14, main_#t~ret15;assume { :begin_inline_test_fun } true;test_fun_#in~x, test_fun_#in~y := main_#t~nondet13, main_#t~nondet14;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~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~mem10, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~mem8, test_fun_#t~short9, test_fun_#t~mem11, test_fun_#t~mem5, test_fun_#t~mem12, 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_~c~0.base, test_fun_~c~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;#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~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset; 863#L552 SUMMARY for call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L552 873#L552-1 SUMMARY for call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L552-1 867#L553 SUMMARY for call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); srcloc: L553 868#L555-3 assume true; 896#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 895#L555-1 assume !!(test_fun_#t~mem5 >= 0);havoc test_fun_#t~mem5; 894#L556 SUMMARY for call write~int(1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L556 893#L557-9 assume true; 892#L557 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L557 891#L557-1 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557-1 889#L557-2 test_fun_#t~short9 := test_fun_#t~mem6 > test_fun_#t~mem7; 887#L557-3 assume test_fun_#t~short9; 885#L557-4 SUMMARY for call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557-4 883#L557-5 test_fun_#t~short9 := test_fun_#t~mem8 < 1073741824; 880#L557-7 assume !!test_fun_#t~short9;havoc test_fun_#t~mem7;havoc test_fun_#t~short9;havoc test_fun_#t~mem8;havoc test_fun_#t~mem6; 878#L558 SUMMARY for call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L558 835#L558-1 SUMMARY for call write~int(2 * test_fun_#t~mem10, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L558-1 901#L558-2 havoc test_fun_#t~mem10; 900#L557-9 assume true; 842#L557 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L557 843#L557-1 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557-1 849#L557-2 test_fun_#t~short9 := test_fun_#t~mem6 > test_fun_#t~mem7; 853#L557-3 assume !test_fun_#t~short9; 859#L557-7 [2018-11-10 10:29:47,309 INFO L795 eck$LassoCheckResult]: Loop: 859#L557-7 assume !test_fun_#t~short9;havoc test_fun_#t~mem7;havoc test_fun_#t~short9;havoc test_fun_#t~mem8;havoc test_fun_#t~mem6; 838#L557-10 SUMMARY for call test_fun_#t~mem11 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L557-10 839#L560 SUMMARY for call write~int(test_fun_#t~mem11 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L560 874#L560-1 havoc test_fun_#t~mem11; 871#L555-3 assume true; 855#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 856#L555-1 assume !!(test_fun_#t~mem5 >= 0);havoc test_fun_#t~mem5; 851#L556 SUMMARY for call write~int(1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L556 830#L557-9 assume true; 831#L557 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L557 899#L557-1 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557-1 898#L557-2 test_fun_#t~short9 := test_fun_#t~mem6 > test_fun_#t~mem7; 897#L557-3 assume !test_fun_#t~short9; 859#L557-7 [2018-11-10 10:29:47,309 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:29:47,309 INFO L82 PathProgramCache]: Analyzing trace with hash -1833143579, now seen corresponding path program 1 times [2018-11-10 10:29:47,309 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:29:47,309 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:29:47,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:29:47,310 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:29:47,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:29:47,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:29:47,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:29:47,330 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:29:47,330 INFO L82 PathProgramCache]: Analyzing trace with hash 2059817839, now seen corresponding path program 2 times [2018-11-10 10:29:47,330 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:29:47,331 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:29:47,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:29:47,333 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:29:47,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:29:47,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:29:47,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:29:47,342 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:29:47,342 INFO L82 PathProgramCache]: Analyzing trace with hash 651866891, now seen corresponding path program 1 times [2018-11-10 10:29:47,342 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:29:47,342 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:29:47,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:29:47,343 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 10:29:47,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:29:47,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:29:47,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:29:47,939 WARN L179 SmtUtils]: Spent 451.00 ms on a formula simplification. DAG size of input: 168 DAG size of output: 137 [2018-11-10 10:29:48,046 WARN L179 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 110 [2018-11-10 10:29:48,048 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 10:29:48,048 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 10:29:48,048 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 10:29:48,048 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 10:29:48,048 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 10:29:48,049 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 10:29:48,049 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 10:29:48,049 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 10:29:48,049 INFO L131 ssoRankerPreferences]: Filename of dumped script: c.01-no-inv-alloca_true-termination_true-no-overflow.c.i_Iteration5_Lasso [2018-11-10 10:29:48,049 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 10:29:48,049 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 10:29:48,051 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:29:48,052 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:29:48,055 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:29:48,056 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:29:48,057 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:29:48,058 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:29:48,060 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:29:48,061 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:29:48,062 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:29:48,063 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:29:48,066 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:29:48,067 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:29:48,068 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:29:48,069 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:29:48,071 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:29:48,347 WARN L179 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 102 [2018-11-10 10:29:48,772 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 10:29:48,772 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 10:29:48,772 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:29:48,773 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:29:48,773 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:29:48,773 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:29:48,773 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:29:48,773 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:29:48,773 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 10:29:48,773 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:29:48,774 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:29:48,774 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:29:48,774 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:29:48,774 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:29:48,774 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:29:48,774 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:29:48,774 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:29:48,774 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 10:29:48,774 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:29:48,775 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:29:48,775 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:29:48,775 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:29:48,775 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:29:48,775 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:29:48,775 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:29:48,775 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:29:48,776 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 10:29:48,776 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:29:48,776 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:29:48,776 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:29:48,776 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:29:48,776 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:29:48,777 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:29:48,777 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:29:48,777 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 10:29:48,777 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 10:29:48,778 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:29:48,778 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:29:48,779 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:29:48,779 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:29:48,779 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:29:48,779 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:29:48,779 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:29:48,779 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 10:29:48,779 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:29:48,780 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:29:48,780 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:29:48,780 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:29:48,780 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:29:48,780 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:29:48,781 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:29:48,781 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 10:29:48,781 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 10:29:48,782 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:29:48,782 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:29:48,783 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:29:48,783 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:29:48,783 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:29:48,783 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:29:48,783 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:29:48,783 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 10:29:48,783 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:29:48,784 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:29:48,784 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:29:48,784 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:29:48,784 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:29:48,784 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:29:48,784 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:29:48,785 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 10:29:48,785 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 10:29:48,786 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:29:48,786 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:29:48,786 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:29:48,786 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:29:48,786 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:29:48,787 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:29:48,787 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:29:48,787 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 10:29:48,787 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:29:48,787 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:29:48,787 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:29:48,788 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:29:48,788 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:29:48,788 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:29:48,788 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:29:48,788 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 10:29:48,789 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 10:29:48,790 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:29:48,790 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:29:48,790 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:29:48,790 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:29:48,791 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:29:48,791 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:29:48,791 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 10:29:48,791 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 10:29:48,792 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:29:48,792 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:29:48,793 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:29:48,793 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:29:48,793 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:29:48,793 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:29:48,793 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:29:48,793 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 10:29:48,793 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:29:48,794 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:29:48,794 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:29:48,794 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:29:48,794 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:29:48,794 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:29:48,794 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:29:48,794 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:29:48,795 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 10:29:48,795 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:29:48,795 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:29:48,795 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:29:48,796 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:29:48,796 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:29:48,796 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:29:48,796 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:29:48,796 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 10:29:48,796 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 10:29:48,798 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:29:48,798 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:29:48,798 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:29:48,798 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:29:48,799 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:29:48,799 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:29:48,801 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 10:29:48,801 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 10:29:48,810 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:29:48,810 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:29:48,811 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:29:48,811 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:29:48,811 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:29:48,811 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:29:48,811 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 10:29:48,812 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 10:29:48,812 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:29:48,813 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:29:48,813 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:29:48,813 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:29:48,813 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:29:48,813 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:29:48,814 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 10:29:48,814 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 10:29:48,815 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:29:48,815 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:29:48,816 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:29:48,816 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 10:29:48,816 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:29:48,816 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:29:48,817 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 10:29:48,817 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 10:29:48,819 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:29:48,819 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:29:48,820 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:29:48,820 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 10:29:48,820 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:29:48,820 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:29:48,821 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 10:29:48,821 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 10:29:48,823 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:29:48,823 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:29:48,824 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:29:48,824 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:29:48,824 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:29:48,824 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:29:48,824 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 10:29:48,824 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 10:29:48,825 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:29:48,826 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:29:48,826 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:29:48,826 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:29:48,826 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:29:48,826 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:29:48,827 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 10:29:48,827 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 10:29:48,828 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:29:48,829 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:29:48,829 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:29:48,829 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:29:48,829 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:29:48,829 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:29:48,830 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 10:29:48,830 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 10:29:48,840 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 10:29:48,846 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2018-11-10 10:29:48,847 INFO L444 ModelExtractionUtils]: 18 out of 25 variables were initially zero. Simplification set additionally 5 variables to zero. [2018-11-10 10:29:48,847 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 10:29:48,847 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 10:29:48,848 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 10:29:48,848 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_3) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_3 Supporting invariants [] [2018-11-10 10:29:48,933 INFO L297 tatePredicateManager]: 19 out of 20 supporting invariants were superfluous and have been removed [2018-11-10 10:29:48,934 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 10:29:48,948 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:29:48,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:29:48,960 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:29:48,966 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-10 10:29:48,966 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 10:29:48,969 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:29:48,969 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:6 [2018-11-10 10:29:48,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:29:48,979 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:29:48,993 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:29:48,994 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 29 [2018-11-10 10:29:48,995 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 22 [2018-11-10 10:29:48,996 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:29:48,999 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:29:49,002 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:29:49,003 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:14 [2018-11-10 10:29:49,042 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 29 [2018-11-10 10:29:49,044 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 10:29:49,044 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:29:49,049 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:29:49,054 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:29:49,055 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:28 [2018-11-10 10:29:49,075 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:29:49,075 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 6 loop predicates [2018-11-10 10:29:49,076 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 74 states and 82 transitions. cyclomatic complexity: 11 Second operand 9 states. [2018-11-10 10:29:49,148 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 74 states and 82 transitions. cyclomatic complexity: 11. Second operand 9 states. Result 210 states and 234 transitions. Complement of second has 11 states. [2018-11-10 10:29:49,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2018-11-10 10:29:49,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-10 10:29:49,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 46 transitions. [2018-11-10 10:29:49,149 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 46 transitions. Stem has 25 letters. Loop has 13 letters. [2018-11-10 10:29:49,150 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 10:29:49,150 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 46 transitions. Stem has 38 letters. Loop has 13 letters. [2018-11-10 10:29:49,150 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 10:29:49,150 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 46 transitions. Stem has 25 letters. Loop has 26 letters. [2018-11-10 10:29:49,150 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 10:29:49,150 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 210 states and 234 transitions. [2018-11-10 10:29:49,152 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 29 [2018-11-10 10:29:49,154 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 210 states to 155 states and 171 transitions. [2018-11-10 10:29:49,154 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 60 [2018-11-10 10:29:49,154 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 61 [2018-11-10 10:29:49,154 INFO L73 IsDeterministic]: Start isDeterministic. Operand 155 states and 171 transitions. [2018-11-10 10:29:49,155 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 10:29:49,155 INFO L705 BuchiCegarLoop]: Abstraction has 155 states and 171 transitions. [2018-11-10 10:29:49,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states and 171 transitions. [2018-11-10 10:29:49,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 153. [2018-11-10 10:29:49,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-11-10 10:29:49,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 169 transitions. [2018-11-10 10:29:49,161 INFO L728 BuchiCegarLoop]: Abstraction has 153 states and 169 transitions. [2018-11-10 10:29:49,161 INFO L608 BuchiCegarLoop]: Abstraction has 153 states and 169 transitions. [2018-11-10 10:29:49,161 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-10 10:29:49,162 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 153 states and 169 transitions. [2018-11-10 10:29:49,163 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 29 [2018-11-10 10:29:49,163 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 10:29:49,163 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 10:29:49,163 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] [2018-11-10 10:29:49,164 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:29:49,164 INFO L793 eck$LassoCheckResult]: Stem: 1393#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1386#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet13, main_#t~nondet14, main_#t~ret15;assume { :begin_inline_test_fun } true;test_fun_#in~x, test_fun_#in~y := main_#t~nondet13, main_#t~nondet14;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~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~mem10, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~mem8, test_fun_#t~short9, test_fun_#t~mem11, test_fun_#t~mem5, test_fun_#t~mem12, 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_~c~0.base, test_fun_~c~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;#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~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset; 1387#L552 SUMMARY for call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L552 1397#L552-1 SUMMARY for call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L552-1 1391#L553 SUMMARY for call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); srcloc: L553 1392#L555-3 assume true; 1376#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 1377#L555-1 assume !!(test_fun_#t~mem5 >= 0);havoc test_fun_#t~mem5; 1365#L556 SUMMARY for call write~int(1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L556 1366#L557-9 assume true; 1443#L557 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L557 1442#L557-1 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557-1 1441#L557-2 test_fun_#t~short9 := test_fun_#t~mem6 > test_fun_#t~mem7; 1440#L557-3 assume test_fun_#t~short9; 1439#L557-4 SUMMARY for call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557-4 1438#L557-5 test_fun_#t~short9 := test_fun_#t~mem8 < 1073741824; 1436#L557-7 assume !!test_fun_#t~short9;havoc test_fun_#t~mem7;havoc test_fun_#t~short9;havoc test_fun_#t~mem8;havoc test_fun_#t~mem6; 1432#L558 SUMMARY for call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L558 1430#L558-1 SUMMARY for call write~int(2 * test_fun_#t~mem10, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L558-1 1428#L558-2 havoc test_fun_#t~mem10; 1426#L557-9 assume true; 1424#L557 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L557 1422#L557-1 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557-1 1420#L557-2 test_fun_#t~short9 := test_fun_#t~mem6 > test_fun_#t~mem7; 1417#L557-3 assume test_fun_#t~short9; 1413#L557-4 SUMMARY for call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557-4 1414#L557-5 test_fun_#t~short9 := test_fun_#t~mem8 < 1073741824; 1409#L557-7 assume !test_fun_#t~short9;havoc test_fun_#t~mem7;havoc test_fun_#t~short9;havoc test_fun_#t~mem8;havoc test_fun_#t~mem6; 1356#L557-10 [2018-11-10 10:29:49,164 INFO L795 eck$LassoCheckResult]: Loop: 1356#L557-10 SUMMARY for call test_fun_#t~mem11 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L557-10 1357#L560 SUMMARY for call write~int(test_fun_#t~mem11 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L560 1403#L560-1 havoc test_fun_#t~mem11; 1406#L555-3 assume true; 1434#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 1383#L555-1 assume !!(test_fun_#t~mem5 >= 0);havoc test_fun_#t~mem5; 1384#L556 SUMMARY for call write~int(1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L556 1427#L557-9 assume true; 1425#L557 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L557 1423#L557-1 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557-1 1421#L557-2 test_fun_#t~short9 := test_fun_#t~mem6 > test_fun_#t~mem7; 1418#L557-3 assume test_fun_#t~short9; 1416#L557-4 SUMMARY for call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557-4 1411#L557-5 test_fun_#t~short9 := test_fun_#t~mem8 < 1073741824; 1412#L557-7 assume !test_fun_#t~short9;havoc test_fun_#t~mem7;havoc test_fun_#t~short9;havoc test_fun_#t~mem8;havoc test_fun_#t~mem6; 1356#L557-10 [2018-11-10 10:29:49,164 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:29:49,164 INFO L82 PathProgramCache]: Analyzing trace with hash -671283678, now seen corresponding path program 1 times [2018-11-10 10:29:49,164 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:29:49,164 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:29:49,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:29:49,165 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:29:49,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:29:49,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:29:49,235 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:29:49,235 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 10:29:49,235 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_90d8d520-a9ba-40ca-8940-35d04161bf04/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 10:29:49,250 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:29:49,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:29:49,273 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:29:49,280 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-10 10:29:49,282 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 10:29:49,282 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:29:49,287 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:29:49,288 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:29:49,289 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2018-11-10 10:29:49,303 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:29:49,303 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 29 [2018-11-10 10:29:49,306 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 19 [2018-11-10 10:29:49,306 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:29:49,311 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:29:49,314 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:29:49,315 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:13 [2018-11-10 10:29:49,333 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-11-10 10:29:49,335 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-11-10 10:29:49,336 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:29:49,337 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:29:49,339 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:29:49,340 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:20, output treesize:9 [2018-11-10 10:29:49,348 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:29:49,374 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 10:29:49,374 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 9 [2018-11-10 10:29:49,374 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 10:29:49,374 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:29:49,375 INFO L82 PathProgramCache]: Analyzing trace with hash 1170910682, now seen corresponding path program 1 times [2018-11-10 10:29:49,375 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:29:49,375 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:29:49,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:29:49,376 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:29:49,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:29:49,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:29:49,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:29:49,410 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:29:49,410 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-10 10:29:49,411 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 10:29:49,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 10:29:49,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-11-10 10:29:49,411 INFO L87 Difference]: Start difference. First operand 153 states and 169 transitions. cyclomatic complexity: 23 Second operand 7 states. [2018-11-10 10:29:49,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:29:49,476 INFO L93 Difference]: Finished difference Result 187 states and 202 transitions. [2018-11-10 10:29:49,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 10:29:49,477 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 187 states and 202 transitions. [2018-11-10 10:29:49,478 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 39 [2018-11-10 10:29:49,479 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 187 states to 181 states and 196 transitions. [2018-11-10 10:29:49,479 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 81 [2018-11-10 10:29:49,479 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 81 [2018-11-10 10:29:49,480 INFO L73 IsDeterministic]: Start isDeterministic. Operand 181 states and 196 transitions. [2018-11-10 10:29:49,480 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 10:29:49,480 INFO L705 BuchiCegarLoop]: Abstraction has 181 states and 196 transitions. [2018-11-10 10:29:49,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states and 196 transitions. [2018-11-10 10:29:49,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 151. [2018-11-10 10:29:49,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-11-10 10:29:49,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 166 transitions. [2018-11-10 10:29:49,487 INFO L728 BuchiCegarLoop]: Abstraction has 151 states and 166 transitions. [2018-11-10 10:29:49,487 INFO L608 BuchiCegarLoop]: Abstraction has 151 states and 166 transitions. [2018-11-10 10:29:49,487 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-10 10:29:49,487 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 151 states and 166 transitions. [2018-11-10 10:29:49,488 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 37 [2018-11-10 10:29:49,488 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 10:29:49,488 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 10:29:49,489 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] [2018-11-10 10:29:49,489 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] [2018-11-10 10:29:49,489 INFO L793 eck$LassoCheckResult]: Stem: 1836#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1828#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet13, main_#t~nondet14, main_#t~ret15;assume { :begin_inline_test_fun } true;test_fun_#in~x, test_fun_#in~y := main_#t~nondet13, main_#t~nondet14;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~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~mem10, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~mem8, test_fun_#t~short9, test_fun_#t~mem11, test_fun_#t~mem5, test_fun_#t~mem12, 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_~c~0.base, test_fun_~c~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;#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~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset; 1829#L552 SUMMARY for call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L552 1837#L552-1 SUMMARY for call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L552-1 1830#L553 SUMMARY for call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); srcloc: L553 1831#L555-3 assume true; 1817#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 1818#L555-1 assume !!(test_fun_#t~mem5 >= 0);havoc test_fun_#t~mem5; 1891#L556 SUMMARY for call write~int(1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L556 1889#L557-9 assume true; 1887#L557 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L557 1885#L557-1 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557-1 1883#L557-2 test_fun_#t~short9 := test_fun_#t~mem6 > test_fun_#t~mem7; 1881#L557-3 assume test_fun_#t~short9; 1879#L557-4 SUMMARY for call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557-4 1878#L557-5 test_fun_#t~short9 := test_fun_#t~mem8 < 1073741824; 1877#L557-7 assume !!test_fun_#t~short9;havoc test_fun_#t~mem7;havoc test_fun_#t~short9;havoc test_fun_#t~mem8;havoc test_fun_#t~mem6; 1875#L558 SUMMARY for call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L558 1872#L558-1 SUMMARY for call write~int(2 * test_fun_#t~mem10, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L558-1 1870#L558-2 havoc test_fun_#t~mem10; 1868#L557-9 assume true; 1866#L557 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L557 1864#L557-1 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557-1 1862#L557-2 test_fun_#t~short9 := test_fun_#t~mem6 > test_fun_#t~mem7; 1860#L557-3 assume test_fun_#t~short9; 1855#L557-4 SUMMARY for call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557-4 1856#L557-5 test_fun_#t~short9 := test_fun_#t~mem8 < 1073741824; 1851#L557-7 assume !test_fun_#t~short9;havoc test_fun_#t~mem7;havoc test_fun_#t~short9;havoc test_fun_#t~mem8;havoc test_fun_#t~mem6; 1799#L557-10 [2018-11-10 10:29:49,489 INFO L795 eck$LassoCheckResult]: Loop: 1799#L557-10 SUMMARY for call test_fun_#t~mem11 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L557-10 1800#L560 SUMMARY for call write~int(test_fun_#t~mem11 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L560 1845#L560-1 havoc test_fun_#t~mem11; 1848#L555-3 assume true; 1852#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 1824#L555-1 assume !!(test_fun_#t~mem5 >= 0);havoc test_fun_#t~mem5; 1807#L556 SUMMARY for call write~int(1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L556 1808#L557-9 assume true; 1890#L557 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L557 1888#L557-1 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557-1 1886#L557-2 test_fun_#t~short9 := test_fun_#t~mem6 > test_fun_#t~mem7; 1884#L557-3 assume test_fun_#t~short9; 1882#L557-4 SUMMARY for call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557-4 1880#L557-5 test_fun_#t~short9 := test_fun_#t~mem8 < 1073741824; 1876#L557-7 assume !!test_fun_#t~short9;havoc test_fun_#t~mem7;havoc test_fun_#t~short9;havoc test_fun_#t~mem8;havoc test_fun_#t~mem6; 1873#L558 SUMMARY for call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L558 1871#L558-1 SUMMARY for call write~int(2 * test_fun_#t~mem10, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L558-1 1869#L558-2 havoc test_fun_#t~mem10; 1867#L557-9 assume true; 1865#L557 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L557 1863#L557-1 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557-1 1861#L557-2 test_fun_#t~short9 := test_fun_#t~mem6 > test_fun_#t~mem7; 1859#L557-3 assume test_fun_#t~short9; 1858#L557-4 SUMMARY for call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557-4 1853#L557-5 test_fun_#t~short9 := test_fun_#t~mem8 < 1073741824; 1854#L557-7 assume !test_fun_#t~short9;havoc test_fun_#t~mem7;havoc test_fun_#t~short9;havoc test_fun_#t~mem8;havoc test_fun_#t~mem6; 1799#L557-10 [2018-11-10 10:29:49,489 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:29:49,490 INFO L82 PathProgramCache]: Analyzing trace with hash -671283678, now seen corresponding path program 2 times [2018-11-10 10:29:49,490 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:29:49,490 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:29:49,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:29:49,490 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:29:49,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:29:49,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:29:49,552 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:29:49,552 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 10:29:49,552 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_90d8d520-a9ba-40ca-8940-35d04161bf04/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 10:29:49,561 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-10 10:29:49,582 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-10 10:29:49,582 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 10:29:49,584 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:29:49,599 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-10 10:29:49,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-11-10 10:29:49,601 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:29:49,602 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:29:49,603 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:29:49,604 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2018-11-10 10:29:49,613 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:29:49,614 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 29 [2018-11-10 10:29:49,620 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 19 [2018-11-10 10:29:49,620 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:29:49,623 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:29:49,626 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:29:49,627 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:13 [2018-11-10 10:29:49,641 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-11-10 10:29:49,643 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-11-10 10:29:49,643 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:29:49,644 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:29:49,646 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:29:49,647 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:20, output treesize:9 [2018-11-10 10:29:49,653 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:29:49,669 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 10:29:49,669 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 9 [2018-11-10 10:29:49,669 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 10:29:49,669 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:29:49,669 INFO L82 PathProgramCache]: Analyzing trace with hash -885930314, now seen corresponding path program 1 times [2018-11-10 10:29:49,669 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:29:49,669 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:29:49,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:29:49,670 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 10:29:49,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:29:49,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:29:49,734 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:29:49,734 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 10:29:49,734 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_90d8d520-a9ba-40ca-8940-35d04161bf04/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 10:29:49,743 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:29:49,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:29:49,751 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:29:49,754 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-10 10:29:49,757 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 10:29:49,757 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:29:49,759 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:29:49,767 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:29:49,767 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2018-11-10 10:29:49,778 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:29:49,779 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 29 [2018-11-10 10:29:49,782 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 19 [2018-11-10 10:29:49,782 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:29:49,786 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:29:49,789 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:29:49,789 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:13 [2018-11-10 10:29:49,805 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-11-10 10:29:49,807 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-11-10 10:29:49,807 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:29:49,809 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:29:49,812 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:29:49,812 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:20, output treesize:9 [2018-11-10 10:29:49,819 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:29:49,835 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 10:29:49,835 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 9 [2018-11-10 10:29:49,835 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 10:29:49,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-10 10:29:49,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2018-11-10 10:29:49,836 INFO L87 Difference]: Start difference. First operand 151 states and 166 transitions. cyclomatic complexity: 21 Second operand 10 states. [2018-11-10 10:29:50,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:29:50,002 INFO L93 Difference]: Finished difference Result 252 states and 271 transitions. [2018-11-10 10:29:50,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-10 10:29:50,003 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 252 states and 271 transitions. [2018-11-10 10:29:50,005 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 50 [2018-11-10 10:29:50,006 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 252 states to 252 states and 271 transitions. [2018-11-10 10:29:50,006 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 114 [2018-11-10 10:29:50,006 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 114 [2018-11-10 10:29:50,006 INFO L73 IsDeterministic]: Start isDeterministic. Operand 252 states and 271 transitions. [2018-11-10 10:29:50,007 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 10:29:50,007 INFO L705 BuchiCegarLoop]: Abstraction has 252 states and 271 transitions. [2018-11-10 10:29:50,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states and 271 transitions. [2018-11-10 10:29:50,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 193. [2018-11-10 10:29:50,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2018-11-10 10:29:50,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 212 transitions. [2018-11-10 10:29:50,013 INFO L728 BuchiCegarLoop]: Abstraction has 193 states and 212 transitions. [2018-11-10 10:29:50,013 INFO L608 BuchiCegarLoop]: Abstraction has 193 states and 212 transitions. [2018-11-10 10:29:50,013 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-10 10:29:50,013 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 193 states and 212 transitions. [2018-11-10 10:29:50,014 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 48 [2018-11-10 10:29:50,014 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 10:29:50,014 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 10:29:50,014 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] [2018-11-10 10:29:50,014 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:29:50,015 INFO L793 eck$LassoCheckResult]: Stem: 2431#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2423#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet13, main_#t~nondet14, main_#t~ret15;assume { :begin_inline_test_fun } true;test_fun_#in~x, test_fun_#in~y := main_#t~nondet13, main_#t~nondet14;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~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~mem10, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~mem8, test_fun_#t~short9, test_fun_#t~mem11, test_fun_#t~mem5, test_fun_#t~mem12, 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_~c~0.base, test_fun_~c~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;#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~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset; 2424#L552 SUMMARY for call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L552 2432#L552-1 SUMMARY for call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L552-1 2425#L553 SUMMARY for call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); srcloc: L553 2426#L555-3 assume true; 2410#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 2411#L555-1 assume !!(test_fun_#t~mem5 >= 0);havoc test_fun_#t~mem5; 2403#L556 SUMMARY for call write~int(1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L556 2404#L557-9 assume true; 2517#L557 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L557 2516#L557-1 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557-1 2515#L557-2 test_fun_#t~short9 := test_fun_#t~mem6 > test_fun_#t~mem7; 2514#L557-3 assume test_fun_#t~short9; 2513#L557-4 SUMMARY for call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557-4 2512#L557-5 test_fun_#t~short9 := test_fun_#t~mem8 < 1073741824; 2511#L557-7 assume !!test_fun_#t~short9;havoc test_fun_#t~mem7;havoc test_fun_#t~short9;havoc test_fun_#t~mem8;havoc test_fun_#t~mem6; 2509#L558 SUMMARY for call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L558 2510#L558-1 SUMMARY for call write~int(2 * test_fun_#t~mem10, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L558-1 2528#L558-2 havoc test_fun_#t~mem10; 2526#L557-9 assume true; 2525#L557 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L557 2407#L557-1 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557-1 2408#L557-2 test_fun_#t~short9 := test_fun_#t~mem6 > test_fun_#t~mem7; 2414#L557-3 assume !test_fun_#t~short9; 2420#L557-7 assume !test_fun_#t~short9;havoc test_fun_#t~mem7;havoc test_fun_#t~short9;havoc test_fun_#t~mem8;havoc test_fun_#t~mem6; 2397#L557-10 SUMMARY for call test_fun_#t~mem11 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L557-10 2398#L560 SUMMARY for call write~int(test_fun_#t~mem11 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L560 2440#L560-1 havoc test_fun_#t~mem11; 2435#L555-3 assume true; 2412#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 2413#L555-1 assume !!(test_fun_#t~mem5 >= 0);havoc test_fun_#t~mem5; 2405#L556 SUMMARY for call write~int(1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L556 2387#L557-9 [2018-11-10 10:29:50,015 INFO L795 eck$LassoCheckResult]: Loop: 2387#L557-9 assume true; 2388#L557 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L557 2399#L557-1 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557-1 2520#L557-2 test_fun_#t~short9 := test_fun_#t~mem6 > test_fun_#t~mem7; 2519#L557-3 assume test_fun_#t~short9; 2427#L557-4 SUMMARY for call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557-4 2428#L557-5 test_fun_#t~short9 := test_fun_#t~mem8 < 1073741824; 2436#L557-7 assume !!test_fun_#t~short9;havoc test_fun_#t~mem7;havoc test_fun_#t~short9;havoc test_fun_#t~mem8;havoc test_fun_#t~mem6; 2391#L558 SUMMARY for call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L558 2392#L558-1 SUMMARY for call write~int(2 * test_fun_#t~mem10, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L558-1 2401#L558-2 havoc test_fun_#t~mem10; 2387#L557-9 [2018-11-10 10:29:50,019 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:29:50,019 INFO L82 PathProgramCache]: Analyzing trace with hash 1788737426, now seen corresponding path program 2 times [2018-11-10 10:29:50,019 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:29:50,019 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:29:50,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:29:50,020 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:29:50,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:29:50,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:29:50,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:29:50,038 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:29:50,038 INFO L82 PathProgramCache]: Analyzing trace with hash 953738907, now seen corresponding path program 2 times [2018-11-10 10:29:50,038 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:29:50,038 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:29:50,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:29:50,039 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 10:29:50,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:29:50,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:29:50,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:29:50,049 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:29:50,049 INFO L82 PathProgramCache]: Analyzing trace with hash -1136051606, now seen corresponding path program 3 times [2018-11-10 10:29:50,049 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:29:50,049 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:29:50,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:29:50,050 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 10:29:50,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:29:50,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:29:50,216 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 15 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:29:50,217 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 10:29:50,217 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_90d8d520-a9ba-40ca-8940-35d04161bf04/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 10:29:50,223 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-10 10:29:50,251 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-10 10:29:50,251 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 10:29:50,255 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:29:50,264 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-10 10:29:50,264 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 10:29:50,265 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:29:50,265 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:8, output treesize:4 [2018-11-10 10:29:50,270 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-10 10:29:50,271 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 10:29:50,272 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:29:50,273 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:29:50,275 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:29:50,275 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:16, output treesize:12 [2018-11-10 10:29:50,294 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:29:50,294 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 29 [2018-11-10 10:29:50,297 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 19 [2018-11-10 10:29:50,297 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:29:50,302 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:29:50,306 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:29:50,307 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:17 [2018-11-10 10:29:50,483 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:29:50,484 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 46 [2018-11-10 10:29:50,486 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 26 [2018-11-10 10:29:50,487 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:29:50,493 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:29:50,499 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:29:50,499 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:48, output treesize:30 [2018-11-10 10:29:50,530 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:29:50,530 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 37 [2018-11-10 10:29:50,532 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 25 [2018-11-10 10:29:50,533 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:29:50,536 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:29:50,541 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:29:50,541 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:26 [2018-11-10 10:29:50,583 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 25 [2018-11-10 10:29:50,586 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-10 10:29:50,586 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:29:50,592 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-11-10 10:29:50,592 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 10:29:50,594 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:29:50,597 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:29:50,597 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:33, output treesize:7 [2018-11-10 10:29:50,613 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 13 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:29:50,629 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 10:29:50,629 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 26 [2018-11-10 10:29:50,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-11-10 10:29:50,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=542, Unknown=0, NotChecked=0, Total=650 [2018-11-10 10:29:50,682 INFO L87 Difference]: Start difference. First operand 193 states and 212 transitions. cyclomatic complexity: 25 Second operand 26 states. [2018-11-10 10:29:51,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:29:51,202 INFO L93 Difference]: Finished difference Result 238 states and 253 transitions. [2018-11-10 10:29:51,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-11-10 10:29:51,203 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 238 states and 253 transitions. [2018-11-10 10:29:51,204 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 50 [2018-11-10 10:29:51,205 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 238 states to 167 states and 175 transitions. [2018-11-10 10:29:51,205 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 104 [2018-11-10 10:29:51,205 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 104 [2018-11-10 10:29:51,205 INFO L73 IsDeterministic]: Start isDeterministic. Operand 167 states and 175 transitions. [2018-11-10 10:29:51,205 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 10:29:51,206 INFO L705 BuchiCegarLoop]: Abstraction has 167 states and 175 transitions. [2018-11-10 10:29:51,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states and 175 transitions. [2018-11-10 10:29:51,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 136. [2018-11-10 10:29:51,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-11-10 10:29:51,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 144 transitions. [2018-11-10 10:29:51,209 INFO L728 BuchiCegarLoop]: Abstraction has 136 states and 144 transitions. [2018-11-10 10:29:51,209 INFO L608 BuchiCegarLoop]: Abstraction has 136 states and 144 transitions. [2018-11-10 10:29:51,209 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-11-10 10:29:51,209 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 136 states and 144 transitions. [2018-11-10 10:29:51,210 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 48 [2018-11-10 10:29:51,210 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 10:29:51,210 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 10:29:51,211 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:29:51,211 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:29:51,211 INFO L793 eck$LassoCheckResult]: Stem: 3055#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 3049#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet13, main_#t~nondet14, main_#t~ret15;assume { :begin_inline_test_fun } true;test_fun_#in~x, test_fun_#in~y := main_#t~nondet13, main_#t~nondet14;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~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~mem10, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~mem8, test_fun_#t~short9, test_fun_#t~mem11, test_fun_#t~mem5, test_fun_#t~mem12, 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_~c~0.base, test_fun_~c~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;#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~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset; 3050#L552 SUMMARY for call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L552 3059#L552-1 SUMMARY for call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L552-1 3053#L553 SUMMARY for call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); srcloc: L553 3054#L555-3 assume true; 3042#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 assume !!(test_fun_#t~mem5 >= 0);havoc test_fun_#t~mem5; 3048#L556 SUMMARY for call write~int(1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L556 3123#L557-9 assume true; 3122#L557 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L557 3120#L557-1 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557-1 3118#L557-2 test_fun_#t~short9 := test_fun_#t~mem6 > test_fun_#t~mem7; 3116#L557-3 assume test_fun_#t~short9; 3114#L557-4 SUMMARY for call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557-4 3112#L557-5 test_fun_#t~short9 := test_fun_#t~mem8 < 1073741824; 3110#L557-7 assume !!test_fun_#t~short9;havoc test_fun_#t~mem7;havoc test_fun_#t~short9;havoc test_fun_#t~mem8;havoc test_fun_#t~mem6; 3109#L558 SUMMARY for call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L558 3029#L558-1 SUMMARY for call write~int(2 * test_fun_#t~mem10, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L558-1 3030#L558-2 havoc test_fun_#t~mem10; 3018#L557-9 assume true; 3019#L557 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L557 3108#L557-1 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557-1 3107#L557-2 test_fun_#t~short9 := test_fun_#t~mem6 > test_fun_#t~mem7; 3105#L557-3 assume test_fun_#t~short9; 3102#L557-4 SUMMARY for call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557-4 3082#L557-5 test_fun_#t~short9 := test_fun_#t~mem8 < 1073741824; 3099#L557-7 assume !!test_fun_#t~short9;havoc test_fun_#t~mem7;havoc test_fun_#t~short9;havoc test_fun_#t~mem8;havoc test_fun_#t~mem6; 3097#L558 SUMMARY for call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L558 3095#L558-1 SUMMARY for call write~int(2 * test_fun_#t~mem10, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L558-1 3093#L558-2 havoc test_fun_#t~mem10; 3091#L557-9 assume true; 3090#L557 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L557 3089#L557-1 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557-1 3087#L557-2 test_fun_#t~short9 := test_fun_#t~mem6 > test_fun_#t~mem7; 3085#L557-3 assume test_fun_#t~short9; 3081#L557-4 SUMMARY for call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557-4 3078#L557-5 test_fun_#t~short9 := test_fun_#t~mem8 < 1073741824; 3079#L557-7 assume !test_fun_#t~short9;havoc test_fun_#t~mem7;havoc test_fun_#t~short9;havoc test_fun_#t~mem8;havoc test_fun_#t~mem6; 3024#L557-10 [2018-11-10 10:29:51,211 INFO L795 eck$LassoCheckResult]: Loop: 3024#L557-10 SUMMARY for call test_fun_#t~mem11 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L557-10 3025#L560 SUMMARY for call write~int(test_fun_#t~mem11 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L560 3060#L560-1 havoc test_fun_#t~mem11; 3062#L555-3 assume true; 3127#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 3126#L555-1 assume !!(test_fun_#t~mem5 >= 0);havoc test_fun_#t~mem5; 3036#L556 SUMMARY for call write~int(1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L556 3037#L557-9 assume true; 3151#L557 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L557 3150#L557-1 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557-1 3149#L557-2 test_fun_#t~short9 := test_fun_#t~mem6 > test_fun_#t~mem7; 3148#L557-3 assume test_fun_#t~short9; 3147#L557-4 SUMMARY for call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557-4 3146#L557-5 test_fun_#t~short9 := test_fun_#t~mem8 < 1073741824; 3145#L557-7 assume !!test_fun_#t~short9;havoc test_fun_#t~mem7;havoc test_fun_#t~short9;havoc test_fun_#t~mem8;havoc test_fun_#t~mem6; 3144#L558 SUMMARY for call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L558 3143#L558-1 SUMMARY for call write~int(2 * test_fun_#t~mem10, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L558-1 3142#L558-2 havoc test_fun_#t~mem10; 3141#L557-9 assume true; 3140#L557 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L557 3139#L557-1 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557-1 3138#L557-2 test_fun_#t~short9 := test_fun_#t~mem6 > test_fun_#t~mem7; 3137#L557-3 assume test_fun_#t~short9; 3136#L557-4 SUMMARY for call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557-4 3135#L557-5 test_fun_#t~short9 := test_fun_#t~mem8 < 1073741824; 3134#L557-7 assume !!test_fun_#t~short9;havoc test_fun_#t~mem7;havoc test_fun_#t~short9;havoc test_fun_#t~mem8;havoc test_fun_#t~mem6; 3064#L558 SUMMARY for call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L558 3131#L558-1 SUMMARY for call write~int(2 * test_fun_#t~mem10, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L558-1 3130#L558-2 havoc test_fun_#t~mem10; 3129#L557-9 assume true; 3128#L557 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L557 3125#L557-1 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557-1 3124#L557-2 test_fun_#t~short9 := test_fun_#t~mem6 > test_fun_#t~mem7; 3086#L557-3 assume test_fun_#t~short9; 3083#L557-4 SUMMARY for call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557-4 3084#L557-5 test_fun_#t~short9 := test_fun_#t~mem8 < 1073741824; 3063#L557-7 assume !test_fun_#t~short9;havoc test_fun_#t~mem7;havoc test_fun_#t~short9;havoc test_fun_#t~mem8;havoc test_fun_#t~mem6; 3024#L557-10 [2018-11-10 10:29:51,211 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:29:51,212 INFO L82 PathProgramCache]: Analyzing trace with hash -2138115730, now seen corresponding path program 3 times [2018-11-10 10:29:51,212 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:29:51,212 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:29:51,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:29:51,220 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 10:29:51,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:29:51,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:29:51,304 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:29:51,304 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 10:29:51,304 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_90d8d520-a9ba-40ca-8940-35d04161bf04/bin-2019/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 10:29:51,311 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-10 10:29:51,329 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-10 10:29:51,329 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 10:29:51,331 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:29:51,336 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-10 10:29:51,339 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 10:29:51,340 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:29:51,341 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:29:51,342 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:29:51,342 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2018-11-10 10:29:51,352 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:29:51,353 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 29 [2018-11-10 10:29:51,355 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 19 [2018-11-10 10:29:51,355 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:29:51,361 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:29:51,365 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:29:51,365 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:13 [2018-11-10 10:29:51,411 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 23 [2018-11-10 10:29:51,421 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-11-10 10:29:51,421 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:29:51,425 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:29:51,428 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-10 10:29:51,429 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:33, output treesize:18 [2018-11-10 10:29:51,446 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-11-10 10:29:51,448 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-11-10 10:29:51,448 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:29:51,451 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:29:51,454 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-10 10:29:51,454 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:25, output treesize:14 [2018-11-10 10:29:51,465 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:29:51,482 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 10:29:51,482 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 14 [2018-11-10 10:29:51,483 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 10:29:51,483 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:29:51,483 INFO L82 PathProgramCache]: Analyzing trace with hash -208286630, now seen corresponding path program 2 times [2018-11-10 10:29:51,483 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:29:51,483 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:29:51,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:29:51,484 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 10:29:51,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:29:51,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:29:51,542 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:29:51,542 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 10:29:51,542 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_90d8d520-a9ba-40ca-8940-35d04161bf04/bin-2019/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 10:29:51,556 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-10 10:29:51,568 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-10 10:29:51,568 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 10:29:51,569 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:29:51,595 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-10 10:29:51,597 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 10:29:51,597 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:29:51,612 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:29:51,613 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:29:51,613 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2018-11-10 10:29:51,624 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:29:51,625 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 29 [2018-11-10 10:29:51,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, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 19 [2018-11-10 10:29:51,627 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:29:51,634 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:29:51,637 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:29:51,637 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:13 [2018-11-10 10:29:51,671 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 23 [2018-11-10 10:29:51,673 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-11-10 10:29:51,673 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:29:51,680 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:29:51,684 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-10 10:29:51,684 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:33, output treesize:18 [2018-11-10 10:29:51,702 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-11-10 10:29:51,703 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-11-10 10:29:51,704 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:29:51,705 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:29:51,708 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-10 10:29:51,709 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:25, output treesize:14 [2018-11-10 10:29:51,719 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:29:51,745 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 10:29:51,745 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 14 [2018-11-10 10:29:51,745 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 10:29:51,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-10 10:29:51,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2018-11-10 10:29:51,746 INFO L87 Difference]: Start difference. First operand 136 states and 144 transitions. cyclomatic complexity: 12 Second operand 15 states. [2018-11-10 10:29:51,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:29:51,987 INFO L93 Difference]: Finished difference Result 225 states and 236 transitions. [2018-11-10 10:29:51,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-10 10:29:51,987 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 225 states and 236 transitions. [2018-11-10 10:29:51,988 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 61 [2018-11-10 10:29:51,988 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 225 states to 225 states and 236 transitions. [2018-11-10 10:29:51,989 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 137 [2018-11-10 10:29:51,989 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 137 [2018-11-10 10:29:51,989 INFO L73 IsDeterministic]: Start isDeterministic. Operand 225 states and 236 transitions. [2018-11-10 10:29:51,989 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 10:29:51,989 INFO L705 BuchiCegarLoop]: Abstraction has 225 states and 236 transitions. [2018-11-10 10:29:51,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states and 236 transitions. [2018-11-10 10:29:51,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 169. [2018-11-10 10:29:51,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2018-11-10 10:29:51,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 180 transitions. [2018-11-10 10:29:51,991 INFO L728 BuchiCegarLoop]: Abstraction has 169 states and 180 transitions. [2018-11-10 10:29:51,991 INFO L608 BuchiCegarLoop]: Abstraction has 169 states and 180 transitions. [2018-11-10 10:29:51,992 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-11-10 10:29:51,992 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 169 states and 180 transitions. [2018-11-10 10:29:51,992 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 59 [2018-11-10 10:29:51,992 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 10:29:51,992 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 10:29:51,993 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:29:51,993 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:29:51,993 INFO L793 eck$LassoCheckResult]: Stem: 3694#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 3687#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet13, main_#t~nondet14, main_#t~ret15;assume { :begin_inline_test_fun } true;test_fun_#in~x, test_fun_#in~y := main_#t~nondet13, main_#t~nondet14;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~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~mem10, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~mem8, test_fun_#t~short9, test_fun_#t~mem11, test_fun_#t~mem5, test_fun_#t~mem12, 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_~c~0.base, test_fun_~c~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;#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~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset; 3688#L552 SUMMARY for call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L552 3697#L552-1 SUMMARY for call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L552-1 3692#L553 SUMMARY for call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); srcloc: L553 3693#L555-3 assume true; 3679#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 3680#L555-1 assume !!(test_fun_#t~mem5 >= 0);havoc test_fun_#t~mem5; 3674#L556 SUMMARY for call write~int(1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L556 3675#L557-9 assume true; 3790#L557 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L557 3789#L557-1 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557-1 3788#L557-2 test_fun_#t~short9 := test_fun_#t~mem6 > test_fun_#t~mem7; 3787#L557-3 assume test_fun_#t~short9; 3786#L557-4 SUMMARY for call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557-4 3785#L557-5 test_fun_#t~short9 := test_fun_#t~mem8 < 1073741824; 3784#L557-7 assume !!test_fun_#t~short9;havoc test_fun_#t~mem7;havoc test_fun_#t~short9;havoc test_fun_#t~mem8;havoc test_fun_#t~mem6; 3783#L558 SUMMARY for call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L558 3782#L558-1 SUMMARY for call write~int(2 * test_fun_#t~mem10, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L558-1 3781#L558-2 havoc test_fun_#t~mem10; 3780#L557-9 assume true; 3779#L557 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L557 3778#L557-1 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557-1 3777#L557-2 test_fun_#t~short9 := test_fun_#t~mem6 > test_fun_#t~mem7; 3776#L557-3 assume test_fun_#t~short9; 3775#L557-4 SUMMARY for call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557-4 3764#L557-5 test_fun_#t~short9 := test_fun_#t~mem8 < 1073741824; 3822#L557-7 assume !!test_fun_#t~short9;havoc test_fun_#t~mem7;havoc test_fun_#t~short9;havoc test_fun_#t~mem8;havoc test_fun_#t~mem6; 3704#L558 SUMMARY for call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L558 3794#L558-1 SUMMARY for call write~int(2 * test_fun_#t~mem10, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L558-1 3793#L558-2 havoc test_fun_#t~mem10; 3792#L557-9 assume true; 3791#L557 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L557 3762#L557-1 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557-1 3761#L557-2 test_fun_#t~short9 := test_fun_#t~mem6 > test_fun_#t~mem7; 3727#L557-3 assume !test_fun_#t~short9; 3707#L557-7 assume !test_fun_#t~short9;havoc test_fun_#t~mem7;havoc test_fun_#t~short9;havoc test_fun_#t~mem8;havoc test_fun_#t~mem6; 3664#L557-10 SUMMARY for call test_fun_#t~mem11 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L557-10 3665#L560 SUMMARY for call write~int(test_fun_#t~mem11 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L560 3702#L560-1 havoc test_fun_#t~mem11; 3700#L555-3 assume true; 3681#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 3682#L555-1 assume !!(test_fun_#t~mem5 >= 0);havoc test_fun_#t~mem5; 3676#L556 SUMMARY for call write~int(1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L556 3654#L557-9 [2018-11-10 10:29:51,993 INFO L795 eck$LassoCheckResult]: Loop: 3654#L557-9 assume true; 3655#L557 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L557 3666#L557-1 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557-1 3671#L557-2 test_fun_#t~short9 := test_fun_#t~mem6 > test_fun_#t~mem7; 3677#L557-3 assume test_fun_#t~short9; 3683#L557-4 SUMMARY for call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557-4 3689#L557-5 test_fun_#t~short9 := test_fun_#t~mem8 < 1073741824; 3695#L557-7 assume !!test_fun_#t~short9;havoc test_fun_#t~mem7;havoc test_fun_#t~short9;havoc test_fun_#t~mem8;havoc test_fun_#t~mem6; 3658#L558 SUMMARY for call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L558 3659#L558-1 SUMMARY for call write~int(2 * test_fun_#t~mem10, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L558-1 3668#L558-2 havoc test_fun_#t~mem10; 3654#L557-9 [2018-11-10 10:29:51,994 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:29:51,994 INFO L82 PathProgramCache]: Analyzing trace with hash -113820730, now seen corresponding path program 4 times [2018-11-10 10:29:51,994 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:29:51,994 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:29:51,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:29:51,995 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 10:29:51,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:29:52,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:29:52,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:29:52,020 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:29:52,020 INFO L82 PathProgramCache]: Analyzing trace with hash 953738907, now seen corresponding path program 3 times [2018-11-10 10:29:52,020 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:29:52,020 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:29:52,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:29:52,021 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 10:29:52,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:29:52,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:29:52,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:29:52,027 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:29:52,027 INFO L82 PathProgramCache]: Analyzing trace with hash 68357558, now seen corresponding path program 5 times [2018-11-10 10:29:52,027 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:29:52,027 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:29:52,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:29:52,028 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 10:29:52,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:29:52,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:29:52,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:29:53,390 WARN L179 SmtUtils]: Spent 1.26 s on a formula simplification. DAG size of input: 217 DAG size of output: 170 [2018-11-10 10:29:53,534 WARN L179 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 105 [2018-11-10 10:29:53,536 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 10:29:53,536 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 10:29:53,536 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 10:29:53,536 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 10:29:53,536 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 10:29:53,536 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 10:29:53,536 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 10:29:53,536 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 10:29:53,536 INFO L131 ssoRankerPreferences]: Filename of dumped script: c.01-no-inv-alloca_true-termination_true-no-overflow.c.i_Iteration10_Lasso [2018-11-10 10:29:53,536 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 10:29:53,537 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 10:29:53,538 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:29:53,539 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:29:53,540 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:29:53,542 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:29:53,543 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:29:53,776 WARN L179 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 99 [2018-11-10 10:29:53,832 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:29:53,833 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:29:53,834 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:29:53,835 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:29:53,836 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:29:53,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-11-10 10:29:53,838 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:29:53,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-11-10 10:29:53,841 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:29:53,842 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:29:53,843 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:29:53,844 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 10:29:54,159 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 10:29:54,159 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 10:29:54,160 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:29:54,160 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:29:54,160 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:29:54,160 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:29:54,160 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:29:54,160 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:29:54,161 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 10:29:54,161 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:29:54,161 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:29:54,161 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:29:54,161 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:29:54,161 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:29:54,161 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:29:54,162 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:29:54,162 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:29:54,162 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 10:29:54,162 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:29:54,162 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:29:54,162 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:29:54,162 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:29:54,162 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:29:54,162 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:29:54,162 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:29:54,163 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 10:29:54,163 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 10:29:54,164 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:29:54,164 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:29:54,164 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:29:54,164 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:29:54,164 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:29:54,164 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:29:54,165 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 10:29:54,165 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 10:29:54,165 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:29:54,166 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:29:54,166 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:29:54,166 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:29:54,166 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:29:54,166 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:29:54,166 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 10:29:54,166 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 10:29:54,167 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:29:54,168 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:29:54,168 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:29:54,168 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:29:54,168 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:29:54,168 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:29:54,168 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 10:29:54,168 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 10:29:54,169 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:29:54,170 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:29:54,170 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:29:54,170 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:29:54,170 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:29:54,170 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:29:54,171 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 10:29:54,171 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 10:29:54,171 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:29:54,172 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:29:54,172 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:29:54,172 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:29:54,172 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:29:54,172 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:29:54,173 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 10:29:54,173 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 10:29:54,174 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:29:54,174 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:29:54,174 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:29:54,174 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:29:54,175 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:29:54,175 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:29:54,175 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 10:29:54,175 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 10:29:54,176 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:29:54,176 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:29:54,176 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:29:54,177 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 10:29:54,177 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:29:54,177 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:29:54,177 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 10:29:54,177 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 10:29:54,180 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:29:54,180 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:29:54,180 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:29:54,180 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:29:54,180 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:29:54,181 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:29:54,181 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 10:29:54,181 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 10:29:54,182 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:29:54,182 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 10:29:54,183 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:29:54,183 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:29:54,183 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:29:54,183 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:29:54,184 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 10:29:54,184 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 10:29:54,202 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 10:29:54,210 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 10:29:54,210 INFO L444 ModelExtractionUtils]: 14 out of 19 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-10 10:29:54,210 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 10:29:54,211 INFO L440 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2018-11-10 10:29:54,211 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 10:29:54,212 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 [1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_4 - 1 >= 0] [2018-11-10 10:29:54,296 INFO L297 tatePredicateManager]: 20 out of 21 supporting invariants were superfluous and have been removed [2018-11-10 10:29:54,298 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 10:29:54,311 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:29:54,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:29:54,325 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:29:54,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:29:54,330 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:29:54,386 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:29:54,387 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 43 [2018-11-10 10:29:54,393 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2018-11-10 10:29:54,394 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:29:54,401 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:29:54,409 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-10 10:29:54,409 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:46, output treesize:26 [2018-11-10 10:29:54,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:29:54,426 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 6 loop predicates [2018-11-10 10:29:54,426 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 169 states and 180 transitions. cyclomatic complexity: 15 Second operand 8 states. [2018-11-10 10:29:54,499 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 169 states and 180 transitions. cyclomatic complexity: 15. Second operand 8 states. Result 225 states and 239 transitions. Complement of second has 15 states. [2018-11-10 10:29:54,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 1 stem states 6 non-accepting loop states 1 accepting loop states [2018-11-10 10:29:54,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-10 10:29:54,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 25 transitions. [2018-11-10 10:29:54,500 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 25 transitions. Stem has 44 letters. Loop has 11 letters. [2018-11-10 10:29:54,500 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 10:29:54,500 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 10:29:54,512 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:29:54,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:29:54,526 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:29:54,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:29:54,532 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:29:54,575 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:29:54,575 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 43 [2018-11-10 10:29:54,577 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2018-11-10 10:29:54,578 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:29:54,584 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:29:54,589 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-10 10:29:54,589 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:46, output treesize:26 [2018-11-10 10:29:54,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:29:54,601 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 6 loop predicates [2018-11-10 10:29:54,601 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 169 states and 180 transitions. cyclomatic complexity: 15 Second operand 8 states. [2018-11-10 10:29:54,679 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 169 states and 180 transitions. cyclomatic complexity: 15. Second operand 8 states. Result 225 states and 239 transitions. Complement of second has 17 states. [2018-11-10 10:29:54,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 1 stem states 7 non-accepting loop states 1 accepting loop states [2018-11-10 10:29:54,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-10 10:29:54,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 24 transitions. [2018-11-10 10:29:54,680 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 24 transitions. Stem has 44 letters. Loop has 11 letters. [2018-11-10 10:29:54,680 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 10:29:54,680 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 10:29:54,698 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:29:54,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:29:54,714 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:29:54,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:29:54,719 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:29:54,762 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:29:54,762 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 43 [2018-11-10 10:29:54,764 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2018-11-10 10:29:54,765 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:29:54,771 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:29:54,776 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-10 10:29:54,776 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:46, output treesize:26 [2018-11-10 10:29:54,786 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:29:54,787 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 6 loop predicates [2018-11-10 10:29:54,787 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 169 states and 180 transitions. cyclomatic complexity: 15 Second operand 8 states. [2018-11-10 10:29:54,850 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 169 states and 180 transitions. cyclomatic complexity: 15. Second operand 8 states. Result 309 states and 331 transitions. Complement of second has 14 states. [2018-11-10 10:29:54,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 1 stem states 6 non-accepting loop states 1 accepting loop states [2018-11-10 10:29:54,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-10 10:29:54,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 42 transitions. [2018-11-10 10:29:54,860 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 42 transitions. Stem has 44 letters. Loop has 11 letters. [2018-11-10 10:29:54,860 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 10:29:54,860 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 42 transitions. Stem has 55 letters. Loop has 11 letters. [2018-11-10 10:29:54,860 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 10:29:54,861 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 42 transitions. Stem has 44 letters. Loop has 22 letters. [2018-11-10 10:29:54,861 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 10:29:54,861 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 309 states and 331 transitions. [2018-11-10 10:29:54,862 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 56 [2018-11-10 10:29:54,863 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 309 states to 112 states and 114 transitions. [2018-11-10 10:29:54,863 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2018-11-10 10:29:54,863 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 34 [2018-11-10 10:29:54,863 INFO L73 IsDeterministic]: Start isDeterministic. Operand 112 states and 114 transitions. [2018-11-10 10:29:54,864 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 10:29:54,864 INFO L705 BuchiCegarLoop]: Abstraction has 112 states and 114 transitions. [2018-11-10 10:29:54,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states and 114 transitions. [2018-11-10 10:29:54,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 53. [2018-11-10 10:29:54,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-11-10 10:29:54,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 54 transitions. [2018-11-10 10:29:54,865 INFO L728 BuchiCegarLoop]: Abstraction has 53 states and 54 transitions. [2018-11-10 10:29:54,865 INFO L608 BuchiCegarLoop]: Abstraction has 53 states and 54 transitions. [2018-11-10 10:29:54,865 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2018-11-10 10:29:54,865 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 53 states and 54 transitions. [2018-11-10 10:29:54,866 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 48 [2018-11-10 10:29:54,866 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 10:29:54,866 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 10:29:54,866 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-10 10:29:54,866 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:29:54,866 INFO L793 eck$LassoCheckResult]: Stem: 5297#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 5290#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet13, main_#t~nondet14, main_#t~ret15;assume { :begin_inline_test_fun } true;test_fun_#in~x, test_fun_#in~y := main_#t~nondet13, main_#t~nondet14;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~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~mem10, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~mem8, test_fun_#t~short9, test_fun_#t~mem11, test_fun_#t~mem5, test_fun_#t~mem12, 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_~c~0.base, test_fun_~c~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;#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~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset; 5291#L552 SUMMARY for call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L552 5301#L552-1 SUMMARY for call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L552-1 5295#L553 SUMMARY for call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); srcloc: L553 5296#L555-3 [2018-11-10 10:29:54,867 INFO L795 eck$LassoCheckResult]: Loop: 5296#L555-3 assume true; 5285#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 5286#L555-1 assume !!(test_fun_#t~mem5 >= 0);havoc test_fun_#t~mem5; 5278#L556 SUMMARY for call write~int(1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L556 5265#L557-9 assume true; 5266#L557 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L557 5275#L557-1 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557-1 5280#L557-2 test_fun_#t~short9 := test_fun_#t~mem6 > test_fun_#t~mem7; 5288#L557-3 assume test_fun_#t~short9; 5289#L557-4 SUMMARY for call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557-4 5299#L557-5 test_fun_#t~short9 := test_fun_#t~mem8 < 1073741824; 5300#L557-7 assume !!test_fun_#t~short9;havoc test_fun_#t~mem7;havoc test_fun_#t~short9;havoc test_fun_#t~mem8;havoc test_fun_#t~mem6; 5269#L558 SUMMARY for call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L558 5270#L558-1 SUMMARY for call write~int(2 * test_fun_#t~mem10, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L558-1 5316#L558-2 havoc test_fun_#t~mem10; 5267#L557-9 assume true; 5268#L557 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L557 5317#L557-1 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557-1 5283#L557-2 test_fun_#t~short9 := test_fun_#t~mem6 > test_fun_#t~mem7; 5284#L557-3 assume test_fun_#t~short9; 5293#L557-4 SUMMARY for call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557-4 5294#L557-5 test_fun_#t~short9 := test_fun_#t~mem8 < 1073741824; 5302#L557-7 assume !!test_fun_#t~short9;havoc test_fun_#t~mem7;havoc test_fun_#t~short9;havoc test_fun_#t~mem8;havoc test_fun_#t~mem6; 5303#L558 SUMMARY for call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L558 5276#L558-1 SUMMARY for call write~int(2 * test_fun_#t~mem10, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L558-1 5277#L558-2 havoc test_fun_#t~mem10; 5281#L557-9 assume true; 5315#L557 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L557 5314#L557-1 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557-1 5313#L557-2 test_fun_#t~short9 := test_fun_#t~mem6 > test_fun_#t~mem7; 5312#L557-3 assume test_fun_#t~short9; 5311#L557-4 SUMMARY for call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557-4 5310#L557-5 test_fun_#t~short9 := test_fun_#t~mem8 < 1073741824; 5309#L557-7 assume !!test_fun_#t~short9;havoc test_fun_#t~mem7;havoc test_fun_#t~short9;havoc test_fun_#t~mem8;havoc test_fun_#t~mem6; 5308#L558 SUMMARY for call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L558 5307#L558-1 SUMMARY for call write~int(2 * test_fun_#t~mem10, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L558-1 5306#L558-2 havoc test_fun_#t~mem10; 5305#L557-9 assume true; 5273#L557 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L557 5274#L557-1 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557-1 5279#L557-2 test_fun_#t~short9 := test_fun_#t~mem6 > test_fun_#t~mem7; 5282#L557-3 assume test_fun_#t~short9; 5287#L557-4 SUMMARY for call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557-4 5292#L557-5 test_fun_#t~short9 := test_fun_#t~mem8 < 1073741824; 5298#L557-7 assume !test_fun_#t~short9;havoc test_fun_#t~mem7;havoc test_fun_#t~short9;havoc test_fun_#t~mem8;havoc test_fun_#t~mem6; 5271#L557-10 SUMMARY for call test_fun_#t~mem11 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L557-10 5272#L560 SUMMARY for call write~int(test_fun_#t~mem11 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L560 5304#L560-1 havoc test_fun_#t~mem11; 5296#L555-3 [2018-11-10 10:29:54,867 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:29:54,867 INFO L82 PathProgramCache]: Analyzing trace with hash 28691745, now seen corresponding path program 3 times [2018-11-10 10:29:54,867 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:29:54,867 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:29:54,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:29:54,868 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 10:29:54,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:29:54,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:29:54,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:29:54,875 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:29:54,876 INFO L82 PathProgramCache]: Analyzing trace with hash 1672824748, now seen corresponding path program 3 times [2018-11-10 10:29:54,876 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:29:54,876 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:29:54,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:29:54,876 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 10:29:54,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:29:54,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:29:55,015 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:29:55,016 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 10:29:55,016 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_90d8d520-a9ba-40ca-8940-35d04161bf04/bin-2019/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 10:29:55,026 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-10 10:29:55,041 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-10 10:29:55,041 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 10:29:55,042 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:29:55,044 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-10 10:29:55,045 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 10:29:55,046 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:29:55,047 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:29:55,048 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:29:55,048 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2018-11-10 10:29:55,056 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:29:55,057 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 29 [2018-11-10 10:29:55,058 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 19 [2018-11-10 10:29:55,058 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:29:55,061 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:29:55,064 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:29:55,064 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:13 [2018-11-10 10:29:55,093 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 23 [2018-11-10 10:29:55,095 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-11-10 10:29:55,096 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:29:55,099 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:29:55,102 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-10 10:29:55,102 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:33, output treesize:18 [2018-11-10 10:29:55,151 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 23 [2018-11-10 10:29:55,154 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-11-10 10:29:55,155 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:29:55,165 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:29:55,171 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-11-10 10:29:55,171 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:38, output treesize:23 [2018-11-10 10:29:55,194 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-11-10 10:29:55,196 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-11-10 10:29:55,196 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:29:55,197 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:29:55,202 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-11-10 10:29:55,202 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:30, output treesize:19 [2018-11-10 10:29:55,221 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:29:55,246 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 10:29:55,246 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11] total 21 [2018-11-10 10:29:55,247 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 10:29:55,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-10 10:29:55,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=325, Unknown=0, NotChecked=0, Total=420 [2018-11-10 10:29:55,249 INFO L87 Difference]: Start difference. First operand 53 states and 54 transitions. cyclomatic complexity: 2 Second operand 21 states. [2018-11-10 10:29:55,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:29:55,650 INFO L93 Difference]: Finished difference Result 82 states and 83 transitions. [2018-11-10 10:29:55,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-10 10:29:55,652 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 82 states and 83 transitions. [2018-11-10 10:29:55,653 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 69 [2018-11-10 10:29:55,653 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 82 states to 74 states and 75 transitions. [2018-11-10 10:29:55,653 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2018-11-10 10:29:55,653 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2018-11-10 10:29:55,653 INFO L73 IsDeterministic]: Start isDeterministic. Operand 74 states and 75 transitions. [2018-11-10 10:29:55,653 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 10:29:55,654 INFO L705 BuchiCegarLoop]: Abstraction has 74 states and 75 transitions. [2018-11-10 10:29:55,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states and 75 transitions. [2018-11-10 10:29:55,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 64. [2018-11-10 10:29:55,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-11-10 10:29:55,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 65 transitions. [2018-11-10 10:29:55,655 INFO L728 BuchiCegarLoop]: Abstraction has 64 states and 65 transitions. [2018-11-10 10:29:55,655 INFO L608 BuchiCegarLoop]: Abstraction has 64 states and 65 transitions. [2018-11-10 10:29:55,655 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2018-11-10 10:29:55,655 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 64 states and 65 transitions. [2018-11-10 10:29:55,655 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 59 [2018-11-10 10:29:55,655 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 10:29:55,656 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 10:29:55,656 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-10 10:29:55,656 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:29:55,656 INFO L793 eck$LassoCheckResult]: Stem: 5621#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 5615#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet13, main_#t~nondet14, main_#t~ret15;assume { :begin_inline_test_fun } true;test_fun_#in~x, test_fun_#in~y := main_#t~nondet13, main_#t~nondet14;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~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~mem10, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~mem8, test_fun_#t~short9, test_fun_#t~mem11, test_fun_#t~mem5, test_fun_#t~mem12, 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_~c~0.base, test_fun_~c~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;#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~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset; 5616#L552 SUMMARY for call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L552 5624#L552-1 SUMMARY for call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L552-1 5619#L553 SUMMARY for call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); srcloc: L553 5620#L555-3 [2018-11-10 10:29:55,656 INFO L795 eck$LassoCheckResult]: Loop: 5620#L555-3 assume true; 5610#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 5611#L555-1 assume !!(test_fun_#t~mem5 >= 0);havoc test_fun_#t~mem5; 5607#L556 SUMMARY for call write~int(1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L556 5593#L557-9 assume true; 5594#L557 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L557 5656#L557-1 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557-1 5655#L557-2 test_fun_#t~short9 := test_fun_#t~mem6 > test_fun_#t~mem7; 5613#L557-3 assume test_fun_#t~short9; 5614#L557-4 SUMMARY for call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557-4 5618#L557-5 test_fun_#t~short9 := test_fun_#t~mem8 < 1073741824; 5623#L557-7 assume !!test_fun_#t~short9;havoc test_fun_#t~mem7;havoc test_fun_#t~short9;havoc test_fun_#t~mem8;havoc test_fun_#t~mem6; 5597#L558 SUMMARY for call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L558 5598#L558-1 SUMMARY for call write~int(2 * test_fun_#t~mem10, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L558-1 5601#L558-2 havoc test_fun_#t~mem10; 5595#L557-9 assume true; 5596#L557 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L557 5604#L557-1 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557-1 5606#L557-2 test_fun_#t~short9 := test_fun_#t~mem6 > test_fun_#t~mem7; 5609#L557-3 assume test_fun_#t~short9; 5654#L557-4 SUMMARY for call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557-4 5653#L557-5 test_fun_#t~short9 := test_fun_#t~mem8 < 1073741824; 5652#L557-7 assume !!test_fun_#t~short9;havoc test_fun_#t~mem7;havoc test_fun_#t~short9;havoc test_fun_#t~mem8;havoc test_fun_#t~mem6; 5651#L558 SUMMARY for call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L558 5650#L558-1 SUMMARY for call write~int(2 * test_fun_#t~mem10, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L558-1 5649#L558-2 havoc test_fun_#t~mem10; 5648#L557-9 assume true; 5647#L557 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L557 5646#L557-1 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557-1 5645#L557-2 test_fun_#t~short9 := test_fun_#t~mem6 > test_fun_#t~mem7; 5644#L557-3 assume test_fun_#t~short9; 5643#L557-4 SUMMARY for call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557-4 5642#L557-5 test_fun_#t~short9 := test_fun_#t~mem8 < 1073741824; 5641#L557-7 assume !!test_fun_#t~short9;havoc test_fun_#t~mem7;havoc test_fun_#t~short9;havoc test_fun_#t~mem8;havoc test_fun_#t~mem6; 5640#L558 SUMMARY for call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L558 5639#L558-1 SUMMARY for call write~int(2 * test_fun_#t~mem10, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L558-1 5638#L558-2 havoc test_fun_#t~mem10; 5628#L557-9 assume true; 5637#L557 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L557 5636#L557-1 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557-1 5635#L557-2 test_fun_#t~short9 := test_fun_#t~mem6 > test_fun_#t~mem7; 5634#L557-3 assume test_fun_#t~short9; 5633#L557-4 SUMMARY for call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557-4 5632#L557-5 test_fun_#t~short9 := test_fun_#t~mem8 < 1073741824; 5631#L557-7 assume !!test_fun_#t~short9;havoc test_fun_#t~mem7;havoc test_fun_#t~short9;havoc test_fun_#t~mem8;havoc test_fun_#t~mem6; 5630#L558 SUMMARY for call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L558 5629#L558-1 SUMMARY for call write~int(2 * test_fun_#t~mem10, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L558-1 5627#L558-2 havoc test_fun_#t~mem10; 5626#L557-9 assume true; 5602#L557 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L557 5603#L557-1 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557-1 5605#L557-2 test_fun_#t~short9 := test_fun_#t~mem6 > test_fun_#t~mem7; 5608#L557-3 assume test_fun_#t~short9; 5612#L557-4 SUMMARY for call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557-4 5617#L557-5 test_fun_#t~short9 := test_fun_#t~mem8 < 1073741824; 5622#L557-7 assume !test_fun_#t~short9;havoc test_fun_#t~mem7;havoc test_fun_#t~short9;havoc test_fun_#t~mem8;havoc test_fun_#t~mem6; 5599#L557-10 SUMMARY for call test_fun_#t~mem11 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L557-10 5600#L560 SUMMARY for call write~int(test_fun_#t~mem11 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L560 5625#L560-1 havoc test_fun_#t~mem11; 5620#L555-3 [2018-11-10 10:29:55,657 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:29:55,657 INFO L82 PathProgramCache]: Analyzing trace with hash 28691745, now seen corresponding path program 4 times [2018-11-10 10:29:55,657 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:29:55,657 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:29:55,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:29:55,658 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 10:29:55,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:29:55,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:29:55,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:29:55,666 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:29:55,666 INFO L82 PathProgramCache]: Analyzing trace with hash -305006560, now seen corresponding path program 4 times [2018-11-10 10:29:55,666 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:29:55,667 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:29:55,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:29:55,667 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 10:29:55,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:29:55,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:29:55,832 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:29:55,833 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 10:29:55,833 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_90d8d520-a9ba-40ca-8940-35d04161bf04/bin-2019/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 10:29:55,840 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-10 10:29:55,859 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-10 10:29:55,859 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 10:29:55,861 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:29:55,865 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-10 10:29:55,868 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 10:29:55,869 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:29:55,884 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:29:55,886 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:29:55,886 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2018-11-10 10:29:55,904 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:29:55,905 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 29 [2018-11-10 10:29:55,909 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 19 [2018-11-10 10:29:55,909 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:29:55,930 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:29:55,941 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:29:55,941 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:13 [2018-11-10 10:29:55,977 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 23 [2018-11-10 10:29:55,980 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-11-10 10:29:55,980 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:29:55,983 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:29:55,987 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-10 10:29:55,987 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:33, output treesize:18 [2018-11-10 10:29:56,025 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 23 [2018-11-10 10:29:56,028 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-11-10 10:29:56,028 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:29:56,032 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:29:56,037 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-11-10 10:29:56,038 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:38, output treesize:23 [2018-11-10 10:29:56,088 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 23 [2018-11-10 10:29:56,092 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-11-10 10:29:56,092 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:29:56,096 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:29:56,103 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-11-10 10:29:56,103 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:43, output treesize:28 [2018-11-10 10:29:56,388 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-11-10 10:29:56,391 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-11-10 10:29:56,391 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:29:56,394 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:29:56,402 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-11-10 10:29:56,402 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:35, output treesize:24 [2018-11-10 10:29:56,439 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:29:56,465 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 10:29:56,465 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 13] total 26 [2018-11-10 10:29:56,465 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 10:29:56,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-11-10 10:29:56,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=508, Unknown=0, NotChecked=0, Total=650 [2018-11-10 10:29:56,466 INFO L87 Difference]: Start difference. First operand 64 states and 65 transitions. cyclomatic complexity: 2 Second operand 26 states. [2018-11-10 10:29:58,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:29:58,786 INFO L93 Difference]: Finished difference Result 93 states and 94 transitions. [2018-11-10 10:29:58,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-11-10 10:29:58,786 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 93 states and 94 transitions. [2018-11-10 10:29:58,786 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 80 [2018-11-10 10:29:58,786 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 93 states to 85 states and 86 transitions. [2018-11-10 10:29:58,786 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2018-11-10 10:29:58,787 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2018-11-10 10:29:58,787 INFO L73 IsDeterministic]: Start isDeterministic. Operand 85 states and 86 transitions. [2018-11-10 10:29:58,787 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 10:29:58,787 INFO L705 BuchiCegarLoop]: Abstraction has 85 states and 86 transitions. [2018-11-10 10:29:58,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states and 86 transitions. [2018-11-10 10:29:58,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 75. [2018-11-10 10:29:58,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-11-10 10:29:58,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 76 transitions. [2018-11-10 10:29:58,788 INFO L728 BuchiCegarLoop]: Abstraction has 75 states and 76 transitions. [2018-11-10 10:29:58,788 INFO L608 BuchiCegarLoop]: Abstraction has 75 states and 76 transitions. [2018-11-10 10:29:58,788 INFO L442 BuchiCegarLoop]: ======== Iteration 13============ [2018-11-10 10:29:58,788 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 75 states and 76 transitions. [2018-11-10 10:29:58,789 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 70 [2018-11-10 10:29:58,789 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 10:29:58,789 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 10:29:58,789 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-10 10:29:58,789 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:29:58,789 INFO L793 eck$LassoCheckResult]: Stem: 6019#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 6013#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet13, main_#t~nondet14, main_#t~ret15;assume { :begin_inline_test_fun } true;test_fun_#in~x, test_fun_#in~y := main_#t~nondet13, main_#t~nondet14;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~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~mem10, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~mem8, test_fun_#t~short9, test_fun_#t~mem11, test_fun_#t~mem5, test_fun_#t~mem12, 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_~c~0.base, test_fun_~c~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;#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~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset; 6014#L552 SUMMARY for call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L552 6022#L552-1 SUMMARY for call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L552-1 6017#L553 SUMMARY for call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); srcloc: L553 6018#L555-3 [2018-11-10 10:29:58,789 INFO L795 eck$LassoCheckResult]: Loop: 6018#L555-3 assume true; 6009#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 assume !!(test_fun_#t~mem5 >= 0);havoc test_fun_#t~mem5; 6006#L556 SUMMARY for call write~int(1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L556 5990#L557-9 assume true; 5991#L557 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L557 6064#L557-1 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557-1 6063#L557-2 test_fun_#t~short9 := test_fun_#t~mem6 > test_fun_#t~mem7; 6062#L557-3 assume test_fun_#t~short9; 6061#L557-4 SUMMARY for call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557-4 6060#L557-5 test_fun_#t~short9 := test_fun_#t~mem8 < 1073741824; 6059#L557-7 assume !!test_fun_#t~short9;havoc test_fun_#t~mem7;havoc test_fun_#t~short9;havoc test_fun_#t~mem8;havoc test_fun_#t~mem6; 5994#L558 SUMMARY for call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L558 5995#L558-1 SUMMARY for call write~int(2 * test_fun_#t~mem10, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L558-1 5998#L558-2 havoc test_fun_#t~mem10; 5992#L557-9 assume true; 5993#L557 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L557 6001#L557-1 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557-1 6003#L557-2 test_fun_#t~short9 := test_fun_#t~mem6 > test_fun_#t~mem7; 6008#L557-3 assume test_fun_#t~short9; 6012#L557-4 SUMMARY for call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557-4 6016#L557-5 test_fun_#t~short9 := test_fun_#t~mem8 < 1073741824; 6021#L557-7 assume !!test_fun_#t~short9;havoc test_fun_#t~mem7;havoc test_fun_#t~short9;havoc test_fun_#t~mem8;havoc test_fun_#t~mem6; 6023#L558 SUMMARY for call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L558 6058#L558-1 SUMMARY for call write~int(2 * test_fun_#t~mem10, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L558-1 6004#L558-2 havoc test_fun_#t~mem10; 6005#L557-9 assume true; 6057#L557 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L557 6056#L557-1 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557-1 6055#L557-2 test_fun_#t~short9 := test_fun_#t~mem6 > test_fun_#t~mem7; 6054#L557-3 assume test_fun_#t~short9; 6053#L557-4 SUMMARY for call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557-4 6052#L557-5 test_fun_#t~short9 := test_fun_#t~mem8 < 1073741824; 6051#L557-7 assume !!test_fun_#t~short9;havoc test_fun_#t~mem7;havoc test_fun_#t~short9;havoc test_fun_#t~mem8;havoc test_fun_#t~mem6; 6050#L558 SUMMARY for call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L558 6049#L558-1 SUMMARY for call write~int(2 * test_fun_#t~mem10, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L558-1 6048#L558-2 havoc test_fun_#t~mem10; 6047#L557-9 assume true; 6046#L557 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L557 6045#L557-1 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557-1 6044#L557-2 test_fun_#t~short9 := test_fun_#t~mem6 > test_fun_#t~mem7; 6043#L557-3 assume test_fun_#t~short9; 6042#L557-4 SUMMARY for call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557-4 6041#L557-5 test_fun_#t~short9 := test_fun_#t~mem8 < 1073741824; 6040#L557-7 assume !!test_fun_#t~short9;havoc test_fun_#t~mem7;havoc test_fun_#t~short9;havoc test_fun_#t~mem8;havoc test_fun_#t~mem6; 6039#L558 SUMMARY for call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L558 6038#L558-1 SUMMARY for call write~int(2 * test_fun_#t~mem10, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L558-1 6037#L558-2 havoc test_fun_#t~mem10; 6027#L557-9 assume true; 6036#L557 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L557 6035#L557-1 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557-1 6034#L557-2 test_fun_#t~short9 := test_fun_#t~mem6 > test_fun_#t~mem7; 6033#L557-3 assume test_fun_#t~short9; 6032#L557-4 SUMMARY for call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557-4 6031#L557-5 test_fun_#t~short9 := test_fun_#t~mem8 < 1073741824; 6030#L557-7 assume !!test_fun_#t~short9;havoc test_fun_#t~mem7;havoc test_fun_#t~short9;havoc test_fun_#t~mem8;havoc test_fun_#t~mem6; 6029#L558 SUMMARY for call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L558 6028#L558-1 SUMMARY for call write~int(2 * test_fun_#t~mem10, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L558-1 6026#L558-2 havoc test_fun_#t~mem10; 6025#L557-9 assume true; 5999#L557 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L557 6000#L557-1 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557-1 6002#L557-2 test_fun_#t~short9 := test_fun_#t~mem6 > test_fun_#t~mem7; 6007#L557-3 assume test_fun_#t~short9; 6011#L557-4 SUMMARY for call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557-4 6015#L557-5 test_fun_#t~short9 := test_fun_#t~mem8 < 1073741824; 6020#L557-7 assume !test_fun_#t~short9;havoc test_fun_#t~mem7;havoc test_fun_#t~short9;havoc test_fun_#t~mem8;havoc test_fun_#t~mem6; 5996#L557-10 SUMMARY for call test_fun_#t~mem11 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L557-10 5997#L560 SUMMARY for call write~int(test_fun_#t~mem11 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L560 6024#L560-1 havoc test_fun_#t~mem11; 6018#L555-3 [2018-11-10 10:29:58,789 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:29:58,789 INFO L82 PathProgramCache]: Analyzing trace with hash 28691745, now seen corresponding path program 5 times [2018-11-10 10:29:58,790 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:29:58,790 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:29:58,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:29:58,790 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 10:29:58,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:29:58,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:29:58,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:29:58,797 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:29:58,797 INFO L82 PathProgramCache]: Analyzing trace with hash -664389844, now seen corresponding path program 5 times [2018-11-10 10:29:58,797 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:29:58,797 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:29:58,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:29:58,798 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 10:29:58,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:29:58,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:29:58,965 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 0 proven. 150 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:29:58,965 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 10:29:58,965 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_90d8d520-a9ba-40ca-8940-35d04161bf04/bin-2019/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 10:29:58,972 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-10 10:29:59,003 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-11-10 10:29:59,003 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 10:29:59,006 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:29:59,024 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-10 10:29:59,039 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 10:29:59,039 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:29:59,041 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:29:59,043 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:29:59,043 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2018-11-10 10:29:59,056 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:29:59,057 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 29 [2018-11-10 10:29:59,059 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 19 [2018-11-10 10:29:59,060 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:29:59,065 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:29:59,068 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:29:59,068 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:13 [2018-11-10 10:29:59,111 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 23 [2018-11-10 10:29:59,114 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-11-10 10:29:59,114 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:29:59,117 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:29:59,121 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-10 10:29:59,121 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:33, output treesize:18 [2018-11-10 10:29:59,161 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 23 [2018-11-10 10:29:59,164 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-11-10 10:29:59,164 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:29:59,168 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:29:59,173 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-11-10 10:29:59,174 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:38, output treesize:23 [2018-11-10 10:29:59,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 23 [2018-11-10 10:29:59,225 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-11-10 10:29:59,225 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:29:59,229 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:29:59,236 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-11-10 10:29:59,236 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:43, output treesize:28 [2018-11-10 10:29:59,864 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 23 [2018-11-10 10:29:59,886 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-11-10 10:29:59,886 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:29:59,890 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:29:59,898 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2018-11-10 10:29:59,898 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:48, output treesize:33 [2018-11-10 10:30:00,832 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-11-10 10:30:00,833 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-11-10 10:30:00,834 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:30:00,835 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:30:00,841 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2018-11-10 10:30:00,841 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:40, output treesize:29 [2018-11-10 10:30:00,871 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 0 proven. 150 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:30:00,887 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 10:30:00,887 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 15] total 30 [2018-11-10 10:30:00,887 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 10:30:00,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-11-10 10:30:00,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=678, Unknown=0, NotChecked=0, Total=870 [2018-11-10 10:30:00,888 INFO L87 Difference]: Start difference. First operand 75 states and 76 transitions. cyclomatic complexity: 2 Second operand 30 states. [2018-11-10 10:30:07,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:30:07,421 INFO L93 Difference]: Finished difference Result 104 states and 105 transitions. [2018-11-10 10:30:07,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-11-10 10:30:07,421 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 104 states and 105 transitions. [2018-11-10 10:30:07,422 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 91 [2018-11-10 10:30:07,422 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 104 states to 96 states and 97 transitions. [2018-11-10 10:30:07,422 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2018-11-10 10:30:07,422 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2018-11-10 10:30:07,422 INFO L73 IsDeterministic]: Start isDeterministic. Operand 96 states and 97 transitions. [2018-11-10 10:30:07,423 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 10:30:07,423 INFO L705 BuchiCegarLoop]: Abstraction has 96 states and 97 transitions. [2018-11-10 10:30:07,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states and 97 transitions. [2018-11-10 10:30:07,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 86. [2018-11-10 10:30:07,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-11-10 10:30:07,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 87 transitions. [2018-11-10 10:30:07,424 INFO L728 BuchiCegarLoop]: Abstraction has 86 states and 87 transitions. [2018-11-10 10:30:07,424 INFO L608 BuchiCegarLoop]: Abstraction has 86 states and 87 transitions. [2018-11-10 10:30:07,424 INFO L442 BuchiCegarLoop]: ======== Iteration 14============ [2018-11-10 10:30:07,424 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 86 states and 87 transitions. [2018-11-10 10:30:07,424 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 81 [2018-11-10 10:30:07,424 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 10:30:07,424 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 10:30:07,425 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-10 10:30:07,425 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:30:07,425 INFO L793 eck$LassoCheckResult]: Stem: 6480#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 6474#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet13, main_#t~nondet14, main_#t~ret15;assume { :begin_inline_test_fun } true;test_fun_#in~x, test_fun_#in~y := main_#t~nondet13, main_#t~nondet14;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~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~mem10, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~mem8, test_fun_#t~short9, test_fun_#t~mem11, test_fun_#t~mem5, test_fun_#t~mem12, 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_~c~0.base, test_fun_~c~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;#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~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset; 6475#L552 SUMMARY for call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L552 6483#L552-1 SUMMARY for call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L552-1 6478#L553 SUMMARY for call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); srcloc: L553 6479#L555-3 [2018-11-10 10:30:07,425 INFO L795 eck$LassoCheckResult]: Loop: 6479#L555-3 assume true; 6470#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 6471#L555-1 assume !!(test_fun_#t~mem5 >= 0);havoc test_fun_#t~mem5; 6467#L556 SUMMARY for call write~int(1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L556 6452#L557-9 assume true; 6453#L557 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L557 6463#L557-1 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557-1 6466#L557-2 test_fun_#t~short9 := test_fun_#t~mem6 > test_fun_#t~mem7; 6469#L557-3 assume test_fun_#t~short9; 6473#L557-4 SUMMARY for call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557-4 6477#L557-5 test_fun_#t~short9 := test_fun_#t~mem8 < 1073741824; 6482#L557-7 assume !!test_fun_#t~short9;havoc test_fun_#t~mem7;havoc test_fun_#t~short9;havoc test_fun_#t~mem8;havoc test_fun_#t~mem6; 6532#L558 SUMMARY for call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L558 6531#L558-1 SUMMARY for call write~int(2 * test_fun_#t~mem10, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L558-1 6530#L558-2 havoc test_fun_#t~mem10; 6454#L557-9 assume true; 6455#L557 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L557 6537#L557-1 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557-1 6536#L557-2 test_fun_#t~short9 := test_fun_#t~mem6 > test_fun_#t~mem7; 6535#L557-3 assume test_fun_#t~short9; 6534#L557-4 SUMMARY for call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557-4 6533#L557-5 test_fun_#t~short9 := test_fun_#t~mem8 < 1073741824; 6484#L557-7 assume !!test_fun_#t~short9;havoc test_fun_#t~mem7;havoc test_fun_#t~short9;havoc test_fun_#t~mem8;havoc test_fun_#t~mem6; 6456#L558 SUMMARY for call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L558 6457#L558-1 SUMMARY for call write~int(2 * test_fun_#t~mem10, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L558-1 6460#L558-2 havoc test_fun_#t~mem10; 6464#L557-9 assume true; 6529#L557 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L557 6528#L557-1 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557-1 6527#L557-2 test_fun_#t~short9 := test_fun_#t~mem6 > test_fun_#t~mem7; 6526#L557-3 assume test_fun_#t~short9; 6525#L557-4 SUMMARY for call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557-4 6524#L557-5 test_fun_#t~short9 := test_fun_#t~mem8 < 1073741824; 6523#L557-7 assume !!test_fun_#t~short9;havoc test_fun_#t~mem7;havoc test_fun_#t~short9;havoc test_fun_#t~mem8;havoc test_fun_#t~mem6; 6522#L558 SUMMARY for call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L558 6521#L558-1 SUMMARY for call write~int(2 * test_fun_#t~mem10, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L558-1 6520#L558-2 havoc test_fun_#t~mem10; 6519#L557-9 assume true; 6518#L557 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L557 6517#L557-1 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557-1 6516#L557-2 test_fun_#t~short9 := test_fun_#t~mem6 > test_fun_#t~mem7; 6515#L557-3 assume test_fun_#t~short9; 6514#L557-4 SUMMARY for call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557-4 6513#L557-5 test_fun_#t~short9 := test_fun_#t~mem8 < 1073741824; 6512#L557-7 assume !!test_fun_#t~short9;havoc test_fun_#t~mem7;havoc test_fun_#t~short9;havoc test_fun_#t~mem8;havoc test_fun_#t~mem6; 6511#L558 SUMMARY for call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L558 6510#L558-1 SUMMARY for call write~int(2 * test_fun_#t~mem10, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L558-1 6509#L558-2 havoc test_fun_#t~mem10; 6508#L557-9 assume true; 6507#L557 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L557 6506#L557-1 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557-1 6505#L557-2 test_fun_#t~short9 := test_fun_#t~mem6 > test_fun_#t~mem7; 6504#L557-3 assume test_fun_#t~short9; 6503#L557-4 SUMMARY for call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557-4 6502#L557-5 test_fun_#t~short9 := test_fun_#t~mem8 < 1073741824; 6501#L557-7 assume !!test_fun_#t~short9;havoc test_fun_#t~mem7;havoc test_fun_#t~short9;havoc test_fun_#t~mem8;havoc test_fun_#t~mem6; 6500#L558 SUMMARY for call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L558 6499#L558-1 SUMMARY for call write~int(2 * test_fun_#t~mem10, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L558-1 6498#L558-2 havoc test_fun_#t~mem10; 6488#L557-9 assume true; 6497#L557 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L557 6496#L557-1 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557-1 6495#L557-2 test_fun_#t~short9 := test_fun_#t~mem6 > test_fun_#t~mem7; 6494#L557-3 assume test_fun_#t~short9; 6493#L557-4 SUMMARY for call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557-4 6492#L557-5 test_fun_#t~short9 := test_fun_#t~mem8 < 1073741824; 6491#L557-7 assume !!test_fun_#t~short9;havoc test_fun_#t~mem7;havoc test_fun_#t~short9;havoc test_fun_#t~mem8;havoc test_fun_#t~mem6; 6490#L558 SUMMARY for call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L558 6489#L558-1 SUMMARY for call write~int(2 * test_fun_#t~mem10, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L558-1 6487#L558-2 havoc test_fun_#t~mem10; 6486#L557-9 assume true; 6461#L557 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L557 6462#L557-1 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557-1 6465#L557-2 test_fun_#t~short9 := test_fun_#t~mem6 > test_fun_#t~mem7; 6468#L557-3 assume test_fun_#t~short9; 6472#L557-4 SUMMARY for call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557-4 6476#L557-5 test_fun_#t~short9 := test_fun_#t~mem8 < 1073741824; 6481#L557-7 assume !test_fun_#t~short9;havoc test_fun_#t~mem7;havoc test_fun_#t~short9;havoc test_fun_#t~mem8;havoc test_fun_#t~mem6; 6458#L557-10 SUMMARY for call test_fun_#t~mem11 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L557-10 6459#L560 SUMMARY for call write~int(test_fun_#t~mem11 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L560 6485#L560-1 havoc test_fun_#t~mem11; 6479#L555-3 [2018-11-10 10:30:07,425 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:30:07,425 INFO L82 PathProgramCache]: Analyzing trace with hash 28691745, now seen corresponding path program 6 times [2018-11-10 10:30:07,425 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:30:07,425 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:30:07,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:30:07,426 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 10:30:07,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:30:07,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:30:07,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:30:07,435 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:30:07,435 INFO L82 PathProgramCache]: Analyzing trace with hash 1566070944, now seen corresponding path program 6 times [2018-11-10 10:30:07,435 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:30:07,435 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:30:07,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:30:07,436 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 10:30:07,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:30:07,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:30:07,644 INFO L134 CoverageAnalysis]: Checked inductivity of 213 backedges. 0 proven. 213 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:30:07,644 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 10:30:07,644 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_90d8d520-a9ba-40ca-8940-35d04161bf04/bin-2019/uautomizer/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 10:30:07,658 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-10 10:30:07,705 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-11-10 10:30:07,706 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 10:30:07,708 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:30:07,720 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-10 10:30:07,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-11-10 10:30:07,723 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:30:07,727 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:30:07,729 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:30:07,729 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2018-11-10 10:30:07,744 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:30:07,745 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 29 [2018-11-10 10:30:07,746 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 19 [2018-11-10 10:30:07,747 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:30:07,751 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:30:07,763 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:30:07,763 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:13 [2018-11-10 10:30:07,791 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 23 [2018-11-10 10:30:07,794 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-11-10 10:30:07,794 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:30:07,796 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:30:07,800 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-10 10:30:07,800 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:33, output treesize:18 [2018-11-10 10:30:07,836 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 23 [2018-11-10 10:30:07,838 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-11-10 10:30:07,839 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:30:07,841 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:30:07,846 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-11-10 10:30:07,846 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:38, output treesize:23 [2018-11-10 10:30:07,886 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 23 [2018-11-10 10:30:07,889 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-11-10 10:30:07,889 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:30:07,892 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:30:07,897 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-11-10 10:30:07,897 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:43, output treesize:28 [2018-11-10 10:30:08,744 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 23 [2018-11-10 10:30:08,747 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-11-10 10:30:08,747 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:30:08,750 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:30:08,756 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2018-11-10 10:30:08,756 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:48, output treesize:33 [2018-11-10 10:30:12,609 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 23 [2018-11-10 10:30:12,611 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-11-10 10:30:12,611 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:30:12,614 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:30:12,622 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2018-11-10 10:30:12,622 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:53, output treesize:38 [2018-11-10 10:30:17,866 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-11-10 10:30:17,867 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-11-10 10:30:17,868 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:30:17,869 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:30:17,876 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2018-11-10 10:30:17,876 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:45, output treesize:34 [2018-11-10 10:30:17,909 INFO L134 CoverageAnalysis]: Checked inductivity of 213 backedges. 0 proven. 213 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:30:17,925 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 10:30:17,925 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 17] total 35 [2018-11-10 10:30:17,925 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 10:30:17,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-11-10 10:30:17,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=933, Unknown=4, NotChecked=0, Total=1190 [2018-11-10 10:30:17,926 INFO L87 Difference]: Start difference. First operand 86 states and 87 transitions. cyclomatic complexity: 2 Second operand 35 states. [2018-11-10 10:30:20,721 WARN L179 SmtUtils]: Spent 345.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2018-11-10 10:30:21,190 WARN L179 SmtUtils]: Spent 407.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2018-11-10 10:30:22,159 WARN L179 SmtUtils]: Spent 325.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 22 [2018-11-10 10:30:23,606 WARN L179 SmtUtils]: Spent 731.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 35 [2018-11-10 10:30:31,101 WARN L179 SmtUtils]: Spent 4.79 s on a formula simplification. DAG size of input: 37 DAG size of output: 25 [2018-11-10 10:30:34,631 WARN L179 SmtUtils]: Spent 2.22 s on a formula simplification. DAG size of input: 35 DAG size of output: 22 [2018-11-10 10:30:42,059 WARN L179 SmtUtils]: Spent 7.09 s on a formula simplification. DAG size of input: 39 DAG size of output: 30 [2018-11-10 10:30:45,087 WARN L179 SmtUtils]: Spent 2.39 s on a formula simplification. DAG size of input: 40 DAG size of output: 31 [2018-11-10 10:30:47,106 WARN L179 SmtUtils]: Spent 607.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 34 [2018-11-10 10:31:00,491 WARN L179 SmtUtils]: Spent 3.18 s on a formula simplification that was a NOOP. DAG size: 34 [2018-11-10 10:31:25,810 WARN L179 SmtUtils]: Spent 7.64 s on a formula simplification. DAG size of input: 36 DAG size of output: 28 [2018-11-10 10:31:29,813 WARN L179 SmtUtils]: Spent 3.82 s on a formula simplification. DAG size of input: 37 DAG size of output: 29 [2018-11-10 10:32:28,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:32:28,948 INFO L93 Difference]: Finished difference Result 115 states and 116 transitions. [2018-11-10 10:32:28,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-11-10 10:32:28,950 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 115 states and 116 transitions. [2018-11-10 10:32:28,950 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 102 [2018-11-10 10:32:28,951 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 115 states to 107 states and 108 transitions. [2018-11-10 10:32:28,951 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2018-11-10 10:32:28,951 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2018-11-10 10:32:28,951 INFO L73 IsDeterministic]: Start isDeterministic. Operand 107 states and 108 transitions. [2018-11-10 10:32:28,951 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 10:32:28,951 INFO L705 BuchiCegarLoop]: Abstraction has 107 states and 108 transitions. [2018-11-10 10:32:28,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states and 108 transitions. [2018-11-10 10:32:28,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 97. [2018-11-10 10:32:28,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-11-10 10:32:28,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 98 transitions. [2018-11-10 10:32:28,953 INFO L728 BuchiCegarLoop]: Abstraction has 97 states and 98 transitions. [2018-11-10 10:32:28,953 INFO L608 BuchiCegarLoop]: Abstraction has 97 states and 98 transitions. [2018-11-10 10:32:28,953 INFO L442 BuchiCegarLoop]: ======== Iteration 15============ [2018-11-10 10:32:28,953 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 97 states and 98 transitions. [2018-11-10 10:32:28,953 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 92 [2018-11-10 10:32:28,954 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 10:32:28,954 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 10:32:28,954 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-10 10:32:28,954 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:32:28,954 INFO L793 eck$LassoCheckResult]: Stem: 7026#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 7020#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet13, main_#t~nondet14, main_#t~ret15;assume { :begin_inline_test_fun } true;test_fun_#in~x, test_fun_#in~y := main_#t~nondet13, main_#t~nondet14;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~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~mem10, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~mem8, test_fun_#t~short9, test_fun_#t~mem11, test_fun_#t~mem5, test_fun_#t~mem12, 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_~c~0.base, test_fun_~c~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;#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~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset; 7021#L552 SUMMARY for call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L552 7029#L552-1 SUMMARY for call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L552-1 7024#L553 SUMMARY for call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); srcloc: L553 7025#L555-3 [2018-11-10 10:32:28,954 INFO L795 eck$LassoCheckResult]: Loop: 7025#L555-3 assume true; 7016#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 7017#L555-1 assume !!(test_fun_#t~mem5 >= 0);havoc test_fun_#t~mem5; 7013#L556 SUMMARY for call write~int(1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L556 6998#L557-9 assume true; 6999#L557 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L557 7009#L557-1 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557-1 7012#L557-2 test_fun_#t~short9 := test_fun_#t~mem6 > test_fun_#t~mem7; 7015#L557-3 assume test_fun_#t~short9; 7019#L557-4 SUMMARY for call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557-4 7023#L557-5 test_fun_#t~short9 := test_fun_#t~mem8 < 1073741824; 7028#L557-7 assume !!test_fun_#t~short9;havoc test_fun_#t~mem7;havoc test_fun_#t~short9;havoc test_fun_#t~mem8;havoc test_fun_#t~mem6; 7089#L558 SUMMARY for call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L558 7088#L558-1 SUMMARY for call write~int(2 * test_fun_#t~mem10, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L558-1 7087#L558-2 havoc test_fun_#t~mem10; 7000#L557-9 assume true; 7001#L557 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L557 7094#L557-1 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557-1 7093#L557-2 test_fun_#t~short9 := test_fun_#t~mem6 > test_fun_#t~mem7; 7092#L557-3 assume test_fun_#t~short9; 7091#L557-4 SUMMARY for call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557-4 7090#L557-5 test_fun_#t~short9 := test_fun_#t~mem8 < 1073741824; 7030#L557-7 assume !!test_fun_#t~short9;havoc test_fun_#t~mem7;havoc test_fun_#t~short9;havoc test_fun_#t~mem8;havoc test_fun_#t~mem6; 7002#L558 SUMMARY for call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L558 7003#L558-1 SUMMARY for call write~int(2 * test_fun_#t~mem10, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L558-1 7006#L558-2 havoc test_fun_#t~mem10; 7010#L557-9 assume true; 7086#L557 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L557 7085#L557-1 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557-1 7084#L557-2 test_fun_#t~short9 := test_fun_#t~mem6 > test_fun_#t~mem7; 7083#L557-3 assume test_fun_#t~short9; 7082#L557-4 SUMMARY for call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557-4 7081#L557-5 test_fun_#t~short9 := test_fun_#t~mem8 < 1073741824; 7080#L557-7 assume !!test_fun_#t~short9;havoc test_fun_#t~mem7;havoc test_fun_#t~short9;havoc test_fun_#t~mem8;havoc test_fun_#t~mem6; 7079#L558 SUMMARY for call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L558 7078#L558-1 SUMMARY for call write~int(2 * test_fun_#t~mem10, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L558-1 7077#L558-2 havoc test_fun_#t~mem10; 7076#L557-9 assume true; 7075#L557 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L557 7074#L557-1 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557-1 7073#L557-2 test_fun_#t~short9 := test_fun_#t~mem6 > test_fun_#t~mem7; 7072#L557-3 assume test_fun_#t~short9; 7071#L557-4 SUMMARY for call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557-4 7070#L557-5 test_fun_#t~short9 := test_fun_#t~mem8 < 1073741824; 7069#L557-7 assume !!test_fun_#t~short9;havoc test_fun_#t~mem7;havoc test_fun_#t~short9;havoc test_fun_#t~mem8;havoc test_fun_#t~mem6; 7068#L558 SUMMARY for call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L558 7067#L558-1 SUMMARY for call write~int(2 * test_fun_#t~mem10, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L558-1 7066#L558-2 havoc test_fun_#t~mem10; 7065#L557-9 assume true; 7064#L557 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L557 7063#L557-1 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557-1 7062#L557-2 test_fun_#t~short9 := test_fun_#t~mem6 > test_fun_#t~mem7; 7061#L557-3 assume test_fun_#t~short9; 7060#L557-4 SUMMARY for call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557-4 7059#L557-5 test_fun_#t~short9 := test_fun_#t~mem8 < 1073741824; 7058#L557-7 assume !!test_fun_#t~short9;havoc test_fun_#t~mem7;havoc test_fun_#t~short9;havoc test_fun_#t~mem8;havoc test_fun_#t~mem6; 7057#L558 SUMMARY for call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L558 7056#L558-1 SUMMARY for call write~int(2 * test_fun_#t~mem10, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L558-1 7055#L558-2 havoc test_fun_#t~mem10; 7054#L557-9 assume true; 7053#L557 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L557 7052#L557-1 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557-1 7051#L557-2 test_fun_#t~short9 := test_fun_#t~mem6 > test_fun_#t~mem7; 7050#L557-3 assume test_fun_#t~short9; 7049#L557-4 SUMMARY for call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557-4 7048#L557-5 test_fun_#t~short9 := test_fun_#t~mem8 < 1073741824; 7047#L557-7 assume !!test_fun_#t~short9;havoc test_fun_#t~mem7;havoc test_fun_#t~short9;havoc test_fun_#t~mem8;havoc test_fun_#t~mem6; 7046#L558 SUMMARY for call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L558 7045#L558-1 SUMMARY for call write~int(2 * test_fun_#t~mem10, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L558-1 7044#L558-2 havoc test_fun_#t~mem10; 7034#L557-9 assume true; 7043#L557 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L557 7042#L557-1 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557-1 7041#L557-2 test_fun_#t~short9 := test_fun_#t~mem6 > test_fun_#t~mem7; 7040#L557-3 assume test_fun_#t~short9; 7039#L557-4 SUMMARY for call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557-4 7038#L557-5 test_fun_#t~short9 := test_fun_#t~mem8 < 1073741824; 7037#L557-7 assume !!test_fun_#t~short9;havoc test_fun_#t~mem7;havoc test_fun_#t~short9;havoc test_fun_#t~mem8;havoc test_fun_#t~mem6; 7036#L558 SUMMARY for call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L558 7035#L558-1 SUMMARY for call write~int(2 * test_fun_#t~mem10, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L558-1 7033#L558-2 havoc test_fun_#t~mem10; 7032#L557-9 assume true; 7007#L557 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L557 7008#L557-1 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557-1 7011#L557-2 test_fun_#t~short9 := test_fun_#t~mem6 > test_fun_#t~mem7; 7014#L557-3 assume test_fun_#t~short9; 7018#L557-4 SUMMARY for call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557-4 7022#L557-5 test_fun_#t~short9 := test_fun_#t~mem8 < 1073741824; 7027#L557-7 assume !test_fun_#t~short9;havoc test_fun_#t~mem7;havoc test_fun_#t~short9;havoc test_fun_#t~mem8;havoc test_fun_#t~mem6; 7004#L557-10 SUMMARY for call test_fun_#t~mem11 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L557-10 7005#L560 SUMMARY for call write~int(test_fun_#t~mem11 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L560 7031#L560-1 havoc test_fun_#t~mem11; 7025#L555-3 [2018-11-10 10:32:28,955 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:32:28,955 INFO L82 PathProgramCache]: Analyzing trace with hash 28691745, now seen corresponding path program 7 times [2018-11-10 10:32:28,955 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:32:28,960 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:32:28,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:32:28,961 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 10:32:28,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:32:28,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:32:28,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:32:28,968 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:32:28,968 INFO L82 PathProgramCache]: Analyzing trace with hash 267814572, now seen corresponding path program 7 times [2018-11-10 10:32:28,968 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:32:28,968 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:32:28,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:32:28,969 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:32:28,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:32:28,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:32:29,238 INFO L134 CoverageAnalysis]: Checked inductivity of 287 backedges. 0 proven. 287 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:32:29,239 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 10:32:29,239 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_90d8d520-a9ba-40ca-8940-35d04161bf04/bin-2019/uautomizer/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 10:32:29,254 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:32:29,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:32:29,286 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:32:29,288 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-10 10:32:29,290 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 10:32:29,291 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:32:29,296 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:32:29,297 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:32:29,297 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2018-11-10 10:32:29,312 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:32:29,313 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 29 [2018-11-10 10:32:29,315 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 19 [2018-11-10 10:32:29,315 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:32:29,321 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:32:29,325 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:32:29,326 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:13 [2018-11-10 10:32:29,377 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 23 [2018-11-10 10:32:29,381 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-11-10 10:32:29,381 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:32:29,385 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:32:29,389 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-10 10:32:29,389 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:33, output treesize:18 [2018-11-10 10:32:29,434 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 23 [2018-11-10 10:32:29,436 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-11-10 10:32:29,437 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:32:29,440 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:32:29,446 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-11-10 10:32:29,446 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:38, output treesize:23 [2018-11-10 10:32:29,501 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 23 [2018-11-10 10:32:29,504 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-11-10 10:32:29,504 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:32:29,507 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:32:29,512 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-11-10 10:32:29,513 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:43, output treesize:28 [2018-11-10 10:32:30,444 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 23 [2018-11-10 10:32:30,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, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-11-10 10:32:30,447 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:32:30,454 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:32:30,463 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2018-11-10 10:32:30,463 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:48, output treesize:33 [2018-11-10 10:32:32,542 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 23 [2018-11-10 10:32:32,544 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-11-10 10:32:32,545 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:32:32,548 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:32:32,555 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2018-11-10 10:32:32,555 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:53, output treesize:38 [2018-11-10 10:32:55,865 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 23 [2018-11-10 10:32:55,868 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-11-10 10:32:55,868 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:32:55,871 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:32:55,879 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-2 vars, End of recursive call: 7 dim-0 vars, and 1 xjuncts. [2018-11-10 10:32:55,880 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:58, output treesize:43 [2018-11-10 10:33:15,919 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-11-10 10:33:15,921 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-11-10 10:33:15,922 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:33:15,928 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:33:15,936 INFO L267 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 1 dim-2 vars, End of recursive call: 7 dim-0 vars, and 1 xjuncts. [2018-11-10 10:33:15,936 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 10 variables, input treesize:50, output treesize:39 [2018-11-10 10:33:15,981 INFO L134 CoverageAnalysis]: Checked inductivity of 287 backedges. 0 proven. 287 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:33:15,997 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 10:33:15,997 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 19] total 40 [2018-11-10 10:33:15,997 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 10:33:15,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-11-10 10:33:15,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=328, Invalid=1228, Unknown=4, NotChecked=0, Total=1560 [2018-11-10 10:33:15,998 INFO L87 Difference]: Start difference. First operand 97 states and 98 transitions. cyclomatic complexity: 2 Second operand 40 states. [2018-11-10 10:33:25,754 WARN L179 SmtUtils]: Spent 481.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 25 [2018-11-10 10:34:36,317 WARN L179 SmtUtils]: Spent 24.12 s on a formula simplification that was a NOOP. DAG size: 37 [2018-11-10 10:35:16,192 WARN L179 SmtUtils]: Spent 385.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 28 [2018-11-10 10:36:03,875 WARN L179 SmtUtils]: Spent 41.57 s on a formula simplification. DAG size of input: 39 DAG size of output: 37 [2018-11-10 10:37:02,228 WARN L179 SmtUtils]: Spent 48.54 s on a formula simplification. DAG size of input: 40 DAG size of output: 38 [2018-11-10 10:37:55,794 WARN L179 SmtUtils]: Spent 47.12 s on a formula simplification. DAG size of input: 43 DAG size of output: 41 [2018-11-10 10:38:44,261 WARN L179 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 35 [2018-11-10 10:39:22,510 WARN L194 Executor]: External (z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000) stderr output: (error "out of memory") [2018-11-10 10:39:22,511 FATAL L265 ToolchainWalker]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000)Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:208) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:225) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:155) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.WrapperScript.checkSat(WrapperScript.java:116) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.WrapperScript.checkSat(WrapperScript.java:116) at de.uni_freiburg.informatik.ultimate.logic.Util.checkSat(Util.java:61) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA.getRedundancy(SimplifyDDA.java:621) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.SimplifyDDAWithTimeout.getRedundancy(SimplifyDDAWithTimeout.java:122) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA$Simplifier.walk(SimplifyDDA.java:371) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:122) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:113) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA.simplifyOnce(SimplifyDDA.java:650) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.SimplifyDDAWithTimeout.getSimplifiedTerm(SimplifyDDAWithTimeout.java:187) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.SmtUtils.simplify(SmtUtils.java:150) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:354) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:382) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.getOrConstructPredicate(DeterministicInterpolantAutomaton.java:281) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.constructSuccessorsAndTransitions(DeterministicInterpolantAutomaton.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:78) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:234) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:213) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.internalSuccessors(ComplementDeterministicNwa.java:121) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:216) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:208) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addInternalsAndSuccessors(NestedWordAutomatonReachableStates.java:1066) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:968) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:188) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.refineFinite(BuchiCegarLoop.java:980) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.iterate(BuchiCegarLoop.java:549) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:145) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:384) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1427) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:630) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:419) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:205) ... 45 more [2018-11-10 10:39:22,514 INFO L168 Benchmark]: Toolchain (without parser) took 582528.48 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 316.7 MB). Free memory was 956.6 MB in the beginning and 1.3 GB in the end (delta: -348.5 MB). Peak memory consumption was 456.4 MB. Max. memory is 11.5 GB. [2018-11-10 10:39:22,514 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 10:39:22,514 INFO L168 Benchmark]: CACSL2BoogieTranslator took 289.99 ms. Allocated memory is still 1.0 GB. Free memory was 956.6 MB in the beginning and 935.1 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. [2018-11-10 10:39:22,514 INFO L168 Benchmark]: Boogie Procedure Inliner took 75.17 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.6 MB). Free memory was 935.1 MB in the beginning and 1.1 GB in the end (delta: -195.9 MB). Peak memory consumption was 16.0 MB. Max. memory is 11.5 GB. [2018-11-10 10:39:22,515 INFO L168 Benchmark]: Boogie Preprocessor took 14.52 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-10 10:39:22,515 INFO L168 Benchmark]: RCFGBuilder took 210.48 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: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. [2018-11-10 10:39:22,515 INFO L168 Benchmark]: BuchiAutomizer took 581935.35 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 185.1 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -199.1 MB). Peak memory consumption was 474.2 MB. Max. memory is 11.5 GB. [2018-11-10 10:39:22,517 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.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 289.99 ms. Allocated memory is still 1.0 GB. Free memory was 956.6 MB in the beginning and 935.1 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 75.17 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.6 MB). Free memory was 935.1 MB in the beginning and 1.1 GB in the end (delta: -195.9 MB). Peak memory consumption was 16.0 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 14.52 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 210.48 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: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 581935.35 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 185.1 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -199.1 MB). Peak memory consumption was 474.2 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 - 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...