./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/Urban-2013WST-Fig2-alloca_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_89bf4f0b-a4b2-4f91-80ee-d2a143ee9ebf/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_89bf4f0b-a4b2-4f91-80ee-d2a143ee9ebf/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_89bf4f0b-a4b2-4f91-80ee-d2a143ee9ebf/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_89bf4f0b-a4b2-4f91-80ee-d2a143ee9ebf/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/Urban-2013WST-Fig2-alloca_true-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_89bf4f0b-a4b2-4f91-80ee-d2a143ee9ebf/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_89bf4f0b-a4b2-4f91-80ee-d2a143ee9ebf/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 b6ea490b9c20ea87d0996e916d918afb3a914616 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-02 05:28:17,433 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 05:28:17,434 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 05:28:17,441 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 05:28:17,441 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 05:28:17,442 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 05:28:17,443 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 05:28:17,444 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 05:28:17,445 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 05:28:17,446 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 05:28:17,446 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 05:28:17,446 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 05:28:17,447 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 05:28:17,448 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 05:28:17,449 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 05:28:17,449 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 05:28:17,450 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 05:28:17,451 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 05:28:17,452 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 05:28:17,453 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 05:28:17,454 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 05:28:17,455 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 05:28:17,457 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 05:28:17,457 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 05:28:17,457 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 05:28:17,458 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 05:28:17,458 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 05:28:17,459 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 05:28:17,459 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 05:28:17,460 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 05:28:17,460 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 05:28:17,461 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 05:28:17,461 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 05:28:17,461 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 05:28:17,462 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 05:28:17,462 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 05:28:17,462 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_89bf4f0b-a4b2-4f91-80ee-d2a143ee9ebf/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-12-02 05:28:17,473 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 05:28:17,473 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 05:28:17,474 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-02 05:28:17,474 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-02 05:28:17,474 INFO L133 SettingsManager]: * Use SBE=true [2018-12-02 05:28:17,474 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-12-02 05:28:17,474 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-12-02 05:28:17,475 INFO L133 SettingsManager]: * Use old map elimination=false [2018-12-02 05:28:17,475 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-12-02 05:28:17,475 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-12-02 05:28:17,475 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-12-02 05:28:17,475 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 05:28:17,475 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-02 05:28:17,475 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 05:28:17,475 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 05:28:17,476 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-12-02 05:28:17,476 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-12-02 05:28:17,476 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-12-02 05:28:17,476 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-02 05:28:17,476 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-12-02 05:28:17,476 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-02 05:28:17,477 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-12-02 05:28:17,477 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 05:28:17,477 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 05:28:17,477 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-12-02 05:28:17,477 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 05:28:17,477 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-02 05:28:17,477 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-12-02 05:28:17,478 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-12-02 05:28:17,478 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_89bf4f0b-a4b2-4f91-80ee-d2a143ee9ebf/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 -> b6ea490b9c20ea87d0996e916d918afb3a914616 [2018-12-02 05:28:17,500 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 05:28:17,507 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 05:28:17,509 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 05:28:17,510 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 05:28:17,510 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 05:28:17,511 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_89bf4f0b-a4b2-4f91-80ee-d2a143ee9ebf/bin-2019/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/Urban-2013WST-Fig2-alloca_true-termination.c.i [2018-12-02 05:28:17,544 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_89bf4f0b-a4b2-4f91-80ee-d2a143ee9ebf/bin-2019/uautomizer/data/e277b6413/20899c7d854e4379acaccd01c259289b/FLAG371b08d2a [2018-12-02 05:28:18,013 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 05:28:18,013 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_89bf4f0b-a4b2-4f91-80ee-d2a143ee9ebf/sv-benchmarks/c/termination-memory-alloca/Urban-2013WST-Fig2-alloca_true-termination.c.i [2018-12-02 05:28:18,020 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_89bf4f0b-a4b2-4f91-80ee-d2a143ee9ebf/bin-2019/uautomizer/data/e277b6413/20899c7d854e4379acaccd01c259289b/FLAG371b08d2a [2018-12-02 05:28:18,028 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_89bf4f0b-a4b2-4f91-80ee-d2a143ee9ebf/bin-2019/uautomizer/data/e277b6413/20899c7d854e4379acaccd01c259289b [2018-12-02 05:28:18,030 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 05:28:18,031 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 05:28:18,031 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 05:28:18,031 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 05:28:18,033 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 05:28:18,034 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 05:28:18" (1/1) ... [2018-12-02 05:28:18,035 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25c26117 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:28:18, skipping insertion in model container [2018-12-02 05:28:18,035 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 05:28:18" (1/1) ... [2018-12-02 05:28:18,040 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 05:28:18,062 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 05:28:18,217 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 05:28:18,223 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 05:28:18,281 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 05:28:18,305 INFO L195 MainTranslator]: Completed translation [2018-12-02 05:28:18,305 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:28:18 WrapperNode [2018-12-02 05:28:18,305 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 05:28:18,306 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 05:28:18,306 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 05:28:18,306 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 05:28:18,313 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:28:18" (1/1) ... [2018-12-02 05:28:18,324 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:28:18" (1/1) ... [2018-12-02 05:28:18,338 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 05:28:18,338 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 05:28:18,338 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 05:28:18,338 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 05:28:18,344 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:28:18" (1/1) ... [2018-12-02 05:28:18,344 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:28:18" (1/1) ... [2018-12-02 05:28:18,345 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:28:18" (1/1) ... [2018-12-02 05:28:18,345 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:28:18" (1/1) ... [2018-12-02 05:28:18,347 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:28:18" (1/1) ... [2018-12-02 05:28:18,350 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:28:18" (1/1) ... [2018-12-02 05:28:18,351 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:28:18" (1/1) ... [2018-12-02 05:28:18,352 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 05:28:18,352 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 05:28:18,352 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 05:28:18,352 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 05:28:18,352 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:28:18" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_89bf4f0b-a4b2-4f91-80ee-d2a143ee9ebf/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-12-02 05:28:18,383 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-02 05:28:18,384 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-02 05:28:18,384 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-02 05:28:18,384 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-02 05:28:18,384 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 05:28:18,384 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 05:28:18,496 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 05:28:18,496 INFO L280 CfgBuilder]: Removed 6 assue(true) statements. [2018-12-02 05:28:18,497 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 05:28:18 BoogieIcfgContainer [2018-12-02 05:28:18,497 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 05:28:18,497 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-12-02 05:28:18,497 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-12-02 05:28:18,499 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-12-02 05:28:18,500 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-02 05:28:18,500 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 02.12 05:28:18" (1/3) ... [2018-12-02 05:28:18,501 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4d0150a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 02.12 05:28:18, skipping insertion in model container [2018-12-02 05:28:18,501 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-02 05:28:18,501 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:28:18" (2/3) ... [2018-12-02 05:28:18,501 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4d0150a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 02.12 05:28:18, skipping insertion in model container [2018-12-02 05:28:18,501 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-02 05:28:18,501 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 05:28:18" (3/3) ... [2018-12-02 05:28:18,502 INFO L375 chiAutomizerObserver]: Analyzing ICFG Urban-2013WST-Fig2-alloca_true-termination.c.i [2018-12-02 05:28:18,534 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-02 05:28:18,535 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-12-02 05:28:18,535 INFO L375 BuchiCegarLoop]: Hoare is false [2018-12-02 05:28:18,535 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-12-02 05:28:18,535 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 05:28:18,535 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 05:28:18,535 INFO L379 BuchiCegarLoop]: Difference is false [2018-12-02 05:28:18,535 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 05:28:18,535 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-12-02 05:28:18,543 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states. [2018-12-02 05:28:18,557 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-12-02 05:28:18,558 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 05:28:18,558 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 05:28:18,562 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-12-02 05:28:18,562 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-02 05:28:18,562 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-12-02 05:28:18,562 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states. [2018-12-02 05:28:18,563 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-12-02 05:28:18,563 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 05:28:18,563 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 05:28:18,563 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-12-02 05:28:18,563 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-02 05:28:18,568 INFO L794 eck$LassoCheckResult]: Stem: 6#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 3#L-1true havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem6, main_#t~mem5, main_#t~mem7, main_#t~mem4, main_~x1~0.base, main_~x1~0.offset, main_~x2~0.base, main_~x2~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4);main_~x1~0.base, main_~x1~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4);main_~x2~0.base, main_~x2~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 8#L549-3true [2018-12-02 05:28:18,568 INFO L796 eck$LassoCheckResult]: Loop: 8#L549-3true call main_#t~mem4 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 4#L549-1true assume !!(main_#t~mem4 <= 10);havoc main_#t~mem4;call write~int(10, main_~x2~0.base, main_~x2~0.offset, 4); 5#L551-3true assume !true; 7#L551-4true call main_#t~mem7 := read~int(main_~x1~0.base, main_~x1~0.offset, 4);call write~int(1 + main_#t~mem7, main_~x1~0.base, main_~x1~0.offset, 4);havoc main_#t~mem7; 8#L549-3true [2018-12-02 05:28:18,572 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:28:18,572 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-12-02 05:28:18,573 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 05:28:18,573 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 05:28:18,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:28:18,607 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:28:18,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:28:18,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 05:28:18,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 05:28:18,640 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:28:18,640 INFO L82 PathProgramCache]: Analyzing trace with hash 1144360, now seen corresponding path program 1 times [2018-12-02 05:28:18,640 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 05:28:18,640 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 05:28:18,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:28:18,641 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:28:18,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:28:18,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:28:18,662 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 05:28:18,663 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:28:18,663 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-02 05:28:18,665 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-02 05:28:18,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-12-02 05:28:18,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-02 05:28:18,675 INFO L87 Difference]: Start difference. First operand 11 states. Second operand 2 states. [2018-12-02 05:28:18,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:28:18,679 INFO L93 Difference]: Finished difference Result 11 states and 12 transitions. [2018-12-02 05:28:18,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-12-02 05:28:18,680 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 12 transitions. [2018-12-02 05:28:18,681 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-12-02 05:28:18,683 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 7 states and 8 transitions. [2018-12-02 05:28:18,684 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2018-12-02 05:28:18,684 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2018-12-02 05:28:18,684 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 8 transitions. [2018-12-02 05:28:18,685 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 05:28:18,685 INFO L705 BuchiCegarLoop]: Abstraction has 7 states and 8 transitions. [2018-12-02 05:28:18,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states and 8 transitions. [2018-12-02 05:28:18,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-12-02 05:28:18,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-12-02 05:28:18,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8 transitions. [2018-12-02 05:28:18,701 INFO L728 BuchiCegarLoop]: Abstraction has 7 states and 8 transitions. [2018-12-02 05:28:18,701 INFO L608 BuchiCegarLoop]: Abstraction has 7 states and 8 transitions. [2018-12-02 05:28:18,701 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-12-02 05:28:18,701 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 8 transitions. [2018-12-02 05:28:18,702 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-12-02 05:28:18,702 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 05:28:18,702 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 05:28:18,702 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-12-02 05:28:18,702 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-12-02 05:28:18,702 INFO L794 eck$LassoCheckResult]: Stem: 35#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 30#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem6, main_#t~mem5, main_#t~mem7, main_#t~mem4, main_~x1~0.base, main_~x1~0.offset, main_~x2~0.base, main_~x2~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4);main_~x1~0.base, main_~x1~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4);main_~x2~0.base, main_~x2~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 31#L549-3 [2018-12-02 05:28:18,702 INFO L796 eck$LassoCheckResult]: Loop: 31#L549-3 call main_#t~mem4 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 32#L549-1 assume !!(main_#t~mem4 <= 10);havoc main_#t~mem4;call write~int(10, main_~x2~0.base, main_~x2~0.offset, 4); 33#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 34#L551-1 assume !(main_#t~mem5 > 1);havoc main_#t~mem5; 36#L551-4 call main_#t~mem7 := read~int(main_~x1~0.base, main_~x1~0.offset, 4);call write~int(1 + main_#t~mem7, main_~x1~0.base, main_~x1~0.offset, 4);havoc main_#t~mem7; 31#L549-3 [2018-12-02 05:28:18,702 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:28:18,703 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2018-12-02 05:28:18,703 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 05:28:18,703 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 05:28:18,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:28:18,704 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:28:18,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:28:18,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 05:28:18,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 05:28:18,711 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:28:18,711 INFO L82 PathProgramCache]: Analyzing trace with hash 35468273, now seen corresponding path program 1 times [2018-12-02 05:28:18,711 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 05:28:18,711 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 05:28:18,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:28:18,712 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 05:28:18,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:28:18,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:28:18,751 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 05:28:18,752 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:28:18,752 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 05:28:18,752 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-02 05:28:18,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 05:28:18,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 05:28:18,752 INFO L87 Difference]: Start difference. First operand 7 states and 8 transitions. cyclomatic complexity: 2 Second operand 4 states. [2018-12-02 05:28:18,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:28:18,773 INFO L93 Difference]: Finished difference Result 9 states and 10 transitions. [2018-12-02 05:28:18,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 05:28:18,774 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 9 states and 10 transitions. [2018-12-02 05:28:18,774 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-12-02 05:28:18,774 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 9 states to 9 states and 10 transitions. [2018-12-02 05:28:18,774 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2018-12-02 05:28:18,774 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2018-12-02 05:28:18,775 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 10 transitions. [2018-12-02 05:28:18,775 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 05:28:18,775 INFO L705 BuchiCegarLoop]: Abstraction has 9 states and 10 transitions. [2018-12-02 05:28:18,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 10 transitions. [2018-12-02 05:28:18,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-12-02 05:28:18,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-12-02 05:28:18,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2018-12-02 05:28:18,776 INFO L728 BuchiCegarLoop]: Abstraction has 9 states and 10 transitions. [2018-12-02 05:28:18,776 INFO L608 BuchiCegarLoop]: Abstraction has 9 states and 10 transitions. [2018-12-02 05:28:18,776 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-12-02 05:28:18,776 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 10 transitions. [2018-12-02 05:28:18,776 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-12-02 05:28:18,776 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 05:28:18,777 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 05:28:18,777 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-12-02 05:28:18,777 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1] [2018-12-02 05:28:18,777 INFO L794 eck$LassoCheckResult]: Stem: 61#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 57#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem6, main_#t~mem5, main_#t~mem7, main_#t~mem4, main_~x1~0.base, main_~x1~0.offset, main_~x2~0.base, main_~x2~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4);main_~x1~0.base, main_~x1~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4);main_~x2~0.base, main_~x2~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 58#L549-3 [2018-12-02 05:28:18,777 INFO L796 eck$LassoCheckResult]: Loop: 58#L549-3 call main_#t~mem4 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 59#L549-1 assume !!(main_#t~mem4 <= 10);havoc main_#t~mem4;call write~int(10, main_~x2~0.base, main_~x2~0.offset, 4); 55#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 56#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 62#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 63#L551-1 assume !(main_#t~mem5 > 1);havoc main_#t~mem5; 60#L551-4 call main_#t~mem7 := read~int(main_~x1~0.base, main_~x1~0.offset, 4);call write~int(1 + main_#t~mem7, main_~x1~0.base, main_~x1~0.offset, 4);havoc main_#t~mem7; 58#L549-3 [2018-12-02 05:28:18,777 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:28:18,777 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2018-12-02 05:28:18,778 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 05:28:18,778 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 05:28:18,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:28:18,779 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:28:18,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:28:18,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 05:28:18,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 05:28:18,785 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:28:18,786 INFO L82 PathProgramCache]: Analyzing trace with hash -274676436, now seen corresponding path program 1 times [2018-12-02 05:28:18,786 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 05:28:18,786 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 05:28:18,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:28:18,787 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 05:28:18,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:28:18,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:28:18,842 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 05:28:18,842 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 05:28:18,842 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_89bf4f0b-a4b2-4f91-80ee-d2a143ee9ebf/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-12-02 05:28:18,849 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:28:18,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:28:18,861 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 05:28:18,884 INFO L478 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-12-02 05:28:18,886 INFO L478 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-12-02 05:28:18,886 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 05:28:18,888 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:28:18,889 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:28:18,889 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2018-12-02 05:28:18,894 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:28:18,895 INFO L478 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 25 treesize of output 28 [2018-12-02 05:28:18,898 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:28:18,898 INFO L478 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 28 treesize of output 7 [2018-12-02 05:28:18,899 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 05:28:18,900 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:28:18,902 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:28:18,902 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:7 [2018-12-02 05:28:18,913 INFO L478 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 15 treesize of output 11 [2018-12-02 05:28:18,915 INFO L478 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-12-02 05:28:18,915 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 05:28:18,916 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:28:18,917 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:28:18,917 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2018-12-02 05:28:18,919 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 05:28:18,933 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 05:28:18,933 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 7 [2018-12-02 05:28:18,933 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-02 05:28:18,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 05:28:18,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-12-02 05:28:18,934 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. cyclomatic complexity: 2 Second operand 7 states. [2018-12-02 05:28:18,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:28:18,963 INFO L93 Difference]: Finished difference Result 11 states and 12 transitions. [2018-12-02 05:28:18,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 05:28:18,964 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 12 transitions. [2018-12-02 05:28:18,964 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2018-12-02 05:28:18,965 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 11 states and 12 transitions. [2018-12-02 05:28:18,965 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2018-12-02 05:28:18,965 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-12-02 05:28:18,965 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 12 transitions. [2018-12-02 05:28:18,965 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 05:28:18,965 INFO L705 BuchiCegarLoop]: Abstraction has 11 states and 12 transitions. [2018-12-02 05:28:18,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 12 transitions. [2018-12-02 05:28:18,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-12-02 05:28:18,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-12-02 05:28:18,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2018-12-02 05:28:18,966 INFO L728 BuchiCegarLoop]: Abstraction has 11 states and 12 transitions. [2018-12-02 05:28:18,966 INFO L608 BuchiCegarLoop]: Abstraction has 11 states and 12 transitions. [2018-12-02 05:28:18,966 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-12-02 05:28:18,967 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 12 transitions. [2018-12-02 05:28:18,967 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2018-12-02 05:28:18,967 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 05:28:18,967 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 05:28:18,967 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-12-02 05:28:18,967 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [3, 2, 1, 1, 1, 1] [2018-12-02 05:28:18,967 INFO L794 eck$LassoCheckResult]: Stem: 111#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 107#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem6, main_#t~mem5, main_#t~mem7, main_#t~mem4, main_~x1~0.base, main_~x1~0.offset, main_~x2~0.base, main_~x2~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4);main_~x1~0.base, main_~x1~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4);main_~x2~0.base, main_~x2~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 108#L549-3 [2018-12-02 05:28:18,968 INFO L796 eck$LassoCheckResult]: Loop: 108#L549-3 call main_#t~mem4 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 109#L549-1 assume !!(main_#t~mem4 <= 10);havoc main_#t~mem4;call write~int(10, main_~x2~0.base, main_~x2~0.offset, 4); 105#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 106#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 112#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 115#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 114#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 113#L551-1 assume !(main_#t~mem5 > 1);havoc main_#t~mem5; 110#L551-4 call main_#t~mem7 := read~int(main_~x1~0.base, main_~x1~0.offset, 4);call write~int(1 + main_#t~mem7, main_~x1~0.base, main_~x1~0.offset, 4);havoc main_#t~mem7; 108#L549-3 [2018-12-02 05:28:18,968 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:28:18,968 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2018-12-02 05:28:18,968 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 05:28:18,968 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 05:28:18,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:28:18,969 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:28:18,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:28:18,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 05:28:18,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 05:28:18,976 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:28:18,976 INFO L82 PathProgramCache]: Analyzing trace with hash -1970998361, now seen corresponding path program 2 times [2018-12-02 05:28:18,976 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 05:28:18,976 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 05:28:18,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:28:18,978 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 05:28:18,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:28:18,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:28:19,047 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 05:28:19,047 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 05:28:19,047 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_89bf4f0b-a4b2-4f91-80ee-d2a143ee9ebf/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-12-02 05:28:19,053 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-02 05:28:19,061 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-02 05:28:19,061 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 05:28:19,062 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 05:28:19,065 INFO L478 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-12-02 05:28:19,066 INFO L478 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-12-02 05:28:19,066 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 05:28:19,068 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:28:19,070 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:28:19,070 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2018-12-02 05:28:19,074 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:28:19,075 INFO L478 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 25 treesize of output 28 [2018-12-02 05:28:19,078 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:28:19,078 INFO L478 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 28 treesize of output 7 [2018-12-02 05:28:19,079 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 05:28:19,080 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:28:19,082 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:28:19,082 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:7 [2018-12-02 05:28:19,095 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:28:19,096 INFO L478 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 25 treesize of output 28 [2018-12-02 05:28:19,099 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:28:19,099 INFO L478 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 28 treesize of output 7 [2018-12-02 05:28:19,100 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 05:28:19,101 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:28:19,102 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:28:19,102 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:7 [2018-12-02 05:28:19,109 INFO L478 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 15 treesize of output 11 [2018-12-02 05:28:19,110 INFO L478 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-12-02 05:28:19,111 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 05:28:19,112 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:28:19,114 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:28:19,114 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2018-12-02 05:28:19,115 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 05:28:19,129 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 05:28:19,129 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 10 [2018-12-02 05:28:19,129 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-02 05:28:19,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-02 05:28:19,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2018-12-02 05:28:19,130 INFO L87 Difference]: Start difference. First operand 11 states and 12 transitions. cyclomatic complexity: 2 Second operand 10 states. [2018-12-02 05:28:19,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:28:19,179 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2018-12-02 05:28:19,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 05:28:19,180 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 14 transitions. [2018-12-02 05:28:19,180 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2018-12-02 05:28:19,180 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 13 states and 14 transitions. [2018-12-02 05:28:19,181 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2018-12-02 05:28:19,181 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2018-12-02 05:28:19,181 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 14 transitions. [2018-12-02 05:28:19,181 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 05:28:19,181 INFO L705 BuchiCegarLoop]: Abstraction has 13 states and 14 transitions. [2018-12-02 05:28:19,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 14 transitions. [2018-12-02 05:28:19,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-12-02 05:28:19,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-12-02 05:28:19,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2018-12-02 05:28:19,182 INFO L728 BuchiCegarLoop]: Abstraction has 13 states and 14 transitions. [2018-12-02 05:28:19,182 INFO L608 BuchiCegarLoop]: Abstraction has 13 states and 14 transitions. [2018-12-02 05:28:19,182 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-12-02 05:28:19,182 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 14 transitions. [2018-12-02 05:28:19,183 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2018-12-02 05:28:19,183 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 05:28:19,183 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 05:28:19,183 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-12-02 05:28:19,183 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [4, 3, 1, 1, 1, 1] [2018-12-02 05:28:19,183 INFO L794 eck$LassoCheckResult]: Stem: 177#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 172#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem6, main_#t~mem5, main_#t~mem7, main_#t~mem4, main_~x1~0.base, main_~x1~0.offset, main_~x2~0.base, main_~x2~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4);main_~x1~0.base, main_~x1~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4);main_~x2~0.base, main_~x2~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 173#L549-3 [2018-12-02 05:28:19,184 INFO L796 eck$LassoCheckResult]: Loop: 173#L549-3 call main_#t~mem4 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 174#L549-1 assume !!(main_#t~mem4 <= 10);havoc main_#t~mem4;call write~int(10, main_~x2~0.base, main_~x2~0.offset, 4); 175#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 178#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 170#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 171#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 182#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 181#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 180#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 179#L551-1 assume !(main_#t~mem5 > 1);havoc main_#t~mem5; 176#L551-4 call main_#t~mem7 := read~int(main_~x1~0.base, main_~x1~0.offset, 4);call write~int(1 + main_#t~mem7, main_~x1~0.base, main_~x1~0.offset, 4);havoc main_#t~mem7; 173#L549-3 [2018-12-02 05:28:19,184 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:28:19,184 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 5 times [2018-12-02 05:28:19,184 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 05:28:19,184 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 05:28:19,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:28:19,185 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 05:28:19,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:28:19,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 05:28:19,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 05:28:19,192 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:28:19,192 INFO L82 PathProgramCache]: Analyzing trace with hash -48795806, now seen corresponding path program 3 times [2018-12-02 05:28:19,192 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 05:28:19,192 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 05:28:19,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:28:19,194 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 05:28:19,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:28:19,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:28:19,278 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 05:28:19,279 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 05:28:19,279 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_89bf4f0b-a4b2-4f91-80ee-d2a143ee9ebf/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-12-02 05:28:19,285 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-02 05:28:19,298 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-12-02 05:28:19,298 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 05:28:19,299 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 05:28:19,302 INFO L478 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-12-02 05:28:19,303 INFO L478 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-12-02 05:28:19,304 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 05:28:19,305 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:28:19,306 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:28:19,306 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2018-12-02 05:28:19,309 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:28:19,309 INFO L478 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 25 treesize of output 28 [2018-12-02 05:28:19,314 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:28:19,315 INFO L478 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 28 treesize of output 7 [2018-12-02 05:28:19,315 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 05:28:19,317 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:28:19,318 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:28:19,318 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:7 [2018-12-02 05:28:19,325 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:28:19,326 INFO L478 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 25 treesize of output 28 [2018-12-02 05:28:19,328 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:28:19,328 INFO L478 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 28 treesize of output 7 [2018-12-02 05:28:19,329 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 05:28:19,330 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:28:19,331 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:28:19,331 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:7 [2018-12-02 05:28:19,338 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:28:19,338 INFO L478 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 25 treesize of output 28 [2018-12-02 05:28:19,341 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:28:19,341 INFO L478 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 28 treesize of output 7 [2018-12-02 05:28:19,342 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 05:28:19,343 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:28:19,344 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:28:19,344 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:7 [2018-12-02 05:28:19,351 INFO L478 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 15 treesize of output 11 [2018-12-02 05:28:19,353 INFO L478 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-12-02 05:28:19,353 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 05:28:19,354 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:28:19,355 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:28:19,355 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2018-12-02 05:28:19,356 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 05:28:19,370 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 05:28:19,370 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 13 [2018-12-02 05:28:19,371 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-02 05:28:19,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-02 05:28:19,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2018-12-02 05:28:19,371 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. cyclomatic complexity: 2 Second operand 13 states. [2018-12-02 05:28:19,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:28:19,434 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2018-12-02 05:28:19,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-02 05:28:19,435 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 16 transitions. [2018-12-02 05:28:19,435 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2018-12-02 05:28:19,436 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 15 states and 16 transitions. [2018-12-02 05:28:19,436 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2018-12-02 05:28:19,436 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2018-12-02 05:28:19,436 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 16 transitions. [2018-12-02 05:28:19,436 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 05:28:19,436 INFO L705 BuchiCegarLoop]: Abstraction has 15 states and 16 transitions. [2018-12-02 05:28:19,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 16 transitions. [2018-12-02 05:28:19,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-12-02 05:28:19,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-12-02 05:28:19,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2018-12-02 05:28:19,438 INFO L728 BuchiCegarLoop]: Abstraction has 15 states and 16 transitions. [2018-12-02 05:28:19,438 INFO L608 BuchiCegarLoop]: Abstraction has 15 states and 16 transitions. [2018-12-02 05:28:19,438 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-12-02 05:28:19,438 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 16 transitions. [2018-12-02 05:28:19,439 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2018-12-02 05:28:19,439 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 05:28:19,439 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 05:28:19,439 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-12-02 05:28:19,439 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [5, 4, 1, 1, 1, 1] [2018-12-02 05:28:19,440 INFO L794 eck$LassoCheckResult]: Stem: 256#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 250#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem6, main_#t~mem5, main_#t~mem7, main_#t~mem4, main_~x1~0.base, main_~x1~0.offset, main_~x2~0.base, main_~x2~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4);main_~x1~0.base, main_~x1~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4);main_~x2~0.base, main_~x2~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 251#L549-3 [2018-12-02 05:28:19,440 INFO L796 eck$LassoCheckResult]: Loop: 251#L549-3 call main_#t~mem4 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 252#L549-1 assume !!(main_#t~mem4 <= 10);havoc main_#t~mem4;call write~int(10, main_~x2~0.base, main_~x2~0.offset, 4); 253#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 258#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 254#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 255#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 264#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 263#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 262#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 261#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 260#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 259#L551-1 assume !(main_#t~mem5 > 1);havoc main_#t~mem5; 257#L551-4 call main_#t~mem7 := read~int(main_~x1~0.base, main_~x1~0.offset, 4);call write~int(1 + main_#t~mem7, main_~x1~0.base, main_~x1~0.offset, 4);havoc main_#t~mem7; 251#L549-3 [2018-12-02 05:28:19,440 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:28:19,440 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 6 times [2018-12-02 05:28:19,440 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 05:28:19,440 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 05:28:19,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:28:19,441 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 05:28:19,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:28:19,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 05:28:19,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 05:28:19,447 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:28:19,448 INFO L82 PathProgramCache]: Analyzing trace with hash 351922269, now seen corresponding path program 4 times [2018-12-02 05:28:19,448 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 05:28:19,448 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 05:28:19,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:28:19,449 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 05:28:19,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:28:19,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:28:19,572 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 05:28:19,572 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 05:28:19,572 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_89bf4f0b-a4b2-4f91-80ee-d2a143ee9ebf/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-12-02 05:28:19,578 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-02 05:28:19,588 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-02 05:28:19,588 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 05:28:19,590 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 05:28:19,593 INFO L478 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-12-02 05:28:19,594 INFO L478 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-12-02 05:28:19,594 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 05:28:19,595 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:28:19,596 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:28:19,596 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2018-12-02 05:28:19,599 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:28:19,599 INFO L478 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 25 treesize of output 28 [2018-12-02 05:28:19,601 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:28:19,602 INFO L478 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 28 treesize of output 7 [2018-12-02 05:28:19,602 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 05:28:19,603 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:28:19,604 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:28:19,604 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:7 [2018-12-02 05:28:19,613 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:28:19,614 INFO L478 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 25 treesize of output 28 [2018-12-02 05:28:19,616 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:28:19,617 INFO L478 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 28 treesize of output 7 [2018-12-02 05:28:19,617 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 05:28:19,618 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:28:19,619 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:28:19,619 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:7 [2018-12-02 05:28:19,626 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:28:19,627 INFO L478 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 25 treesize of output 28 [2018-12-02 05:28:19,629 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:28:19,629 INFO L478 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 28 treesize of output 7 [2018-12-02 05:28:19,629 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 05:28:19,631 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:28:19,631 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:28:19,632 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:7 [2018-12-02 05:28:19,640 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:28:19,640 INFO L478 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 25 treesize of output 28 [2018-12-02 05:28:19,642 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:28:19,642 INFO L478 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 28 treesize of output 7 [2018-12-02 05:28:19,643 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 05:28:19,644 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:28:19,645 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:28:19,645 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:7 [2018-12-02 05:28:19,659 INFO L478 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 15 treesize of output 11 [2018-12-02 05:28:19,661 INFO L478 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-12-02 05:28:19,661 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 05:28:19,662 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:28:19,663 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:28:19,663 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2018-12-02 05:28:19,664 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 05:28:19,678 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 05:28:19,678 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 16 [2018-12-02 05:28:19,678 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-02 05:28:19,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-02 05:28:19,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=167, Unknown=0, NotChecked=0, Total=240 [2018-12-02 05:28:19,679 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. cyclomatic complexity: 2 Second operand 16 states. [2018-12-02 05:28:19,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:28:19,782 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2018-12-02 05:28:19,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-02 05:28:19,783 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 18 transitions. [2018-12-02 05:28:19,783 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-12-02 05:28:19,783 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 17 states and 18 transitions. [2018-12-02 05:28:19,783 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2018-12-02 05:28:19,783 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2018-12-02 05:28:19,783 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 18 transitions. [2018-12-02 05:28:19,784 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 05:28:19,784 INFO L705 BuchiCegarLoop]: Abstraction has 17 states and 18 transitions. [2018-12-02 05:28:19,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 18 transitions. [2018-12-02 05:28:19,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-12-02 05:28:19,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-02 05:28:19,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2018-12-02 05:28:19,785 INFO L728 BuchiCegarLoop]: Abstraction has 17 states and 18 transitions. [2018-12-02 05:28:19,785 INFO L608 BuchiCegarLoop]: Abstraction has 17 states and 18 transitions. [2018-12-02 05:28:19,785 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-12-02 05:28:19,785 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 18 transitions. [2018-12-02 05:28:19,785 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-12-02 05:28:19,785 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 05:28:19,785 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 05:28:19,785 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-12-02 05:28:19,785 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [6, 5, 1, 1, 1, 1] [2018-12-02 05:28:19,786 INFO L794 eck$LassoCheckResult]: Stem: 351#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 345#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem6, main_#t~mem5, main_#t~mem7, main_#t~mem4, main_~x1~0.base, main_~x1~0.offset, main_~x2~0.base, main_~x2~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4);main_~x1~0.base, main_~x1~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4);main_~x2~0.base, main_~x2~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 346#L549-3 [2018-12-02 05:28:19,786 INFO L796 eck$LassoCheckResult]: Loop: 346#L549-3 call main_#t~mem4 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 347#L549-1 assume !!(main_#t~mem4 <= 10);havoc main_#t~mem4;call write~int(10, main_~x2~0.base, main_~x2~0.offset, 4); 348#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 353#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 349#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 350#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 361#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 360#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 359#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 358#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 357#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 356#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 355#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 354#L551-1 assume !(main_#t~mem5 > 1);havoc main_#t~mem5; 352#L551-4 call main_#t~mem7 := read~int(main_~x1~0.base, main_~x1~0.offset, 4);call write~int(1 + main_#t~mem7, main_~x1~0.base, main_~x1~0.offset, 4);havoc main_#t~mem7; 346#L549-3 [2018-12-02 05:28:19,786 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:28:19,786 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 7 times [2018-12-02 05:28:19,786 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 05:28:19,786 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 05:28:19,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:28:19,787 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 05:28:19,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:28:19,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 05:28:19,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 05:28:19,790 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:28:19,790 INFO L82 PathProgramCache]: Analyzing trace with hash -1105064296, now seen corresponding path program 5 times [2018-12-02 05:28:19,790 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 05:28:19,791 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 05:28:19,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:28:19,791 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:28:19,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:28:19,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:28:19,907 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 05:28:19,907 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 05:28:19,907 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_89bf4f0b-a4b2-4f91-80ee-d2a143ee9ebf/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-12-02 05:28:19,913 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-12-02 05:28:19,928 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-12-02 05:28:19,928 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 05:28:19,929 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 05:28:19,932 INFO L478 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-12-02 05:28:19,934 INFO L478 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-12-02 05:28:19,934 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 05:28:19,935 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:28:19,936 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:28:19,937 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2018-12-02 05:28:19,940 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:28:19,940 INFO L478 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 25 treesize of output 28 [2018-12-02 05:28:19,943 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:28:19,943 INFO L478 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 28 treesize of output 7 [2018-12-02 05:28:19,944 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 05:28:19,945 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:28:19,946 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:28:19,946 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:7 [2018-12-02 05:28:19,955 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:28:19,955 INFO L478 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 25 treesize of output 28 [2018-12-02 05:28:19,957 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:28:19,958 INFO L478 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 28 treesize of output 7 [2018-12-02 05:28:19,958 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 05:28:19,959 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:28:19,960 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:28:19,960 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:7 [2018-12-02 05:28:19,974 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:28:19,975 INFO L478 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 25 treesize of output 28 [2018-12-02 05:28:19,976 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:28:19,977 INFO L478 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 28 treesize of output 7 [2018-12-02 05:28:19,977 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 05:28:19,978 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:28:19,979 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:28:19,979 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:7 [2018-12-02 05:28:19,986 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:28:19,986 INFO L478 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 25 treesize of output 28 [2018-12-02 05:28:19,988 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:28:19,989 INFO L478 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 28 treesize of output 7 [2018-12-02 05:28:19,989 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 05:28:19,990 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:28:19,992 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:28:19,992 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:7 [2018-12-02 05:28:20,000 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:28:20,000 INFO L478 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 25 treesize of output 28 [2018-12-02 05:28:20,002 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:28:20,003 INFO L478 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 28 treesize of output 7 [2018-12-02 05:28:20,003 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 05:28:20,004 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:28:20,005 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:28:20,005 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:7 [2018-12-02 05:28:20,012 INFO L478 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 15 treesize of output 11 [2018-12-02 05:28:20,014 INFO L478 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-12-02 05:28:20,014 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 05:28:20,015 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:28:20,016 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:28:20,016 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2018-12-02 05:28:20,017 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 05:28:20,032 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 05:28:20,032 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9] total 19 [2018-12-02 05:28:20,032 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-02 05:28:20,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-02 05:28:20,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=242, Unknown=0, NotChecked=0, Total=342 [2018-12-02 05:28:20,032 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. cyclomatic complexity: 2 Second operand 19 states. [2018-12-02 05:28:20,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:28:20,153 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2018-12-02 05:28:20,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-02 05:28:20,153 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 20 transitions. [2018-12-02 05:28:20,153 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 17 [2018-12-02 05:28:20,154 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 19 states and 20 transitions. [2018-12-02 05:28:20,154 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2018-12-02 05:28:20,154 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2018-12-02 05:28:20,154 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 20 transitions. [2018-12-02 05:28:20,154 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 05:28:20,154 INFO L705 BuchiCegarLoop]: Abstraction has 19 states and 20 transitions. [2018-12-02 05:28:20,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 20 transitions. [2018-12-02 05:28:20,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-12-02 05:28:20,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-02 05:28:20,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2018-12-02 05:28:20,156 INFO L728 BuchiCegarLoop]: Abstraction has 19 states and 20 transitions. [2018-12-02 05:28:20,156 INFO L608 BuchiCegarLoop]: Abstraction has 19 states and 20 transitions. [2018-12-02 05:28:20,156 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-12-02 05:28:20,156 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 20 transitions. [2018-12-02 05:28:20,156 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 17 [2018-12-02 05:28:20,156 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 05:28:20,156 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 05:28:20,157 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-12-02 05:28:20,157 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [7, 6, 1, 1, 1, 1] [2018-12-02 05:28:20,157 INFO L794 eck$LassoCheckResult]: Stem: 462#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 457#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem6, main_#t~mem5, main_#t~mem7, main_#t~mem4, main_~x1~0.base, main_~x1~0.offset, main_~x2~0.base, main_~x2~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4);main_~x1~0.base, main_~x1~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4);main_~x2~0.base, main_~x2~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 458#L549-3 [2018-12-02 05:28:20,157 INFO L796 eck$LassoCheckResult]: Loop: 458#L549-3 call main_#t~mem4 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 459#L549-1 assume !!(main_#t~mem4 <= 10);havoc main_#t~mem4;call write~int(10, main_~x2~0.base, main_~x2~0.offset, 4); 460#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 463#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 455#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 456#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 473#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 472#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 471#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 470#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 469#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 468#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 467#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 466#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 465#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 464#L551-1 assume !(main_#t~mem5 > 1);havoc main_#t~mem5; 461#L551-4 call main_#t~mem7 := read~int(main_~x1~0.base, main_~x1~0.offset, 4);call write~int(1 + main_#t~mem7, main_~x1~0.base, main_~x1~0.offset, 4);havoc main_#t~mem7; 458#L549-3 [2018-12-02 05:28:20,157 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:28:20,157 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 8 times [2018-12-02 05:28:20,157 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 05:28:20,157 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 05:28:20,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:28:20,158 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 05:28:20,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:28:20,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 05:28:20,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 05:28:20,163 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:28:20,163 INFO L82 PathProgramCache]: Analyzing trace with hash -1109814765, now seen corresponding path program 6 times [2018-12-02 05:28:20,163 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 05:28:20,163 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 05:28:20,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:28:20,164 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 05:28:20,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:28:20,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:28:20,319 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 05:28:20,319 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 05:28:20,319 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_89bf4f0b-a4b2-4f91-80ee-d2a143ee9ebf/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-12-02 05:28:20,325 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-12-02 05:28:20,344 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-12-02 05:28:20,345 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 05:28:20,346 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 05:28:20,349 INFO L478 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-12-02 05:28:20,350 INFO L478 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-12-02 05:28:20,350 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 05:28:20,351 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:28:20,352 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:28:20,352 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2018-12-02 05:28:20,355 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:28:20,355 INFO L478 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 25 treesize of output 28 [2018-12-02 05:28:20,357 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:28:20,358 INFO L478 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 28 treesize of output 7 [2018-12-02 05:28:20,358 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 05:28:20,359 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:28:20,361 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:28:20,361 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:7 [2018-12-02 05:28:20,368 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:28:20,369 INFO L478 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 25 treesize of output 28 [2018-12-02 05:28:20,378 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:28:20,379 INFO L478 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 28 treesize of output 7 [2018-12-02 05:28:20,379 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 05:28:20,380 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:28:20,381 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:28:20,382 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:7 [2018-12-02 05:28:20,389 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:28:20,389 INFO L478 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 25 treesize of output 28 [2018-12-02 05:28:20,391 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:28:20,392 INFO L478 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 28 treesize of output 7 [2018-12-02 05:28:20,392 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 05:28:20,394 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:28:20,395 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:28:20,395 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:7 [2018-12-02 05:28:20,404 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:28:20,404 INFO L478 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 25 treesize of output 28 [2018-12-02 05:28:20,406 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:28:20,407 INFO L478 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 28 treesize of output 7 [2018-12-02 05:28:20,407 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 05:28:20,408 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:28:20,409 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:28:20,409 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:7 [2018-12-02 05:28:20,418 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:28:20,418 INFO L478 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 25 treesize of output 28 [2018-12-02 05:28:20,420 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:28:20,421 INFO L478 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 28 treesize of output 7 [2018-12-02 05:28:20,421 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 05:28:20,422 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:28:20,423 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:28:20,423 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:7 [2018-12-02 05:28:20,431 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:28:20,431 INFO L478 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 25 treesize of output 28 [2018-12-02 05:28:20,433 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:28:20,433 INFO L478 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 28 treesize of output 7 [2018-12-02 05:28:20,434 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 05:28:20,435 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:28:20,435 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:28:20,436 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:7 [2018-12-02 05:28:20,445 INFO L478 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 15 treesize of output 11 [2018-12-02 05:28:20,446 INFO L478 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-12-02 05:28:20,446 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 05:28:20,447 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:28:20,447 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:28:20,448 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2018-12-02 05:28:20,448 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 05:28:20,463 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 05:28:20,463 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 10] total 22 [2018-12-02 05:28:20,463 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-02 05:28:20,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-12-02 05:28:20,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=331, Unknown=0, NotChecked=0, Total=462 [2018-12-02 05:28:20,464 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. cyclomatic complexity: 2 Second operand 22 states. [2018-12-02 05:28:20,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:28:20,599 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2018-12-02 05:28:20,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-02 05:28:20,600 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 22 transitions. [2018-12-02 05:28:20,600 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 19 [2018-12-02 05:28:20,600 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 21 states and 22 transitions. [2018-12-02 05:28:20,600 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2018-12-02 05:28:20,600 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2018-12-02 05:28:20,600 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 22 transitions. [2018-12-02 05:28:20,600 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 05:28:20,601 INFO L705 BuchiCegarLoop]: Abstraction has 21 states and 22 transitions. [2018-12-02 05:28:20,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 22 transitions. [2018-12-02 05:28:20,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-12-02 05:28:20,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-12-02 05:28:20,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2018-12-02 05:28:20,601 INFO L728 BuchiCegarLoop]: Abstraction has 21 states and 22 transitions. [2018-12-02 05:28:20,602 INFO L608 BuchiCegarLoop]: Abstraction has 21 states and 22 transitions. [2018-12-02 05:28:20,602 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-12-02 05:28:20,602 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 22 transitions. [2018-12-02 05:28:20,602 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 19 [2018-12-02 05:28:20,602 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 05:28:20,602 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 05:28:20,602 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-12-02 05:28:20,602 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [8, 7, 1, 1, 1, 1] [2018-12-02 05:28:20,602 INFO L794 eck$LassoCheckResult]: Stem: 586#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 582#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem6, main_#t~mem5, main_#t~mem7, main_#t~mem4, main_~x1~0.base, main_~x1~0.offset, main_~x2~0.base, main_~x2~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4);main_~x1~0.base, main_~x1~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4);main_~x2~0.base, main_~x2~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 583#L549-3 [2018-12-02 05:28:20,602 INFO L796 eck$LassoCheckResult]: Loop: 583#L549-3 call main_#t~mem4 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 584#L549-1 assume !!(main_#t~mem4 <= 10);havoc main_#t~mem4;call write~int(10, main_~x2~0.base, main_~x2~0.offset, 4); 585#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 588#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 580#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 581#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 600#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 599#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 598#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 597#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 596#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 595#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 594#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 593#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 592#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 591#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 590#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 589#L551-1 assume !(main_#t~mem5 > 1);havoc main_#t~mem5; 587#L551-4 call main_#t~mem7 := read~int(main_~x1~0.base, main_~x1~0.offset, 4);call write~int(1 + main_#t~mem7, main_~x1~0.base, main_~x1~0.offset, 4);havoc main_#t~mem7; 583#L549-3 [2018-12-02 05:28:20,602 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:28:20,602 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 9 times [2018-12-02 05:28:20,603 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 05:28:20,603 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 05:28:20,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:28:20,603 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 05:28:20,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:28:20,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 05:28:20,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 05:28:20,606 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:28:20,606 INFO L82 PathProgramCache]: Analyzing trace with hash -1380048178, now seen corresponding path program 7 times [2018-12-02 05:28:20,606 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 05:28:20,606 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 05:28:20,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:28:20,607 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 05:28:20,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:28:20,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:28:20,754 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 05:28:20,754 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 05:28:20,754 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_89bf4f0b-a4b2-4f91-80ee-d2a143ee9ebf/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-12-02 05:28:20,761 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:28:20,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:28:20,770 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 05:28:20,773 INFO L478 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-12-02 05:28:20,774 INFO L478 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-12-02 05:28:20,774 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 05:28:20,775 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:28:20,776 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:28:20,776 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2018-12-02 05:28:20,778 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:28:20,779 INFO L478 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 25 treesize of output 28 [2018-12-02 05:28:20,783 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:28:20,783 INFO L478 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 28 treesize of output 7 [2018-12-02 05:28:20,783 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 05:28:20,784 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:28:20,785 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:28:20,785 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:7 [2018-12-02 05:28:20,794 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:28:20,794 INFO L478 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 25 treesize of output 28 [2018-12-02 05:28:20,796 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:28:20,797 INFO L478 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 28 treesize of output 7 [2018-12-02 05:28:20,797 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 05:28:20,798 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:28:20,799 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:28:20,799 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:7 [2018-12-02 05:28:20,816 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:28:20,817 INFO L478 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 25 treesize of output 28 [2018-12-02 05:28:20,819 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:28:20,819 INFO L478 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 28 treesize of output 7 [2018-12-02 05:28:20,820 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 05:28:20,822 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:28:20,823 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:28:20,823 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:7 [2018-12-02 05:28:20,832 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:28:20,833 INFO L478 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 25 treesize of output 28 [2018-12-02 05:28:20,835 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:28:20,835 INFO L478 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 28 treesize of output 7 [2018-12-02 05:28:20,835 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 05:28:20,837 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:28:20,838 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:28:20,838 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:7 [2018-12-02 05:28:20,847 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:28:20,848 INFO L478 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 25 treesize of output 28 [2018-12-02 05:28:20,850 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:28:20,850 INFO L478 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 28 treesize of output 7 [2018-12-02 05:28:20,851 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 05:28:20,852 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:28:20,853 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:28:20,853 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:7 [2018-12-02 05:28:20,863 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:28:20,863 INFO L478 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 25 treesize of output 28 [2018-12-02 05:28:20,866 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:28:20,866 INFO L478 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 28 treesize of output 7 [2018-12-02 05:28:20,866 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 05:28:20,868 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:28:20,870 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:28:20,870 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:7 [2018-12-02 05:28:20,886 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:28:20,886 INFO L478 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 25 treesize of output 28 [2018-12-02 05:28:20,888 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:28:20,889 INFO L478 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 28 treesize of output 7 [2018-12-02 05:28:20,889 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 05:28:20,890 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:28:20,891 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:28:20,891 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:7 [2018-12-02 05:28:20,901 INFO L478 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 15 treesize of output 11 [2018-12-02 05:28:20,902 INFO L478 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-12-02 05:28:20,902 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 05:28:20,903 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:28:20,904 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:28:20,905 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2018-12-02 05:28:20,906 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 05:28:20,921 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 05:28:20,921 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 11] total 25 [2018-12-02 05:28:20,921 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-02 05:28:20,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-12-02 05:28:20,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=434, Unknown=0, NotChecked=0, Total=600 [2018-12-02 05:28:20,922 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. cyclomatic complexity: 2 Second operand 25 states. [2018-12-02 05:28:21,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:28:21,084 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2018-12-02 05:28:21,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-02 05:28:21,084 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 24 transitions. [2018-12-02 05:28:21,085 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 21 [2018-12-02 05:28:21,085 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 23 states and 24 transitions. [2018-12-02 05:28:21,085 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2018-12-02 05:28:21,085 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2018-12-02 05:28:21,086 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 24 transitions. [2018-12-02 05:28:21,086 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 05:28:21,086 INFO L705 BuchiCegarLoop]: Abstraction has 23 states and 24 transitions. [2018-12-02 05:28:21,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 24 transitions. [2018-12-02 05:28:21,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-12-02 05:28:21,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-12-02 05:28:21,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2018-12-02 05:28:21,087 INFO L728 BuchiCegarLoop]: Abstraction has 23 states and 24 transitions. [2018-12-02 05:28:21,087 INFO L608 BuchiCegarLoop]: Abstraction has 23 states and 24 transitions. [2018-12-02 05:28:21,087 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-12-02 05:28:21,088 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 24 transitions. [2018-12-02 05:28:21,088 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 21 [2018-12-02 05:28:21,088 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 05:28:21,088 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 05:28:21,088 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-12-02 05:28:21,088 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [9, 8, 1, 1, 1, 1] [2018-12-02 05:28:21,089 INFO L794 eck$LassoCheckResult]: Stem: 726#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 722#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem6, main_#t~mem5, main_#t~mem7, main_#t~mem4, main_~x1~0.base, main_~x1~0.offset, main_~x2~0.base, main_~x2~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4);main_~x1~0.base, main_~x1~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4);main_~x2~0.base, main_~x2~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 723#L549-3 [2018-12-02 05:28:21,089 INFO L796 eck$LassoCheckResult]: Loop: 723#L549-3 call main_#t~mem4 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 724#L549-1 assume !!(main_#t~mem4 <= 10);havoc main_#t~mem4;call write~int(10, main_~x2~0.base, main_~x2~0.offset, 4); 725#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 728#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 720#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 721#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 742#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 741#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 740#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 739#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 738#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 737#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 736#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 735#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 734#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 733#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 732#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 731#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 730#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 729#L551-1 assume !(main_#t~mem5 > 1);havoc main_#t~mem5; 727#L551-4 call main_#t~mem7 := read~int(main_~x1~0.base, main_~x1~0.offset, 4);call write~int(1 + main_#t~mem7, main_~x1~0.base, main_~x1~0.offset, 4);havoc main_#t~mem7; 723#L549-3 [2018-12-02 05:28:21,089 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:28:21,089 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 10 times [2018-12-02 05:28:21,089 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 05:28:21,089 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 05:28:21,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:28:21,090 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:28:21,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:28:21,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 05:28:21,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 05:28:21,094 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:28:21,094 INFO L82 PathProgramCache]: Analyzing trace with hash 918646985, now seen corresponding path program 8 times [2018-12-02 05:28:21,094 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 05:28:21,094 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 05:28:21,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:28:21,095 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 05:28:21,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:28:21,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:28:21,240 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 05:28:21,240 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 05:28:21,240 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_89bf4f0b-a4b2-4f91-80ee-d2a143ee9ebf/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-12-02 05:28:21,248 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-02 05:28:21,259 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-02 05:28:21,259 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 05:28:21,260 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 05:28:21,263 INFO L478 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-12-02 05:28:21,264 INFO L478 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-12-02 05:28:21,264 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 05:28:21,265 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:28:21,267 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:28:21,267 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2018-12-02 05:28:21,269 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:28:21,270 INFO L478 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 25 treesize of output 28 [2018-12-02 05:28:21,274 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:28:21,274 INFO L478 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 28 treesize of output 7 [2018-12-02 05:28:21,275 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 05:28:21,276 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:28:21,277 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:28:21,277 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:7 [2018-12-02 05:28:21,293 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:28:21,294 INFO L478 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 25 treesize of output 28 [2018-12-02 05:28:21,295 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:28:21,295 INFO L478 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 28 treesize of output 7 [2018-12-02 05:28:21,296 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 05:28:21,296 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:28:21,297 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:28:21,297 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:7 [2018-12-02 05:28:21,309 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:28:21,310 INFO L478 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 25 treesize of output 28 [2018-12-02 05:28:21,312 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:28:21,312 INFO L478 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 28 treesize of output 7 [2018-12-02 05:28:21,312 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 05:28:21,313 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:28:21,314 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:28:21,314 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:7 [2018-12-02 05:28:21,321 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:28:21,322 INFO L478 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 25 treesize of output 28 [2018-12-02 05:28:21,323 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:28:21,323 INFO L478 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 28 treesize of output 7 [2018-12-02 05:28:21,324 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 05:28:21,324 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:28:21,325 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:28:21,325 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:7 [2018-12-02 05:28:21,333 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:28:21,333 INFO L478 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 25 treesize of output 28 [2018-12-02 05:28:21,335 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:28:21,335 INFO L478 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 28 treesize of output 7 [2018-12-02 05:28:21,335 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 05:28:21,336 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:28:21,337 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:28:21,338 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:7 [2018-12-02 05:28:21,346 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:28:21,347 INFO L478 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 25 treesize of output 28 [2018-12-02 05:28:21,349 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:28:21,349 INFO L478 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 28 treesize of output 7 [2018-12-02 05:28:21,349 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 05:28:21,350 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:28:21,351 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:28:21,351 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:7 [2018-12-02 05:28:21,359 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:28:21,359 INFO L478 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 25 treesize of output 28 [2018-12-02 05:28:21,362 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:28:21,362 INFO L478 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 28 treesize of output 7 [2018-12-02 05:28:21,362 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 05:28:21,363 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:28:21,364 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:28:21,364 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:7 [2018-12-02 05:28:21,372 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:28:21,373 INFO L478 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 25 treesize of output 28 [2018-12-02 05:28:21,374 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:28:21,375 INFO L478 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 28 treesize of output 7 [2018-12-02 05:28:21,375 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 05:28:21,376 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:28:21,377 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:28:21,377 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:7 [2018-12-02 05:28:21,391 INFO L478 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 15 treesize of output 11 [2018-12-02 05:28:21,392 INFO L478 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-12-02 05:28:21,392 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 05:28:21,393 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:28:21,394 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:28:21,394 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2018-12-02 05:28:21,395 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 05:28:21,409 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 05:28:21,410 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 12] total 28 [2018-12-02 05:28:21,410 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-02 05:28:21,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-12-02 05:28:21,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=205, Invalid=551, Unknown=0, NotChecked=0, Total=756 [2018-12-02 05:28:21,411 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. cyclomatic complexity: 2 Second operand 28 states. [2018-12-02 05:28:21,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:28:21,614 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2018-12-02 05:28:21,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-02 05:28:21,614 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 26 transitions. [2018-12-02 05:28:21,615 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2018-12-02 05:28:21,615 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 25 states and 26 transitions. [2018-12-02 05:28:21,615 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2018-12-02 05:28:21,615 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2018-12-02 05:28:21,615 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 26 transitions. [2018-12-02 05:28:21,615 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 05:28:21,615 INFO L705 BuchiCegarLoop]: Abstraction has 25 states and 26 transitions. [2018-12-02 05:28:21,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 26 transitions. [2018-12-02 05:28:21,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-12-02 05:28:21,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-12-02 05:28:21,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2018-12-02 05:28:21,616 INFO L728 BuchiCegarLoop]: Abstraction has 25 states and 26 transitions. [2018-12-02 05:28:21,616 INFO L608 BuchiCegarLoop]: Abstraction has 25 states and 26 transitions. [2018-12-02 05:28:21,616 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2018-12-02 05:28:21,616 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 26 transitions. [2018-12-02 05:28:21,617 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2018-12-02 05:28:21,617 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 05:28:21,617 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 05:28:21,617 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-12-02 05:28:21,617 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [10, 9, 1, 1, 1, 1] [2018-12-02 05:28:21,617 INFO L794 eck$LassoCheckResult]: Stem: 881#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 875#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem6, main_#t~mem5, main_#t~mem7, main_#t~mem4, main_~x1~0.base, main_~x1~0.offset, main_~x2~0.base, main_~x2~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4);main_~x1~0.base, main_~x1~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4);main_~x2~0.base, main_~x2~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 876#L549-3 [2018-12-02 05:28:21,617 INFO L796 eck$LassoCheckResult]: Loop: 876#L549-3 call main_#t~mem4 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 877#L549-1 assume !!(main_#t~mem4 <= 10);havoc main_#t~mem4;call write~int(10, main_~x2~0.base, main_~x2~0.offset, 4); 878#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 883#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 879#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 880#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 899#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 898#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 897#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 896#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 895#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 894#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 893#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 892#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 891#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 890#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 889#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 888#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 887#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 886#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 885#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 884#L551-1 assume !(main_#t~mem5 > 1);havoc main_#t~mem5; 882#L551-4 call main_#t~mem7 := read~int(main_~x1~0.base, main_~x1~0.offset, 4);call write~int(1 + main_#t~mem7, main_~x1~0.base, main_~x1~0.offset, 4);havoc main_#t~mem7; 876#L549-3 [2018-12-02 05:28:21,617 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:28:21,617 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 11 times [2018-12-02 05:28:21,617 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 05:28:21,617 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 05:28:21,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:28:21,618 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 05:28:21,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:28:21,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 05:28:21,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 05:28:21,620 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:28:21,621 INFO L82 PathProgramCache]: Analyzing trace with hash -1943458812, now seen corresponding path program 9 times [2018-12-02 05:28:21,621 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 05:28:21,621 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 05:28:21,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:28:21,621 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 05:28:21,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:28:21,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 05:28:21,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 05:28:21,637 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:28:21,637 INFO L82 PathProgramCache]: Analyzing trace with hash -1979445758, now seen corresponding path program 1 times [2018-12-02 05:28:21,638 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 05:28:21,638 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 05:28:21,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:28:21,638 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 05:28:21,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:28:21,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 05:28:21,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 05:28:23,205 WARN L180 SmtUtils]: Spent 1.55 s on a formula simplification. DAG size of input: 138 DAG size of output: 127 [2018-12-02 05:28:23,257 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 05:28:23,258 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 05:28:23,258 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 05:28:23,258 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 05:28:23,258 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-02 05:28:23,258 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 05:28:23,258 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 05:28:23,258 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 05:28:23,258 INFO L131 ssoRankerPreferences]: Filename of dumped script: Urban-2013WST-Fig2-alloca_true-termination.c.i_Iteration11_Lasso [2018-12-02 05:28:23,258 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 05:28:23,258 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 05:28:23,270 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 05:28:23,274 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 05:28:23,275 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 05:28:23,277 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 05:28:23,278 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 05:28:23,279 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 05:28:23,280 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 05:28:23,281 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 05:28:23,282 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 05:28:23,375 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 05:28:23,377 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 05:28:23,541 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 05:28:23,544 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-02 05:28:23,545 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-12-02 05:28:23,546 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 05:28:23,546 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 05:28:23,546 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 05:28:23,546 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 05:28:23,546 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 05:28:23,548 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 05:28:23,548 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 05:28:23,549 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 05:28:23,549 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-12-02 05:28:23,549 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 05:28:23,549 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 05:28:23,550 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 05:28:23,550 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 05:28:23,550 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 05:28:23,550 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 05:28:23,550 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 05:28:23,550 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 05:28:23,551 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-12-02 05:28:23,551 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 05:28:23,551 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 05:28:23,551 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 05:28:23,551 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 05:28:23,552 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 05:28:23,552 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 05:28:23,553 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 05:28:23,554 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-12-02 05:28:23,554 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 05:28:23,554 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 05:28:23,554 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 05:28:23,554 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 05:28:23,554 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 05:28:23,555 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 05:28:23,555 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 05:28:23,555 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 05:28:23,555 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-12-02 05:28:23,555 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 05:28:23,555 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 05:28:23,556 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 05:28:23,556 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 05:28:23,556 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 05:28:23,556 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 05:28:23,556 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 05:28:23,556 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 05:28:23,556 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-12-02 05:28:23,557 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 05:28:23,557 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 05:28:23,557 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 05:28:23,557 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 05:28:23,558 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 05:28:23,558 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 05:28:23,559 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 05:28:23,559 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-12-02 05:28:23,559 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 05:28:23,559 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 05:28:23,559 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 05:28:23,560 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 05:28:23,560 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 05:28:23,560 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 05:28:23,560 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 05:28:23,560 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 05:28:23,560 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-12-02 05:28:23,561 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 05:28:23,561 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 05:28:23,561 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 05:28:23,561 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 05:28:23,562 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 05:28:23,562 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 05:28:23,563 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 05:28:23,563 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-12-02 05:28:23,564 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 05:28:23,564 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 05:28:23,564 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 05:28:23,564 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 05:28:23,565 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 05:28:23,565 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 05:28:23,568 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 05:28:23,569 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-12-02 05:28:23,569 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 05:28:23,569 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 05:28:23,569 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 05:28:23,569 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 05:28:23,570 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 05:28:23,570 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 05:28:23,573 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 05:28:23,574 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-12-02 05:28:23,574 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 05:28:23,574 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-02 05:28:23,574 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 05:28:23,574 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 05:28:23,575 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-02 05:28:23,575 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 05:28:23,578 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 05:28:23,578 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-12-02 05:28:23,578 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 05:28:23,578 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-02 05:28:23,579 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 05:28:23,579 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 05:28:23,579 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-02 05:28:23,579 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 05:28:23,582 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 05:28:23,582 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-12-02 05:28:23,582 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 05:28:23,583 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 05:28:23,583 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 05:28:23,583 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 05:28:23,583 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 05:28:23,583 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 05:28:23,584 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 05:28:23,585 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-12-02 05:28:23,585 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 05:28:23,585 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 05:28:23,585 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 05:28:23,585 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 05:28:23,586 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 05:28:23,586 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 05:28:23,593 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 05:28:23,593 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-12-02 05:28:23,593 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 05:28:23,593 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 05:28:23,593 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 05:28:23,593 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 05:28:23,593 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 05:28:23,594 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 05:28:23,594 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 05:28:23,595 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 05:28:23,595 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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-12-02 05:28:23,595 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 05:28:23,595 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 05:28:23,595 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 05:28:23,595 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 05:28:23,595 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 05:28:23,596 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 05:28:23,596 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 05:28:23,597 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-02 05:28:23,599 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-02 05:28:23,599 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-12-02 05:28:23,600 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-02 05:28:23,600 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-12-02 05:28:23,600 INFO L518 LassoAnalysis]: Proved termination. [2018-12-02 05:28:23,601 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~x1~0.base) ULTIMATE.start_main_~x1~0.offset)_1) = -2*v_rep(select (select #memory_int ULTIMATE.start_main_~x1~0.base) ULTIMATE.start_main_~x1~0.offset)_1 + 21 Supporting invariants [] [2018-12-02 05:28:23,633 INFO L297 tatePredicateManager]: 10 out of 11 supporting invariants were superfluous and have been removed [2018-12-02 05:28:23,638 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-02 05:28:23,654 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:28:23,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:28:23,658 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 05:28:23,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:28:23,668 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 05:28:23,687 INFO L478 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-12-02 05:28:23,689 INFO L478 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-12-02 05:28:23,689 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 05:28:23,694 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:28:23,698 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:28:23,698 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:34, output treesize:30 [2018-12-02 05:28:23,713 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:28:23,714 INFO L478 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 43 treesize of output 50 [2018-12-02 05:28:23,717 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:28:23,717 INFO L478 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 28 treesize of output 7 [2018-12-02 05:28:23,717 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 05:28:23,722 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:28:23,728 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:28:23,728 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:47, output treesize:30 [2018-12-02 05:28:23,743 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:28:23,744 INFO L478 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 43 treesize of output 50 [2018-12-02 05:28:23,746 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:28:23,746 INFO L478 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 28 treesize of output 7 [2018-12-02 05:28:23,746 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 05:28:23,751 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:28:23,754 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:28:23,755 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:47, output treesize:30 [2018-12-02 05:28:23,772 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:28:23,773 INFO L478 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 43 treesize of output 50 [2018-12-02 05:28:23,775 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:28:23,775 INFO L478 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 28 treesize of output 7 [2018-12-02 05:28:23,775 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 05:28:23,783 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:28:23,788 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:28:23,788 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:47, output treesize:30 [2018-12-02 05:28:23,808 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:28:23,809 INFO L478 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 43 treesize of output 50 [2018-12-02 05:28:23,811 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:28:23,811 INFO L478 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 28 treesize of output 7 [2018-12-02 05:28:23,811 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 05:28:23,816 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:28:23,820 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:28:23,820 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:47, output treesize:30 [2018-12-02 05:28:23,842 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:28:23,842 INFO L478 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 43 treesize of output 50 [2018-12-02 05:28:23,845 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:28:23,845 INFO L478 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 28 treesize of output 7 [2018-12-02 05:28:23,845 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 05:28:23,858 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:28:23,862 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:28:23,862 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:47, output treesize:30 [2018-12-02 05:28:23,883 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:28:23,884 INFO L478 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 43 treesize of output 50 [2018-12-02 05:28:23,886 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:28:23,886 INFO L478 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 28 treesize of output 7 [2018-12-02 05:28:23,887 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 05:28:23,892 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:28:23,897 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:28:23,897 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:47, output treesize:30 [2018-12-02 05:28:23,919 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:28:23,919 INFO L478 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 43 treesize of output 50 [2018-12-02 05:28:23,922 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:28:23,922 INFO L478 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 28 treesize of output 7 [2018-12-02 05:28:23,922 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 05:28:23,927 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:28:23,933 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:28:23,933 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:47, output treesize:30 [2018-12-02 05:28:23,957 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:28:23,958 INFO L478 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 43 treesize of output 50 [2018-12-02 05:28:23,960 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:28:23,960 INFO L478 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 28 treesize of output 7 [2018-12-02 05:28:23,961 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 05:28:23,968 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:28:23,972 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:28:23,972 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:47, output treesize:30 [2018-12-02 05:28:23,992 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:28:23,992 INFO L478 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 43 treesize of output 50 [2018-12-02 05:28:23,994 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:28:23,994 INFO L478 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 28 treesize of output 7 [2018-12-02 05:28:23,995 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 05:28:23,998 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:28:24,002 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-12-02 05:28:24,003 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:47, output treesize:30 [2018-12-02 05:28:24,038 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 05:28:24,041 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 12 loop predicates [2018-12-02 05:28:24,041 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 26 transitions. cyclomatic complexity: 2 Second operand 13 states. [2018-12-02 05:28:24,281 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 26 transitions. cyclomatic complexity: 2. Second operand 13 states. Result 57 states and 62 transitions. Complement of second has 26 states. [2018-12-02 05:28:24,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 14 states 1 stem states 12 non-accepting loop states 1 accepting loop states [2018-12-02 05:28:24,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-12-02 05:28:24,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 31 transitions. [2018-12-02 05:28:24,283 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 31 transitions. Stem has 2 letters. Loop has 23 letters. [2018-12-02 05:28:24,284 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 05:28:24,284 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 31 transitions. Stem has 25 letters. Loop has 23 letters. [2018-12-02 05:28:24,284 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 05:28:24,284 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 31 transitions. Stem has 2 letters. Loop has 46 letters. [2018-12-02 05:28:24,284 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 05:28:24,284 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 57 states and 62 transitions. [2018-12-02 05:28:24,285 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2018-12-02 05:28:24,285 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 57 states to 56 states and 61 transitions. [2018-12-02 05:28:24,285 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2018-12-02 05:28:24,285 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2018-12-02 05:28:24,285 INFO L73 IsDeterministic]: Start isDeterministic. Operand 56 states and 61 transitions. [2018-12-02 05:28:24,285 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 05:28:24,285 INFO L705 BuchiCegarLoop]: Abstraction has 56 states and 61 transitions. [2018-12-02 05:28:24,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states and 61 transitions. [2018-12-02 05:28:24,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 55. [2018-12-02 05:28:24,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-12-02 05:28:24,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 60 transitions. [2018-12-02 05:28:24,287 INFO L728 BuchiCegarLoop]: Abstraction has 55 states and 60 transitions. [2018-12-02 05:28:24,287 INFO L608 BuchiCegarLoop]: Abstraction has 55 states and 60 transitions. [2018-12-02 05:28:24,287 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2018-12-02 05:28:24,287 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 55 states and 60 transitions. [2018-12-02 05:28:24,288 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2018-12-02 05:28:24,288 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 05:28:24,288 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 05:28:24,288 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-12-02 05:28:24,288 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [11, 10, 1, 1, 1, 1] [2018-12-02 05:28:24,288 INFO L794 eck$LassoCheckResult]: Stem: 1153#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1144#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem6, main_#t~mem5, main_#t~mem7, main_#t~mem4, main_~x1~0.base, main_~x1~0.offset, main_~x2~0.base, main_~x2~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4);main_~x1~0.base, main_~x1~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4);main_~x2~0.base, main_~x2~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 1145#L549-3 call main_#t~mem4 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 1146#L549-1 [2018-12-02 05:28:24,288 INFO L796 eck$LassoCheckResult]: Loop: 1146#L549-1 assume !!(main_#t~mem4 <= 10);havoc main_#t~mem4;call write~int(10, main_~x2~0.base, main_~x2~0.offset, 4); 1147#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 1150#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 1159#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 1179#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 1178#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 1177#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 1176#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 1175#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 1174#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 1173#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 1172#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 1171#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 1170#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 1169#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 1168#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 1167#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 1166#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 1165#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 1164#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 1163#L551-1 assume !!(main_#t~mem5 > 1);havoc main_#t~mem5;call main_#t~mem6 := read~int(main_~x2~0.base, main_~x2~0.offset, 4);call write~int(main_#t~mem6 - 1, main_~x2~0.base, main_~x2~0.offset, 4);havoc main_#t~mem6; 1162#L551-3 call main_#t~mem5 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 1161#L551-1 assume !(main_#t~mem5 > 1);havoc main_#t~mem5; 1154#L551-4 call main_#t~mem7 := read~int(main_~x1~0.base, main_~x1~0.offset, 4);call write~int(1 + main_#t~mem7, main_~x1~0.base, main_~x1~0.offset, 4);havoc main_#t~mem7; 1155#L549-3 call main_#t~mem4 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 1146#L549-1 [2018-12-02 05:28:24,288 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:28:24,288 INFO L82 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 1 times [2018-12-02 05:28:24,288 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 05:28:24,288 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 05:28:24,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:28:24,289 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:28:24,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:28:24,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 05:28:24,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 05:28:24,292 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:28:24,292 INFO L82 PathProgramCache]: Analyzing trace with hash 1726515181, now seen corresponding path program 10 times [2018-12-02 05:28:24,292 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 05:28:24,293 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 05:28:24,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:28:24,293 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:28:24,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:28:24,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:28:24,491 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 84 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 05:28:24,491 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 05:28:24,491 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_89bf4f0b-a4b2-4f91-80ee-d2a143ee9ebf/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-12-02 05:28:24,497 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-02 05:28:24,507 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-02 05:28:24,507 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 05:28:24,508 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 05:28:24,510 INFO L478 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-12-02 05:28:24,511 INFO L478 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-12-02 05:28:24,511 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 05:28:24,512 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:28:24,513 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:28:24,513 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2018-12-02 05:28:24,515 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:28:24,516 INFO L478 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 25 treesize of output 28 [2018-12-02 05:28:24,517 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:28:24,517 INFO L478 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 28 treesize of output 7 [2018-12-02 05:28:24,518 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 05:28:24,519 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:28:24,519 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:28:24,520 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:7 [2018-12-02 05:28:24,533 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:28:24,533 INFO L478 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 25 treesize of output 28 [2018-12-02 05:28:24,535 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:28:24,535 INFO L478 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 28 treesize of output 7 [2018-12-02 05:28:24,536 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 05:28:24,537 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:28:24,538 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:28:24,538 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:7 [2018-12-02 05:28:24,554 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:28:24,554 INFO L478 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 25 treesize of output 28 [2018-12-02 05:28:24,556 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:28:24,556 INFO L478 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 28 treesize of output 7 [2018-12-02 05:28:24,556 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 05:28:24,558 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:28:24,559 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:28:24,559 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:7 [2018-12-02 05:28:24,574 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:28:24,574 INFO L478 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 25 treesize of output 28 [2018-12-02 05:28:24,576 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:28:24,576 INFO L478 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 28 treesize of output 7 [2018-12-02 05:28:24,576 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 05:28:24,577 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:28:24,578 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:28:24,578 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:7 [2018-12-02 05:28:24,590 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:28:24,591 INFO L478 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 25 treesize of output 28 [2018-12-02 05:28:24,593 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:28:24,593 INFO L478 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 28 treesize of output 7 [2018-12-02 05:28:24,593 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 05:28:24,594 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:28:24,595 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:28:24,595 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:7 [2018-12-02 05:28:24,609 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:28:24,609 INFO L478 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 25 treesize of output 28 [2018-12-02 05:28:24,611 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:28:24,611 INFO L478 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 28 treesize of output 7 [2018-12-02 05:28:24,612 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 05:28:24,613 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:28:24,614 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:28:24,614 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:7 [2018-12-02 05:28:24,628 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:28:24,629 INFO L478 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 25 treesize of output 28 [2018-12-02 05:28:24,630 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:28:24,630 INFO L478 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 28 treesize of output 7 [2018-12-02 05:28:24,630 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 05:28:24,631 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:28:24,632 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:28:24,632 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:7 [2018-12-02 05:28:24,652 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:28:24,652 INFO L478 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 25 treesize of output 28 [2018-12-02 05:28:24,653 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:28:24,654 INFO L478 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 28 treesize of output 7 [2018-12-02 05:28:24,654 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 05:28:24,655 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:28:24,656 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:28:24,656 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:7 [2018-12-02 05:28:24,682 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:28:24,683 INFO L478 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 25 treesize of output 28 [2018-12-02 05:28:24,684 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 05:28:24,684 INFO L478 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 28 treesize of output 7 [2018-12-02 05:28:24,685 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 05:28:24,686 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:28:24,687 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:28:24,687 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:7 [2018-12-02 05:28:24,705 INFO L478 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 15 treesize of output 11 [2018-12-02 05:28:24,706 INFO L478 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-12-02 05:28:24,706 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 05:28:24,707 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:28:24,708 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 05:28:24,708 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2018-12-02 05:28:24,709 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 20 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 05:28:24,723 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 05:28:24,723 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 12] total 30 [2018-12-02 05:28:24,723 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-02 05:28:24,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-12-02 05:28:24,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=205, Invalid=725, Unknown=0, NotChecked=0, Total=930 [2018-12-02 05:28:24,724 INFO L87 Difference]: Start difference. First operand 55 states and 60 transitions. cyclomatic complexity: 7 Second operand 31 states. [2018-12-02 05:28:24,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:28:24,921 INFO L93 Difference]: Finished difference Result 49 states and 50 transitions. [2018-12-02 05:28:24,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-12-02 05:28:24,921 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 50 transitions. [2018-12-02 05:28:24,922 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-02 05:28:24,922 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 0 states and 0 transitions. [2018-12-02 05:28:24,922 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-12-02 05:28:24,922 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-12-02 05:28:24,922 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-12-02 05:28:24,922 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 05:28:24,922 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 05:28:24,922 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 05:28:24,922 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 05:28:24,922 INFO L442 BuchiCegarLoop]: ======== Iteration 13============ [2018-12-02 05:28:24,922 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-12-02 05:28:24,922 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-02 05:28:24,922 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-12-02 05:28:24,926 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 02.12 05:28:24 BoogieIcfgContainer [2018-12-02 05:28:24,926 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-12-02 05:28:24,927 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 05:28:24,927 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 05:28:24,927 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 05:28:24,927 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 05:28:18" (3/4) ... [2018-12-02 05:28:24,929 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-02 05:28:24,929 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 05:28:24,930 INFO L168 Benchmark]: Toolchain (without parser) took 6899.34 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 195.6 MB). Free memory was 951.7 MB in the beginning and 1.1 GB in the end (delta: -177.3 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. [2018-12-02 05:28:24,930 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 05:28:24,930 INFO L168 Benchmark]: CACSL2BoogieTranslator took 274.39 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 112.7 MB). Free memory was 951.7 MB in the beginning and 1.1 GB in the end (delta: -150.5 MB). Peak memory consumption was 24.7 MB. Max. memory is 11.5 GB. [2018-12-02 05:28:24,930 INFO L168 Benchmark]: Boogie Procedure Inliner took 32.33 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-12-02 05:28:24,930 INFO L168 Benchmark]: Boogie Preprocessor took 13.36 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 05:28:24,930 INFO L168 Benchmark]: RCFGBuilder took 145.08 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 14.3 MB). Peak memory consumption was 14.3 MB. Max. memory is 11.5 GB. [2018-12-02 05:28:24,930 INFO L168 Benchmark]: BuchiAutomizer took 6429.25 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 82.8 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -46.5 MB). Peak memory consumption was 36.3 MB. Max. memory is 11.5 GB. [2018-12-02 05:28:24,931 INFO L168 Benchmark]: Witness Printer took 2.56 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 05:28:24,931 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.10 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 274.39 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 112.7 MB). Free memory was 951.7 MB in the beginning and 1.1 GB in the end (delta: -150.5 MB). Peak memory consumption was 24.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 32.33 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 13.36 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 145.08 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 14.3 MB). Peak memory consumption was 14.3 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 6429.25 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 82.8 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -46.5 MB). Peak memory consumption was 36.3 MB. Max. memory is 11.5 GB. * Witness Printer took 2.56 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 12 terminating modules (11 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -2 * unknown-#memory_int-unknown[x1][x1] + 21 and consists of 14 locations. 11 modules have a trivial ranking function, the largest among these consists of 31 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 6.4s and 13 iterations. TraceHistogramMax:11. Analysis of lassos took 4.5s. Construction of modules took 0.7s. Büchi inclusion checks took 1.0s. Highest rank in rank-based complementation 3. Minimization of det autom 11. Minimization of nondet autom 1. Automata minimization 0.0s AutomataMinimizationTime, 11 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 55 states and ocurred in iteration 11. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/90 HoareTripleCheckerStatistics: 73 SDtfs, 93 SDslu, 180 SDs, 0 SdLazy, 1647 SolverSat, 42 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time LassoAnalysisResults: nont0 unkn0 SFLI11 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital152 mio100 ax111 hnf100 lsp85 ukn72 mio100 lsp45 div100 bol100 ite100 ukn100 eq191 hnf88 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 4ms VariablesStem: 2 VariablesLoop: 2 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...