./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/ldv-regression/ex3_forlist_true-termination.c_true-unreach-call.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_86819597-491e-4c2e-92ce-073d1270dbbd/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_86819597-491e-4c2e-92ce-073d1270dbbd/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_86819597-491e-4c2e-92ce-073d1270dbbd/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_86819597-491e-4c2e-92ce-073d1270dbbd/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/ldv-regression/ex3_forlist_true-termination.c_true-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_86819597-491e-4c2e-92ce-073d1270dbbd/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_86819597-491e-4c2e-92ce-073d1270dbbd/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 32bit --witnessprinter.graph.data.programhash 35d30cdccac93bddd26c3755048a0b29ad39c8fa .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-01 15:53:59,794 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-01 15:53:59,795 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-01 15:53:59,804 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-01 15:53:59,804 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-01 15:53:59,805 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-01 15:53:59,805 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-01 15:53:59,807 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-01 15:53:59,808 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-01 15:53:59,808 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-01 15:53:59,809 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-01 15:53:59,809 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-01 15:53:59,810 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-01 15:53:59,810 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-01 15:53:59,811 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-01 15:53:59,812 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-01 15:53:59,812 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-01 15:53:59,814 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-01 15:53:59,815 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-01 15:53:59,816 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-01 15:53:59,816 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-01 15:53:59,817 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-01 15:53:59,818 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-01 15:53:59,818 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-01 15:53:59,818 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-01 15:53:59,818 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-01 15:53:59,819 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-01 15:53:59,819 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-01 15:53:59,820 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-01 15:53:59,820 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-01 15:53:59,820 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-01 15:53:59,821 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-01 15:53:59,821 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-01 15:53:59,821 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-01 15:53:59,821 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-01 15:53:59,822 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-01 15:53:59,822 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_86819597-491e-4c2e-92ce-073d1270dbbd/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-12-01 15:53:59,830 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-01 15:53:59,830 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-01 15:53:59,830 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-01 15:53:59,831 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-01 15:53:59,831 INFO L133 SettingsManager]: * Use SBE=true [2018-12-01 15:53:59,831 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-12-01 15:53:59,831 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-12-01 15:53:59,831 INFO L133 SettingsManager]: * Use old map elimination=false [2018-12-01 15:53:59,831 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-12-01 15:53:59,831 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-12-01 15:53:59,831 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-12-01 15:53:59,831 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-01 15:53:59,831 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-01 15:53:59,831 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-01 15:53:59,832 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-01 15:53:59,832 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-01 15:53:59,832 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-01 15:53:59,832 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-12-01 15:53:59,832 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-12-01 15:53:59,832 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-12-01 15:53:59,832 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-01 15:53:59,832 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-01 15:53:59,832 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-12-01 15:53:59,832 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-01 15:53:59,832 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-12-01 15:53:59,832 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-01 15:53:59,832 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-01 15:53:59,833 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-12-01 15:53:59,833 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-01 15:53:59,833 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-01 15:53:59,833 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-12-01 15:53:59,833 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-12-01 15:53:59,833 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_86819597-491e-4c2e-92ce-073d1270dbbd/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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 35d30cdccac93bddd26c3755048a0b29ad39c8fa [2018-12-01 15:53:59,851 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-01 15:53:59,860 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-01 15:53:59,862 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-01 15:53:59,863 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-01 15:53:59,864 INFO L276 PluginConnector]: CDTParser initialized [2018-12-01 15:53:59,864 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_86819597-491e-4c2e-92ce-073d1270dbbd/bin-2019/uautomizer/../../sv-benchmarks/c/ldv-regression/ex3_forlist_true-termination.c_true-unreach-call.i [2018-12-01 15:53:59,907 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_86819597-491e-4c2e-92ce-073d1270dbbd/bin-2019/uautomizer/data/81b11d0bb/d5fa461eb0f249838d0cb1a5c3f41343/FLAGe9882814a [2018-12-01 15:54:00,319 INFO L307 CDTParser]: Found 1 translation units. [2018-12-01 15:54:00,319 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_86819597-491e-4c2e-92ce-073d1270dbbd/sv-benchmarks/c/ldv-regression/ex3_forlist_true-termination.c_true-unreach-call.i [2018-12-01 15:54:00,323 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_86819597-491e-4c2e-92ce-073d1270dbbd/bin-2019/uautomizer/data/81b11d0bb/d5fa461eb0f249838d0cb1a5c3f41343/FLAGe9882814a [2018-12-01 15:54:00,332 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_86819597-491e-4c2e-92ce-073d1270dbbd/bin-2019/uautomizer/data/81b11d0bb/d5fa461eb0f249838d0cb1a5c3f41343 [2018-12-01 15:54:00,334 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-01 15:54:00,335 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-01 15:54:00,336 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-01 15:54:00,336 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-01 15:54:00,338 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-01 15:54:00,339 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 03:54:00" (1/1) ... [2018-12-01 15:54:00,341 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b4b7748 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:54:00, skipping insertion in model container [2018-12-01 15:54:00,341 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 03:54:00" (1/1) ... [2018-12-01 15:54:00,346 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-01 15:54:00,360 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-01 15:54:00,453 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-01 15:54:00,458 INFO L191 MainTranslator]: Completed pre-run [2018-12-01 15:54:00,473 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-01 15:54:00,489 INFO L195 MainTranslator]: Completed translation [2018-12-01 15:54:00,489 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:54:00 WrapperNode [2018-12-01 15:54:00,489 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-01 15:54:00,489 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-01 15:54:00,490 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-01 15:54:00,490 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-01 15:54:00,494 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:54:00" (1/1) ... [2018-12-01 15:54:00,500 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:54:00" (1/1) ... [2018-12-01 15:54:00,548 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-01 15:54:00,548 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-01 15:54:00,548 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-01 15:54:00,548 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-01 15:54:00,554 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:54:00" (1/1) ... [2018-12-01 15:54:00,554 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:54:00" (1/1) ... [2018-12-01 15:54:00,556 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:54:00" (1/1) ... [2018-12-01 15:54:00,556 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:54:00" (1/1) ... [2018-12-01 15:54:00,560 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:54:00" (1/1) ... [2018-12-01 15:54:00,564 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:54:00" (1/1) ... [2018-12-01 15:54:00,565 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:54:00" (1/1) ... [2018-12-01 15:54:00,566 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-01 15:54:00,566 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-01 15:54:00,566 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-01 15:54:00,566 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-01 15:54:00,567 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:54:00" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_86819597-491e-4c2e-92ce-073d1270dbbd/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-01 15:54:00,599 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-12-01 15:54:00,599 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2018-12-01 15:54:00,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2018-12-01 15:54:00,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-12-01 15:54:00,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-01 15:54:00,600 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-01 15:54:00,600 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-01 15:54:00,600 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-01 15:54:00,600 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-01 15:54:00,784 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-01 15:54:00,784 INFO L280 CfgBuilder]: Removed 27 assue(true) statements. [2018-12-01 15:54:00,785 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 03:54:00 BoogieIcfgContainer [2018-12-01 15:54:00,785 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-01 15:54:00,785 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-12-01 15:54:00,785 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-12-01 15:54:00,787 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-12-01 15:54:00,788 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-01 15:54:00,788 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.12 03:54:00" (1/3) ... [2018-12-01 15:54:00,789 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3f34b539 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.12 03:54:00, skipping insertion in model container [2018-12-01 15:54:00,789 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-01 15:54:00,789 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:54:00" (2/3) ... [2018-12-01 15:54:00,789 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3f34b539 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.12 03:54:00, skipping insertion in model container [2018-12-01 15:54:00,789 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-01 15:54:00,789 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 03:54:00" (3/3) ... [2018-12-01 15:54:00,790 INFO L375 chiAutomizerObserver]: Analyzing ICFG ex3_forlist_true-termination.c_true-unreach-call.i [2018-12-01 15:54:00,824 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-01 15:54:00,824 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-12-01 15:54:00,824 INFO L375 BuchiCegarLoop]: Hoare is false [2018-12-01 15:54:00,824 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-12-01 15:54:00,825 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-01 15:54:00,825 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-01 15:54:00,825 INFO L379 BuchiCegarLoop]: Difference is false [2018-12-01 15:54:00,825 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-01 15:54:00,825 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-12-01 15:54:00,834 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states. [2018-12-01 15:54:00,849 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 20 [2018-12-01 15:54:00,849 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 15:54:00,849 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 15:54:00,853 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-12-01 15:54:00,853 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-01 15:54:00,853 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-12-01 15:54:00,853 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states. [2018-12-01 15:54:00,855 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 20 [2018-12-01 15:54:00,855 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 15:54:00,855 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 15:54:00,855 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-12-01 15:54:00,855 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-01 15:54:00,860 INFO L794 eck$LassoCheckResult]: Stem: 28#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#pp~0.base, ~#pp~0.offset := #Ultimate.alloc(8);call write~init~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset, 4);call write~init~$Pointer$(0, 0, ~#pp~0.base, 4 + ~#pp~0.offset, 4);call ~#pstate~0.base, ~#pstate~0.offset := #Ultimate.alloc(8);call write~init~int(0, ~#pstate~0.base, ~#pstate~0.offset, 4);call write~init~int(0, ~#pstate~0.base, 4 + ~#pstate~0.offset, 4);~counter~0 := 1; 4#L-1true havoc main_#res;havoc main_#t~ret7.base, main_#t~ret7.offset, main_#t~ret8.base, main_#t~ret8.offset, main_~a~0.base, main_~a~0.offset, main_~b~0.base, main_~b~0.offset;havoc main_~a~0.base, main_~a~0.offset;havoc main_~b~0.base, main_~b~0.offset;havoc init_#t~post0, init_~i~0;havoc init_~i~0;init_~i~0 := 0; 31#L17-3true [2018-12-01 15:54:00,860 INFO L796 eck$LassoCheckResult]: Loop: 31#L17-3true assume !!(init_~i~0 < 2);call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0, 4);call write~int(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0, 4); 17#L17-2true init_#t~post0 := init_~i~0;init_~i~0 := 1 + init_#t~post0;havoc init_#t~post0; 31#L17-3true [2018-12-01 15:54:00,863 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 15:54:00,863 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-12-01 15:54:00,864 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 15:54:00,865 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 15:54:00,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:54:00,891 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 15:54:00,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:54:00,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 15:54:00,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 15:54:00,932 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 15:54:00,932 INFO L82 PathProgramCache]: Analyzing trace with hash 1283, now seen corresponding path program 1 times [2018-12-01 15:54:00,932 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 15:54:00,932 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 15:54:00,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:54:00,933 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 15:54:00,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:54:00,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 15:54:00,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 15:54:00,951 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 15:54:00,951 INFO L82 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2018-12-01 15:54:00,951 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 15:54:00,951 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 15:54:00,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:54:00,952 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 15:54:00,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:54:00,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 15:54:00,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 15:54:01,068 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-01 15:54:01,075 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-01 15:54:01,129 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-01 15:54:01,130 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:185, output treesize:186 [2018-12-01 15:54:01,248 INFO L216 LassoAnalysis]: Preferences: [2018-12-01 15:54:01,248 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-01 15:54:01,248 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-01 15:54:01,249 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-01 15:54:01,249 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-01 15:54:01,249 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-01 15:54:01,249 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-01 15:54:01,249 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-01 15:54:01,249 INFO L131 ssoRankerPreferences]: Filename of dumped script: ex3_forlist_true-termination.c_true-unreach-call.i_Iteration1_Lasso [2018-12-01 15:54:01,249 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-01 15:54:01,249 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-01 15:54:01,261 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-01 15:54:01,265 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 15:54:01,266 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-01 15:54:01,267 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 15:54:01,269 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 15:54:01,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-01 15:54:01,272 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-01 15:54:01,273 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-01 15:54:01,443 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 15:54:01,444 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-01 15:54:01,446 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-01 15:54:01,446 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-01 15:54:01,447 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 15:54:01,449 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 15:54:01,599 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-01 15:54:01,602 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-01 15:54:01,603 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-01 15:54:01,604 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 15:54:01,605 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 15:54:01,605 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 15:54:01,605 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 15:54:01,605 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 15:54:01,606 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 15:54:01,606 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 15:54:01,607 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 15:54:01,608 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-01 15:54:01,608 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 15:54:01,608 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 15:54:01,608 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 15:54:01,608 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 15:54:01,608 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 15:54:01,609 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 15:54:01,609 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 15:54:01,609 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 15:54:01,609 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-01 15:54:01,610 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 15:54:01,610 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 15:54:01,610 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 15:54:01,610 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 15:54:01,610 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 15:54:01,610 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 15:54:01,611 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 15:54:01,611 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 15:54:01,611 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-01 15:54:01,612 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 15:54:01,612 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 15:54:01,612 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 15:54:01,612 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 15:54:01,612 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 15:54:01,612 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 15:54:01,612 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 15:54:01,613 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 15:54:01,613 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-01 15:54:01,613 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 15:54:01,613 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 15:54:01,613 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 15:54:01,614 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 15:54:01,614 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 15:54:01,614 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 15:54:01,614 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 15:54:01,614 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 15:54:01,615 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-01 15:54:01,615 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 15:54:01,615 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 15:54:01,615 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 15:54:01,615 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 15:54:01,616 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 15:54:01,616 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 15:54:01,618 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 15:54:01,619 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-01 15:54:01,619 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 15:54:01,619 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 15:54:01,619 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 15:54:01,619 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 15:54:01,619 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 15:54:01,620 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 15:54:01,620 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 15:54:01,620 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 15:54:01,620 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-01 15:54:01,621 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 15:54:01,621 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 15:54:01,621 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 15:54:01,621 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 15:54:01,622 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 15:54:01,622 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 15:54:01,625 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 15:54:01,625 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-01 15:54:01,626 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 15:54:01,626 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 15:54:01,626 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 15:54:01,626 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 15:54:01,627 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 15:54:01,627 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 15:54:01,630 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 15:54:01,631 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-01 15:54:01,631 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 15:54:01,631 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 15:54:01,631 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 15:54:01,631 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 15:54:01,632 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 15:54:01,632 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 15:54:01,634 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 15:54:01,635 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-01 15:54:01,635 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 15:54:01,635 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 15:54:01,635 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 15:54:01,635 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 15:54:01,636 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 15:54:01,636 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 15:54:01,639 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 15:54:01,639 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-01 15:54:01,640 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 15:54:01,640 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 15:54:01,640 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 15:54:01,640 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 15:54:01,640 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 15:54:01,640 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 15:54:01,640 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 15:54:01,641 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 15:54:01,641 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-01 15:54:01,641 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 15:54:01,641 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 15:54:01,642 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 15:54:01,642 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 15:54:01,642 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 15:54:01,642 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 15:54:01,644 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 15:54:01,644 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-01 15:54:01,644 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 15:54:01,645 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 15:54:01,645 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 15:54:01,645 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 15:54:01,645 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 15:54:01,645 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 15:54:01,645 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 15:54:01,646 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 15:54:01,646 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-01 15:54:01,646 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 15:54:01,646 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-01 15:54:01,647 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 15:54:01,647 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 15:54:01,647 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-01 15:54:01,647 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 15:54:01,650 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 15:54:01,650 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-01 15:54:01,651 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 15:54:01,651 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 15:54:01,651 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 15:54:01,651 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 15:54:01,652 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 15:54:01,652 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 15:54:01,654 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 15:54:01,655 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-01 15:54:01,655 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 15:54:01,655 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-01 15:54:01,655 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 15:54:01,655 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 15:54:01,656 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-01 15:54:01,657 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 15:54:01,660 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 15:54:01,660 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-01 15:54:01,661 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 15:54:01,661 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 15:54:01,661 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 15:54:01,661 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 15:54:01,661 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 15:54:01,662 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 15:54:01,662 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 15:54:01,663 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 15:54:01,663 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-01 15:54:01,664 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 15:54:01,664 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 15:54:01,664 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 15:54:01,664 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 15:54:01,665 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 15:54:01,665 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 15:54:01,670 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 15:54:01,670 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-01 15:54:01,671 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 15:54:01,671 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 15:54:01,671 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 15:54:01,671 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 15:54:01,672 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 15:54:01,672 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 15:54:01,678 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 15:54:01,678 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-01 15:54:01,679 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 15:54:01,679 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 15:54:01,679 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 15:54:01,679 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 15:54:01,681 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 15:54:01,682 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 15:54:01,703 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-01 15:54:01,714 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-12-01 15:54:01,714 INFO L444 ModelExtractionUtils]: 14 out of 19 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-12-01 15:54:01,715 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-01 15:54:01,716 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-01 15:54:01,716 INFO L518 LassoAnalysis]: Proved termination. [2018-12-01 15:54:01,717 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_init_~i~0) = -2*ULTIMATE.start_init_~i~0 + 3 Supporting invariants [] [2018-12-01 15:54:01,731 INFO L297 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2018-12-01 15:54:01,749 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 15:54:01,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 15:54:01,759 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 15:54:01,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 15:54:01,768 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 15:54:01,776 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-01 15:54:01,785 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-12-01 15:54:01,786 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 33 states. Second operand 3 states. [2018-12-01 15:54:01,825 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 33 states.. Second operand 3 states. Result 93 states and 136 transitions. Complement of second has 7 states. [2018-12-01 15:54:01,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-12-01 15:54:01,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-01 15:54:01,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 92 transitions. [2018-12-01 15:54:01,829 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 92 transitions. Stem has 2 letters. Loop has 2 letters. [2018-12-01 15:54:01,829 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 15:54:01,829 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 92 transitions. Stem has 4 letters. Loop has 2 letters. [2018-12-01 15:54:01,829 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 15:54:01,829 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 92 transitions. Stem has 2 letters. Loop has 4 letters. [2018-12-01 15:54:01,830 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 15:54:01,830 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 93 states and 136 transitions. [2018-12-01 15:54:01,834 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 16 [2018-12-01 15:54:01,837 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 93 states to 28 states and 37 transitions. [2018-12-01 15:54:01,838 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2018-12-01 15:54:01,838 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2018-12-01 15:54:01,838 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 37 transitions. [2018-12-01 15:54:01,839 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-01 15:54:01,839 INFO L705 BuchiCegarLoop]: Abstraction has 28 states and 37 transitions. [2018-12-01 15:54:01,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 37 transitions. [2018-12-01 15:54:01,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-12-01 15:54:01,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-12-01 15:54:01,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 37 transitions. [2018-12-01 15:54:01,856 INFO L728 BuchiCegarLoop]: Abstraction has 28 states and 37 transitions. [2018-12-01 15:54:01,856 INFO L608 BuchiCegarLoop]: Abstraction has 28 states and 37 transitions. [2018-12-01 15:54:01,856 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-12-01 15:54:01,856 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 37 transitions. [2018-12-01 15:54:01,857 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 16 [2018-12-01 15:54:01,857 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 15:54:01,857 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 15:54:01,857 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-12-01 15:54:01,857 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-01 15:54:01,858 INFO L794 eck$LassoCheckResult]: Stem: 216#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#pp~0.base, ~#pp~0.offset := #Ultimate.alloc(8);call write~init~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset, 4);call write~init~$Pointer$(0, 0, ~#pp~0.base, 4 + ~#pp~0.offset, 4);call ~#pstate~0.base, ~#pstate~0.offset := #Ultimate.alloc(8);call write~init~int(0, ~#pstate~0.base, ~#pstate~0.offset, 4);call write~init~int(0, ~#pstate~0.base, 4 + ~#pstate~0.offset, 4);~counter~0 := 1; 191#L-1 havoc main_#res;havoc main_#t~ret7.base, main_#t~ret7.offset, main_#t~ret8.base, main_#t~ret8.offset, main_~a~0.base, main_~a~0.offset, main_~b~0.base, main_~b~0.offset;havoc main_~a~0.base, main_~a~0.offset;havoc main_~b~0.base, main_~b~0.offset;havoc init_#t~post0, init_~i~0;havoc init_~i~0;init_~i~0 := 0; 192#L17-3 assume !(init_~i~0 < 2); 205#L15 malloc_#in~size := 4;havoc malloc_#res.base, malloc_#res.offset;havoc malloc_#t~post6, malloc_~size;malloc_~size := malloc_#in~size;malloc_#t~post6 := ~counter~0;~counter~0 := 1 + malloc_#t~post6;malloc_#res.base, malloc_#res.offset := 0, malloc_#t~post6;havoc malloc_#t~post6; 189#L47 main_#t~ret7.base, main_#t~ret7.offset := malloc_#res.base, malloc_#res.offset;main_~a~0.base, main_~a~0.offset := main_#t~ret7.base, main_#t~ret7.offset;havoc main_#t~ret7.base, main_#t~ret7.offset;malloc_#in~size := 4;havoc malloc_#res.base, malloc_#res.offset;havoc malloc_#t~post6, malloc_~size;malloc_~size := malloc_#in~size;malloc_#t~post6 := ~counter~0;~counter~0 := 1 + malloc_#t~post6;malloc_#res.base, malloc_#res.offset := 0, malloc_#t~post6;havoc malloc_#t~post6; 190#L47-1 main_#t~ret8.base, main_#t~ret8.offset := malloc_#res.base, malloc_#res.offset;main_~b~0.base, main_~b~0.offset := main_#t~ret8.base, main_#t~ret8.offset;havoc main_#t~ret8.base, main_#t~ret8.offset; 204#L57 assume !((main_~a~0.base == 0 && main_~a~0.offset == 0) || (main_~b~0.base == 0 && main_~b~0.offset == 0));f_#in~pointer.base, f_#in~pointer.offset := main_~a~0.base, main_~a~0.offset;havoc f_#t~mem2.base, f_#t~mem2.offset, f_#t~post1, f_~pointer.base, f_~pointer.offset, f_~i~1;f_~pointer.base, f_~pointer.offset := f_#in~pointer.base, f_#in~pointer.offset;havoc f_~i~1;f_~i~1 := 0; 195#L25-3 [2018-12-01 15:54:01,858 INFO L796 eck$LassoCheckResult]: Loop: 195#L25-3 assume !!(f_~i~1 < 2);call f_#t~mem2.base, f_#t~mem2.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1, 4); 196#L26 assume !(f_#t~mem2.base == 0 && f_#t~mem2.offset == 0);havoc f_#t~mem2.base, f_#t~mem2.offset; 200#L25-2 f_#t~post1 := f_~i~1;f_~i~1 := 1 + f_#t~post1;havoc f_#t~post1; 195#L25-3 [2018-12-01 15:54:01,858 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 15:54:01,858 INFO L82 PathProgramCache]: Analyzing trace with hash 1807951404, now seen corresponding path program 1 times [2018-12-01 15:54:01,858 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 15:54:01,858 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 15:54:01,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:54:01,859 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 15:54:01,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:54:01,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 15:54:01,888 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-01 15:54:01,889 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 15:54:01,889 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 15:54:01,890 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-01 15:54:01,890 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 15:54:01,890 INFO L82 PathProgramCache]: Analyzing trace with hash 62722, now seen corresponding path program 1 times [2018-12-01 15:54:01,891 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 15:54:01,891 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 15:54:01,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:54:01,891 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 15:54:01,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:54:01,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 15:54:01,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 15:54:01,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 15:54:01,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 15:54:01,945 INFO L87 Difference]: Start difference. First operand 28 states and 37 transitions. cyclomatic complexity: 14 Second operand 3 states. [2018-12-01 15:54:01,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 15:54:01,954 INFO L93 Difference]: Finished difference Result 29 states and 37 transitions. [2018-12-01 15:54:01,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 15:54:01,955 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 37 transitions. [2018-12-01 15:54:01,956 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 16 [2018-12-01 15:54:01,956 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 29 states and 37 transitions. [2018-12-01 15:54:01,956 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2018-12-01 15:54:01,956 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2018-12-01 15:54:01,956 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 37 transitions. [2018-12-01 15:54:01,957 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-01 15:54:01,957 INFO L705 BuchiCegarLoop]: Abstraction has 29 states and 37 transitions. [2018-12-01 15:54:01,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 37 transitions. [2018-12-01 15:54:01,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2018-12-01 15:54:01,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-12-01 15:54:01,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 36 transitions. [2018-12-01 15:54:01,958 INFO L728 BuchiCegarLoop]: Abstraction has 28 states and 36 transitions. [2018-12-01 15:54:01,958 INFO L608 BuchiCegarLoop]: Abstraction has 28 states and 36 transitions. [2018-12-01 15:54:01,958 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-12-01 15:54:01,958 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 36 transitions. [2018-12-01 15:54:01,959 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 16 [2018-12-01 15:54:01,959 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 15:54:01,959 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 15:54:01,959 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 15:54:01,959 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-01 15:54:01,959 INFO L794 eck$LassoCheckResult]: Stem: 279#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#pp~0.base, ~#pp~0.offset := #Ultimate.alloc(8);call write~init~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset, 4);call write~init~$Pointer$(0, 0, ~#pp~0.base, 4 + ~#pp~0.offset, 4);call ~#pstate~0.base, ~#pstate~0.offset := #Ultimate.alloc(8);call write~init~int(0, ~#pstate~0.base, ~#pstate~0.offset, 4);call write~init~int(0, ~#pstate~0.base, 4 + ~#pstate~0.offset, 4);~counter~0 := 1; 254#L-1 havoc main_#res;havoc main_#t~ret7.base, main_#t~ret7.offset, main_#t~ret8.base, main_#t~ret8.offset, main_~a~0.base, main_~a~0.offset, main_~b~0.base, main_~b~0.offset;havoc main_~a~0.base, main_~a~0.offset;havoc main_~b~0.base, main_~b~0.offset;havoc init_#t~post0, init_~i~0;havoc init_~i~0;init_~i~0 := 0; 255#L17-3 assume !!(init_~i~0 < 2);call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0, 4);call write~int(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0, 4); 268#L17-2 init_#t~post0 := init_~i~0;init_~i~0 := 1 + init_#t~post0;havoc init_#t~post0; 269#L17-3 assume !(init_~i~0 < 2); 270#L15 malloc_#in~size := 4;havoc malloc_#res.base, malloc_#res.offset;havoc malloc_#t~post6, malloc_~size;malloc_~size := malloc_#in~size;malloc_#t~post6 := ~counter~0;~counter~0 := 1 + malloc_#t~post6;malloc_#res.base, malloc_#res.offset := 0, malloc_#t~post6;havoc malloc_#t~post6; 252#L47 main_#t~ret7.base, main_#t~ret7.offset := malloc_#res.base, malloc_#res.offset;main_~a~0.base, main_~a~0.offset := main_#t~ret7.base, main_#t~ret7.offset;havoc main_#t~ret7.base, main_#t~ret7.offset;malloc_#in~size := 4;havoc malloc_#res.base, malloc_#res.offset;havoc malloc_#t~post6, malloc_~size;malloc_~size := malloc_#in~size;malloc_#t~post6 := ~counter~0;~counter~0 := 1 + malloc_#t~post6;malloc_#res.base, malloc_#res.offset := 0, malloc_#t~post6;havoc malloc_#t~post6; 253#L47-1 main_#t~ret8.base, main_#t~ret8.offset := malloc_#res.base, malloc_#res.offset;main_~b~0.base, main_~b~0.offset := main_#t~ret8.base, main_#t~ret8.offset;havoc main_#t~ret8.base, main_#t~ret8.offset; 267#L57 assume !((main_~a~0.base == 0 && main_~a~0.offset == 0) || (main_~b~0.base == 0 && main_~b~0.offset == 0));f_#in~pointer.base, f_#in~pointer.offset := main_~a~0.base, main_~a~0.offset;havoc f_#t~mem2.base, f_#t~mem2.offset, f_#t~post1, f_~pointer.base, f_~pointer.offset, f_~i~1;f_~pointer.base, f_~pointer.offset := f_#in~pointer.base, f_#in~pointer.offset;havoc f_~i~1;f_~i~1 := 0; 256#L25-3 [2018-12-01 15:54:01,959 INFO L796 eck$LassoCheckResult]: Loop: 256#L25-3 assume !!(f_~i~1 < 2);call f_#t~mem2.base, f_#t~mem2.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1, 4); 257#L26 assume !(f_#t~mem2.base == 0 && f_#t~mem2.offset == 0);havoc f_#t~mem2.base, f_#t~mem2.offset; 264#L25-2 f_#t~post1 := f_~i~1;f_~i~1 := 1 + f_#t~post1;havoc f_#t~post1; 256#L25-3 [2018-12-01 15:54:01,960 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 15:54:01,960 INFO L82 PathProgramCache]: Analyzing trace with hash -369325334, now seen corresponding path program 1 times [2018-12-01 15:54:01,960 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 15:54:01,960 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 15:54:01,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:54:01,960 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 15:54:01,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:54:01,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 15:54:01,981 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 15:54:01,981 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-01 15:54:01,981 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_86819597-491e-4c2e-92ce-073d1270dbbd/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-01 15:54:01,992 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 15:54:02,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 15:54:02,006 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 15:54:02,012 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 15:54:02,037 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-01 15:54:02,037 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-12-01 15:54:02,038 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-01 15:54:02,038 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 15:54:02,038 INFO L82 PathProgramCache]: Analyzing trace with hash 62722, now seen corresponding path program 2 times [2018-12-01 15:54:02,038 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 15:54:02,038 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 15:54:02,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:54:02,039 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 15:54:02,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:54:02,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 15:54:02,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 15:54:02,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-01 15:54:02,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-12-01 15:54:02,093 INFO L87 Difference]: Start difference. First operand 28 states and 36 transitions. cyclomatic complexity: 13 Second operand 5 states. [2018-12-01 15:54:02,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 15:54:02,104 INFO L93 Difference]: Finished difference Result 30 states and 38 transitions. [2018-12-01 15:54:02,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-01 15:54:02,105 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 38 transitions. [2018-12-01 15:54:02,105 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 16 [2018-12-01 15:54:02,106 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 30 states and 38 transitions. [2018-12-01 15:54:02,106 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2018-12-01 15:54:02,106 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2018-12-01 15:54:02,106 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 38 transitions. [2018-12-01 15:54:02,106 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-01 15:54:02,106 INFO L705 BuchiCegarLoop]: Abstraction has 30 states and 38 transitions. [2018-12-01 15:54:02,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 38 transitions. [2018-12-01 15:54:02,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-12-01 15:54:02,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-12-01 15:54:02,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 38 transitions. [2018-12-01 15:54:02,108 INFO L728 BuchiCegarLoop]: Abstraction has 30 states and 38 transitions. [2018-12-01 15:54:02,108 INFO L608 BuchiCegarLoop]: Abstraction has 30 states and 38 transitions. [2018-12-01 15:54:02,108 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-12-01 15:54:02,108 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 38 transitions. [2018-12-01 15:54:02,108 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 16 [2018-12-01 15:54:02,108 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 15:54:02,108 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 15:54:02,109 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 15:54:02,109 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-01 15:54:02,109 INFO L794 eck$LassoCheckResult]: Stem: 369#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#pp~0.base, ~#pp~0.offset := #Ultimate.alloc(8);call write~init~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset, 4);call write~init~$Pointer$(0, 0, ~#pp~0.base, 4 + ~#pp~0.offset, 4);call ~#pstate~0.base, ~#pstate~0.offset := #Ultimate.alloc(8);call write~init~int(0, ~#pstate~0.base, ~#pstate~0.offset, 4);call write~init~int(0, ~#pstate~0.base, 4 + ~#pstate~0.offset, 4);~counter~0 := 1; 344#L-1 havoc main_#res;havoc main_#t~ret7.base, main_#t~ret7.offset, main_#t~ret8.base, main_#t~ret8.offset, main_~a~0.base, main_~a~0.offset, main_~b~0.base, main_~b~0.offset;havoc main_~a~0.base, main_~a~0.offset;havoc main_~b~0.base, main_~b~0.offset;havoc init_#t~post0, init_~i~0;havoc init_~i~0;init_~i~0 := 0; 345#L17-3 assume !!(init_~i~0 < 2);call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0, 4);call write~int(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0, 4); 358#L17-2 init_#t~post0 := init_~i~0;init_~i~0 := 1 + init_#t~post0;havoc init_#t~post0; 359#L17-3 assume !!(init_~i~0 < 2);call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0, 4);call write~int(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0, 4); 370#L17-2 init_#t~post0 := init_~i~0;init_~i~0 := 1 + init_#t~post0;havoc init_#t~post0; 371#L17-3 assume !(init_~i~0 < 2); 360#L15 malloc_#in~size := 4;havoc malloc_#res.base, malloc_#res.offset;havoc malloc_#t~post6, malloc_~size;malloc_~size := malloc_#in~size;malloc_#t~post6 := ~counter~0;~counter~0 := 1 + malloc_#t~post6;malloc_#res.base, malloc_#res.offset := 0, malloc_#t~post6;havoc malloc_#t~post6; 342#L47 main_#t~ret7.base, main_#t~ret7.offset := malloc_#res.base, malloc_#res.offset;main_~a~0.base, main_~a~0.offset := main_#t~ret7.base, main_#t~ret7.offset;havoc main_#t~ret7.base, main_#t~ret7.offset;malloc_#in~size := 4;havoc malloc_#res.base, malloc_#res.offset;havoc malloc_#t~post6, malloc_~size;malloc_~size := malloc_#in~size;malloc_#t~post6 := ~counter~0;~counter~0 := 1 + malloc_#t~post6;malloc_#res.base, malloc_#res.offset := 0, malloc_#t~post6;havoc malloc_#t~post6; 343#L47-1 main_#t~ret8.base, main_#t~ret8.offset := malloc_#res.base, malloc_#res.offset;main_~b~0.base, main_~b~0.offset := main_#t~ret8.base, main_#t~ret8.offset;havoc main_#t~ret8.base, main_#t~ret8.offset; 357#L57 assume !((main_~a~0.base == 0 && main_~a~0.offset == 0) || (main_~b~0.base == 0 && main_~b~0.offset == 0));f_#in~pointer.base, f_#in~pointer.offset := main_~a~0.base, main_~a~0.offset;havoc f_#t~mem2.base, f_#t~mem2.offset, f_#t~post1, f_~pointer.base, f_~pointer.offset, f_~i~1;f_~pointer.base, f_~pointer.offset := f_#in~pointer.base, f_#in~pointer.offset;havoc f_~i~1;f_~i~1 := 0; 346#L25-3 [2018-12-01 15:54:02,109 INFO L796 eck$LassoCheckResult]: Loop: 346#L25-3 assume !!(f_~i~1 < 2);call f_#t~mem2.base, f_#t~mem2.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1, 4); 347#L26 assume !(f_#t~mem2.base == 0 && f_#t~mem2.offset == 0);havoc f_#t~mem2.base, f_#t~mem2.offset; 354#L25-2 f_#t~post1 := f_~i~1;f_~i~1 := 1 + f_#t~post1;havoc f_#t~post1; 346#L25-3 [2018-12-01 15:54:02,109 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 15:54:02,109 INFO L82 PathProgramCache]: Analyzing trace with hash -1083197400, now seen corresponding path program 2 times [2018-12-01 15:54:02,109 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 15:54:02,109 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 15:54:02,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:54:02,110 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 15:54:02,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:54:02,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 15:54:02,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 15:54:02,132 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 15:54:02,132 INFO L82 PathProgramCache]: Analyzing trace with hash 62722, now seen corresponding path program 3 times [2018-12-01 15:54:02,132 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 15:54:02,132 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 15:54:02,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:54:02,133 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 15:54:02,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:54:02,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 15:54:02,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 15:54:02,136 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 15:54:02,137 INFO L82 PathProgramCache]: Analyzing trace with hash -1444415621, now seen corresponding path program 1 times [2018-12-01 15:54:02,137 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 15:54:02,137 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 15:54:02,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:54:02,137 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 15:54:02,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:54:02,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 15:54:02,384 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 15:54:02,384 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-01 15:54:02,384 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_86819597-491e-4c2e-92ce-073d1270dbbd/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-01 15:54:02,395 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 15:54:02,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 15:54:02,407 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 15:54:02,414 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2018-12-01 15:54:02,420 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2018-12-01 15:54:02,420 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 15:54:02,422 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 15:54:02,425 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 15:54:02,425 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:18, output treesize:11 [2018-12-01 15:54:02,458 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 36 [2018-12-01 15:54:02,460 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 12 treesize of output 11 [2018-12-01 15:54:02,460 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 15:54:02,469 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 35 treesize of output 36 [2018-12-01 15:54:02,471 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 20 treesize of output 1 [2018-12-01 15:54:02,471 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-01 15:54:02,475 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 15:54:02,476 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 15:54:02,487 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 36 [2018-12-01 15:54:02,489 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 12 treesize of output 11 [2018-12-01 15:54:02,490 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-01 15:54:02,497 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 35 treesize of output 36 [2018-12-01 15:54:02,499 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 20 treesize of output 1 [2018-12-01 15:54:02,499 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-01 15:54:02,501 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 15:54:02,502 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 15:54:02,508 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 15:54:02,508 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 2 variables, input treesize:108, output treesize:36 [2018-12-01 15:54:02,552 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 41 [2018-12-01 15:54:02,555 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:54:02,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 18 treesize of output 27 [2018-12-01 15:54:02,556 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 15:54:02,569 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 42 treesize of output 43 [2018-12-01 15:54:02,571 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 20 treesize of output 1 [2018-12-01 15:54:02,571 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-01 15:54:02,576 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 15:54:02,581 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 15:54:02,594 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 41 [2018-12-01 15:54:02,597 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:54:02,597 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 18 treesize of output 27 [2018-12-01 15:54:02,598 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-01 15:54:02,607 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 42 treesize of output 43 [2018-12-01 15:54:02,609 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 20 treesize of output 1 [2018-12-01 15:54:02,609 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-01 15:54:02,612 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 15:54:02,616 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 15:54:02,625 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-01 15:54:02,625 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:122, output treesize:46 [2018-12-01 15:54:02,727 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 24 treesize of output 18 [2018-12-01 15:54:02,729 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:54:02,730 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-12-01 15:54:02,730 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 15:54:02,733 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 15:54:02,739 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 24 treesize of output 18 [2018-12-01 15:54:02,740 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:54:02,741 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-12-01 15:54:02,741 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-01 15:54:02,743 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 15:54:02,746 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 15:54:02,746 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:50, output treesize:7 [2018-12-01 15:54:02,758 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 15:54:02,772 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-01 15:54:02,772 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2018-12-01 15:54:02,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-01 15:54:02,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=297, Unknown=0, NotChecked=0, Total=342 [2018-12-01 15:54:02,801 INFO L87 Difference]: Start difference. First operand 30 states and 38 transitions. cyclomatic complexity: 13 Second operand 19 states. [2018-12-01 15:54:15,496 WARN L180 SmtUtils]: Spent 284.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 42 [2018-12-01 15:54:15,824 WARN L180 SmtUtils]: Spent 311.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 46 [2018-12-01 15:54:15,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 15:54:15,911 INFO L93 Difference]: Finished difference Result 29 states and 35 transitions. [2018-12-01 15:54:15,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-01 15:54:15,912 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 35 transitions. [2018-12-01 15:54:15,912 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2018-12-01 15:54:15,912 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 29 states and 35 transitions. [2018-12-01 15:54:15,912 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2018-12-01 15:54:15,913 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2018-12-01 15:54:15,913 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 35 transitions. [2018-12-01 15:54:15,913 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-01 15:54:15,913 INFO L705 BuchiCegarLoop]: Abstraction has 29 states and 35 transitions. [2018-12-01 15:54:15,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 35 transitions. [2018-12-01 15:54:15,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-12-01 15:54:15,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-12-01 15:54:15,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2018-12-01 15:54:15,914 INFO L728 BuchiCegarLoop]: Abstraction has 29 states and 35 transitions. [2018-12-01 15:54:15,914 INFO L608 BuchiCegarLoop]: Abstraction has 29 states and 35 transitions. [2018-12-01 15:54:15,915 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-12-01 15:54:15,915 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 35 transitions. [2018-12-01 15:54:15,915 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2018-12-01 15:54:15,915 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 15:54:15,915 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 15:54:15,915 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 15:54:15,915 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-01 15:54:15,915 INFO L794 eck$LassoCheckResult]: Stem: 506#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#pp~0.base, ~#pp~0.offset := #Ultimate.alloc(8);call write~init~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset, 4);call write~init~$Pointer$(0, 0, ~#pp~0.base, 4 + ~#pp~0.offset, 4);call ~#pstate~0.base, ~#pstate~0.offset := #Ultimate.alloc(8);call write~init~int(0, ~#pstate~0.base, ~#pstate~0.offset, 4);call write~init~int(0, ~#pstate~0.base, 4 + ~#pstate~0.offset, 4);~counter~0 := 1; 482#L-1 havoc main_#res;havoc main_#t~ret7.base, main_#t~ret7.offset, main_#t~ret8.base, main_#t~ret8.offset, main_~a~0.base, main_~a~0.offset, main_~b~0.base, main_~b~0.offset;havoc main_~a~0.base, main_~a~0.offset;havoc main_~b~0.base, main_~b~0.offset;havoc init_#t~post0, init_~i~0;havoc init_~i~0;init_~i~0 := 0; 483#L17-3 assume !!(init_~i~0 < 2);call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0, 4);call write~int(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0, 4); 496#L17-2 init_#t~post0 := init_~i~0;init_~i~0 := 1 + init_#t~post0;havoc init_#t~post0; 497#L17-3 assume !!(init_~i~0 < 2);call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0, 4);call write~int(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0, 4); 507#L17-2 init_#t~post0 := init_~i~0;init_~i~0 := 1 + init_#t~post0;havoc init_#t~post0; 508#L17-3 assume !(init_~i~0 < 2); 495#L15 malloc_#in~size := 4;havoc malloc_#res.base, malloc_#res.offset;havoc malloc_#t~post6, malloc_~size;malloc_~size := malloc_#in~size;malloc_#t~post6 := ~counter~0;~counter~0 := 1 + malloc_#t~post6;malloc_#res.base, malloc_#res.offset := 0, malloc_#t~post6;havoc malloc_#t~post6; 480#L47 main_#t~ret7.base, main_#t~ret7.offset := malloc_#res.base, malloc_#res.offset;main_~a~0.base, main_~a~0.offset := main_#t~ret7.base, main_#t~ret7.offset;havoc main_#t~ret7.base, main_#t~ret7.offset;malloc_#in~size := 4;havoc malloc_#res.base, malloc_#res.offset;havoc malloc_#t~post6, malloc_~size;malloc_~size := malloc_#in~size;malloc_#t~post6 := ~counter~0;~counter~0 := 1 + malloc_#t~post6;malloc_#res.base, malloc_#res.offset := 0, malloc_#t~post6;havoc malloc_#t~post6; 481#L47-1 main_#t~ret8.base, main_#t~ret8.offset := malloc_#res.base, malloc_#res.offset;main_~b~0.base, main_~b~0.offset := main_#t~ret8.base, main_#t~ret8.offset;havoc main_#t~ret8.base, main_#t~ret8.offset; 494#L57 assume !((main_~a~0.base == 0 && main_~a~0.offset == 0) || (main_~b~0.base == 0 && main_~b~0.offset == 0));f_#in~pointer.base, f_#in~pointer.offset := main_~a~0.base, main_~a~0.offset;havoc f_#t~mem2.base, f_#t~mem2.offset, f_#t~post1, f_~pointer.base, f_~pointer.offset, f_~i~1;f_~pointer.base, f_~pointer.offset := f_#in~pointer.base, f_#in~pointer.offset;havoc f_~i~1;f_~i~1 := 0; 484#L25-3 assume !!(f_~i~1 < 2);call f_#t~mem2.base, f_#t~mem2.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1, 4); 485#L26 assume f_#t~mem2.base == 0 && f_#t~mem2.offset == 0;havoc f_#t~mem2.base, f_#t~mem2.offset;call write~$Pointer$(f_~pointer.base, f_~pointer.offset, ~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1, 4);call write~int(1, ~#pstate~0.base, ~#pstate~0.offset + 4 * f_~i~1, 4); 490#L23 f_#in~pointer.base, f_#in~pointer.offset := main_~b~0.base, main_~b~0.offset;havoc f_#t~mem2.base, f_#t~mem2.offset, f_#t~post1, f_~pointer.base, f_~pointer.offset, f_~i~1;f_~pointer.base, f_~pointer.offset := f_#in~pointer.base, f_#in~pointer.offset;havoc f_~i~1;f_~i~1 := 0; 491#L25-7 [2018-12-01 15:54:15,915 INFO L796 eck$LassoCheckResult]: Loop: 491#L25-7 assume !!(f_~i~1 < 2);call f_#t~mem2.base, f_#t~mem2.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1, 4); 502#L26-1 assume !(f_#t~mem2.base == 0 && f_#t~mem2.offset == 0);havoc f_#t~mem2.base, f_#t~mem2.offset; 504#L25-6 f_#t~post1 := f_~i~1;f_~i~1 := 1 + f_#t~post1;havoc f_#t~post1; 491#L25-7 [2018-12-01 15:54:15,916 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 15:54:15,916 INFO L82 PathProgramCache]: Analyzing trace with hash -1444415679, now seen corresponding path program 1 times [2018-12-01 15:54:15,916 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 15:54:15,916 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 15:54:15,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:54:15,916 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 15:54:15,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:54:15,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 15:54:15,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 15:54:15,948 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 15:54:15,948 INFO L82 PathProgramCache]: Analyzing trace with hash 81589, now seen corresponding path program 1 times [2018-12-01 15:54:15,948 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 15:54:15,948 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 15:54:15,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:54:15,949 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 15:54:15,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:54:15,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 15:54:15,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 15:54:15,953 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 15:54:15,953 INFO L82 PathProgramCache]: Analyzing trace with hash 689897333, now seen corresponding path program 1 times [2018-12-01 15:54:15,953 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 15:54:15,953 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 15:54:15,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:54:15,954 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 15:54:15,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:54:15,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 15:54:15,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 15:54:39,050 WARN L180 SmtUtils]: Spent 23.03 s on a formula simplification. DAG size of input: 265 DAG size of output: 224 [2018-12-01 15:54:39,054 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-01 15:54:39,159 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-01 15:54:45,125 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-01 15:54:45,251 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-01 15:54:52,036 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-01 15:54:52,210 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-01 15:54:58,678 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-01 15:54:58,807 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-01 15:55:05,012 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-01 15:55:05,096 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-01 15:55:10,720 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-01 15:55:10,847 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-01 15:55:14,902 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-01 15:55:15,001 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-01 15:55:19,039 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-2 vars, End of recursive call: 7 dim-0 vars, and 1 xjuncts. [2018-12-01 15:55:19,040 INFO L202 ElimStorePlain]: Needed 15 recursive calls to eliminate 7 variables, input treesize:461, output treesize:1764 [2018-12-01 15:55:23,255 WARN L180 SmtUtils]: Spent 4.22 s on a formula simplification that was a NOOP. DAG size: 158 [2018-12-01 15:55:23,257 INFO L216 LassoAnalysis]: Preferences: [2018-12-01 15:55:23,257 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-01 15:55:23,257 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-01 15:55:23,257 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-01 15:55:23,257 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-01 15:55:23,257 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-01 15:55:23,257 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-01 15:55:23,258 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-01 15:55:23,258 INFO L131 ssoRankerPreferences]: Filename of dumped script: ex3_forlist_true-termination.c_true-unreach-call.i_Iteration5_Lasso [2018-12-01 15:55:23,258 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-01 15:55:23,258 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-01 15:55:23,260 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-01 15:55:23,261 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-01 15:55:23,262 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 15:55:23,983 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-01 15:55:23,984 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-01 15:55:23,985 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-01 15:55:23,986 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-01 15:55:23,987 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-01 15:55:23,989 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-01 15:55:23,990 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-01 15:55:23,991 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-01 15:55:23,996 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-01 15:55:23,997 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-01 15:55:23,998 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-01 15:55:23,999 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-01 15:55:24,004 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-01 15:55:24,005 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-01 15:55:24,176 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-01 15:55:24,176 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-01 15:55:24,176 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 15:55:24,177 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 15:55:24,177 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 15:55:24,177 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 15:55:24,177 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 15:55:24,177 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 15:55:24,177 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 15:55:24,177 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 15:55:24,177 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 15:55:24,178 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-01 15:55:24,178 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 15:55:24,178 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 15:55:24,178 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 15:55:24,178 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 15:55:24,178 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 15:55:24,178 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 15:55:24,178 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 15:55:24,178 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 15:55:24,179 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 15:55:24,179 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 15:55:24,179 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 15:55:24,179 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 15:55:24,179 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 15:55:24,179 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 15:55:24,179 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 15:55:24,180 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 15:55:24,180 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 15:55:24,181 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 15:55:24,181 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 15:55:24,181 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 15:55:24,181 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 15:55:24,181 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 15:55:24,181 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 15:55:24,182 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 15:55:24,182 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 15:55:24,183 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 15:55:24,183 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 15:55:24,183 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 15:55:24,183 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 15:55:24,183 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 15:55:24,183 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 15:55:24,184 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 15:55:24,184 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-01 15:55:24,185 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 15:55:24,185 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 15:55:24,185 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 15:55:24,185 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 15:55:24,185 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 15:55:24,185 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 15:55:24,185 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 15:55:24,185 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 15:55:24,185 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 15:55:24,186 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 15:55:24,186 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 15:55:24,186 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 15:55:24,186 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 15:55:24,186 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 15:55:24,186 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 15:55:24,187 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 15:55:24,187 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 15:55:24,187 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 15:55:24,187 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-01 15:55:24,187 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 15:55:24,188 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 15:55:24,188 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-01 15:55:24,188 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 15:55:24,189 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 15:55:24,189 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-01 15:55:24,189 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 15:55:24,190 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 15:55:24,190 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 15:55:24,190 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 15:55:24,190 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 15:55:24,190 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 15:55:24,191 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 15:55:24,191 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-01 15:55:24,191 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 15:55:24,191 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 15:55:24,191 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 15:55:24,192 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 15:55:24,192 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 15:55:24,192 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 15:55:24,193 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 15:55:24,193 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-01 15:55:24,193 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 15:55:24,193 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 15:55:24,193 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 15:55:24,193 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 15:55:24,194 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 15:55:24,194 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 15:55:24,194 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 15:55:24,195 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-01 15:55:24,195 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 15:55:24,195 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 15:55:24,195 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 15:55:24,195 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 15:55:24,195 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 15:55:24,196 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 15:55:24,196 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 15:55:24,196 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 15:55:24,197 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 15:55:24,197 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 15:55:24,197 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 15:55:24,197 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 15:55:24,197 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 15:55:24,197 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 15:55:24,199 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 15:55:24,199 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-01 15:55:24,199 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 15:55:24,199 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 15:55:24,199 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 15:55:24,199 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 15:55:24,200 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 15:55:24,200 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 15:55:24,200 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 15:55:24,201 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 15:55:24,201 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 15:55:24,201 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 15:55:24,201 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 15:55:24,201 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 15:55:24,201 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 15:55:24,201 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 15:55:24,202 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 15:55:24,202 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-01 15:55:24,202 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 15:55:24,202 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 15:55:24,203 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 15:55:24,203 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 15:55:24,203 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 15:55:24,203 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 15:55:24,204 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 15:55:24,204 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 15:55:24,204 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 15:55:24,204 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-01 15:55:24,204 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 15:55:24,204 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 15:55:24,205 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-01 15:55:24,205 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 15:55:24,206 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 15:55:24,206 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 15:55:24,206 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 15:55:24,206 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 15:55:24,206 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 15:55:24,206 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 15:55:24,206 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 15:55:24,207 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 15:55:24,207 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 15:55:24,207 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 15:55:24,207 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-01 15:55:24,207 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 15:55:24,207 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 15:55:24,207 INFO L206 nArgumentSynthesizer]: 4 loop disjuncts [2018-12-01 15:55:24,208 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 15:55:24,212 INFO L402 nArgumentSynthesizer]: We have 48 Motzkin's Theorem applications. [2018-12-01 15:55:24,213 INFO L403 nArgumentSynthesizer]: A total of 8 supporting invariants were added. [2018-12-01 15:55:24,230 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 15:55:24,231 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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-01 15:55:24,231 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 15:55:24,231 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 15:55:24,231 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 15:55:24,231 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 15:55:24,232 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 15:55:24,232 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 15:55:24,237 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-01 15:55:24,240 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-12-01 15:55:24,240 INFO L444 ModelExtractionUtils]: 12 out of 16 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-01 15:55:24,240 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-01 15:55:24,241 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-01 15:55:24,241 INFO L518 LassoAnalysis]: Proved termination. [2018-12-01 15:55:24,241 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_f_~i~1) = -2*ULTIMATE.start_f_~i~1 + 3 Supporting invariants [] [2018-12-01 15:55:24,264 INFO L297 tatePredicateManager]: 9 out of 9 supporting invariants were superfluous and have been removed [2018-12-01 15:55:24,276 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 15:55:24,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 15:55:24,303 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 15:55:24,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 15:55:24,307 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 15:55:24,312 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-01 15:55:24,312 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-12-01 15:55:24,312 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 29 states and 35 transitions. cyclomatic complexity: 10 Second operand 3 states. [2018-12-01 15:55:24,324 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 29 states and 35 transitions. cyclomatic complexity: 10. Second operand 3 states. Result 68 states and 88 transitions. Complement of second has 6 states. [2018-12-01 15:55:24,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-12-01 15:55:24,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-01 15:55:24,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 47 transitions. [2018-12-01 15:55:24,325 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 47 transitions. Stem has 14 letters. Loop has 3 letters. [2018-12-01 15:55:24,326 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 15:55:24,326 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 47 transitions. Stem has 17 letters. Loop has 3 letters. [2018-12-01 15:55:24,326 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 15:55:24,326 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 47 transitions. Stem has 14 letters. Loop has 6 letters. [2018-12-01 15:55:24,326 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 15:55:24,327 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 68 states and 88 transitions. [2018-12-01 15:55:24,327 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 20 [2018-12-01 15:55:24,328 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 68 states to 43 states and 54 transitions. [2018-12-01 15:55:24,328 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 34 [2018-12-01 15:55:24,328 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2018-12-01 15:55:24,328 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43 states and 54 transitions. [2018-12-01 15:55:24,328 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-01 15:55:24,328 INFO L705 BuchiCegarLoop]: Abstraction has 43 states and 54 transitions. [2018-12-01 15:55:24,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states and 54 transitions. [2018-12-01 15:55:24,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 31. [2018-12-01 15:55:24,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-12-01 15:55:24,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 39 transitions. [2018-12-01 15:55:24,330 INFO L728 BuchiCegarLoop]: Abstraction has 31 states and 39 transitions. [2018-12-01 15:55:24,330 INFO L608 BuchiCegarLoop]: Abstraction has 31 states and 39 transitions. [2018-12-01 15:55:24,330 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-12-01 15:55:24,330 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 39 transitions. [2018-12-01 15:55:24,331 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-12-01 15:55:24,331 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 15:55:24,331 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 15:55:24,331 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 15:55:24,331 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-01 15:55:24,332 INFO L794 eck$LassoCheckResult]: Stem: 715#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#pp~0.base, ~#pp~0.offset := #Ultimate.alloc(8);call write~init~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset, 4);call write~init~$Pointer$(0, 0, ~#pp~0.base, 4 + ~#pp~0.offset, 4);call ~#pstate~0.base, ~#pstate~0.offset := #Ultimate.alloc(8);call write~init~int(0, ~#pstate~0.base, ~#pstate~0.offset, 4);call write~init~int(0, ~#pstate~0.base, 4 + ~#pstate~0.offset, 4);~counter~0 := 1; 689#L-1 havoc main_#res;havoc main_#t~ret7.base, main_#t~ret7.offset, main_#t~ret8.base, main_#t~ret8.offset, main_~a~0.base, main_~a~0.offset, main_~b~0.base, main_~b~0.offset;havoc main_~a~0.base, main_~a~0.offset;havoc main_~b~0.base, main_~b~0.offset;havoc init_#t~post0, init_~i~0;havoc init_~i~0;init_~i~0 := 0; 690#L17-3 assume !!(init_~i~0 < 2);call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0, 4);call write~int(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0, 4); 702#L17-2 init_#t~post0 := init_~i~0;init_~i~0 := 1 + init_#t~post0;havoc init_#t~post0; 703#L17-3 assume !!(init_~i~0 < 2);call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0, 4);call write~int(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0, 4); 716#L17-2 init_#t~post0 := init_~i~0;init_~i~0 := 1 + init_#t~post0;havoc init_#t~post0; 717#L17-3 assume !(init_~i~0 < 2); 704#L15 malloc_#in~size := 4;havoc malloc_#res.base, malloc_#res.offset;havoc malloc_#t~post6, malloc_~size;malloc_~size := malloc_#in~size;malloc_#t~post6 := ~counter~0;~counter~0 := 1 + malloc_#t~post6;malloc_#res.base, malloc_#res.offset := 0, malloc_#t~post6;havoc malloc_#t~post6; 687#L47 main_#t~ret7.base, main_#t~ret7.offset := malloc_#res.base, malloc_#res.offset;main_~a~0.base, main_~a~0.offset := main_#t~ret7.base, main_#t~ret7.offset;havoc main_#t~ret7.base, main_#t~ret7.offset;malloc_#in~size := 4;havoc malloc_#res.base, malloc_#res.offset;havoc malloc_#t~post6, malloc_~size;malloc_~size := malloc_#in~size;malloc_#t~post6 := ~counter~0;~counter~0 := 1 + malloc_#t~post6;malloc_#res.base, malloc_#res.offset := 0, malloc_#t~post6;havoc malloc_#t~post6; 688#L47-1 main_#t~ret8.base, main_#t~ret8.offset := malloc_#res.base, malloc_#res.offset;main_~b~0.base, main_~b~0.offset := main_#t~ret8.base, main_#t~ret8.offset;havoc main_#t~ret8.base, main_#t~ret8.offset; 701#L57 assume !((main_~a~0.base == 0 && main_~a~0.offset == 0) || (main_~b~0.base == 0 && main_~b~0.offset == 0));f_#in~pointer.base, f_#in~pointer.offset := main_~a~0.base, main_~a~0.offset;havoc f_#t~mem2.base, f_#t~mem2.offset, f_#t~post1, f_~pointer.base, f_~pointer.offset, f_~i~1;f_~pointer.base, f_~pointer.offset := f_#in~pointer.base, f_#in~pointer.offset;havoc f_~i~1;f_~i~1 := 0; 693#L25-3 assume !!(f_~i~1 < 2);call f_#t~mem2.base, f_#t~mem2.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1, 4); 694#L26 assume f_#t~mem2.base == 0 && f_#t~mem2.offset == 0;havoc f_#t~mem2.base, f_#t~mem2.offset;call write~$Pointer$(f_~pointer.base, f_~pointer.offset, ~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1, 4);call write~int(1, ~#pstate~0.base, ~#pstate~0.offset + 4 * f_~i~1, 4); 697#L23 f_#in~pointer.base, f_#in~pointer.offset := main_~b~0.base, main_~b~0.offset;havoc f_#t~mem2.base, f_#t~mem2.offset, f_#t~post1, f_~pointer.base, f_~pointer.offset, f_~i~1;f_~pointer.base, f_~pointer.offset := f_#in~pointer.base, f_#in~pointer.offset;havoc f_~i~1;f_~i~1 := 0; 698#L25-7 assume !(f_~i~1 < 2); 691#L23-1 g_#in~pointer.base, g_#in~pointer.offset := main_~a~0.base, main_~a~0.offset;havoc g_#t~mem4.base, g_#t~mem4.offset, g_#t~mem5, g_#t~post3, g_~pointer.base, g_~pointer.offset, g_~i~2;g_~pointer.base, g_~pointer.offset := g_#in~pointer.base, g_#in~pointer.offset;havoc g_~i~2;g_~i~2 := 0; 692#L36-3 [2018-12-01 15:55:24,332 INFO L796 eck$LassoCheckResult]: Loop: 692#L36-3 assume !!(g_~i~2 < 2);call g_#t~mem4.base, g_#t~mem4.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * g_~i~2, 4); 696#L37 assume !(g_#t~mem4.base == g_~pointer.base && g_#t~mem4.offset == g_~pointer.offset);havoc g_#t~mem4.base, g_#t~mem4.offset; 700#L36-2 g_#t~post3 := g_~i~2;g_~i~2 := 1 + g_#t~post3;havoc g_#t~post3; 692#L36-3 [2018-12-01 15:55:24,332 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 15:55:24,332 INFO L82 PathProgramCache]: Analyzing trace with hash -809029298, now seen corresponding path program 1 times [2018-12-01 15:55:24,332 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 15:55:24,332 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 15:55:24,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:55:24,333 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 15:55:24,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:55:24,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 15:55:24,345 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-01 15:55:24,345 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 15:55:24,345 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 15:55:24,345 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-01 15:55:24,345 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 15:55:24,346 INFO L82 PathProgramCache]: Analyzing trace with hash 100776, now seen corresponding path program 1 times [2018-12-01 15:55:24,346 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 15:55:24,346 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 15:55:24,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:55:24,346 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 15:55:24,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:55:24,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 15:55:24,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 15:55:24,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 15:55:24,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 15:55:24,375 INFO L87 Difference]: Start difference. First operand 31 states and 39 transitions. cyclomatic complexity: 12 Second operand 3 states. [2018-12-01 15:55:24,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 15:55:24,388 INFO L93 Difference]: Finished difference Result 46 states and 56 transitions. [2018-12-01 15:55:24,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 15:55:24,389 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 56 transitions. [2018-12-01 15:55:24,389 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 20 [2018-12-01 15:55:24,389 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 46 states and 56 transitions. [2018-12-01 15:55:24,389 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 37 [2018-12-01 15:55:24,390 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 37 [2018-12-01 15:55:24,390 INFO L73 IsDeterministic]: Start isDeterministic. Operand 46 states and 56 transitions. [2018-12-01 15:55:24,390 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-01 15:55:24,390 INFO L705 BuchiCegarLoop]: Abstraction has 46 states and 56 transitions. [2018-12-01 15:55:24,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states and 56 transitions. [2018-12-01 15:55:24,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 31. [2018-12-01 15:55:24,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-12-01 15:55:24,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 38 transitions. [2018-12-01 15:55:24,391 INFO L728 BuchiCegarLoop]: Abstraction has 31 states and 38 transitions. [2018-12-01 15:55:24,391 INFO L608 BuchiCegarLoop]: Abstraction has 31 states and 38 transitions. [2018-12-01 15:55:24,391 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-12-01 15:55:24,391 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 38 transitions. [2018-12-01 15:55:24,391 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-12-01 15:55:24,391 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 15:55:24,391 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 15:55:24,392 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 15:55:24,392 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-01 15:55:24,392 INFO L794 eck$LassoCheckResult]: Stem: 798#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#pp~0.base, ~#pp~0.offset := #Ultimate.alloc(8);call write~init~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset, 4);call write~init~$Pointer$(0, 0, ~#pp~0.base, 4 + ~#pp~0.offset, 4);call ~#pstate~0.base, ~#pstate~0.offset := #Ultimate.alloc(8);call write~init~int(0, ~#pstate~0.base, ~#pstate~0.offset, 4);call write~init~int(0, ~#pstate~0.base, 4 + ~#pstate~0.offset, 4);~counter~0 := 1; 772#L-1 havoc main_#res;havoc main_#t~ret7.base, main_#t~ret7.offset, main_#t~ret8.base, main_#t~ret8.offset, main_~a~0.base, main_~a~0.offset, main_~b~0.base, main_~b~0.offset;havoc main_~a~0.base, main_~a~0.offset;havoc main_~b~0.base, main_~b~0.offset;havoc init_#t~post0, init_~i~0;havoc init_~i~0;init_~i~0 := 0; 773#L17-3 assume !!(init_~i~0 < 2);call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0, 4);call write~int(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0, 4); 785#L17-2 init_#t~post0 := init_~i~0;init_~i~0 := 1 + init_#t~post0;havoc init_#t~post0; 786#L17-3 assume !!(init_~i~0 < 2);call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0, 4);call write~int(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0, 4); 799#L17-2 init_#t~post0 := init_~i~0;init_~i~0 := 1 + init_#t~post0;havoc init_#t~post0; 800#L17-3 assume !(init_~i~0 < 2); 787#L15 malloc_#in~size := 4;havoc malloc_#res.base, malloc_#res.offset;havoc malloc_#t~post6, malloc_~size;malloc_~size := malloc_#in~size;malloc_#t~post6 := ~counter~0;~counter~0 := 1 + malloc_#t~post6;malloc_#res.base, malloc_#res.offset := 0, malloc_#t~post6;havoc malloc_#t~post6; 770#L47 main_#t~ret7.base, main_#t~ret7.offset := malloc_#res.base, malloc_#res.offset;main_~a~0.base, main_~a~0.offset := main_#t~ret7.base, main_#t~ret7.offset;havoc main_#t~ret7.base, main_#t~ret7.offset;malloc_#in~size := 4;havoc malloc_#res.base, malloc_#res.offset;havoc malloc_#t~post6, malloc_~size;malloc_~size := malloc_#in~size;malloc_#t~post6 := ~counter~0;~counter~0 := 1 + malloc_#t~post6;malloc_#res.base, malloc_#res.offset := 0, malloc_#t~post6;havoc malloc_#t~post6; 771#L47-1 main_#t~ret8.base, main_#t~ret8.offset := malloc_#res.base, malloc_#res.offset;main_~b~0.base, main_~b~0.offset := main_#t~ret8.base, main_#t~ret8.offset;havoc main_#t~ret8.base, main_#t~ret8.offset; 784#L57 assume !((main_~a~0.base == 0 && main_~a~0.offset == 0) || (main_~b~0.base == 0 && main_~b~0.offset == 0));f_#in~pointer.base, f_#in~pointer.offset := main_~a~0.base, main_~a~0.offset;havoc f_#t~mem2.base, f_#t~mem2.offset, f_#t~post1, f_~pointer.base, f_~pointer.offset, f_~i~1;f_~pointer.base, f_~pointer.offset := f_#in~pointer.base, f_#in~pointer.offset;havoc f_~i~1;f_~i~1 := 0; 774#L25-3 assume !!(f_~i~1 < 2);call f_#t~mem2.base, f_#t~mem2.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1, 4); 775#L26 assume f_#t~mem2.base == 0 && f_#t~mem2.offset == 0;havoc f_#t~mem2.base, f_#t~mem2.offset;call write~$Pointer$(f_~pointer.base, f_~pointer.offset, ~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1, 4);call write~int(1, ~#pstate~0.base, ~#pstate~0.offset + 4 * f_~i~1, 4); 780#L23 f_#in~pointer.base, f_#in~pointer.offset := main_~b~0.base, main_~b~0.offset;havoc f_#t~mem2.base, f_#t~mem2.offset, f_#t~post1, f_~pointer.base, f_~pointer.offset, f_~i~1;f_~pointer.base, f_~pointer.offset := f_#in~pointer.base, f_#in~pointer.offset;havoc f_~i~1;f_~i~1 := 0; 781#L25-7 assume !!(f_~i~1 < 2);call f_#t~mem2.base, f_#t~mem2.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1, 4); 793#L26-1 assume f_#t~mem2.base == 0 && f_#t~mem2.offset == 0;havoc f_#t~mem2.base, f_#t~mem2.offset;call write~$Pointer$(f_~pointer.base, f_~pointer.offset, ~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1, 4);call write~int(1, ~#pstate~0.base, ~#pstate~0.offset + 4 * f_~i~1, 4); 776#L23-1 g_#in~pointer.base, g_#in~pointer.offset := main_~a~0.base, main_~a~0.offset;havoc g_#t~mem4.base, g_#t~mem4.offset, g_#t~mem5, g_#t~post3, g_~pointer.base, g_~pointer.offset, g_~i~2;g_~pointer.base, g_~pointer.offset := g_#in~pointer.base, g_#in~pointer.offset;havoc g_~i~2;g_~i~2 := 0; 777#L36-3 [2018-12-01 15:55:24,392 INFO L796 eck$LassoCheckResult]: Loop: 777#L36-3 assume !!(g_~i~2 < 2);call g_#t~mem4.base, g_#t~mem4.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * g_~i~2, 4); 779#L37 assume !(g_#t~mem4.base == g_~pointer.base && g_#t~mem4.offset == g_~pointer.offset);havoc g_#t~mem4.base, g_#t~mem4.offset; 783#L36-2 g_#t~post3 := g_~i~2;g_~i~2 := 1 + g_#t~post3;havoc g_#t~post3; 777#L36-3 [2018-12-01 15:55:24,392 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 15:55:24,392 INFO L82 PathProgramCache]: Analyzing trace with hash 689897275, now seen corresponding path program 1 times [2018-12-01 15:55:24,392 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 15:55:24,392 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 15:55:24,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:55:24,393 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 15:55:24,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:55:24,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 15:55:24,533 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-01 15:55:24,534 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 15:55:24,534 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-01 15:55:24,534 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-01 15:55:24,534 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 15:55:24,534 INFO L82 PathProgramCache]: Analyzing trace with hash 100776, now seen corresponding path program 2 times [2018-12-01 15:55:24,534 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 15:55:24,534 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 15:55:24,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:55:24,535 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 15:55:24,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:55:24,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 15:55:24,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 15:55:24,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-01 15:55:24,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-12-01 15:55:24,563 INFO L87 Difference]: Start difference. First operand 31 states and 38 transitions. cyclomatic complexity: 11 Second operand 9 states. [2018-12-01 15:55:24,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 15:55:24,722 INFO L93 Difference]: Finished difference Result 46 states and 55 transitions. [2018-12-01 15:55:24,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-01 15:55:24,723 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 55 transitions. [2018-12-01 15:55:24,723 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 20 [2018-12-01 15:55:24,723 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 45 states and 54 transitions. [2018-12-01 15:55:24,723 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 36 [2018-12-01 15:55:24,723 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2018-12-01 15:55:24,724 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 54 transitions. [2018-12-01 15:55:24,724 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-01 15:55:24,724 INFO L705 BuchiCegarLoop]: Abstraction has 45 states and 54 transitions. [2018-12-01 15:55:24,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states and 54 transitions. [2018-12-01 15:55:24,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 31. [2018-12-01 15:55:24,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-12-01 15:55:24,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 37 transitions. [2018-12-01 15:55:24,725 INFO L728 BuchiCegarLoop]: Abstraction has 31 states and 37 transitions. [2018-12-01 15:55:24,725 INFO L608 BuchiCegarLoop]: Abstraction has 31 states and 37 transitions. [2018-12-01 15:55:24,725 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-12-01 15:55:24,725 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 37 transitions. [2018-12-01 15:55:24,725 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-12-01 15:55:24,725 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 15:55:24,725 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 15:55:24,725 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 15:55:24,725 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-01 15:55:24,726 INFO L794 eck$LassoCheckResult]: Stem: 897#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#pp~0.base, ~#pp~0.offset := #Ultimate.alloc(8);call write~init~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset, 4);call write~init~$Pointer$(0, 0, ~#pp~0.base, 4 + ~#pp~0.offset, 4);call ~#pstate~0.base, ~#pstate~0.offset := #Ultimate.alloc(8);call write~init~int(0, ~#pstate~0.base, ~#pstate~0.offset, 4);call write~init~int(0, ~#pstate~0.base, 4 + ~#pstate~0.offset, 4);~counter~0 := 1; 871#L-1 havoc main_#res;havoc main_#t~ret7.base, main_#t~ret7.offset, main_#t~ret8.base, main_#t~ret8.offset, main_~a~0.base, main_~a~0.offset, main_~b~0.base, main_~b~0.offset;havoc main_~a~0.base, main_~a~0.offset;havoc main_~b~0.base, main_~b~0.offset;havoc init_#t~post0, init_~i~0;havoc init_~i~0;init_~i~0 := 0; 872#L17-3 assume !!(init_~i~0 < 2);call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0, 4);call write~int(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0, 4); 884#L17-2 init_#t~post0 := init_~i~0;init_~i~0 := 1 + init_#t~post0;havoc init_#t~post0; 885#L17-3 assume !!(init_~i~0 < 2);call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0, 4);call write~int(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0, 4); 898#L17-2 init_#t~post0 := init_~i~0;init_~i~0 := 1 + init_#t~post0;havoc init_#t~post0; 899#L17-3 assume !(init_~i~0 < 2); 886#L15 malloc_#in~size := 4;havoc malloc_#res.base, malloc_#res.offset;havoc malloc_#t~post6, malloc_~size;malloc_~size := malloc_#in~size;malloc_#t~post6 := ~counter~0;~counter~0 := 1 + malloc_#t~post6;malloc_#res.base, malloc_#res.offset := 0, malloc_#t~post6;havoc malloc_#t~post6; 869#L47 main_#t~ret7.base, main_#t~ret7.offset := malloc_#res.base, malloc_#res.offset;main_~a~0.base, main_~a~0.offset := main_#t~ret7.base, main_#t~ret7.offset;havoc main_#t~ret7.base, main_#t~ret7.offset;malloc_#in~size := 4;havoc malloc_#res.base, malloc_#res.offset;havoc malloc_#t~post6, malloc_~size;malloc_~size := malloc_#in~size;malloc_#t~post6 := ~counter~0;~counter~0 := 1 + malloc_#t~post6;malloc_#res.base, malloc_#res.offset := 0, malloc_#t~post6;havoc malloc_#t~post6; 870#L47-1 main_#t~ret8.base, main_#t~ret8.offset := malloc_#res.base, malloc_#res.offset;main_~b~0.base, main_~b~0.offset := main_#t~ret8.base, main_#t~ret8.offset;havoc main_#t~ret8.base, main_#t~ret8.offset; 883#L57 assume !((main_~a~0.base == 0 && main_~a~0.offset == 0) || (main_~b~0.base == 0 && main_~b~0.offset == 0));f_#in~pointer.base, f_#in~pointer.offset := main_~a~0.base, main_~a~0.offset;havoc f_#t~mem2.base, f_#t~mem2.offset, f_#t~post1, f_~pointer.base, f_~pointer.offset, f_~i~1;f_~pointer.base, f_~pointer.offset := f_#in~pointer.base, f_#in~pointer.offset;havoc f_~i~1;f_~i~1 := 0; 875#L25-3 assume !!(f_~i~1 < 2);call f_#t~mem2.base, f_#t~mem2.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1, 4); 876#L26 assume f_#t~mem2.base == 0 && f_#t~mem2.offset == 0;havoc f_#t~mem2.base, f_#t~mem2.offset;call write~$Pointer$(f_~pointer.base, f_~pointer.offset, ~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1, 4);call write~int(1, ~#pstate~0.base, ~#pstate~0.offset + 4 * f_~i~1, 4); 879#L23 f_#in~pointer.base, f_#in~pointer.offset := main_~b~0.base, main_~b~0.offset;havoc f_#t~mem2.base, f_#t~mem2.offset, f_#t~post1, f_~pointer.base, f_~pointer.offset, f_~i~1;f_~pointer.base, f_~pointer.offset := f_#in~pointer.base, f_#in~pointer.offset;havoc f_~i~1;f_~i~1 := 0; 880#L25-7 assume !!(f_~i~1 < 2);call f_#t~mem2.base, f_#t~mem2.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1, 4); 891#L26-1 assume !(f_#t~mem2.base == 0 && f_#t~mem2.offset == 0);havoc f_#t~mem2.base, f_#t~mem2.offset; 895#L25-6 f_#t~post1 := f_~i~1;f_~i~1 := 1 + f_#t~post1;havoc f_#t~post1; 892#L25-7 assume !(f_~i~1 < 2); 873#L23-1 g_#in~pointer.base, g_#in~pointer.offset := main_~a~0.base, main_~a~0.offset;havoc g_#t~mem4.base, g_#t~mem4.offset, g_#t~mem5, g_#t~post3, g_~pointer.base, g_~pointer.offset, g_~i~2;g_~pointer.base, g_~pointer.offset := g_#in~pointer.base, g_#in~pointer.offset;havoc g_~i~2;g_~i~2 := 0; 874#L36-3 [2018-12-01 15:55:24,726 INFO L796 eck$LassoCheckResult]: Loop: 874#L36-3 assume !!(g_~i~2 < 2);call g_#t~mem4.base, g_#t~mem4.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * g_~i~2, 4); 878#L37 assume !(g_#t~mem4.base == g_~pointer.base && g_#t~mem4.offset == g_~pointer.offset);havoc g_#t~mem4.base, g_#t~mem4.offset; 882#L36-2 g_#t~post3 := g_~i~2;g_~i~2 := 1 + g_#t~post3;havoc g_#t~post3; 874#L36-3 [2018-12-01 15:55:24,726 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 15:55:24,726 INFO L82 PathProgramCache]: Analyzing trace with hash 1566375042, now seen corresponding path program 1 times [2018-12-01 15:55:24,726 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 15:55:24,726 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 15:55:24,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:55:24,726 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 15:55:24,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:55:24,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 15:55:24,739 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-01 15:55:24,739 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-01 15:55:24,739 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_86819597-491e-4c2e-92ce-073d1270dbbd/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-01 15:55:24,748 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 15:55:24,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 15:55:24,766 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 15:55:24,770 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-01 15:55:24,786 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-01 15:55:24,786 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-12-01 15:55:24,786 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-01 15:55:24,786 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 15:55:24,787 INFO L82 PathProgramCache]: Analyzing trace with hash 100776, now seen corresponding path program 3 times [2018-12-01 15:55:24,787 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 15:55:24,787 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 15:55:24,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:55:24,787 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 15:55:24,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:55:24,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 15:55:24,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 15:55:24,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-01 15:55:24,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-12-01 15:55:24,823 INFO L87 Difference]: Start difference. First operand 31 states and 37 transitions. cyclomatic complexity: 10 Second operand 5 states. [2018-12-01 15:55:24,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 15:55:24,839 INFO L93 Difference]: Finished difference Result 46 states and 56 transitions. [2018-12-01 15:55:24,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-01 15:55:24,839 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 56 transitions. [2018-12-01 15:55:24,839 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 20 [2018-12-01 15:55:24,840 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 46 states and 56 transitions. [2018-12-01 15:55:24,840 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 36 [2018-12-01 15:55:24,840 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2018-12-01 15:55:24,840 INFO L73 IsDeterministic]: Start isDeterministic. Operand 46 states and 56 transitions. [2018-12-01 15:55:24,840 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-01 15:55:24,840 INFO L705 BuchiCegarLoop]: Abstraction has 46 states and 56 transitions. [2018-12-01 15:55:24,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states and 56 transitions. [2018-12-01 15:55:24,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 34. [2018-12-01 15:55:24,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-12-01 15:55:24,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 41 transitions. [2018-12-01 15:55:24,841 INFO L728 BuchiCegarLoop]: Abstraction has 34 states and 41 transitions. [2018-12-01 15:55:24,841 INFO L608 BuchiCegarLoop]: Abstraction has 34 states and 41 transitions. [2018-12-01 15:55:24,841 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-12-01 15:55:24,842 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 41 transitions. [2018-12-01 15:55:24,842 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-12-01 15:55:24,842 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 15:55:24,842 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 15:55:24,842 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 15:55:24,842 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-01 15:55:24,842 INFO L794 eck$LassoCheckResult]: Stem: 1037#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#pp~0.base, ~#pp~0.offset := #Ultimate.alloc(8);call write~init~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset, 4);call write~init~$Pointer$(0, 0, ~#pp~0.base, 4 + ~#pp~0.offset, 4);call ~#pstate~0.base, ~#pstate~0.offset := #Ultimate.alloc(8);call write~init~int(0, ~#pstate~0.base, ~#pstate~0.offset, 4);call write~init~int(0, ~#pstate~0.base, 4 + ~#pstate~0.offset, 4);~counter~0 := 1; 1010#L-1 havoc main_#res;havoc main_#t~ret7.base, main_#t~ret7.offset, main_#t~ret8.base, main_#t~ret8.offset, main_~a~0.base, main_~a~0.offset, main_~b~0.base, main_~b~0.offset;havoc main_~a~0.base, main_~a~0.offset;havoc main_~b~0.base, main_~b~0.offset;havoc init_#t~post0, init_~i~0;havoc init_~i~0;init_~i~0 := 0; 1011#L17-3 assume !!(init_~i~0 < 2);call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0, 4);call write~int(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0, 4); 1023#L17-2 init_#t~post0 := init_~i~0;init_~i~0 := 1 + init_#t~post0;havoc init_#t~post0; 1024#L17-3 assume !!(init_~i~0 < 2);call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0, 4);call write~int(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0, 4); 1038#L17-2 init_#t~post0 := init_~i~0;init_~i~0 := 1 + init_#t~post0;havoc init_#t~post0; 1040#L17-3 assume !(init_~i~0 < 2); 1025#L15 malloc_#in~size := 4;havoc malloc_#res.base, malloc_#res.offset;havoc malloc_#t~post6, malloc_~size;malloc_~size := malloc_#in~size;malloc_#t~post6 := ~counter~0;~counter~0 := 1 + malloc_#t~post6;malloc_#res.base, malloc_#res.offset := 0, malloc_#t~post6;havoc malloc_#t~post6; 1008#L47 main_#t~ret7.base, main_#t~ret7.offset := malloc_#res.base, malloc_#res.offset;main_~a~0.base, main_~a~0.offset := main_#t~ret7.base, main_#t~ret7.offset;havoc main_#t~ret7.base, main_#t~ret7.offset;malloc_#in~size := 4;havoc malloc_#res.base, malloc_#res.offset;havoc malloc_#t~post6, malloc_~size;malloc_~size := malloc_#in~size;malloc_#t~post6 := ~counter~0;~counter~0 := 1 + malloc_#t~post6;malloc_#res.base, malloc_#res.offset := 0, malloc_#t~post6;havoc malloc_#t~post6; 1009#L47-1 main_#t~ret8.base, main_#t~ret8.offset := malloc_#res.base, malloc_#res.offset;main_~b~0.base, main_~b~0.offset := main_#t~ret8.base, main_#t~ret8.offset;havoc main_#t~ret8.base, main_#t~ret8.offset; 1022#L57 assume !((main_~a~0.base == 0 && main_~a~0.offset == 0) || (main_~b~0.base == 0 && main_~b~0.offset == 0));f_#in~pointer.base, f_#in~pointer.offset := main_~a~0.base, main_~a~0.offset;havoc f_#t~mem2.base, f_#t~mem2.offset, f_#t~post1, f_~pointer.base, f_~pointer.offset, f_~i~1;f_~pointer.base, f_~pointer.offset := f_#in~pointer.base, f_#in~pointer.offset;havoc f_~i~1;f_~i~1 := 0; 1012#L25-3 assume !!(f_~i~1 < 2);call f_#t~mem2.base, f_#t~mem2.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1, 4); 1013#L26 assume f_#t~mem2.base == 0 && f_#t~mem2.offset == 0;havoc f_#t~mem2.base, f_#t~mem2.offset;call write~$Pointer$(f_~pointer.base, f_~pointer.offset, ~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1, 4);call write~int(1, ~#pstate~0.base, ~#pstate~0.offset + 4 * f_~i~1, 4); 1018#L23 f_#in~pointer.base, f_#in~pointer.offset := main_~b~0.base, main_~b~0.offset;havoc f_#t~mem2.base, f_#t~mem2.offset, f_#t~post1, f_~pointer.base, f_~pointer.offset, f_~i~1;f_~pointer.base, f_~pointer.offset := f_#in~pointer.base, f_#in~pointer.offset;havoc f_~i~1;f_~i~1 := 0; 1019#L25-7 assume !!(f_~i~1 < 2);call f_#t~mem2.base, f_#t~mem2.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1, 4); 1030#L26-1 assume !(f_#t~mem2.base == 0 && f_#t~mem2.offset == 0);havoc f_#t~mem2.base, f_#t~mem2.offset; 1035#L25-6 f_#t~post1 := f_~i~1;f_~i~1 := 1 + f_#t~post1;havoc f_#t~post1; 1031#L25-7 assume !!(f_~i~1 < 2);call f_#t~mem2.base, f_#t~mem2.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1, 4); 1033#L26-1 assume f_#t~mem2.base == 0 && f_#t~mem2.offset == 0;havoc f_#t~mem2.base, f_#t~mem2.offset;call write~$Pointer$(f_~pointer.base, f_~pointer.offset, ~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1, 4);call write~int(1, ~#pstate~0.base, ~#pstate~0.offset + 4 * f_~i~1, 4); 1014#L23-1 g_#in~pointer.base, g_#in~pointer.offset := main_~a~0.base, main_~a~0.offset;havoc g_#t~mem4.base, g_#t~mem4.offset, g_#t~mem5, g_#t~post3, g_~pointer.base, g_~pointer.offset, g_~i~2;g_~pointer.base, g_~pointer.offset := g_#in~pointer.base, g_#in~pointer.offset;havoc g_~i~2;g_~i~2 := 0; 1015#L36-3 [2018-12-01 15:55:24,842 INFO L796 eck$LassoCheckResult]: Loop: 1015#L36-3 assume !!(g_~i~2 < 2);call g_#t~mem4.base, g_#t~mem4.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * g_~i~2, 4); 1017#L37 assume !(g_#t~mem4.base == g_~pointer.base && g_#t~mem4.offset == g_~pointer.offset);havoc g_#t~mem4.base, g_#t~mem4.offset; 1021#L36-2 g_#t~post3 := g_~i~2;g_~i~2 := 1 + g_#t~post3;havoc g_#t~post3; 1015#L36-3 [2018-12-01 15:55:24,842 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 15:55:24,843 INFO L82 PathProgramCache]: Analyzing trace with hash 1312987783, now seen corresponding path program 1 times [2018-12-01 15:55:24,843 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 15:55:24,843 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 15:55:24,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:55:24,843 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 15:55:24,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:55:24,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 15:55:24,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 15:55:24,866 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 15:55:24,866 INFO L82 PathProgramCache]: Analyzing trace with hash 100776, now seen corresponding path program 4 times [2018-12-01 15:55:24,866 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 15:55:24,866 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 15:55:24,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:55:24,867 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 15:55:24,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:55:24,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 15:55:24,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 15:55:24,869 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 15:55:24,869 INFO L82 PathProgramCache]: Analyzing trace with hash 951949666, now seen corresponding path program 1 times [2018-12-01 15:55:24,869 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 15:55:24,869 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 15:55:24,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:55:24,870 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 15:55:24,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:55:24,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 15:55:25,116 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-01 15:55:25,116 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-01 15:55:25,117 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_86819597-491e-4c2e-92ce-073d1270dbbd/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-01 15:55:25,123 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 15:55:25,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 15:55:25,140 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 15:55:25,142 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2018-12-01 15:55:25,151 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2018-12-01 15:55:25,151 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 15:55:25,152 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 15:55:25,155 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 15:55:25,155 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:18, output treesize:11 [2018-12-01 15:55:25,170 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 24 [2018-12-01 15:55:25,173 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-01 15:55:25,173 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 15:55:25,184 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 23 treesize of output 24 [2018-12-01 15:55:25,187 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 12 treesize of output 1 [2018-12-01 15:55:25,187 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-01 15:55:25,191 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 15:55:25,194 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 15:55:25,208 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 24 [2018-12-01 15:55:25,211 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-01 15:55:25,211 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-01 15:55:25,219 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 23 treesize of output 24 [2018-12-01 15:55:25,221 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 12 treesize of output 1 [2018-12-01 15:55:25,221 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-01 15:55:25,225 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 15:55:25,226 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 15:55:25,234 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 15:55:25,234 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 2 variables, input treesize:76, output treesize:28 [2018-12-01 15:55:25,284 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 41 [2018-12-01 15:55:25,288 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:55:25,290 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 18 treesize of output 27 [2018-12-01 15:55:25,290 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 15:55:25,311 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 42 treesize of output 43 [2018-12-01 15:55:25,314 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 20 treesize of output 1 [2018-12-01 15:55:25,314 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-01 15:55:25,320 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 15:55:25,325 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 15:55:25,344 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 41 [2018-12-01 15:55:25,347 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:55:25,348 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 18 treesize of output 27 [2018-12-01 15:55:25,348 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-01 15:55:25,357 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 42 treesize of output 43 [2018-12-01 15:55:25,359 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 20 treesize of output 1 [2018-12-01 15:55:25,360 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-01 15:55:25,363 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 15:55:25,366 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 15:55:25,375 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 15:55:25,375 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 7 variables, input treesize:125, output treesize:24 [2018-12-01 15:55:25,390 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-01 15:55:25,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-01 15:55:25,392 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 15:55:25,393 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 15:55:25,400 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-01 15:55:25,401 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-01 15:55:25,401 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-01 15:55:25,402 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 15:55:25,406 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 15:55:25,406 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:35, output treesize:13 [2018-12-01 15:55:25,417 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-01 15:55:25,432 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-01 15:55:25,432 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 14 [2018-12-01 15:55:25,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-01 15:55:25,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2018-12-01 15:55:25,470 INFO L87 Difference]: Start difference. First operand 34 states and 41 transitions. cyclomatic complexity: 11 Second operand 15 states. [2018-12-01 15:55:25,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 15:55:25,663 INFO L93 Difference]: Finished difference Result 39 states and 46 transitions. [2018-12-01 15:55:25,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-01 15:55:25,664 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 46 transitions. [2018-12-01 15:55:25,664 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-12-01 15:55:25,664 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 39 states and 46 transitions. [2018-12-01 15:55:25,664 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2018-12-01 15:55:25,665 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2018-12-01 15:55:25,665 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 46 transitions. [2018-12-01 15:55:25,665 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-01 15:55:25,665 INFO L705 BuchiCegarLoop]: Abstraction has 39 states and 46 transitions. [2018-12-01 15:55:25,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 46 transitions. [2018-12-01 15:55:25,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 36. [2018-12-01 15:55:25,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-12-01 15:55:25,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 43 transitions. [2018-12-01 15:55:25,666 INFO L728 BuchiCegarLoop]: Abstraction has 36 states and 43 transitions. [2018-12-01 15:55:25,666 INFO L608 BuchiCegarLoop]: Abstraction has 36 states and 43 transitions. [2018-12-01 15:55:25,666 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-12-01 15:55:25,666 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 43 transitions. [2018-12-01 15:55:25,666 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-12-01 15:55:25,666 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 15:55:25,666 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 15:55:25,667 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 15:55:25,667 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-12-01 15:55:25,667 INFO L794 eck$LassoCheckResult]: Stem: 1203#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#pp~0.base, ~#pp~0.offset := #Ultimate.alloc(8);call write~init~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset, 4);call write~init~$Pointer$(0, 0, ~#pp~0.base, 4 + ~#pp~0.offset, 4);call ~#pstate~0.base, ~#pstate~0.offset := #Ultimate.alloc(8);call write~init~int(0, ~#pstate~0.base, ~#pstate~0.offset, 4);call write~init~int(0, ~#pstate~0.base, 4 + ~#pstate~0.offset, 4);~counter~0 := 1; 1175#L-1 havoc main_#res;havoc main_#t~ret7.base, main_#t~ret7.offset, main_#t~ret8.base, main_#t~ret8.offset, main_~a~0.base, main_~a~0.offset, main_~b~0.base, main_~b~0.offset;havoc main_~a~0.base, main_~a~0.offset;havoc main_~b~0.base, main_~b~0.offset;havoc init_#t~post0, init_~i~0;havoc init_~i~0;init_~i~0 := 0; 1176#L17-3 assume !!(init_~i~0 < 2);call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0, 4);call write~int(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0, 4); 1189#L17-2 init_#t~post0 := init_~i~0;init_~i~0 := 1 + init_#t~post0;havoc init_#t~post0; 1190#L17-3 assume !!(init_~i~0 < 2);call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0, 4);call write~int(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0, 4); 1204#L17-2 init_#t~post0 := init_~i~0;init_~i~0 := 1 + init_#t~post0;havoc init_#t~post0; 1208#L17-3 assume !(init_~i~0 < 2); 1191#L15 malloc_#in~size := 4;havoc malloc_#res.base, malloc_#res.offset;havoc malloc_#t~post6, malloc_~size;malloc_~size := malloc_#in~size;malloc_#t~post6 := ~counter~0;~counter~0 := 1 + malloc_#t~post6;malloc_#res.base, malloc_#res.offset := 0, malloc_#t~post6;havoc malloc_#t~post6; 1173#L47 main_#t~ret7.base, main_#t~ret7.offset := malloc_#res.base, malloc_#res.offset;main_~a~0.base, main_~a~0.offset := main_#t~ret7.base, main_#t~ret7.offset;havoc main_#t~ret7.base, main_#t~ret7.offset;malloc_#in~size := 4;havoc malloc_#res.base, malloc_#res.offset;havoc malloc_#t~post6, malloc_~size;malloc_~size := malloc_#in~size;malloc_#t~post6 := ~counter~0;~counter~0 := 1 + malloc_#t~post6;malloc_#res.base, malloc_#res.offset := 0, malloc_#t~post6;havoc malloc_#t~post6; 1174#L47-1 main_#t~ret8.base, main_#t~ret8.offset := malloc_#res.base, malloc_#res.offset;main_~b~0.base, main_~b~0.offset := main_#t~ret8.base, main_#t~ret8.offset;havoc main_#t~ret8.base, main_#t~ret8.offset; 1188#L57 assume !((main_~a~0.base == 0 && main_~a~0.offset == 0) || (main_~b~0.base == 0 && main_~b~0.offset == 0));f_#in~pointer.base, f_#in~pointer.offset := main_~a~0.base, main_~a~0.offset;havoc f_#t~mem2.base, f_#t~mem2.offset, f_#t~post1, f_~pointer.base, f_~pointer.offset, f_~i~1;f_~pointer.base, f_~pointer.offset := f_#in~pointer.base, f_#in~pointer.offset;havoc f_~i~1;f_~i~1 := 0; 1177#L25-3 assume !!(f_~i~1 < 2);call f_#t~mem2.base, f_#t~mem2.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1, 4); 1178#L26 assume f_#t~mem2.base == 0 && f_#t~mem2.offset == 0;havoc f_#t~mem2.base, f_#t~mem2.offset;call write~$Pointer$(f_~pointer.base, f_~pointer.offset, ~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1, 4);call write~int(1, ~#pstate~0.base, ~#pstate~0.offset + 4 * f_~i~1, 4); 1182#L23 f_#in~pointer.base, f_#in~pointer.offset := main_~b~0.base, main_~b~0.offset;havoc f_#t~mem2.base, f_#t~mem2.offset, f_#t~post1, f_~pointer.base, f_~pointer.offset, f_~i~1;f_~pointer.base, f_~pointer.offset := f_#in~pointer.base, f_#in~pointer.offset;havoc f_~i~1;f_~i~1 := 0; 1183#L25-7 assume !!(f_~i~1 < 2);call f_#t~mem2.base, f_#t~mem2.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1, 4); 1196#L26-1 assume !(f_#t~mem2.base == 0 && f_#t~mem2.offset == 0);havoc f_#t~mem2.base, f_#t~mem2.offset; 1201#L25-6 f_#t~post1 := f_~i~1;f_~i~1 := 1 + f_#t~post1;havoc f_#t~post1; 1197#L25-7 assume !!(f_~i~1 < 2);call f_#t~mem2.base, f_#t~mem2.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1, 4); 1199#L26-1 assume f_#t~mem2.base == 0 && f_#t~mem2.offset == 0;havoc f_#t~mem2.base, f_#t~mem2.offset;call write~$Pointer$(f_~pointer.base, f_~pointer.offset, ~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1, 4);call write~int(1, ~#pstate~0.base, ~#pstate~0.offset + 4 * f_~i~1, 4); 1179#L23-1 g_#in~pointer.base, g_#in~pointer.offset := main_~a~0.base, main_~a~0.offset;havoc g_#t~mem4.base, g_#t~mem4.offset, g_#t~mem5, g_#t~post3, g_~pointer.base, g_~pointer.offset, g_~i~2;g_~pointer.base, g_~pointer.offset := g_#in~pointer.base, g_#in~pointer.offset;havoc g_~i~2;g_~i~2 := 0; 1180#L36-3 assume !!(g_~i~2 < 2);call g_#t~mem4.base, g_#t~mem4.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * g_~i~2, 4); 1181#L37 assume g_#t~mem4.base == g_~pointer.base && g_#t~mem4.offset == g_~pointer.offset;havoc g_#t~mem4.base, g_#t~mem4.offset;call g_#t~mem5 := read~int(~#pstate~0.base, ~#pstate~0.offset + 4 * g_~i~2, 4); 1192#L39 [2018-12-01 15:55:25,667 INFO L796 eck$LassoCheckResult]: Loop: 1192#L39 assume 1 == g_#t~mem5; 1195#L4 havoc g_#t~mem5;call write~int(2, ~#pstate~0.base, ~#pstate~0.offset + 4 * g_~i~2, 4); 1184#L36-2 g_#t~post3 := g_~i~2;g_~i~2 := 1 + g_#t~post3;havoc g_#t~post3; 1185#L36-3 assume !!(g_~i~2 < 2);call g_#t~mem4.base, g_#t~mem4.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * g_~i~2, 4); 1207#L37 assume g_#t~mem4.base == g_~pointer.base && g_#t~mem4.offset == g_~pointer.offset;havoc g_#t~mem4.base, g_#t~mem4.offset;call g_#t~mem5 := read~int(~#pstate~0.base, ~#pstate~0.offset + 4 * g_~i~2, 4); 1192#L39 [2018-12-01 15:55:25,667 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 15:55:25,667 INFO L82 PathProgramCache]: Analyzing trace with hash -939123286, now seen corresponding path program 1 times [2018-12-01 15:55:25,667 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 15:55:25,667 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 15:55:25,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:55:25,668 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 15:55:25,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:55:25,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 15:55:25,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 15:55:25,691 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 15:55:25,691 INFO L82 PathProgramCache]: Analyzing trace with hash 102329555, now seen corresponding path program 1 times [2018-12-01 15:55:25,692 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 15:55:25,692 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 15:55:25,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:55:25,692 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 15:55:25,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:55:25,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 15:55:25,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 15:55:25,696 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 15:55:25,696 INFO L82 PathProgramCache]: Analyzing trace with hash -289378102, now seen corresponding path program 1 times [2018-12-01 15:55:25,696 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 15:55:25,696 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 15:55:25,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:55:25,696 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 15:55:25,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:55:25,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 15:55:25,939 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-01 15:55:25,939 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-01 15:55:25,939 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_86819597-491e-4c2e-92ce-073d1270dbbd/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-01 15:55:25,945 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 15:55:25,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 15:55:25,965 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 15:55:25,968 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2018-12-01 15:55:25,975 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2018-12-01 15:55:25,975 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 15:55:25,976 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 15:55:25,980 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 15:55:25,980 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:18, output treesize:11 [2018-12-01 15:55:26,063 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 30 [2018-12-01 15:55:26,065 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 10 treesize of output 9 [2018-12-01 15:55:26,065 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 15:55:26,075 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 29 treesize of output 30 [2018-12-01 15:55:26,077 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 16 treesize of output 1 [2018-12-01 15:55:26,077 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-01 15:55:26,084 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 15:55:26,085 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 15:55:26,090 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 15:55:26,090 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:50, output treesize:20 [2018-12-01 15:55:26,132 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 33 treesize of output 34 [2018-12-01 15:55:26,134 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 20 treesize of output 1 [2018-12-01 15:55:26,134 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 15:55:26,136 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 15:55:26,140 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-01 15:55:26,140 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:46, output treesize:19 [2018-12-01 15:55:26,178 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-01 15:55:26,179 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-01 15:55:26,179 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 15:55:26,180 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 15:55:26,182 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 15:55:26,182 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:18, output treesize:7 [2018-12-01 15:55:26,199 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-01 15:55:26,213 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-01 15:55:26,213 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 24 [2018-12-01 15:55:26,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-12-01 15:55:26,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=589, Unknown=0, NotChecked=0, Total=650 [2018-12-01 15:55:26,311 INFO L87 Difference]: Start difference. First operand 36 states and 43 transitions. cyclomatic complexity: 11 Second operand 26 states. [2018-12-01 15:55:27,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 15:55:27,988 INFO L93 Difference]: Finished difference Result 72 states and 83 transitions. [2018-12-01 15:55:27,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-01 15:55:27,989 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 72 states and 83 transitions. [2018-12-01 15:55:27,990 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 26 [2018-12-01 15:55:27,992 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 72 states to 72 states and 83 transitions. [2018-12-01 15:55:27,992 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 60 [2018-12-01 15:55:27,992 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 60 [2018-12-01 15:55:27,992 INFO L73 IsDeterministic]: Start isDeterministic. Operand 72 states and 83 transitions. [2018-12-01 15:55:27,993 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-01 15:55:27,993 INFO L705 BuchiCegarLoop]: Abstraction has 72 states and 83 transitions. [2018-12-01 15:55:27,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states and 83 transitions. [2018-12-01 15:55:27,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 52. [2018-12-01 15:55:27,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-12-01 15:55:27,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 60 transitions. [2018-12-01 15:55:27,998 INFO L728 BuchiCegarLoop]: Abstraction has 52 states and 60 transitions. [2018-12-01 15:55:27,998 INFO L608 BuchiCegarLoop]: Abstraction has 52 states and 60 transitions. [2018-12-01 15:55:27,998 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2018-12-01 15:55:27,998 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 52 states and 60 transitions. [2018-12-01 15:55:27,999 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2018-12-01 15:55:27,999 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 15:55:28,000 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 15:55:28,000 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 15:55:28,001 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-12-01 15:55:28,001 INFO L794 eck$LassoCheckResult]: Stem: 1461#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#pp~0.base, ~#pp~0.offset := #Ultimate.alloc(8);call write~init~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset, 4);call write~init~$Pointer$(0, 0, ~#pp~0.base, 4 + ~#pp~0.offset, 4);call ~#pstate~0.base, ~#pstate~0.offset := #Ultimate.alloc(8);call write~init~int(0, ~#pstate~0.base, ~#pstate~0.offset, 4);call write~init~int(0, ~#pstate~0.base, 4 + ~#pstate~0.offset, 4);~counter~0 := 1; 1430#L-1 havoc main_#res;havoc main_#t~ret7.base, main_#t~ret7.offset, main_#t~ret8.base, main_#t~ret8.offset, main_~a~0.base, main_~a~0.offset, main_~b~0.base, main_~b~0.offset;havoc main_~a~0.base, main_~a~0.offset;havoc main_~b~0.base, main_~b~0.offset;havoc init_#t~post0, init_~i~0;havoc init_~i~0;init_~i~0 := 0; 1431#L17-3 assume !!(init_~i~0 < 2);call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0, 4);call write~int(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0, 4); 1444#L17-2 init_#t~post0 := init_~i~0;init_~i~0 := 1 + init_#t~post0;havoc init_#t~post0; 1445#L17-3 assume !!(init_~i~0 < 2);call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0, 4);call write~int(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0, 4); 1462#L17-2 init_#t~post0 := init_~i~0;init_~i~0 := 1 + init_#t~post0;havoc init_#t~post0; 1464#L17-3 assume !(init_~i~0 < 2); 1446#L15 malloc_#in~size := 4;havoc malloc_#res.base, malloc_#res.offset;havoc malloc_#t~post6, malloc_~size;malloc_~size := malloc_#in~size;malloc_#t~post6 := ~counter~0;~counter~0 := 1 + malloc_#t~post6;malloc_#res.base, malloc_#res.offset := 0, malloc_#t~post6;havoc malloc_#t~post6; 1428#L47 main_#t~ret7.base, main_#t~ret7.offset := malloc_#res.base, malloc_#res.offset;main_~a~0.base, main_~a~0.offset := main_#t~ret7.base, main_#t~ret7.offset;havoc main_#t~ret7.base, main_#t~ret7.offset;malloc_#in~size := 4;havoc malloc_#res.base, malloc_#res.offset;havoc malloc_#t~post6, malloc_~size;malloc_~size := malloc_#in~size;malloc_#t~post6 := ~counter~0;~counter~0 := 1 + malloc_#t~post6;malloc_#res.base, malloc_#res.offset := 0, malloc_#t~post6;havoc malloc_#t~post6; 1429#L47-1 main_#t~ret8.base, main_#t~ret8.offset := malloc_#res.base, malloc_#res.offset;main_~b~0.base, main_~b~0.offset := main_#t~ret8.base, main_#t~ret8.offset;havoc main_#t~ret8.base, main_#t~ret8.offset; 1443#L57 assume !((main_~a~0.base == 0 && main_~a~0.offset == 0) || (main_~b~0.base == 0 && main_~b~0.offset == 0));f_#in~pointer.base, f_#in~pointer.offset := main_~a~0.base, main_~a~0.offset;havoc f_#t~mem2.base, f_#t~mem2.offset, f_#t~post1, f_~pointer.base, f_~pointer.offset, f_~i~1;f_~pointer.base, f_~pointer.offset := f_#in~pointer.base, f_#in~pointer.offset;havoc f_~i~1;f_~i~1 := 0; 1432#L25-3 assume !!(f_~i~1 < 2);call f_#t~mem2.base, f_#t~mem2.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1, 4); 1433#L26 assume f_#t~mem2.base == 0 && f_#t~mem2.offset == 0;havoc f_#t~mem2.base, f_#t~mem2.offset;call write~$Pointer$(f_~pointer.base, f_~pointer.offset, ~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1, 4);call write~int(1, ~#pstate~0.base, ~#pstate~0.offset + 4 * f_~i~1, 4); 1437#L23 f_#in~pointer.base, f_#in~pointer.offset := main_~b~0.base, main_~b~0.offset;havoc f_#t~mem2.base, f_#t~mem2.offset, f_#t~post1, f_~pointer.base, f_~pointer.offset, f_~i~1;f_~pointer.base, f_~pointer.offset := f_#in~pointer.base, f_#in~pointer.offset;havoc f_~i~1;f_~i~1 := 0; 1438#L25-7 assume !!(f_~i~1 < 2);call f_#t~mem2.base, f_#t~mem2.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1, 4); 1453#L26-1 assume !(f_#t~mem2.base == 0 && f_#t~mem2.offset == 0);havoc f_#t~mem2.base, f_#t~mem2.offset; 1469#L25-6 f_#t~post1 := f_~i~1;f_~i~1 := 1 + f_#t~post1;havoc f_#t~post1; 1454#L25-7 assume !!(f_~i~1 < 2);call f_#t~mem2.base, f_#t~mem2.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1, 4); 1455#L26-1 assume !(f_#t~mem2.base == 0 && f_#t~mem2.offset == 0);havoc f_#t~mem2.base, f_#t~mem2.offset; 1458#L25-6 f_#t~post1 := f_~i~1;f_~i~1 := 1 + f_#t~post1;havoc f_#t~post1; 1459#L25-7 assume !(f_~i~1 < 2); 1467#L23-1 g_#in~pointer.base, g_#in~pointer.offset := main_~a~0.base, main_~a~0.offset;havoc g_#t~mem4.base, g_#t~mem4.offset, g_#t~mem5, g_#t~post3, g_~pointer.base, g_~pointer.offset, g_~i~2;g_~pointer.base, g_~pointer.offset := g_#in~pointer.base, g_#in~pointer.offset;havoc g_~i~2;g_~i~2 := 0; 1474#L36-3 assume !!(g_~i~2 < 2);call g_#t~mem4.base, g_#t~mem4.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * g_~i~2, 4); 1473#L37 assume g_#t~mem4.base == g_~pointer.base && g_#t~mem4.offset == g_~pointer.offset;havoc g_#t~mem4.base, g_#t~mem4.offset;call g_#t~mem5 := read~int(~#pstate~0.base, ~#pstate~0.offset + 4 * g_~i~2, 4); 1472#L39 [2018-12-01 15:55:28,001 INFO L796 eck$LassoCheckResult]: Loop: 1472#L39 assume 1 == g_#t~mem5; 1470#L4 havoc g_#t~mem5;call write~int(2, ~#pstate~0.base, ~#pstate~0.offset + 4 * g_~i~2, 4); 1441#L36-2 g_#t~post3 := g_~i~2;g_~i~2 := 1 + g_#t~post3;havoc g_#t~post3; 1442#L36-3 assume !!(g_~i~2 < 2);call g_#t~mem4.base, g_#t~mem4.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * g_~i~2, 4); 1471#L37 assume g_#t~mem4.base == g_~pointer.base && g_#t~mem4.offset == g_~pointer.offset;havoc g_#t~mem4.base, g_#t~mem4.offset;call g_#t~mem5 := read~int(~#pstate~0.base, ~#pstate~0.offset + 4 * g_~i~2, 4); 1472#L39 [2018-12-01 15:55:28,001 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 15:55:28,001 INFO L82 PathProgramCache]: Analyzing trace with hash -501415375, now seen corresponding path program 1 times [2018-12-01 15:55:28,002 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 15:55:28,002 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 15:55:28,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:55:28,003 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 15:55:28,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:55:28,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 15:55:28,364 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 15:55:28,365 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-01 15:55:28,365 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_86819597-491e-4c2e-92ce-073d1270dbbd/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-01 15:55:28,371 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 15:55:28,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 15:55:28,387 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 15:55:28,388 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2018-12-01 15:55:28,393 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2018-12-01 15:55:28,393 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 15:55:28,394 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 15:55:28,396 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 15:55:28,397 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:18, output treesize:11 [2018-12-01 15:55:28,426 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 30 [2018-12-01 15:55:28,428 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 10 treesize of output 9 [2018-12-01 15:55:28,428 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 15:55:28,437 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 29 treesize of output 30 [2018-12-01 15:55:28,439 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 16 treesize of output 1 [2018-12-01 15:55:28,439 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-01 15:55:28,442 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 15:55:28,444 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 15:55:28,453 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 30 [2018-12-01 15:55:28,454 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 10 treesize of output 9 [2018-12-01 15:55:28,454 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-01 15:55:28,461 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 29 treesize of output 30 [2018-12-01 15:55:28,463 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 16 treesize of output 1 [2018-12-01 15:55:28,463 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-01 15:55:28,465 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 15:55:28,466 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 15:55:28,471 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 15:55:28,471 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 2 variables, input treesize:89, output treesize:29 [2018-12-01 15:55:28,527 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 43 [2018-12-01 15:55:28,530 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:55:28,532 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 20 treesize of output 31 [2018-12-01 15:55:28,532 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 15:55:28,544 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 44 treesize of output 45 [2018-12-01 15:55:28,546 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 20 treesize of output 1 [2018-12-01 15:55:28,546 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-01 15:55:28,551 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 15:55:28,554 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 15:55:28,566 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 43 [2018-12-01 15:55:28,568 INFO L701 Elim1Store]: detected not equals via solver [2018-12-01 15:55:28,569 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 20 treesize of output 31 [2018-12-01 15:55:28,569 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-01 15:55:28,578 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 44 treesize of output 45 [2018-12-01 15:55:28,580 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 20 treesize of output 1 [2018-12-01 15:55:28,580 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-01 15:55:28,583 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 15:55:28,586 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 15:55:28,595 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 15:55:28,595 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 7 variables, input treesize:123, output treesize:22 [2018-12-01 15:55:28,639 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-01 15:55:28,640 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-01 15:55:28,640 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-01 15:55:28,641 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 15:55:28,645 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-01 15:55:28,646 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-01 15:55:28,646 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-01 15:55:28,647 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-01 15:55:28,648 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-01 15:55:28,649 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:29, output treesize:7 [2018-12-01 15:55:28,660 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 15:55:28,675 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-01 15:55:28,675 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 23 [2018-12-01 15:55:28,675 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-01 15:55:28,675 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 15:55:28,675 INFO L82 PathProgramCache]: Analyzing trace with hash 102329555, now seen corresponding path program 2 times [2018-12-01 15:55:28,675 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 15:55:28,675 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 15:55:28,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:55:28,676 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 15:55:28,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:55:28,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 15:55:28,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 15:55:28,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-12-01 15:55:28,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=470, Unknown=0, NotChecked=0, Total=552 [2018-12-01 15:55:28,776 INFO L87 Difference]: Start difference. First operand 52 states and 60 transitions. cyclomatic complexity: 13 Second operand 24 states. [2018-12-01 15:55:29,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 15:55:29,406 INFO L93 Difference]: Finished difference Result 37 states and 40 transitions. [2018-12-01 15:55:29,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-01 15:55:29,407 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 40 transitions. [2018-12-01 15:55:29,408 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2018-12-01 15:55:29,408 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 36 states and 39 transitions. [2018-12-01 15:55:29,408 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2018-12-01 15:55:29,408 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 31 [2018-12-01 15:55:29,409 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 39 transitions. [2018-12-01 15:55:29,409 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-01 15:55:29,409 INFO L705 BuchiCegarLoop]: Abstraction has 36 states and 39 transitions. [2018-12-01 15:55:29,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 39 transitions. [2018-12-01 15:55:29,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2018-12-01 15:55:29,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-12-01 15:55:29,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2018-12-01 15:55:29,412 INFO L728 BuchiCegarLoop]: Abstraction has 35 states and 38 transitions. [2018-12-01 15:55:29,412 INFO L608 BuchiCegarLoop]: Abstraction has 35 states and 38 transitions. [2018-12-01 15:55:29,412 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2018-12-01 15:55:29,412 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 38 transitions. [2018-12-01 15:55:29,413 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2018-12-01 15:55:29,413 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 15:55:29,413 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 15:55:29,414 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 15:55:29,414 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-01 15:55:29,415 INFO L794 eck$LassoCheckResult]: Stem: 1661#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];call ~#pp~0.base, ~#pp~0.offset := #Ultimate.alloc(8);call write~init~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset, 4);call write~init~$Pointer$(0, 0, ~#pp~0.base, 4 + ~#pp~0.offset, 4);call ~#pstate~0.base, ~#pstate~0.offset := #Ultimate.alloc(8);call write~init~int(0, ~#pstate~0.base, ~#pstate~0.offset, 4);call write~init~int(0, ~#pstate~0.base, 4 + ~#pstate~0.offset, 4);~counter~0 := 1; 1635#L-1 havoc main_#res;havoc main_#t~ret7.base, main_#t~ret7.offset, main_#t~ret8.base, main_#t~ret8.offset, main_~a~0.base, main_~a~0.offset, main_~b~0.base, main_~b~0.offset;havoc main_~a~0.base, main_~a~0.offset;havoc main_~b~0.base, main_~b~0.offset;havoc init_#t~post0, init_~i~0;havoc init_~i~0;init_~i~0 := 0; 1636#L17-3 assume !!(init_~i~0 < 2);call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0, 4);call write~int(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0, 4); 1649#L17-2 init_#t~post0 := init_~i~0;init_~i~0 := 1 + init_#t~post0;havoc init_#t~post0; 1650#L17-3 assume !!(init_~i~0 < 2);call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0, 4);call write~int(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0, 4); 1662#L17-2 init_#t~post0 := init_~i~0;init_~i~0 := 1 + init_#t~post0;havoc init_#t~post0; 1667#L17-3 assume !(init_~i~0 < 2); 1651#L15 malloc_#in~size := 4;havoc malloc_#res.base, malloc_#res.offset;havoc malloc_#t~post6, malloc_~size;malloc_~size := malloc_#in~size;malloc_#t~post6 := ~counter~0;~counter~0 := 1 + malloc_#t~post6;malloc_#res.base, malloc_#res.offset := 0, malloc_#t~post6;havoc malloc_#t~post6; 1633#L47 main_#t~ret7.base, main_#t~ret7.offset := malloc_#res.base, malloc_#res.offset;main_~a~0.base, main_~a~0.offset := main_#t~ret7.base, main_#t~ret7.offset;havoc main_#t~ret7.base, main_#t~ret7.offset;malloc_#in~size := 4;havoc malloc_#res.base, malloc_#res.offset;havoc malloc_#t~post6, malloc_~size;malloc_~size := malloc_#in~size;malloc_#t~post6 := ~counter~0;~counter~0 := 1 + malloc_#t~post6;malloc_#res.base, malloc_#res.offset := 0, malloc_#t~post6;havoc malloc_#t~post6; 1634#L47-1 main_#t~ret8.base, main_#t~ret8.offset := malloc_#res.base, malloc_#res.offset;main_~b~0.base, main_~b~0.offset := main_#t~ret8.base, main_#t~ret8.offset;havoc main_#t~ret8.base, main_#t~ret8.offset; 1648#L57 assume !((main_~a~0.base == 0 && main_~a~0.offset == 0) || (main_~b~0.base == 0 && main_~b~0.offset == 0));f_#in~pointer.base, f_#in~pointer.offset := main_~a~0.base, main_~a~0.offset;havoc f_#t~mem2.base, f_#t~mem2.offset, f_#t~post1, f_~pointer.base, f_~pointer.offset, f_~i~1;f_~pointer.base, f_~pointer.offset := f_#in~pointer.base, f_#in~pointer.offset;havoc f_~i~1;f_~i~1 := 0; 1637#L25-3 assume !!(f_~i~1 < 2);call f_#t~mem2.base, f_#t~mem2.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1, 4); 1638#L26 assume f_#t~mem2.base == 0 && f_#t~mem2.offset == 0;havoc f_#t~mem2.base, f_#t~mem2.offset;call write~$Pointer$(f_~pointer.base, f_~pointer.offset, ~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1, 4);call write~int(1, ~#pstate~0.base, ~#pstate~0.offset + 4 * f_~i~1, 4); 1642#L23 f_#in~pointer.base, f_#in~pointer.offset := main_~b~0.base, main_~b~0.offset;havoc f_#t~mem2.base, f_#t~mem2.offset, f_#t~post1, f_~pointer.base, f_~pointer.offset, f_~i~1;f_~pointer.base, f_~pointer.offset := f_#in~pointer.base, f_#in~pointer.offset;havoc f_~i~1;f_~i~1 := 0; 1643#L25-7 assume !!(f_~i~1 < 2);call f_#t~mem2.base, f_#t~mem2.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1, 4); 1656#L26-1 assume !(f_#t~mem2.base == 0 && f_#t~mem2.offset == 0);havoc f_#t~mem2.base, f_#t~mem2.offset; 1658#L25-6 f_#t~post1 := f_~i~1;f_~i~1 := 1 + f_#t~post1;havoc f_#t~post1; 1659#L25-7 assume !!(f_~i~1 < 2);call f_#t~mem2.base, f_#t~mem2.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1, 4); 1663#L26-1 assume f_#t~mem2.base == 0 && f_#t~mem2.offset == 0;havoc f_#t~mem2.base, f_#t~mem2.offset;call write~$Pointer$(f_~pointer.base, f_~pointer.offset, ~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1, 4);call write~int(1, ~#pstate~0.base, ~#pstate~0.offset + 4 * f_~i~1, 4); 1639#L23-1 g_#in~pointer.base, g_#in~pointer.offset := main_~a~0.base, main_~a~0.offset;havoc g_#t~mem4.base, g_#t~mem4.offset, g_#t~mem5, g_#t~post3, g_~pointer.base, g_~pointer.offset, g_~i~2;g_~pointer.base, g_~pointer.offset := g_#in~pointer.base, g_#in~pointer.offset;havoc g_~i~2;g_~i~2 := 0; 1640#L36-3 assume !!(g_~i~2 < 2);call g_#t~mem4.base, g_#t~mem4.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * g_~i~2, 4); 1641#L37 assume g_#t~mem4.base == g_~pointer.base && g_#t~mem4.offset == g_~pointer.offset;havoc g_#t~mem4.base, g_#t~mem4.offset;call g_#t~mem5 := read~int(~#pstate~0.base, ~#pstate~0.offset + 4 * g_~i~2, 4); 1652#L39 assume 1 == g_#t~mem5; 1655#L4 havoc g_#t~mem5;call write~int(2, ~#pstate~0.base, ~#pstate~0.offset + 4 * g_~i~2, 4); 1644#L36-2 g_#t~post3 := g_~i~2;g_~i~2 := 1 + g_#t~post3;havoc g_#t~post3; 1645#L36-3 assume !!(g_~i~2 < 2);call g_#t~mem4.base, g_#t~mem4.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * g_~i~2, 4); 1665#L37 [2018-12-01 15:55:29,415 INFO L796 eck$LassoCheckResult]: Loop: 1665#L37 assume !(g_#t~mem4.base == g_~pointer.base && g_#t~mem4.offset == g_~pointer.offset);havoc g_#t~mem4.base, g_#t~mem4.offset; 1666#L36-2 g_#t~post3 := g_~i~2;g_~i~2 := 1 + g_#t~post3;havoc g_#t~post3; 1664#L36-3 assume !!(g_~i~2 < 2);call g_#t~mem4.base, g_#t~mem4.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * g_~i~2, 4); 1665#L37 [2018-12-01 15:55:29,415 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 15:55:29,415 INFO L82 PathProgramCache]: Analyzing trace with hash -147882112, now seen corresponding path program 2 times [2018-12-01 15:55:29,415 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 15:55:29,416 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 15:55:29,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:55:29,417 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 15:55:29,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:55:29,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 15:55:29,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 15:55:29,456 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 15:55:29,456 INFO L82 PathProgramCache]: Analyzing trace with hash 115236, now seen corresponding path program 5 times [2018-12-01 15:55:29,456 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 15:55:29,456 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 15:55:29,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:55:29,457 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 15:55:29,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:55:29,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 15:55:29,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 15:55:29,459 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 15:55:29,459 INFO L82 PathProgramCache]: Analyzing trace with hash 1080532549, now seen corresponding path program 1 times [2018-12-01 15:55:29,460 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 15:55:29,460 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 15:55:29,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:55:29,460 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 15:55:29,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 15:55:29,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 15:55:29,487 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-01 15:55:29,487 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-01 15:55:29,487 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_86819597-491e-4c2e-92ce-073d1270dbbd/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-01 15:55:29,500 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 15:55:29,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 15:55:29,523 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 15:55:29,525 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-01 15:55:29,541 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-01 15:55:29,541 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2018-12-01 15:55:29,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-01 15:55:29,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-01 15:55:29,567 INFO L87 Difference]: Start difference. First operand 35 states and 38 transitions. cyclomatic complexity: 6 Second operand 6 states. [2018-12-01 15:55:29,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 15:55:29,613 INFO L93 Difference]: Finished difference Result 41 states and 43 transitions. [2018-12-01 15:55:29,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-01 15:55:29,613 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 43 transitions. [2018-12-01 15:55:29,614 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-01 15:55:29,614 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 0 states and 0 transitions. [2018-12-01 15:55:29,614 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-12-01 15:55:29,614 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-12-01 15:55:29,614 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-12-01 15:55:29,614 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-01 15:55:29,614 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-01 15:55:29,614 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-01 15:55:29,614 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-01 15:55:29,614 INFO L442 BuchiCegarLoop]: ======== Iteration 13============ [2018-12-01 15:55:29,614 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-12-01 15:55:29,614 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-01 15:55:29,614 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-12-01 15:55:29,618 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.12 03:55:29 BoogieIcfgContainer [2018-12-01 15:55:29,619 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-12-01 15:55:29,619 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-01 15:55:29,619 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-01 15:55:29,619 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-01 15:55:29,619 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 03:54:00" (3/4) ... [2018-12-01 15:55:29,622 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-01 15:55:29,622 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-01 15:55:29,622 INFO L168 Benchmark]: Toolchain (without parser) took 89287.61 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.5 MB). Free memory was 954.4 MB in the beginning and 1.1 GB in the end (delta: -140.1 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-12-01 15:55:29,623 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-01 15:55:29,623 INFO L168 Benchmark]: CACSL2BoogieTranslator took 152.96 ms. Allocated memory is still 1.0 GB. Free memory was 954.4 MB in the beginning and 943.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-12-01 15:55:29,623 INFO L168 Benchmark]: Boogie Procedure Inliner took 58.62 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 104.9 MB). Free memory was 943.6 MB in the beginning and 1.1 GB in the end (delta: -159.2 MB). Peak memory consumption was 15.6 MB. Max. memory is 11.5 GB. [2018-12-01 15:55:29,623 INFO L168 Benchmark]: Boogie Preprocessor took 17.87 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-12-01 15:55:29,623 INFO L168 Benchmark]: RCFGBuilder took 218.67 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: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. [2018-12-01 15:55:29,624 INFO L168 Benchmark]: BuchiAutomizer took 88833.28 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 24.6 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -16.7 MB). Peak memory consumption was 7.9 MB. Max. memory is 11.5 GB. [2018-12-01 15:55:29,624 INFO L168 Benchmark]: Witness Printer took 3.06 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-01 15:55:29,625 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 152.96 ms. Allocated memory is still 1.0 GB. Free memory was 954.4 MB in the beginning and 943.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 58.62 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 104.9 MB). Free memory was 943.6 MB in the beginning and 1.1 GB in the end (delta: -159.2 MB). Peak memory consumption was 15.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 17.87 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 218.67 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: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 88833.28 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 24.6 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -16.7 MB). Peak memory consumption was 7.9 MB. Max. memory is 11.5 GB. * Witness Printer took 3.06 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.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 12 terminating modules (10 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -2 * i + 3 and consists of 5 locations. One deterministic module has affine ranking function -2 * i + 3 and consists of 4 locations. 10 modules have a trivial ranking function, the largest among these consists of 26 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 88.8s and 13 iterations. TraceHistogramMax:2. Analysis of lassos took 72.6s. Construction of modules took 13.2s. Büchi inclusion checks took 2.7s. Highest rank in rank-based complementation 3. Minimization of det autom 6. Minimization of nondet autom 6. Automata minimization 0.0s AutomataMinimizationTime, 11 MinimizatonAttempts, 78 StatesRemovedByMinimization, 8 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 52 states and ocurred in iteration 10. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 303 SDtfs, 727 SDslu, 893 SDs, 0 SdLazy, 1333 SolverSat, 283 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 13.2s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc4 concLT0 SILN0 SILU6 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital1076 mio100 ax100 hnf100 lsp96 ukn23 mio100 lsp48 div100 bol100 ite100 ukn100 eq169 hnf77 smp100 dnf100 smp100 tf100 neg100 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 23ms VariablesStem: 6 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 4 SupportingInvariants: 8 MotzkinApplications: 48 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...