./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 aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_a700c152-43dc-4ffe-80b5-6dce24529833/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_a700c152-43dc-4ffe-80b5-6dce24529833/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_a700c152-43dc-4ffe-80b5-6dce24529833/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_a700c152-43dc-4ffe-80b5-6dce24529833/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_a700c152-43dc-4ffe-80b5-6dce24529833/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_a700c152-43dc-4ffe-80b5-6dce24529833/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-aa41828 [2018-11-23 15:07:36,927 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 15:07:36,928 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 15:07:36,935 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 15:07:36,935 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 15:07:36,936 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 15:07:36,937 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 15:07:36,938 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 15:07:36,939 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 15:07:36,939 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 15:07:36,940 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 15:07:36,940 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 15:07:36,941 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 15:07:36,942 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 15:07:36,942 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 15:07:36,943 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 15:07:36,943 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 15:07:36,945 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 15:07:36,946 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 15:07:36,947 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 15:07:36,948 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 15:07:36,948 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 15:07:36,950 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 15:07:36,950 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 15:07:36,950 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 15:07:36,951 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 15:07:36,951 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 15:07:36,952 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 15:07:36,952 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 15:07:36,954 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 15:07:36,954 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 15:07:36,954 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 15:07:36,955 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 15:07:36,955 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 15:07:36,955 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 15:07:36,956 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 15:07:36,956 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_a700c152-43dc-4ffe-80b5-6dce24529833/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-23 15:07:36,964 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 15:07:36,965 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 15:07:36,966 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 15:07:36,966 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 15:07:36,966 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 15:07:36,966 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-23 15:07:36,966 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-23 15:07:36,966 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-23 15:07:36,966 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-23 15:07:36,967 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-23 15:07:36,967 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-23 15:07:36,967 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 15:07:36,967 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 15:07:36,967 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-23 15:07:36,967 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 15:07:36,967 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 15:07:36,968 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 15:07:36,968 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-23 15:07:36,968 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-23 15:07:36,968 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-23 15:07:36,968 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 15:07:36,968 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 15:07:36,968 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-23 15:07:36,968 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 15:07:36,969 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-23 15:07:36,969 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 15:07:36,969 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 15:07:36,969 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-23 15:07:36,969 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 15:07:36,969 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 15:07:36,969 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-23 15:07:36,970 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-23 15:07:36,970 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_a700c152-43dc-4ffe-80b5-6dce24529833/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-11-23 15:07:36,993 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 15:07:37,003 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 15:07:37,006 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 15:07:37,007 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 15:07:37,007 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 15:07:37,007 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_a700c152-43dc-4ffe-80b5-6dce24529833/bin-2019/uautomizer/../../sv-benchmarks/c/ldv-regression/ex3_forlist_true-termination.c_true-unreach-call.i [2018-11-23 15:07:37,045 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a700c152-43dc-4ffe-80b5-6dce24529833/bin-2019/uautomizer/data/1fb238528/b8178de5844342a386791f9428bfd103/FLAGf10ec14d5 [2018-11-23 15:07:37,445 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 15:07:37,445 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_a700c152-43dc-4ffe-80b5-6dce24529833/sv-benchmarks/c/ldv-regression/ex3_forlist_true-termination.c_true-unreach-call.i [2018-11-23 15:07:37,451 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a700c152-43dc-4ffe-80b5-6dce24529833/bin-2019/uautomizer/data/1fb238528/b8178de5844342a386791f9428bfd103/FLAGf10ec14d5 [2018-11-23 15:07:37,459 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_a700c152-43dc-4ffe-80b5-6dce24529833/bin-2019/uautomizer/data/1fb238528/b8178de5844342a386791f9428bfd103 [2018-11-23 15:07:37,461 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 15:07:37,462 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 15:07:37,462 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 15:07:37,463 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 15:07:37,465 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 15:07:37,466 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:07:37" (1/1) ... [2018-11-23 15:07:37,468 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9c9a7ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:07:37, skipping insertion in model container [2018-11-23 15:07:37,468 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:07:37" (1/1) ... [2018-11-23 15:07:37,476 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 15:07:37,491 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 15:07:37,594 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 15:07:37,597 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 15:07:37,612 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 15:07:37,627 INFO L195 MainTranslator]: Completed translation [2018-11-23 15:07:37,627 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:07:37 WrapperNode [2018-11-23 15:07:37,627 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 15:07:37,628 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 15:07:37,628 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 15:07:37,628 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 15:07:37,635 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:07:37" (1/1) ... [2018-11-23 15:07:37,643 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:07:37" (1/1) ... [2018-11-23 15:07:37,703 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 15:07:37,703 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 15:07:37,704 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 15:07:37,704 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 15:07:37,712 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:07:37" (1/1) ... [2018-11-23 15:07:37,712 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:07:37" (1/1) ... [2018-11-23 15:07:37,714 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:07:37" (1/1) ... [2018-11-23 15:07:37,715 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:07:37" (1/1) ... [2018-11-23 15:07:37,721 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:07:37" (1/1) ... [2018-11-23 15:07:37,725 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:07:37" (1/1) ... [2018-11-23 15:07:37,727 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:07:37" (1/1) ... [2018-11-23 15:07:37,729 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 15:07:37,729 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 15:07:37,729 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 15:07:37,730 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 15:07:37,730 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:07:37" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a700c152-43dc-4ffe-80b5-6dce24529833/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 15:07:37,771 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-23 15:07:37,771 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2018-11-23 15:07:37,771 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2018-11-23 15:07:37,771 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-23 15:07:37,771 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 15:07:37,771 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 15:07:37,771 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 15:07:37,772 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 15:07:37,772 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 15:07:38,011 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 15:07:38,011 INFO L280 CfgBuilder]: Removed 27 assue(true) statements. [2018-11-23 15:07:38,011 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:07:38 BoogieIcfgContainer [2018-11-23 15:07:38,012 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 15:07:38,012 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-23 15:07:38,012 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-23 15:07:38,015 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-23 15:07:38,016 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 15:07:38,016 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 23.11 03:07:37" (1/3) ... [2018-11-23 15:07:38,017 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6d800173 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 03:07:38, skipping insertion in model container [2018-11-23 15:07:38,017 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 15:07:38,017 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:07:37" (2/3) ... [2018-11-23 15:07:38,017 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6d800173 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 03:07:38, skipping insertion in model container [2018-11-23 15:07:38,017 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 15:07:38,018 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:07:38" (3/3) ... [2018-11-23 15:07:38,020 INFO L375 chiAutomizerObserver]: Analyzing ICFG ex3_forlist_true-termination.c_true-unreach-call.i [2018-11-23 15:07:38,069 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 15:07:38,069 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-23 15:07:38,069 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-23 15:07:38,069 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-23 15:07:38,070 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 15:07:38,070 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 15:07:38,070 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-23 15:07:38,070 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 15:07:38,070 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-23 15:07:38,081 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states. [2018-11-23 15:07:38,096 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 20 [2018-11-23 15:07:38,096 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 15:07:38,097 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 15:07:38,101 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-23 15:07:38,101 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-23 15:07:38,101 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-23 15:07:38,101 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states. [2018-11-23 15:07:38,103 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 20 [2018-11-23 15:07:38,103 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 15:07:38,103 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 15:07:38,104 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-23 15:07:38,104 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-23 15:07:38,108 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-11-23 15:07:38,109 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-11-23 15:07:38,113 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:07:38,113 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-11-23 15:07:38,114 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:07:38,115 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:07:38,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:07:38,144 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:07:38,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:07:38,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:07:38,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:07:38,196 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:07:38,196 INFO L82 PathProgramCache]: Analyzing trace with hash 1283, now seen corresponding path program 1 times [2018-11-23 15:07:38,196 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:07:38,196 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:07:38,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:07:38,197 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:07:38,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:07:38,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:07:38,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:07:38,220 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:07:38,220 INFO L82 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2018-11-23 15:07:38,220 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:07:38,220 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:07:38,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:07:38,222 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:07:38,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:07:38,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:07:38,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:07:38,356 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 15:07:38,361 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 15:07:38,427 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 15:07:38,427 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:185, output treesize:186 [2018-11-23 15:07:38,561 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 15:07:38,564 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 15:07:38,564 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 15:07:38,564 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 15:07:38,564 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 15:07:38,564 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 15:07:38,564 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 15:07:38,564 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 15:07:38,565 INFO L131 ssoRankerPreferences]: Filename of dumped script: ex3_forlist_true-termination.c_true-unreach-call.i_Iteration1_Lasso [2018-11-23 15:07:38,565 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 15:07:38,565 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 15:07:38,580 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:07:38,585 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:07:38,589 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:07:38,590 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:07:38,592 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:07:38,594 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:07:38,596 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:07:38,597 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:07:38,598 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:07:38,600 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:07:38,603 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:07:38,604 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:07:38,606 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:07:38,608 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:07:39,020 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 15:07:39,023 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 15:07:39,025 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:07:39,026 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:07:39,026 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:07:39,026 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:07:39,027 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:07:39,027 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:07:39,028 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:07:39,029 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:07:39,031 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:07:39,031 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:07:39,032 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:07:39,032 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:07:39,032 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:07:39,032 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:07:39,033 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:07:39,033 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:07:39,033 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:07:39,034 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:07:39,034 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:07:39,035 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:07:39,035 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:07:39,035 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:07:39,035 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:07:39,036 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:07:39,036 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:07:39,036 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:07:39,037 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:07:39,038 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:07:39,038 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:07:39,038 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:07:39,038 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:07:39,038 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:07:39,039 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:07:39,039 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:07:39,039 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:07:39,040 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:07:39,041 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:07:39,041 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:07:39,042 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:07:39,042 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:07:39,042 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:07:39,042 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:07:39,042 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:07:39,043 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:07:39,043 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:07:39,044 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:07:39,044 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:07:39,044 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:07:39,044 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:07:39,045 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:07:39,047 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 15:07:39,047 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 15:07:39,050 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:07:39,051 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:07:39,051 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:07:39,051 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:07:39,051 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:07:39,052 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:07:39,052 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:07:39,052 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:07:39,052 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:07:39,054 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:07:39,054 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:07:39,055 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:07:39,055 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:07:39,055 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:07:39,055 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:07:39,056 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:07:39,056 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:07:39,056 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:07:39,057 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:07:39,057 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:07:39,057 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:07:39,058 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:07:39,058 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:07:39,058 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:07:39,059 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 15:07:39,059 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 15:07:39,063 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:07:39,064 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:07:39,064 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:07:39,064 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:07:39,065 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:07:39,065 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:07:39,065 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:07:39,065 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:07:39,065 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:07:39,066 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:07:39,066 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:07:39,067 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:07:39,067 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:07:39,067 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:07:39,067 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:07:39,067 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:07:39,068 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:07:39,068 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:07:39,071 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:07:39,071 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:07:39,072 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:07:39,072 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:07:39,072 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:07:39,072 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:07:39,073 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 15:07:39,073 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 15:07:39,077 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:07:39,077 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:07:39,078 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:07:39,078 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:07:39,078 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:07:39,078 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:07:39,078 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:07:39,079 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:07:39,079 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:07:39,079 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:07:39,079 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:07:39,080 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:07:39,080 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:07:39,080 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:07:39,080 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:07:39,084 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 15:07:39,084 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 15:07:39,088 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:07:39,089 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:07:39,089 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:07:39,089 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:07:39,089 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:07:39,089 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:07:39,090 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 15:07:39,091 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 15:07:39,094 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:07:39,095 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:07:39,095 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:07:39,096 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:07:39,096 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:07:39,096 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:07:39,096 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 15:07:39,097 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 15:07:39,099 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:07:39,100 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:07:39,100 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:07:39,100 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:07:39,100 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:07:39,101 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:07:39,102 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 15:07:39,102 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 15:07:39,106 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:07:39,106 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:07:39,106 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:07:39,107 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:07:39,107 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:07:39,107 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:07:39,107 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:07:39,107 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:07:39,108 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:07:39,108 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:07:39,109 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:07:39,109 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:07:39,109 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:07:39,110 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:07:39,110 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:07:39,111 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 15:07:39,111 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 15:07:39,113 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:07:39,114 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:07:39,114 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:07:39,114 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:07:39,114 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:07:39,115 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:07:39,115 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:07:39,115 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:07:39,115 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:07:39,116 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:07:39,116 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:07:39,117 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:07:39,117 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 15:07:39,117 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:07:39,117 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:07:39,118 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 15:07:39,118 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 15:07:39,126 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:07:39,126 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:07:39,127 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:07:39,127 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:07:39,127 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:07:39,127 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:07:39,128 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 15:07:39,129 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 15:07:39,133 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:07:39,134 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:07:39,134 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:07:39,134 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 15:07:39,134 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:07:39,135 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:07:39,135 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 15:07:39,136 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 15:07:39,141 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:07:39,142 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:07:39,142 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:07:39,142 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:07:39,143 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:07:39,143 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:07:39,143 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:07:39,143 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:07:39,143 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:07:39,144 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:07:39,144 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:07:39,147 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:07:39,147 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:07:39,147 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:07:39,148 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:07:39,148 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 15:07:39,148 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 15:07:39,154 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:07:39,155 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:07:39,155 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:07:39,155 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:07:39,156 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:07:39,156 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:07:39,158 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 15:07:39,158 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 15:07:39,163 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:07:39,163 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:07:39,164 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:07:39,164 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:07:39,164 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:07:39,164 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:07:39,167 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 15:07:39,167 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 15:07:39,186 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 15:07:39,211 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-11-23 15:07:39,211 INFO L444 ModelExtractionUtils]: 13 out of 19 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-11-23 15:07:39,213 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 15:07:39,215 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 15:07:39,215 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 15:07:39,215 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ~#pp~0.base)_1, ULTIMATE.start_init_~i~0) = 3*v_rep(select #length ~#pp~0.base)_1 - 8*ULTIMATE.start_init_~i~0 Supporting invariants [] [2018-11-23 15:07:39,231 INFO L297 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2018-11-23 15:07:39,238 WARN L1272 BoogieBacktranslator]: unknown boogie variable #length [2018-11-23 15:07:39,255 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:07:39,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:07:39,267 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:07:39,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:07:39,277 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:07:39,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 15:07:39,303 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-11-23 15:07:39,304 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 33 states. Second operand 3 states. [2018-11-23 15:07:39,383 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-11-23 15:07:39,383 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-11-23 15:07:39,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 15:07:39,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 92 transitions. [2018-11-23 15:07:39,386 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 92 transitions. Stem has 2 letters. Loop has 2 letters. [2018-11-23 15:07:39,386 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 15:07:39,386 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 92 transitions. Stem has 4 letters. Loop has 2 letters. [2018-11-23 15:07:39,387 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 15:07:39,387 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 92 transitions. Stem has 2 letters. Loop has 4 letters. [2018-11-23 15:07:39,387 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 15:07:39,387 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 93 states and 136 transitions. [2018-11-23 15:07:39,390 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 16 [2018-11-23 15:07:39,393 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 93 states to 28 states and 37 transitions. [2018-11-23 15:07:39,394 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2018-11-23 15:07:39,394 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2018-11-23 15:07:39,394 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 37 transitions. [2018-11-23 15:07:39,395 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 15:07:39,395 INFO L705 BuchiCegarLoop]: Abstraction has 28 states and 37 transitions. [2018-11-23 15:07:39,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 37 transitions. [2018-11-23 15:07:39,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-11-23 15:07:39,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-23 15:07:39,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 37 transitions. [2018-11-23 15:07:39,414 INFO L728 BuchiCegarLoop]: Abstraction has 28 states and 37 transitions. [2018-11-23 15:07:39,414 INFO L608 BuchiCegarLoop]: Abstraction has 28 states and 37 transitions. [2018-11-23 15:07:39,414 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-23 15:07:39,414 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 37 transitions. [2018-11-23 15:07:39,415 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 16 [2018-11-23 15:07:39,415 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 15:07:39,415 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 15:07:39,415 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-23 15:07:39,415 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 15:07:39,416 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-11-23 15:07:39,416 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-11-23 15:07:39,416 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:07:39,416 INFO L82 PathProgramCache]: Analyzing trace with hash 1807951404, now seen corresponding path program 1 times [2018-11-23 15:07:39,416 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:07:39,417 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:07:39,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:07:39,417 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:07:39,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:07:39,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:07:39,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 15:07:39,448 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 15:07:39,448 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 15:07:39,449 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 15:07:39,450 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:07:39,450 INFO L82 PathProgramCache]: Analyzing trace with hash 62722, now seen corresponding path program 1 times [2018-11-23 15:07:39,450 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:07:39,450 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:07:39,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:07:39,451 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:07:39,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:07:39,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:07:39,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:07:39,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 15:07:39,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 15:07:39,515 INFO L87 Difference]: Start difference. First operand 28 states and 37 transitions. cyclomatic complexity: 14 Second operand 3 states. [2018-11-23 15:07:39,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:07:39,536 INFO L93 Difference]: Finished difference Result 29 states and 37 transitions. [2018-11-23 15:07:39,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 15:07:39,538 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 37 transitions. [2018-11-23 15:07:39,539 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 16 [2018-11-23 15:07:39,540 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 29 states and 37 transitions. [2018-11-23 15:07:39,540 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2018-11-23 15:07:39,540 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2018-11-23 15:07:39,540 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 37 transitions. [2018-11-23 15:07:39,540 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 15:07:39,540 INFO L705 BuchiCegarLoop]: Abstraction has 29 states and 37 transitions. [2018-11-23 15:07:39,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 37 transitions. [2018-11-23 15:07:39,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2018-11-23 15:07:39,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-23 15:07:39,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 36 transitions. [2018-11-23 15:07:39,542 INFO L728 BuchiCegarLoop]: Abstraction has 28 states and 36 transitions. [2018-11-23 15:07:39,543 INFO L608 BuchiCegarLoop]: Abstraction has 28 states and 36 transitions. [2018-11-23 15:07:39,543 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-23 15:07:39,543 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 36 transitions. [2018-11-23 15:07:39,543 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 16 [2018-11-23 15:07:39,544 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 15:07:39,544 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 15:07:39,544 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 15:07:39,544 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 15:07:39,548 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-11-23 15:07:39,548 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-11-23 15:07:39,548 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:07:39,548 INFO L82 PathProgramCache]: Analyzing trace with hash -369325334, now seen corresponding path program 1 times [2018-11-23 15:07:39,548 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:07:39,548 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:07:39,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:07:39,549 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:07:39,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:07:39,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:07:39,574 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 15:07:39,575 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 15:07:39,575 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a700c152-43dc-4ffe-80b5-6dce24529833/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 15:07:39,589 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:07:39,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:07:39,606 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:07:39,612 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 15:07:39,639 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 15:07:39,639 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-23 15:07:39,639 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 15:07:39,640 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:07:39,640 INFO L82 PathProgramCache]: Analyzing trace with hash 62722, now seen corresponding path program 2 times [2018-11-23 15:07:39,640 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:07:39,640 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:07:39,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:07:39,642 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:07:39,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:07:39,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:07:39,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:07:39,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 15:07:39,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-23 15:07:39,706 INFO L87 Difference]: Start difference. First operand 28 states and 36 transitions. cyclomatic complexity: 13 Second operand 5 states. [2018-11-23 15:07:39,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:07:39,723 INFO L93 Difference]: Finished difference Result 30 states and 38 transitions. [2018-11-23 15:07:39,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 15:07:39,723 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 38 transitions. [2018-11-23 15:07:39,724 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 16 [2018-11-23 15:07:39,724 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 30 states and 38 transitions. [2018-11-23 15:07:39,724 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2018-11-23 15:07:39,724 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2018-11-23 15:07:39,724 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 38 transitions. [2018-11-23 15:07:39,724 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 15:07:39,724 INFO L705 BuchiCegarLoop]: Abstraction has 30 states and 38 transitions. [2018-11-23 15:07:39,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 38 transitions. [2018-11-23 15:07:39,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-11-23 15:07:39,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-23 15:07:39,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 38 transitions. [2018-11-23 15:07:39,726 INFO L728 BuchiCegarLoop]: Abstraction has 30 states and 38 transitions. [2018-11-23 15:07:39,726 INFO L608 BuchiCegarLoop]: Abstraction has 30 states and 38 transitions. [2018-11-23 15:07:39,726 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-23 15:07:39,726 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 38 transitions. [2018-11-23 15:07:39,726 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 16 [2018-11-23 15:07:39,726 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 15:07:39,726 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 15:07:39,727 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 15:07:39,727 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 15:07:39,727 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-11-23 15:07:39,727 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-11-23 15:07:39,727 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:07:39,727 INFO L82 PathProgramCache]: Analyzing trace with hash -1083197400, now seen corresponding path program 2 times [2018-11-23 15:07:39,727 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:07:39,727 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:07:39,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:07:39,728 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 15:07:39,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:07:39,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:07:39,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:07:39,758 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:07:39,758 INFO L82 PathProgramCache]: Analyzing trace with hash 62722, now seen corresponding path program 3 times [2018-11-23 15:07:39,758 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:07:39,759 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:07:39,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:07:39,759 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 15:07:39,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:07:39,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:07:39,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:07:39,765 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:07:39,765 INFO L82 PathProgramCache]: Analyzing trace with hash -1444415621, now seen corresponding path program 1 times [2018-11-23 15:07:39,765 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:07:39,766 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:07:39,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:07:39,766 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 15:07:39,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:07:39,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:07:40,094 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 15:07:40,094 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 15:07:40,094 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a700c152-43dc-4ffe-80b5-6dce24529833/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 15:07:40,106 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:07:40,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:07:40,126 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:07:40,137 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-11-23 15:07:40,145 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-11-23 15:07:40,145 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 15:07:40,146 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:07:40,150 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:07:40,150 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:18, output treesize:11 [2018-11-23 15:07:40,182 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-11-23 15:07:40,184 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-11-23 15:07:40,185 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 15:07:40,195 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-11-23 15:07:40,198 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-11-23 15:07:40,198 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 15:07:40,202 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:07:40,204 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:07:40,216 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-11-23 15:07:40,219 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-11-23 15:07:40,219 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 15:07:40,227 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-11-23 15:07:40,230 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-11-23 15:07:40,230 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-23 15:07:40,233 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:07:40,235 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:07:40,241 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:07:40,241 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 2 variables, input treesize:108, output treesize:36 [2018-11-23 15:07:40,289 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-11-23 15:07:40,295 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:07:40,296 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-11-23 15:07:40,296 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 15:07:40,314 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-11-23 15:07:40,317 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-11-23 15:07:40,317 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 15:07:40,323 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:07:40,327 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:07:40,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-11-23 15:07:40,348 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:07:40,349 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-23 15:07:40,350 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 15:07:40,361 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-11-23 15:07:40,363 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-11-23 15:07:40,363 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-23 15:07:40,366 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:07:40,369 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:07:40,377 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-11-23 15:07:40,377 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:122, output treesize:46 [2018-11-23 15:07:40,527 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-11-23 15:07:40,529 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:07:40,530 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-11-23 15:07:40,530 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 15:07:40,532 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:07:40,539 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-11-23 15:07:40,541 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:07:40,541 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-11-23 15:07:40,541 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 15:07:40,543 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:07:40,546 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:07:40,546 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:50, output treesize:7 [2018-11-23 15:07:40,554 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 15:07:40,569 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 15:07:40,569 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2018-11-23 15:07:40,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-23 15:07:40,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=297, Unknown=0, NotChecked=0, Total=342 [2018-11-23 15:07:40,596 INFO L87 Difference]: Start difference. First operand 30 states and 38 transitions. cyclomatic complexity: 13 Second operand 19 states. [2018-11-23 15:07:41,679 WARN L180 SmtUtils]: Spent 414.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 42 [2018-11-23 15:07:41,872 WARN L180 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 46 [2018-11-23 15:07:41,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:07:41,957 INFO L93 Difference]: Finished difference Result 29 states and 35 transitions. [2018-11-23 15:07:41,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 15:07:41,957 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 35 transitions. [2018-11-23 15:07:41,957 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2018-11-23 15:07:41,958 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 29 states and 35 transitions. [2018-11-23 15:07:41,958 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2018-11-23 15:07:41,958 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2018-11-23 15:07:41,958 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 35 transitions. [2018-11-23 15:07:41,958 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 15:07:41,958 INFO L705 BuchiCegarLoop]: Abstraction has 29 states and 35 transitions. [2018-11-23 15:07:41,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 35 transitions. [2018-11-23 15:07:41,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-11-23 15:07:41,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-23 15:07:41,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2018-11-23 15:07:41,960 INFO L728 BuchiCegarLoop]: Abstraction has 29 states and 35 transitions. [2018-11-23 15:07:41,960 INFO L608 BuchiCegarLoop]: Abstraction has 29 states and 35 transitions. [2018-11-23 15:07:41,960 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-23 15:07:41,960 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 35 transitions. [2018-11-23 15:07:41,961 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2018-11-23 15:07:41,961 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 15:07:41,961 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 15:07:41,961 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 15:07:41,961 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 15:07:41,961 INFO L794 eck$LassoCheckResult]: Stem: 507#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; 483#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; 484#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); 497#L17-2 init_#t~post0 := init_~i~0;init_~i~0 := 1 + init_#t~post0;havoc init_#t~post0; 498#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); 508#L17-2 init_#t~post0 := init_~i~0;init_~i~0 := 1 + init_#t~post0;havoc init_#t~post0; 509#L17-3 assume !(init_~i~0 < 2); 496#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; 481#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; 482#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; 495#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; 485#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); 486#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); 491#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; 492#L25-7 [2018-11-23 15:07:41,961 INFO L796 eck$LassoCheckResult]: Loop: 492#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); 503#L26-1 assume !(f_#t~mem2.base == 0 && f_#t~mem2.offset == 0);havoc f_#t~mem2.base, f_#t~mem2.offset; 505#L25-6 f_#t~post1 := f_~i~1;f_~i~1 := 1 + f_#t~post1;havoc f_#t~post1; 492#L25-7 [2018-11-23 15:07:41,962 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:07:41,962 INFO L82 PathProgramCache]: Analyzing trace with hash -1444415679, now seen corresponding path program 1 times [2018-11-23 15:07:41,962 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:07:41,962 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:07:41,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:07:41,962 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:07:41,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:07:41,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:07:41,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:07:41,996 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:07:41,996 INFO L82 PathProgramCache]: Analyzing trace with hash 81589, now seen corresponding path program 1 times [2018-11-23 15:07:41,997 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:07:41,997 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:07:41,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:07:41,997 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:07:41,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:07:41,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:07:42,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:07:42,001 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:07:42,002 INFO L82 PathProgramCache]: Analyzing trace with hash 689897333, now seen corresponding path program 1 times [2018-11-23 15:07:42,002 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:07:42,002 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:07:42,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:07:42,002 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:07:42,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:07:42,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:07:42,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:08:04,891 WARN L180 SmtUtils]: Spent 22.81 s on a formula simplification. DAG size of input: 265 DAG size of output: 225 [2018-11-23 15:08:04,896 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 15:08:05,089 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 15:08:14,825 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 15:08:15,085 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 15:08:25,067 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 15:08:25,278 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 15:08:34,113 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 15:08:34,309 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 15:08:42,695 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 15:08:42,924 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 15:08:51,175 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 15:08:51,294 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 15:08:57,311 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 15:08:57,424 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 15:09:03,271 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-2 vars, End of recursive call: 7 dim-0 vars, and 1 xjuncts. [2018-11-23 15:09:03,271 INFO L202 ElimStorePlain]: Needed 15 recursive calls to eliminate 7 variables, input treesize:500, output treesize:1875 [2018-11-23 15:09:08,870 WARN L180 SmtUtils]: Spent 5.60 s on a formula simplification that was a NOOP. DAG size: 163 [2018-11-23 15:09:08,872 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 15:09:08,873 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 15:09:08,873 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 15:09:08,873 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 15:09:08,873 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 15:09:08,873 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 15:09:08,873 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 15:09:08,873 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 15:09:08,873 INFO L131 ssoRankerPreferences]: Filename of dumped script: ex3_forlist_true-termination.c_true-unreach-call.i_Iteration5_Lasso [2018-11-23 15:09:08,873 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 15:09:08,873 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 15:09:08,877 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:09:08,878 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:09:08,879 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:09:08,880 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:09:08,881 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:09:08,883 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:09:08,885 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:09:09,898 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:09:09,901 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:09:09,902 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:09:09,906 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:09:09,908 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:09:09,909 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:09:09,910 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:09:09,911 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:09:09,919 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:09:10,131 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 15:09:10,131 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 15:09:10,131 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:09:10,132 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:09:10,132 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:09:10,132 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:09:10,132 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:09:10,132 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:09:10,132 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:09:10,132 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:09:10,133 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:09:10,133 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:09:10,133 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:09:10,133 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:09:10,133 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:09:10,133 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:09:10,133 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:09:10,133 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:09:10,134 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:09:10,134 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:09:10,134 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:09:10,134 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:09:10,134 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:09:10,134 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:09:10,134 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:09:10,134 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:09:10,135 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:09:10,135 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:09:10,135 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:09:10,135 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:09:10,136 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:09:10,136 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:09:10,136 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:09:10,136 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:09:10,136 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:09:10,136 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:09:10,136 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:09:10,136 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:09:10,136 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:09:10,139 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:09:10,139 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:09:10,139 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:09:10,139 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:09:10,140 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 15:09:10,140 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 15:09:10,141 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:09:10,142 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:09:10,142 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:09:10,142 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:09:10,142 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:09:10,142 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:09:10,142 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:09:10,143 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:09:10,143 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:09:10,143 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:09:10,143 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:09:10,144 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:09:10,144 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:09:10,144 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:09:10,144 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:09:10,145 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 15:09:10,145 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 15:09:10,149 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:09:10,149 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:09:10,149 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:09:10,150 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:09:10,150 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:09:10,150 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:09:10,151 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 15:09:10,151 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 15:09:10,152 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:09:10,153 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:09:10,153 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:09:10,153 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:09:10,153 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:09:10,153 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:09:10,154 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 15:09:10,154 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 15:09:10,156 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:09:10,156 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:09:10,157 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:09:10,157 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:09:10,157 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:09:10,157 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:09:10,158 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 15:09:10,158 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 15:09:10,159 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:09:10,160 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:09:10,160 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:09:10,160 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:09:10,160 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:09:10,160 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:09:10,160 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:09:10,161 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:09:10,161 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:09:10,161 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:09:10,161 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:09:10,162 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:09:10,162 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:09:10,162 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:09:10,162 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:09:10,163 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 15:09:10,164 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 15:09:10,174 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 15:09:10,192 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2018-11-23 15:09:10,192 INFO L444 ModelExtractionUtils]: 10 out of 19 variables were initially zero. Simplification set additionally 6 variables to zero. [2018-11-23 15:09:10,192 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 15:09:10,194 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 15:09:10,194 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 15:09:10,195 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-11-23 15:09:10,262 INFO L297 tatePredicateManager]: 17 out of 17 supporting invariants were superfluous and have been removed [2018-11-23 15:09:10,273 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:09:10,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:09:10,311 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:09:10,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:09:10,320 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:09:10,327 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 15:09:10,327 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-11-23 15:09:10,327 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 29 states and 35 transitions. cyclomatic complexity: 10 Second operand 3 states. [2018-11-23 15:09:10,351 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-11-23 15:09:10,351 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-11-23 15:09:10,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 15:09:10,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 47 transitions. [2018-11-23 15:09:10,352 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 47 transitions. Stem has 14 letters. Loop has 3 letters. [2018-11-23 15:09:10,353 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 15:09:10,353 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 47 transitions. Stem has 17 letters. Loop has 3 letters. [2018-11-23 15:09:10,353 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 15:09:10,353 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 47 transitions. Stem has 14 letters. Loop has 6 letters. [2018-11-23 15:09:10,353 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 15:09:10,353 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 68 states and 88 transitions. [2018-11-23 15:09:10,356 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 20 [2018-11-23 15:09:10,356 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 68 states to 43 states and 54 transitions. [2018-11-23 15:09:10,357 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 34 [2018-11-23 15:09:10,357 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2018-11-23 15:09:10,357 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43 states and 54 transitions. [2018-11-23 15:09:10,357 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 15:09:10,357 INFO L705 BuchiCegarLoop]: Abstraction has 43 states and 54 transitions. [2018-11-23 15:09:10,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states and 54 transitions. [2018-11-23 15:09:10,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 31. [2018-11-23 15:09:10,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-23 15:09:10,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 39 transitions. [2018-11-23 15:09:10,359 INFO L728 BuchiCegarLoop]: Abstraction has 31 states and 39 transitions. [2018-11-23 15:09:10,359 INFO L608 BuchiCegarLoop]: Abstraction has 31 states and 39 transitions. [2018-11-23 15:09:10,360 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-23 15:09:10,360 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 39 transitions. [2018-11-23 15:09:10,360 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-11-23 15:09:10,360 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 15:09:10,360 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 15:09:10,360 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 15:09:10,361 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 15:09:10,361 INFO L794 eck$LassoCheckResult]: Stem: 748#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; 722#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; 723#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); 735#L17-2 init_#t~post0 := init_~i~0;init_~i~0 := 1 + init_#t~post0;havoc init_#t~post0; 736#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); 749#L17-2 init_#t~post0 := init_~i~0;init_~i~0 := 1 + init_#t~post0;havoc init_#t~post0; 750#L17-3 assume !(init_~i~0 < 2); 737#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; 720#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; 721#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; 734#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; 724#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); 725#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); 730#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; 731#L25-7 assume !(f_~i~1 < 2); 726#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; 727#L36-3 [2018-11-23 15:09:10,361 INFO L796 eck$LassoCheckResult]: Loop: 727#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); 729#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; 733#L36-2 g_#t~post3 := g_~i~2;g_~i~2 := 1 + g_#t~post3;havoc g_#t~post3; 727#L36-3 [2018-11-23 15:09:10,361 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:09:10,361 INFO L82 PathProgramCache]: Analyzing trace with hash -809029298, now seen corresponding path program 1 times [2018-11-23 15:09:10,361 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:09:10,361 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:09:10,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:09:10,362 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:09:10,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:09:10,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:09:10,389 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-23 15:09:10,390 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 15:09:10,390 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 15:09:10,390 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 15:09:10,390 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:09:10,390 INFO L82 PathProgramCache]: Analyzing trace with hash 100776, now seen corresponding path program 1 times [2018-11-23 15:09:10,390 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:09:10,390 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:09:10,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:09:10,391 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:09:10,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:09:10,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:09:10,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:09:10,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 15:09:10,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 15:09:10,425 INFO L87 Difference]: Start difference. First operand 31 states and 39 transitions. cyclomatic complexity: 12 Second operand 3 states. [2018-11-23 15:09:10,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:09:10,446 INFO L93 Difference]: Finished difference Result 46 states and 56 transitions. [2018-11-23 15:09:10,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 15:09:10,447 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 56 transitions. [2018-11-23 15:09:10,447 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 20 [2018-11-23 15:09:10,448 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 46 states and 56 transitions. [2018-11-23 15:09:10,448 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 37 [2018-11-23 15:09:10,448 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 37 [2018-11-23 15:09:10,448 INFO L73 IsDeterministic]: Start isDeterministic. Operand 46 states and 56 transitions. [2018-11-23 15:09:10,448 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 15:09:10,448 INFO L705 BuchiCegarLoop]: Abstraction has 46 states and 56 transitions. [2018-11-23 15:09:10,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states and 56 transitions. [2018-11-23 15:09:10,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 31. [2018-11-23 15:09:10,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-23 15:09:10,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 38 transitions. [2018-11-23 15:09:10,450 INFO L728 BuchiCegarLoop]: Abstraction has 31 states and 38 transitions. [2018-11-23 15:09:10,450 INFO L608 BuchiCegarLoop]: Abstraction has 31 states and 38 transitions. [2018-11-23 15:09:10,450 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-23 15:09:10,450 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 38 transitions. [2018-11-23 15:09:10,450 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-11-23 15:09:10,450 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 15:09:10,450 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 15:09:10,451 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 15:09:10,451 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 15:09:10,451 INFO L794 eck$LassoCheckResult]: Stem: 831#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; 805#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; 806#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); 818#L17-2 init_#t~post0 := init_~i~0;init_~i~0 := 1 + init_#t~post0;havoc init_#t~post0; 819#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); 832#L17-2 init_#t~post0 := init_~i~0;init_~i~0 := 1 + init_#t~post0;havoc init_#t~post0; 833#L17-3 assume !(init_~i~0 < 2); 820#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; 803#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; 804#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; 817#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; 807#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); 808#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); 813#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; 814#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); 826#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); 809#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; 810#L36-3 [2018-11-23 15:09:10,451 INFO L796 eck$LassoCheckResult]: Loop: 810#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); 812#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; 816#L36-2 g_#t~post3 := g_~i~2;g_~i~2 := 1 + g_#t~post3;havoc g_#t~post3; 810#L36-3 [2018-11-23 15:09:10,451 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:09:10,451 INFO L82 PathProgramCache]: Analyzing trace with hash 689897275, now seen corresponding path program 1 times [2018-11-23 15:09:10,451 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:09:10,451 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:09:10,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:09:10,452 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:09:10,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:09:10,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:09:10,644 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-23 15:09:10,644 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 15:09:10,644 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-23 15:09:10,644 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 15:09:10,645 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:09:10,645 INFO L82 PathProgramCache]: Analyzing trace with hash 100776, now seen corresponding path program 2 times [2018-11-23 15:09:10,645 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:09:10,645 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:09:10,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:09:10,645 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:09:10,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:09:10,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:09:10,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:09:10,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 15:09:10,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-11-23 15:09:10,681 INFO L87 Difference]: Start difference. First operand 31 states and 38 transitions. cyclomatic complexity: 11 Second operand 9 states. [2018-11-23 15:09:10,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:09:10,857 INFO L93 Difference]: Finished difference Result 46 states and 55 transitions. [2018-11-23 15:09:10,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 15:09:10,857 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 55 transitions. [2018-11-23 15:09:10,858 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 20 [2018-11-23 15:09:10,858 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 45 states and 54 transitions. [2018-11-23 15:09:10,858 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 36 [2018-11-23 15:09:10,859 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2018-11-23 15:09:10,859 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 54 transitions. [2018-11-23 15:09:10,859 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 15:09:10,859 INFO L705 BuchiCegarLoop]: Abstraction has 45 states and 54 transitions. [2018-11-23 15:09:10,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states and 54 transitions. [2018-11-23 15:09:10,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 31. [2018-11-23 15:09:10,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-23 15:09:10,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 37 transitions. [2018-11-23 15:09:10,860 INFO L728 BuchiCegarLoop]: Abstraction has 31 states and 37 transitions. [2018-11-23 15:09:10,860 INFO L608 BuchiCegarLoop]: Abstraction has 31 states and 37 transitions. [2018-11-23 15:09:10,861 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-23 15:09:10,861 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 37 transitions. [2018-11-23 15:09:10,861 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-11-23 15:09:10,861 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 15:09:10,861 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 15:09:10,861 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 15:09:10,861 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 15:09:10,862 INFO L794 eck$LassoCheckResult]: Stem: 928#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; 902#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; 903#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); 915#L17-2 init_#t~post0 := init_~i~0;init_~i~0 := 1 + init_#t~post0;havoc init_#t~post0; 916#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); 929#L17-2 init_#t~post0 := init_~i~0;init_~i~0 := 1 + init_#t~post0;havoc init_#t~post0; 930#L17-3 assume !(init_~i~0 < 2); 917#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; 900#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; 901#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; 914#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; 904#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); 905#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); 910#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; 911#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); 922#L26-1 assume !(f_#t~mem2.base == 0 && f_#t~mem2.offset == 0);havoc f_#t~mem2.base, f_#t~mem2.offset; 926#L25-6 f_#t~post1 := f_~i~1;f_~i~1 := 1 + f_#t~post1;havoc f_#t~post1; 923#L25-7 assume !(f_~i~1 < 2); 906#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; 907#L36-3 [2018-11-23 15:09:10,862 INFO L796 eck$LassoCheckResult]: Loop: 907#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); 909#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; 913#L36-2 g_#t~post3 := g_~i~2;g_~i~2 := 1 + g_#t~post3;havoc g_#t~post3; 907#L36-3 [2018-11-23 15:09:10,862 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:09:10,862 INFO L82 PathProgramCache]: Analyzing trace with hash 1566375042, now seen corresponding path program 1 times [2018-11-23 15:09:10,862 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:09:10,862 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:09:10,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:09:10,863 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 15:09:10,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:09:10,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:09:10,886 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-23 15:09:10,886 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 15:09:10,887 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a700c152-43dc-4ffe-80b5-6dce24529833/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 15:09:10,900 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:09:10,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:09:10,923 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:09:10,927 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-23 15:09:10,943 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 15:09:10,943 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-23 15:09:10,943 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 15:09:10,943 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:09:10,943 INFO L82 PathProgramCache]: Analyzing trace with hash 100776, now seen corresponding path program 3 times [2018-11-23 15:09:10,943 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:09:10,943 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:09:10,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:09:10,944 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:09:10,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:09:10,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:09:10,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:09:10,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 15:09:10,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-23 15:09:10,985 INFO L87 Difference]: Start difference. First operand 31 states and 37 transitions. cyclomatic complexity: 10 Second operand 5 states. [2018-11-23 15:09:11,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:09:11,000 INFO L93 Difference]: Finished difference Result 46 states and 56 transitions. [2018-11-23 15:09:11,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 15:09:11,003 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 56 transitions. [2018-11-23 15:09:11,003 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 20 [2018-11-23 15:09:11,004 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 46 states and 56 transitions. [2018-11-23 15:09:11,004 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 36 [2018-11-23 15:09:11,004 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2018-11-23 15:09:11,004 INFO L73 IsDeterministic]: Start isDeterministic. Operand 46 states and 56 transitions. [2018-11-23 15:09:11,004 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 15:09:11,004 INFO L705 BuchiCegarLoop]: Abstraction has 46 states and 56 transitions. [2018-11-23 15:09:11,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states and 56 transitions. [2018-11-23 15:09:11,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 34. [2018-11-23 15:09:11,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-23 15:09:11,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 41 transitions. [2018-11-23 15:09:11,006 INFO L728 BuchiCegarLoop]: Abstraction has 34 states and 41 transitions. [2018-11-23 15:09:11,006 INFO L608 BuchiCegarLoop]: Abstraction has 34 states and 41 transitions. [2018-11-23 15:09:11,006 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-11-23 15:09:11,006 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 41 transitions. [2018-11-23 15:09:11,007 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-11-23 15:09:11,007 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 15:09:11,007 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 15:09:11,007 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 15:09:11,007 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 15:09:11,007 INFO L794 eck$LassoCheckResult]: Stem: 1068#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; 1041#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; 1042#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); 1054#L17-2 init_#t~post0 := init_~i~0;init_~i~0 := 1 + init_#t~post0;havoc init_#t~post0; 1055#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); 1069#L17-2 init_#t~post0 := init_~i~0;init_~i~0 := 1 + init_#t~post0;havoc init_#t~post0; 1071#L17-3 assume !(init_~i~0 < 2); 1056#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; 1039#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; 1040#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; 1053#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; 1043#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); 1044#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); 1049#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; 1050#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); 1061#L26-1 assume !(f_#t~mem2.base == 0 && f_#t~mem2.offset == 0);havoc f_#t~mem2.base, f_#t~mem2.offset; 1066#L25-6 f_#t~post1 := f_~i~1;f_~i~1 := 1 + f_#t~post1;havoc f_#t~post1; 1062#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); 1064#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); 1045#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; 1046#L36-3 [2018-11-23 15:09:11,008 INFO L796 eck$LassoCheckResult]: Loop: 1046#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); 1048#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; 1052#L36-2 g_#t~post3 := g_~i~2;g_~i~2 := 1 + g_#t~post3;havoc g_#t~post3; 1046#L36-3 [2018-11-23 15:09:11,008 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:09:11,008 INFO L82 PathProgramCache]: Analyzing trace with hash 1312987783, now seen corresponding path program 1 times [2018-11-23 15:09:11,008 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:09:11,008 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:09:11,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:09:11,008 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 15:09:11,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:09:11,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:09:11,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:09:11,043 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:09:11,043 INFO L82 PathProgramCache]: Analyzing trace with hash 100776, now seen corresponding path program 4 times [2018-11-23 15:09:11,043 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:09:11,043 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:09:11,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:09:11,045 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:09:11,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:09:11,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:09:11,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:09:11,049 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:09:11,049 INFO L82 PathProgramCache]: Analyzing trace with hash 951949666, now seen corresponding path program 1 times [2018-11-23 15:09:11,049 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:09:11,049 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:09:11,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:09:11,050 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 15:09:11,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:09:11,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:09:11,346 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 15:09:11,346 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 15:09:11,346 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a700c152-43dc-4ffe-80b5-6dce24529833/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 15:09:11,352 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:09:11,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:09:11,369 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:09:11,371 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-11-23 15:09:11,376 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-11-23 15:09:11,376 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 15:09:11,377 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:09:11,380 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:09:11,380 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:18, output treesize:11 [2018-11-23 15:09:11,429 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-11-23 15:09:11,431 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-11-23 15:09:11,431 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 15:09:11,440 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-11-23 15:09:11,442 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-11-23 15:09:11,442 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 15:09:11,445 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:09:11,446 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:09:11,455 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-11-23 15:09:11,457 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-11-23 15:09:11,457 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 15:09:11,464 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-11-23 15:09:11,466 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-11-23 15:09:11,466 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-23 15:09:11,473 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:09:11,475 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:09:11,480 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:09:11,480 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 2 variables, input treesize:73, output treesize:25 [2018-11-23 15:09:11,545 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-11-23 15:09:11,548 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:09:11,562 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-11-23 15:09:11,562 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 15:09:11,576 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-11-23 15:09:11,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-11-23 15:09:11,580 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 15:09:11,585 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:09:11,589 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:09:11,605 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-11-23 15:09:11,608 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:09:11,609 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-11-23 15:09:11,610 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 15:09:11,620 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-11-23 15:09:11,622 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-11-23 15:09:11,623 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-23 15:09:11,627 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:09:11,631 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:09:11,640 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:09:11,640 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 7 variables, input treesize:122, output treesize:21 [2018-11-23 15:09:11,672 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-11-23 15:09:11,674 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-11-23 15:09:11,674 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 15:09:11,677 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:09:11,682 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-11-23 15:09:11,685 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-11-23 15:09:11,685 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 15:09:11,686 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:09:11,689 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:09:11,690 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:32, output treesize:10 [2018-11-23 15:09:11,705 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-23 15:09:11,720 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 15:09:11,720 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 24 [2018-11-23 15:09:11,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-11-23 15:09:11,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=484, Unknown=0, NotChecked=0, Total=600 [2018-11-23 15:09:11,746 INFO L87 Difference]: Start difference. First operand 34 states and 41 transitions. cyclomatic complexity: 11 Second operand 25 states. [2018-11-23 15:09:12,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:09:12,161 INFO L93 Difference]: Finished difference Result 39 states and 46 transitions. [2018-11-23 15:09:12,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-23 15:09:12,162 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 46 transitions. [2018-11-23 15:09:12,162 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-11-23 15:09:12,162 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 39 states and 46 transitions. [2018-11-23 15:09:12,162 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2018-11-23 15:09:12,163 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2018-11-23 15:09:12,163 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 46 transitions. [2018-11-23 15:09:12,163 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 15:09:12,163 INFO L705 BuchiCegarLoop]: Abstraction has 39 states and 46 transitions. [2018-11-23 15:09:12,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 46 transitions. [2018-11-23 15:09:12,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 36. [2018-11-23 15:09:12,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-23 15:09:12,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 43 transitions. [2018-11-23 15:09:12,165 INFO L728 BuchiCegarLoop]: Abstraction has 36 states and 43 transitions. [2018-11-23 15:09:12,165 INFO L608 BuchiCegarLoop]: Abstraction has 36 states and 43 transitions. [2018-11-23 15:09:12,165 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-11-23 15:09:12,165 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 43 transitions. [2018-11-23 15:09:12,165 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-11-23 15:09:12,165 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 15:09:12,165 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 15:09:12,166 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-11-23 15:09:12,166 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-23 15:09:12,166 INFO L794 eck$LassoCheckResult]: Stem: 1258#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; 1230#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; 1231#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); 1244#L17-2 init_#t~post0 := init_~i~0;init_~i~0 := 1 + init_#t~post0;havoc init_#t~post0; 1245#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); 1259#L17-2 init_#t~post0 := init_~i~0;init_~i~0 := 1 + init_#t~post0;havoc init_#t~post0; 1263#L17-3 assume !(init_~i~0 < 2); 1246#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; 1228#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; 1229#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; 1243#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; 1232#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); 1233#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); 1237#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; 1238#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); 1251#L26-1 assume !(f_#t~mem2.base == 0 && f_#t~mem2.offset == 0);havoc f_#t~mem2.base, f_#t~mem2.offset; 1256#L25-6 f_#t~post1 := f_~i~1;f_~i~1 := 1 + f_#t~post1;havoc f_#t~post1; 1252#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); 1254#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); 1234#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; 1235#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); 1236#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); 1247#L39 [2018-11-23 15:09:12,166 INFO L796 eck$LassoCheckResult]: Loop: 1247#L39 assume 1 == g_#t~mem5; 1250#L4 havoc g_#t~mem5;call write~int(2, ~#pstate~0.base, ~#pstate~0.offset + 4 * g_~i~2, 4); 1239#L36-2 g_#t~post3 := g_~i~2;g_~i~2 := 1 + g_#t~post3;havoc g_#t~post3; 1240#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); 1262#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); 1247#L39 [2018-11-23 15:09:12,166 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:09:12,166 INFO L82 PathProgramCache]: Analyzing trace with hash -939123286, now seen corresponding path program 1 times [2018-11-23 15:09:12,166 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:09:12,167 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:09:12,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:09:12,167 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:09:12,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:09:12,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:09:12,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:09:12,214 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:09:12,214 INFO L82 PathProgramCache]: Analyzing trace with hash 102329555, now seen corresponding path program 1 times [2018-11-23 15:09:12,214 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:09:12,214 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:09:12,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:09:12,214 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:09:12,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:09:12,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:09:12,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:09:12,220 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:09:12,220 INFO L82 PathProgramCache]: Analyzing trace with hash -289378102, now seen corresponding path program 1 times [2018-11-23 15:09:12,220 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:09:12,220 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:09:12,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:09:12,221 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:09:12,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:09:12,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:09:12,579 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-23 15:09:12,580 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 15:09:12,580 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a700c152-43dc-4ffe-80b5-6dce24529833/bin-2019/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 15:09:12,588 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:09:12,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:09:12,609 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:09:12,612 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-11-23 15:09:12,628 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-11-23 15:09:12,628 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 15:09:12,630 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:09:12,633 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:09:12,633 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:18, output treesize:11 [2018-11-23 15:09:12,729 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-11-23 15:09:12,732 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-11-23 15:09:12,732 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 15:09:12,739 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-11-23 15:09:12,741 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-11-23 15:09:12,741 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 15:09:12,744 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:09:12,746 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:09:12,750 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:09:12,751 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:50, output treesize:20 [2018-11-23 15:09:12,800 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-11-23 15:09:12,803 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-11-23 15:09:12,803 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 15:09:12,806 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:09:12,811 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:09:12,812 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:46, output treesize:19 [2018-11-23 15:09:12,853 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-11-23 15:09:12,855 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-11-23 15:09:12,855 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 15:09:12,856 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:09:12,859 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:09:12,859 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:18, output treesize:7 [2018-11-23 15:09:12,880 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-23 15:09:12,895 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 15:09:12,895 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 24 [2018-11-23 15:09:12,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-11-23 15:09:12,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=588, Unknown=0, NotChecked=0, Total=650 [2018-11-23 15:09:12,980 INFO L87 Difference]: Start difference. First operand 36 states and 43 transitions. cyclomatic complexity: 11 Second operand 26 states. [2018-11-23 15:09:14,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:09:14,051 INFO L93 Difference]: Finished difference Result 72 states and 83 transitions. [2018-11-23 15:09:14,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-23 15:09:14,051 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 72 states and 83 transitions. [2018-11-23 15:09:14,052 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 26 [2018-11-23 15:09:14,053 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 72 states to 72 states and 83 transitions. [2018-11-23 15:09:14,053 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 60 [2018-11-23 15:09:14,053 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 60 [2018-11-23 15:09:14,053 INFO L73 IsDeterministic]: Start isDeterministic. Operand 72 states and 83 transitions. [2018-11-23 15:09:14,053 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 15:09:14,053 INFO L705 BuchiCegarLoop]: Abstraction has 72 states and 83 transitions. [2018-11-23 15:09:14,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states and 83 transitions. [2018-11-23 15:09:14,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 52. [2018-11-23 15:09:14,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-11-23 15:09:14,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 60 transitions. [2018-11-23 15:09:14,056 INFO L728 BuchiCegarLoop]: Abstraction has 52 states and 60 transitions. [2018-11-23 15:09:14,056 INFO L608 BuchiCegarLoop]: Abstraction has 52 states and 60 transitions. [2018-11-23 15:09:14,056 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2018-11-23 15:09:14,056 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 52 states and 60 transitions. [2018-11-23 15:09:14,056 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2018-11-23 15:09:14,057 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 15:09:14,057 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 15:09:14,057 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-11-23 15:09:14,057 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-23 15:09:14,057 INFO L794 eck$LassoCheckResult]: Stem: 1516#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; 1485#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; 1486#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); 1499#L17-2 init_#t~post0 := init_~i~0;init_~i~0 := 1 + init_#t~post0;havoc init_#t~post0; 1500#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); 1517#L17-2 init_#t~post0 := init_~i~0;init_~i~0 := 1 + init_#t~post0;havoc init_#t~post0; 1519#L17-3 assume !(init_~i~0 < 2); 1501#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; 1483#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; 1484#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; 1498#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; 1489#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); 1490#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); 1492#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; 1493#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); 1508#L26-1 assume !(f_#t~mem2.base == 0 && f_#t~mem2.offset == 0);havoc f_#t~mem2.base, f_#t~mem2.offset; 1522#L25-6 f_#t~post1 := f_~i~1;f_~i~1 := 1 + f_#t~post1;havoc f_#t~post1; 1509#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); 1510#L26-1 assume !(f_#t~mem2.base == 0 && f_#t~mem2.offset == 0);havoc f_#t~mem2.base, f_#t~mem2.offset; 1513#L25-6 f_#t~post1 := f_~i~1;f_~i~1 := 1 + f_#t~post1;havoc f_#t~post1; 1514#L25-7 assume !(f_~i~1 < 2); 1520#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; 1530#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); 1529#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); 1528#L39 [2018-11-23 15:09:14,057 INFO L796 eck$LassoCheckResult]: Loop: 1528#L39 assume 1 == g_#t~mem5; 1527#L4 havoc g_#t~mem5;call write~int(2, ~#pstate~0.base, ~#pstate~0.offset + 4 * g_~i~2, 4); 1526#L36-2 g_#t~post3 := g_~i~2;g_~i~2 := 1 + g_#t~post3;havoc g_#t~post3; 1523#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); 1524#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); 1528#L39 [2018-11-23 15:09:14,058 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:09:14,058 INFO L82 PathProgramCache]: Analyzing trace with hash -501415375, now seen corresponding path program 1 times [2018-11-23 15:09:14,058 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:09:14,058 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:09:14,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:09:14,058 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:09:14,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:09:14,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:09:14,507 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 15:09:14,507 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 15:09:14,507 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a700c152-43dc-4ffe-80b5-6dce24529833/bin-2019/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 15:09:14,513 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:09:14,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:09:14,532 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:09:14,536 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-11-23 15:09:14,543 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-11-23 15:09:14,543 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 15:09:14,544 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:09:14,546 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:09:14,546 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:18, output treesize:11 [2018-11-23 15:09:14,579 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-11-23 15:09:14,581 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-11-23 15:09:14,581 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 15:09:14,590 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-11-23 15:09:14,592 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-11-23 15:09:14,592 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 15:09:14,596 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:09:14,597 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:09:14,606 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-11-23 15:09:14,608 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-11-23 15:09:14,608 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 15:09:14,614 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-11-23 15:09:14,616 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-11-23 15:09:14,616 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-23 15:09:14,619 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:09:14,620 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:09:14,625 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:09:14,625 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 2 variables, input treesize:89, output treesize:29 [2018-11-23 15:09:14,679 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-11-23 15:09:14,682 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:09:14,684 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 31 [2018-11-23 15:09:14,684 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 15:09:14,696 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-11-23 15:09:14,698 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-11-23 15:09:14,698 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 15:09:14,703 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:09:14,707 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:09:14,719 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-11-23 15:09:14,722 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:09:14,723 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-11-23 15:09:14,723 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 15:09:14,732 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-11-23 15:09:14,734 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-11-23 15:09:14,734 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-23 15:09:14,737 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:09:14,740 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:09:14,747 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:09:14,747 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 7 variables, input treesize:123, output treesize:22 [2018-11-23 15:09:14,786 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-11-23 15:09:14,787 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-11-23 15:09:14,787 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 15:09:14,788 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:09:14,792 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-11-23 15:09:14,793 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-11-23 15:09:14,793 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 15:09:14,794 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:09:14,796 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:09:14,797 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:29, output treesize:7 [2018-11-23 15:09:14,809 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 15:09:14,824 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 15:09:14,824 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 24 [2018-11-23 15:09:14,824 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 15:09:14,824 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:09:14,824 INFO L82 PathProgramCache]: Analyzing trace with hash 102329555, now seen corresponding path program 2 times [2018-11-23 15:09:14,824 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:09:14,824 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:09:14,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:09:14,825 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:09:14,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:09:14,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:09:14,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:09:14,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-11-23 15:09:14,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=508, Unknown=0, NotChecked=0, Total=600 [2018-11-23 15:09:14,947 INFO L87 Difference]: Start difference. First operand 52 states and 60 transitions. cyclomatic complexity: 13 Second operand 25 states. [2018-11-23 15:09:15,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:09:15,530 INFO L93 Difference]: Finished difference Result 37 states and 40 transitions. [2018-11-23 15:09:15,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-23 15:09:15,531 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 40 transitions. [2018-11-23 15:09:15,531 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2018-11-23 15:09:15,531 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 36 states and 39 transitions. [2018-11-23 15:09:15,531 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2018-11-23 15:09:15,531 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 31 [2018-11-23 15:09:15,532 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 39 transitions. [2018-11-23 15:09:15,532 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 15:09:15,532 INFO L705 BuchiCegarLoop]: Abstraction has 36 states and 39 transitions. [2018-11-23 15:09:15,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 39 transitions. [2018-11-23 15:09:15,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2018-11-23 15:09:15,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-23 15:09:15,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2018-11-23 15:09:15,534 INFO L728 BuchiCegarLoop]: Abstraction has 35 states and 38 transitions. [2018-11-23 15:09:15,534 INFO L608 BuchiCegarLoop]: Abstraction has 35 states and 38 transitions. [2018-11-23 15:09:15,534 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2018-11-23 15:09:15,534 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 38 transitions. [2018-11-23 15:09:15,535 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2018-11-23 15:09:15,535 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 15:09:15,535 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 15:09:15,535 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 15:09:15,535 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 15:09:15,536 INFO L794 eck$LassoCheckResult]: Stem: 1719#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; 1693#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; 1694#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); 1707#L17-2 init_#t~post0 := init_~i~0;init_~i~0 := 1 + init_#t~post0;havoc init_#t~post0; 1708#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); 1720#L17-2 init_#t~post0 := init_~i~0;init_~i~0 := 1 + init_#t~post0;havoc init_#t~post0; 1725#L17-3 assume !(init_~i~0 < 2); 1709#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; 1691#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; 1692#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; 1706#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; 1697#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); 1698#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); 1700#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; 1701#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); 1724#L26-1 assume !(f_#t~mem2.base == 0 && f_#t~mem2.offset == 0);havoc f_#t~mem2.base, f_#t~mem2.offset; 1717#L25-6 f_#t~post1 := f_~i~1;f_~i~1 := 1 + f_#t~post1;havoc f_#t~post1; 1714#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); 1715#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); 1695#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; 1696#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); 1699#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); 1710#L39 assume 1 == g_#t~mem5; 1713#L4 havoc g_#t~mem5;call write~int(2, ~#pstate~0.base, ~#pstate~0.offset + 4 * g_~i~2, 4); 1702#L36-2 g_#t~post3 := g_~i~2;g_~i~2 := 1 + g_#t~post3;havoc g_#t~post3; 1703#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); 1722#L37 [2018-11-23 15:09:15,536 INFO L796 eck$LassoCheckResult]: Loop: 1722#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; 1723#L36-2 g_#t~post3 := g_~i~2;g_~i~2 := 1 + g_#t~post3;havoc g_#t~post3; 1721#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); 1722#L37 [2018-11-23 15:09:15,536 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:09:15,536 INFO L82 PathProgramCache]: Analyzing trace with hash -147882112, now seen corresponding path program 2 times [2018-11-23 15:09:15,536 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:09:15,536 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:09:15,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:09:15,537 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 15:09:15,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:09:15,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:09:15,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:09:15,591 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:09:15,592 INFO L82 PathProgramCache]: Analyzing trace with hash 115236, now seen corresponding path program 5 times [2018-11-23 15:09:15,592 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:09:15,592 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:09:15,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:09:15,592 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 15:09:15,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:09:15,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:09:15,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:09:15,595 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:09:15,595 INFO L82 PathProgramCache]: Analyzing trace with hash 1080532549, now seen corresponding path program 1 times [2018-11-23 15:09:15,595 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:09:15,595 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:09:15,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:09:15,596 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 15:09:15,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:09:15,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:09:15,652 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-23 15:09:15,652 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 15:09:15,652 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a700c152-43dc-4ffe-80b5-6dce24529833/bin-2019/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 15:09:15,664 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:09:15,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:09:15,697 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:09:15,701 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-23 15:09:15,727 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-23 15:09:15,727 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2018-11-23 15:09:15,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 15:09:15,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-23 15:09:15,785 INFO L87 Difference]: Start difference. First operand 35 states and 38 transitions. cyclomatic complexity: 6 Second operand 6 states. [2018-11-23 15:09:15,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:09:15,842 INFO L93 Difference]: Finished difference Result 41 states and 43 transitions. [2018-11-23 15:09:15,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 15:09:15,844 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 43 transitions. [2018-11-23 15:09:15,845 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-23 15:09:15,845 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 0 states and 0 transitions. [2018-11-23 15:09:15,845 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-23 15:09:15,845 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-23 15:09:15,845 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-23 15:09:15,845 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 15:09:15,845 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 15:09:15,845 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 15:09:15,845 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 15:09:15,845 INFO L442 BuchiCegarLoop]: ======== Iteration 13============ [2018-11-23 15:09:15,845 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-23 15:09:15,845 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-23 15:09:15,846 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-23 15:09:15,851 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 23.11 03:09:15 BoogieIcfgContainer [2018-11-23 15:09:15,851 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-23 15:09:15,851 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 15:09:15,851 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 15:09:15,851 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 15:09:15,852 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:07:38" (3/4) ... [2018-11-23 15:09:15,855 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-23 15:09:15,855 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 15:09:15,856 INFO L168 Benchmark]: Toolchain (without parser) took 98394.25 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 254.3 MB). Free memory was 959.1 MB in the beginning and 1.2 GB in the end (delta: -239.4 MB). Peak memory consumption was 14.9 MB. Max. memory is 11.5 GB. [2018-11-23 15:09:15,856 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 15:09:15,856 INFO L168 Benchmark]: CACSL2BoogieTranslator took 165.09 ms. Allocated memory is still 1.0 GB. Free memory was 959.1 MB in the beginning and 945.5 MB in the end (delta: 13.6 MB). Peak memory consumption was 13.6 MB. Max. memory is 11.5 GB. [2018-11-23 15:09:15,857 INFO L168 Benchmark]: Boogie Procedure Inliner took 75.43 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 150.5 MB). Free memory was 945.5 MB in the beginning and 1.1 GB in the end (delta: -199.9 MB). Peak memory consumption was 14.3 MB. Max. memory is 11.5 GB. [2018-11-23 15:09:15,859 INFO L168 Benchmark]: Boogie Preprocessor took 25.65 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-11-23 15:09:15,859 INFO L168 Benchmark]: RCFGBuilder took 282.30 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 27.9 MB). Peak memory consumption was 27.9 MB. Max. memory is 11.5 GB. [2018-11-23 15:09:15,859 INFO L168 Benchmark]: BuchiAutomizer took 97839.10 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 103.8 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -87.8 MB). Peak memory consumption was 16.0 MB. Max. memory is 11.5 GB. [2018-11-23 15:09:15,859 INFO L168 Benchmark]: Witness Printer took 3.91 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 15:09:15,861 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.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 165.09 ms. Allocated memory is still 1.0 GB. Free memory was 959.1 MB in the beginning and 945.5 MB in the end (delta: 13.6 MB). Peak memory consumption was 13.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 75.43 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 150.5 MB). Free memory was 945.5 MB in the beginning and 1.1 GB in the end (delta: -199.9 MB). Peak memory consumption was 14.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 25.65 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. * RCFGBuilder took 282.30 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 27.9 MB). Peak memory consumption was 27.9 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 97839.10 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 103.8 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -87.8 MB). Peak memory consumption was 16.0 MB. Max. memory is 11.5 GB. * Witness Printer took 3.91 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length * 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 3 * unknown-#length-unknown[pp] + -8 * i 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 97.7s and 13 iterations. TraceHistogramMax:2. Analysis of lassos took 93.6s. Construction of modules took 1.3s. Büchi inclusion checks took 2.6s. 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: 288 SDtfs, 855 SDslu, 883 SDs, 0 SdLazy, 1450 SolverSat, 324 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 1.3s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc4 concLT0 SILN0 SILU6 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital1131 mio100 ax100 hnf99 lsp96 ukn24 mio100 lsp52 div100 bol100 ite100 ukn100 eq177 hnf67 smp100 dnf100 smp100 tf100 neg100 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 9ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...