./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-crafted/4BitCounterPointer.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 678e0110 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_347c403d-729d-4d89-bb97-94cf4a62af01/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_347c403d-729d-4d89-bb97-94cf4a62af01/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_347c403d-729d-4d89-bb97-94cf4a62af01/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_347c403d-729d-4d89-bb97-94cf4a62af01/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-crafted/4BitCounterPointer.c -s /tmp/vcloud-vcloud-master/worker/run_dir_347c403d-729d-4d89-bb97-94cf4a62af01/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_347c403d-729d-4d89-bb97-94cf4a62af01/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 0233d496bfaf5cb1311bfa260a57f41458184795 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-678e011 [2019-11-19 22:10:35,145 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-19 22:10:35,147 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-19 22:10:35,160 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-19 22:10:35,161 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-19 22:10:35,162 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-19 22:10:35,163 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-19 22:10:35,172 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-19 22:10:35,176 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-19 22:10:35,180 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-19 22:10:35,181 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-19 22:10:35,182 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-19 22:10:35,182 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-19 22:10:35,185 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-19 22:10:35,186 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-19 22:10:35,186 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-19 22:10:35,187 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-19 22:10:35,188 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-19 22:10:35,190 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-19 22:10:35,194 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-19 22:10:35,197 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-19 22:10:35,199 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-19 22:10:35,201 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-19 22:10:35,202 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-19 22:10:35,204 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-19 22:10:35,205 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-19 22:10:35,205 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-19 22:10:35,206 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-19 22:10:35,207 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-19 22:10:35,208 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-19 22:10:35,208 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-19 22:10:35,208 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-19 22:10:35,209 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-19 22:10:35,210 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-19 22:10:35,211 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-19 22:10:35,211 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-19 22:10:35,211 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-19 22:10:35,212 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-19 22:10:35,212 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-19 22:10:35,213 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-19 22:10:35,214 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-19 22:10:35,214 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_347c403d-729d-4d89-bb97-94cf4a62af01/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-11-19 22:10:35,240 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-19 22:10:35,250 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-19 22:10:35,251 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-19 22:10:35,251 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-19 22:10:35,251 INFO L138 SettingsManager]: * Use SBE=true [2019-11-19 22:10:35,251 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-19 22:10:35,251 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-19 22:10:35,252 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-19 22:10:35,252 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-19 22:10:35,252 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-19 22:10:35,252 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-19 22:10:35,253 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-19 22:10:35,253 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-19 22:10:35,253 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-19 22:10:35,253 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-19 22:10:35,253 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-19 22:10:35,254 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-19 22:10:35,254 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-19 22:10:35,254 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-19 22:10:35,255 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-19 22:10:35,255 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-19 22:10:35,255 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-19 22:10:35,255 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-19 22:10:35,256 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-19 22:10:35,256 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-19 22:10:35,256 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-19 22:10:35,257 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-19 22:10:35,257 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-19 22:10:35,258 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-19 22:10:35,259 INFO L138 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/run_dir_347c403d-729d-4d89-bb97-94cf4a62af01/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0233d496bfaf5cb1311bfa260a57f41458184795 [2019-11-19 22:10:35,431 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-19 22:10:35,444 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-19 22:10:35,447 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-19 22:10:35,449 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-19 22:10:35,450 INFO L275 PluginConnector]: CDTParser initialized [2019-11-19 22:10:35,451 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_347c403d-729d-4d89-bb97-94cf4a62af01/bin/uautomizer/../../sv-benchmarks/c/termination-crafted/4BitCounterPointer.c [2019-11-19 22:10:35,509 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_347c403d-729d-4d89-bb97-94cf4a62af01/bin/uautomizer/data/0d44c140e/d64b629dfc5b409cba7c68593f7ddce9/FLAG1f6d55586 [2019-11-19 22:10:35,894 INFO L306 CDTParser]: Found 1 translation units. [2019-11-19 22:10:35,894 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_347c403d-729d-4d89-bb97-94cf4a62af01/sv-benchmarks/c/termination-crafted/4BitCounterPointer.c [2019-11-19 22:10:35,899 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_347c403d-729d-4d89-bb97-94cf4a62af01/bin/uautomizer/data/0d44c140e/d64b629dfc5b409cba7c68593f7ddce9/FLAG1f6d55586 [2019-11-19 22:10:36,307 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_347c403d-729d-4d89-bb97-94cf4a62af01/bin/uautomizer/data/0d44c140e/d64b629dfc5b409cba7c68593f7ddce9 [2019-11-19 22:10:36,309 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-19 22:10:36,326 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-19 22:10:36,332 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-19 22:10:36,332 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-19 22:10:36,335 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-19 22:10:36,336 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 10:10:36" (1/1) ... [2019-11-19 22:10:36,338 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b3c7c74 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:10:36, skipping insertion in model container [2019-11-19 22:10:36,344 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 10:10:36" (1/1) ... [2019-11-19 22:10:36,350 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-19 22:10:36,388 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-19 22:10:36,677 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 22:10:36,687 INFO L188 MainTranslator]: Completed pre-run [2019-11-19 22:10:36,710 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 22:10:36,724 INFO L192 MainTranslator]: Completed translation [2019-11-19 22:10:36,725 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:10:36 WrapperNode [2019-11-19 22:10:36,725 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-19 22:10:36,726 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-19 22:10:36,726 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-19 22:10:36,726 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-19 22:10:36,735 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:10:36" (1/1) ... [2019-11-19 22:10:36,746 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:10:36" (1/1) ... [2019-11-19 22:10:36,768 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-19 22:10:36,769 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-19 22:10:36,769 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-19 22:10:36,769 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-19 22:10:36,778 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:10:36" (1/1) ... [2019-11-19 22:10:36,778 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:10:36" (1/1) ... [2019-11-19 22:10:36,791 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:10:36" (1/1) ... [2019-11-19 22:10:36,792 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:10:36" (1/1) ... [2019-11-19 22:10:36,796 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:10:36" (1/1) ... [2019-11-19 22:10:36,804 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:10:36" (1/1) ... [2019-11-19 22:10:36,812 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:10:36" (1/1) ... [2019-11-19 22:10:36,814 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-19 22:10:36,815 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-19 22:10:36,815 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-19 22:10:36,815 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-19 22:10:36,816 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:10:36" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_347c403d-729d-4d89-bb97-94cf4a62af01/bin/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 [2019-11-19 22:10:36,880 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-19 22:10:36,881 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-19 22:10:36,881 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-19 22:10:36,882 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-19 22:10:36,882 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-19 22:10:36,882 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-19 22:10:37,127 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-19 22:10:37,127 INFO L285 CfgBuilder]: Removed 5 assume(true) statements. [2019-11-19 22:10:37,128 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:10:37 BoogieIcfgContainer [2019-11-19 22:10:37,129 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-19 22:10:37,129 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-19 22:10:37,129 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-19 22:10:37,133 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-19 22:10:37,134 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-19 22:10:37,134 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 19.11 10:10:36" (1/3) ... [2019-11-19 22:10:37,136 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@301279d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 19.11 10:10:37, skipping insertion in model container [2019-11-19 22:10:37,136 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-19 22:10:37,136 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:10:36" (2/3) ... [2019-11-19 22:10:37,137 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@301279d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 19.11 10:10:37, skipping insertion in model container [2019-11-19 22:10:37,137 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-19 22:10:37,137 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:10:37" (3/3) ... [2019-11-19 22:10:37,138 INFO L371 chiAutomizerObserver]: Analyzing ICFG 4BitCounterPointer.c [2019-11-19 22:10:37,207 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-19 22:10:37,220 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-19 22:10:37,221 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-19 22:10:37,221 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-19 22:10:37,221 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-19 22:10:37,221 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-19 22:10:37,236 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-19 22:10:37,237 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-19 22:10:37,250 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states. [2019-11-19 22:10:37,283 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-19 22:10:37,293 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-19 22:10:37,294 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-19 22:10:37,301 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-19 22:10:37,301 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-19 22:10:37,301 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-19 22:10:37,301 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states. [2019-11-19 22:10:37,302 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-19 22:10:37,302 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-19 22:10:37,303 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-19 22:10:37,303 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-19 22:10:37,303 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-19 22:10:37,311 INFO L794 eck$LassoCheckResult]: Stem: 4#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 3#L-1true havoc main_#res;havoc main_#t~malloc0.base, main_#t~malloc0.offset, main_#t~malloc1.base, main_#t~malloc1.offset, main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem5, main_#t~mem6, main_#t~mem7, main_#t~mem4, main_~x0~0.base, main_~x0~0.offset, main_~x1~0.base, main_~x1~0.offset, main_~x2~0.base, main_~x2~0.offset, main_~x3~0.base, main_~x3~0.offset;call main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.allocOnStack(4);main_~x0~0.base, main_~x0~0.offset := main_#t~malloc0.base, main_#t~malloc0.offset;call main_#t~malloc1.base, main_#t~malloc1.offset := #Ultimate.allocOnStack(4);main_~x1~0.base, main_~x1~0.offset := main_#t~malloc1.base, main_#t~malloc1.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x2~0.base, main_~x2~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~x3~0.base, main_~x3~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call write~int(0, main_~x1~0.base, main_~x1~0.offset, 4);call write~int(0, main_~x2~0.base, main_~x2~0.offset, 4);call write~int(0, main_~x3~0.base, main_~x3~0.offset, 4); 6#L24-2true [2019-11-19 22:10:37,311 INFO L796 eck$LassoCheckResult]: Loop: 6#L24-2true call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 12#L15-1true assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 5#L16true assume 0 == main_#t~mem5;havoc main_#t~mem5;call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); 6#L24-2true [2019-11-19 22:10:37,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:10:37,333 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2019-11-19 22:10:37,341 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:10:37,341 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372136130] [2019-11-19 22:10:37,342 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:10:37,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:10:37,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:10:37,587 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 22:10:37,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:10:37,588 INFO L82 PathProgramCache]: Analyzing trace with hash 36905, now seen corresponding path program 1 times [2019-11-19 22:10:37,588 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:10:37,588 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625471219] [2019-11-19 22:10:37,588 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:10:37,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:10:37,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:10:37,607 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 22:10:37,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:10:37,609 INFO L82 PathProgramCache]: Analyzing trace with hash 28695847, now seen corresponding path program 1 times [2019-11-19 22:10:37,609 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:10:37,609 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426537378] [2019-11-19 22:10:37,609 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:10:37,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:10:37,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:10:37,710 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 22:10:38,556 WARN L191 SmtUtils]: Spent 727.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 91 [2019-11-19 22:10:38,795 WARN L191 SmtUtils]: Spent 235.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2019-11-19 22:10:38,808 INFO L210 LassoAnalysis]: Preferences: [2019-11-19 22:10:38,808 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-19 22:10:38,808 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-19 22:10:38,808 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-19 22:10:38,809 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-19 22:10:38,809 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:10:38,809 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-19 22:10:38,809 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-19 22:10:38,809 INFO L133 ssoRankerPreferences]: Filename of dumped script: 4BitCounterPointer.c_Iteration1_Lasso [2019-11-19 22:10:38,809 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-19 22:10:38,810 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-19 22:10:38,849 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:10:38,857 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:10:38,863 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:10:38,866 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:10:38,873 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:10:39,448 WARN L191 SmtUtils]: Spent 311.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 76 [2019-11-19 22:10:39,637 WARN L191 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 62 [2019-11-19 22:10:39,638 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:10:39,642 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:10:39,645 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:10:39,649 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:10:39,794 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 34 [2019-11-19 22:10:40,245 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-19 22:10:40,249 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_347c403d-729d-4d89-bb97-94cf4a62af01/bin/uautomizer/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-19 22:10:40,258 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:10:40,260 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:10:40,260 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 22:10:40,261 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:10:40,261 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:10:40,261 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:10:40,263 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 22:10:40,263 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-19 22:10:40,270 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_347c403d-729d-4d89-bb97-94cf4a62af01/bin/uautomizer/z3 Starting monitored process 3 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 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:10:40,286 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-19 22:10:40,287 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:10:40,287 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:10:40,288 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:10:40,288 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:10:40,292 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-19 22:10:40,293 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-19 22:10:40,296 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_347c403d-729d-4d89-bb97-94cf4a62af01/bin/uautomizer/z3 Starting monitored process 4 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 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:10:40,300 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-19 22:10:40,302 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:10:40,302 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 22:10:40,302 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:10:40,302 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:10:40,302 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:10:40,303 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 22:10:40,303 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-19 22:10:40,304 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_347c403d-729d-4d89-bb97-94cf4a62af01/bin/uautomizer/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-19 22:10:40,329 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-19 22:10:40,331 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:10:40,331 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:10:40,331 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:10:40,332 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:10:40,335 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-19 22:10:40,335 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:10:40,339 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_347c403d-729d-4d89-bb97-94cf4a62af01/bin/uautomizer/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-19 22:10:40,353 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-19 22:10:40,355 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:10:40,356 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:10:40,356 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:10:40,356 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:10:40,369 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-19 22:10:40,370 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-19 22:10:40,389 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_347c403d-729d-4d89-bb97-94cf4a62af01/bin/uautomizer/z3 Starting monitored process 7 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 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:10:40,409 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-19 22:10:40,411 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:10:40,412 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:10:40,412 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:10:40,412 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:10:40,420 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-19 22:10:40,421 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-19 22:10:40,432 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_347c403d-729d-4d89-bb97-94cf4a62af01/bin/uautomizer/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-19 22:10:40,449 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-19 22:10:40,451 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:10:40,451 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:10:40,451 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:10:40,451 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:10:40,454 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-19 22:10:40,454 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:10:40,460 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_347c403d-729d-4d89-bb97-94cf4a62af01/bin/uautomizer/z3 Starting monitored process 9 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 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:10:40,473 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-19 22:10:40,475 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:10:40,475 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:10:40,475 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:10:40,475 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:10:40,478 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-19 22:10:40,478 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-19 22:10:40,482 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_347c403d-729d-4d89-bb97-94cf4a62af01/bin/uautomizer/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-19 22:10:40,499 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-19 22:10:40,500 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:10:40,500 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:10:40,501 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:10:40,501 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:10:40,503 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-19 22:10:40,504 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:10:40,508 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_347c403d-729d-4d89-bb97-94cf4a62af01/bin/uautomizer/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-19 22:10:40,525 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-19 22:10:40,526 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:10:40,526 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:10:40,527 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:10:40,527 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:10:40,531 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-19 22:10:40,531 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:10:40,537 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_347c403d-729d-4d89-bb97-94cf4a62af01/bin/uautomizer/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-19 22:10:40,553 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-19 22:10:40,555 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:10:40,555 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:10:40,555 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:10:40,555 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:10:40,557 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-19 22:10:40,557 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:10:40,562 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_347c403d-729d-4d89-bb97-94cf4a62af01/bin/uautomizer/z3 Starting monitored process 13 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 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:10:40,569 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-19 22:10:40,571 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:10:40,571 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:10:40,571 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:10:40,571 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:10:40,577 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-19 22:10:40,577 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-19 22:10:40,580 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_347c403d-729d-4d89-bb97-94cf4a62af01/bin/uautomizer/z3 Starting monitored process 14 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 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:10:40,594 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-19 22:10:40,596 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:10:40,596 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:10:40,597 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:10:40,597 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:10:40,607 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-19 22:10:40,607 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-19 22:10:40,613 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_347c403d-729d-4d89-bb97-94cf4a62af01/bin/uautomizer/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-19 22:10:40,630 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-19 22:10:40,632 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:10:40,632 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:10:40,632 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:10:40,633 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:10:40,636 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-19 22:10:40,636 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:10:40,642 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_347c403d-729d-4d89-bb97-94cf4a62af01/bin/uautomizer/z3 Starting monitored process 16 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 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:10:40,652 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-19 22:10:40,653 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:10:40,653 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:10:40,654 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:10:40,654 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:10:40,657 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-19 22:10:40,657 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-19 22:10:40,665 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_347c403d-729d-4d89-bb97-94cf4a62af01/bin/uautomizer/z3 Starting monitored process 17 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 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:10:40,681 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-19 22:10:40,683 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:10:40,683 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:10:40,683 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:10:40,683 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:10:40,685 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-19 22:10:40,686 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-19 22:10:40,690 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_347c403d-729d-4d89-bb97-94cf4a62af01/bin/uautomizer/z3 Starting monitored process 18 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 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:10:40,709 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-19 22:10:40,711 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:10:40,711 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:10:40,711 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:10:40,711 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:10:40,714 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-19 22:10:40,714 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-19 22:10:40,719 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-19 22:10:40,754 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2019-11-19 22:10:40,754 INFO L444 ModelExtractionUtils]: 2 out of 7 variables were initially zero. Simplification set additionally 2 variables to zero. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_347c403d-729d-4d89-bb97-94cf4a62af01/bin/uautomizer/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-19 22:10:40,775 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:10:40,778 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-19 22:10:40,778 INFO L510 LassoAnalysis]: Proved termination. [2019-11-19 22:10:40,779 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~x0~0.base) ULTIMATE.start_main_~x0~0.offset)_1) = -2*v_rep(select (select #memory_int ULTIMATE.start_main_~x0~0.base) ULTIMATE.start_main_~x0~0.offset)_1 + 1 Supporting invariants [] [2019-11-19 22:10:40,981 INFO L297 tatePredicateManager]: 40 out of 40 supporting invariants were superfluous and have been removed [2019-11-19 22:10:40,989 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-19 22:10:41,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:10:41,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:10:41,037 INFO L255 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-19 22:10:41,038 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:10:41,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:10:41,059 INFO L255 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-19 22:10:41,060 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:10:41,075 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:10:41,091 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 [2019-11-19 22:10:41,092 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states. Second operand 4 states. [2019-11-19 22:10:41,155 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states.. Second operand 4 states. Result 29 states and 36 transitions. Complement of second has 8 states. [2019-11-19 22:10:41,158 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 [2019-11-19 22:10:41,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-19 22:10:41,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 13 transitions. [2019-11-19 22:10:41,161 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 2 letters. Loop has 3 letters. [2019-11-19 22:10:41,162 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-19 22:10:41,162 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 5 letters. Loop has 3 letters. [2019-11-19 22:10:41,163 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-19 22:10:41,163 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 2 letters. Loop has 6 letters. [2019-11-19 22:10:41,163 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-19 22:10:41,164 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 36 transitions. [2019-11-19 22:10:41,170 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-19 22:10:41,175 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 13 states and 18 transitions. [2019-11-19 22:10:41,182 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2019-11-19 22:10:41,183 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-11-19 22:10:41,183 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 18 transitions. [2019-11-19 22:10:41,183 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-19 22:10:41,184 INFO L688 BuchiCegarLoop]: Abstraction has 13 states and 18 transitions. [2019-11-19 22:10:41,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 18 transitions. [2019-11-19 22:10:41,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-11-19 22:10:41,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-11-19 22:10:41,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 18 transitions. [2019-11-19 22:10:41,213 INFO L711 BuchiCegarLoop]: Abstraction has 13 states and 18 transitions. [2019-11-19 22:10:41,214 INFO L591 BuchiCegarLoop]: Abstraction has 13 states and 18 transitions. [2019-11-19 22:10:41,214 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-19 22:10:41,214 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 18 transitions. [2019-11-19 22:10:41,215 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-19 22:10:41,215 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-19 22:10:41,216 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-19 22:10:41,216 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-19 22:10:41,216 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-19 22:10:41,217 INFO L794 eck$LassoCheckResult]: Stem: 245#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 243#L-1 havoc main_#res;havoc main_#t~malloc0.base, main_#t~malloc0.offset, main_#t~malloc1.base, main_#t~malloc1.offset, main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem5, main_#t~mem6, main_#t~mem7, main_#t~mem4, main_~x0~0.base, main_~x0~0.offset, main_~x1~0.base, main_~x1~0.offset, main_~x2~0.base, main_~x2~0.offset, main_~x3~0.base, main_~x3~0.offset;call main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.allocOnStack(4);main_~x0~0.base, main_~x0~0.offset := main_#t~malloc0.base, main_#t~malloc0.offset;call main_#t~malloc1.base, main_#t~malloc1.offset := #Ultimate.allocOnStack(4);main_~x1~0.base, main_~x1~0.offset := main_#t~malloc1.base, main_#t~malloc1.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x2~0.base, main_~x2~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~x3~0.base, main_~x3~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call write~int(0, main_~x1~0.base, main_~x1~0.offset, 4);call write~int(0, main_~x2~0.base, main_~x2~0.offset, 4);call write~int(0, main_~x3~0.base, main_~x3~0.offset, 4); 244#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 253#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 246#L16 assume !(0 == main_#t~mem5);havoc main_#t~mem5;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 247#L20 [2019-11-19 22:10:41,217 INFO L796 eck$LassoCheckResult]: Loop: 247#L20 assume 0 == main_#t~mem6;havoc main_#t~mem6;call write~int(1, main_~x1~0.base, main_~x1~0.offset, 4); 250#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 251#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 255#L16 assume !(0 == main_#t~mem5);havoc main_#t~mem5;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 247#L20 [2019-11-19 22:10:41,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:10:41,217 INFO L82 PathProgramCache]: Analyzing trace with hash 28695849, now seen corresponding path program 1 times [2019-11-19 22:10:41,218 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:10:41,218 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704489573] [2019-11-19 22:10:41,218 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:10:41,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:10:41,383 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:10:41,384 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704489573] [2019-11-19 22:10:41,384 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:10:41,384 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 22:10:41,385 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236961396] [2019-11-19 22:10:41,387 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-19 22:10:41,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:10:41,387 INFO L82 PathProgramCache]: Analyzing trace with hash 1526457, now seen corresponding path program 1 times [2019-11-19 22:10:41,387 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:10:41,387 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927151327] [2019-11-19 22:10:41,387 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:10:41,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:10:41,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:10:41,399 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 22:10:41,492 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:10:41,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-19 22:10:41,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-19 22:10:41,495 INFO L87 Difference]: Start difference. First operand 13 states and 18 transitions. cyclomatic complexity: 7 Second operand 5 states. [2019-11-19 22:10:41,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:10:41,593 INFO L93 Difference]: Finished difference Result 20 states and 24 transitions. [2019-11-19 22:10:41,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-19 22:10:41,595 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 24 transitions. [2019-11-19 22:10:41,596 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-11-19 22:10:41,597 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 18 states and 22 transitions. [2019-11-19 22:10:41,597 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2019-11-19 22:10:41,597 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2019-11-19 22:10:41,597 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 22 transitions. [2019-11-19 22:10:41,597 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-19 22:10:41,597 INFO L688 BuchiCegarLoop]: Abstraction has 18 states and 22 transitions. [2019-11-19 22:10:41,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 22 transitions. [2019-11-19 22:10:41,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 16. [2019-11-19 22:10:41,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-11-19 22:10:41,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 20 transitions. [2019-11-19 22:10:41,599 INFO L711 BuchiCegarLoop]: Abstraction has 16 states and 20 transitions. [2019-11-19 22:10:41,599 INFO L591 BuchiCegarLoop]: Abstraction has 16 states and 20 transitions. [2019-11-19 22:10:41,599 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-19 22:10:41,600 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 20 transitions. [2019-11-19 22:10:41,600 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-11-19 22:10:41,600 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-19 22:10:41,600 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-19 22:10:41,601 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1] [2019-11-19 22:10:41,601 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-19 22:10:41,601 INFO L794 eck$LassoCheckResult]: Stem: 290#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 288#L-1 havoc main_#res;havoc main_#t~malloc0.base, main_#t~malloc0.offset, main_#t~malloc1.base, main_#t~malloc1.offset, main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem5, main_#t~mem6, main_#t~mem7, main_#t~mem4, main_~x0~0.base, main_~x0~0.offset, main_~x1~0.base, main_~x1~0.offset, main_~x2~0.base, main_~x2~0.offset, main_~x3~0.base, main_~x3~0.offset;call main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.allocOnStack(4);main_~x0~0.base, main_~x0~0.offset := main_#t~malloc0.base, main_#t~malloc0.offset;call main_#t~malloc1.base, main_#t~malloc1.offset := #Ultimate.allocOnStack(4);main_~x1~0.base, main_~x1~0.offset := main_#t~malloc1.base, main_#t~malloc1.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x2~0.base, main_~x2~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~x3~0.base, main_~x3~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call write~int(0, main_~x1~0.base, main_~x1~0.offset, 4);call write~int(0, main_~x2~0.base, main_~x2~0.offset, 4);call write~int(0, main_~x3~0.base, main_~x3~0.offset, 4); 289#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 296#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 293#L16 assume 0 == main_#t~mem5;havoc main_#t~mem5;call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); 294#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 297#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 300#L16 assume !(0 == main_#t~mem5);havoc main_#t~mem5;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 301#L20 [2019-11-19 22:10:41,601 INFO L796 eck$LassoCheckResult]: Loop: 301#L20 assume 0 == main_#t~mem6;havoc main_#t~mem6;call write~int(1, main_~x1~0.base, main_~x1~0.offset, 4); 292#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 295#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 303#L16 assume !(0 == main_#t~mem5);havoc main_#t~mem5;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 301#L20 [2019-11-19 22:10:41,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:10:41,601 INFO L82 PathProgramCache]: Analyzing trace with hash 179493189, now seen corresponding path program 1 times [2019-11-19 22:10:41,602 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:10:41,602 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469672798] [2019-11-19 22:10:41,602 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:10:41,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:10:41,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:10:41,674 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 22:10:41,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:10:41,675 INFO L82 PathProgramCache]: Analyzing trace with hash 1526457, now seen corresponding path program 2 times [2019-11-19 22:10:41,675 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:10:41,675 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580448081] [2019-11-19 22:10:41,675 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:10:41,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:10:41,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:10:41,695 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 22:10:41,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:10:41,696 INFO L82 PathProgramCache]: Analyzing trace with hash 1467212285, now seen corresponding path program 1 times [2019-11-19 22:10:41,697 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:10:41,698 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522830453] [2019-11-19 22:10:41,698 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:10:41,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:10:41,785 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:10:41,786 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522830453] [2019-11-19 22:10:41,786 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1753995359] [2019-11-19 22:10:41,786 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_347c403d-729d-4d89-bb97-94cf4a62af01/bin/uautomizer/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 22:10:41,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:10:41,855 INFO L255 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 17 conjunts are in the unsatisfiable core [2019-11-19 22:10:41,856 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:10:41,897 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:10:41,898 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 27 [2019-11-19 22:10:41,899 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:10:41,904 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:10:41,907 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:10:41,907 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:4 [2019-11-19 22:10:41,914 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 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 11 treesize of output 7 [2019-11-19 22:10:41,914 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:10:41,919 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:10:41,919 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:10:41,920 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:12 [2019-11-19 22:10:41,953 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2019-11-19 22:10:41,954 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:10:41,962 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:10:41,962 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:10:41,963 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:12 [2019-11-19 22:10:41,975 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 22:10:41,977 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-11-19 22:10:41,978 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:10:41,984 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:10:41,985 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-19 22:10:41,986 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:31, output treesize:19 [2019-11-19 22:10:42,017 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2019-11-19 22:10:42,017 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:10:42,021 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:10:42,022 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:10:42,022 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:26, output treesize:3 [2019-11-19 22:10:42,024 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:10:42,024 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 22:10:42,025 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2019-11-19 22:10:42,025 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46289680] [2019-11-19 22:10:42,136 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:10:42,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-19 22:10:42,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2019-11-19 22:10:42,137 INFO L87 Difference]: Start difference. First operand 16 states and 20 transitions. cyclomatic complexity: 6 Second operand 11 states. [2019-11-19 22:10:42,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:10:42,337 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2019-11-19 22:10:42,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-19 22:10:42,337 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 27 transitions. [2019-11-19 22:10:42,338 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2019-11-19 22:10:42,339 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 22 states and 25 transitions. [2019-11-19 22:10:42,339 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2019-11-19 22:10:42,339 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2019-11-19 22:10:42,339 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 25 transitions. [2019-11-19 22:10:42,339 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-19 22:10:42,340 INFO L688 BuchiCegarLoop]: Abstraction has 22 states and 25 transitions. [2019-11-19 22:10:42,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 25 transitions. [2019-11-19 22:10:42,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 13. [2019-11-19 22:10:42,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-11-19 22:10:42,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 16 transitions. [2019-11-19 22:10:42,342 INFO L711 BuchiCegarLoop]: Abstraction has 13 states and 16 transitions. [2019-11-19 22:10:42,342 INFO L591 BuchiCegarLoop]: Abstraction has 13 states and 16 transitions. [2019-11-19 22:10:42,342 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-19 22:10:42,342 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 16 transitions. [2019-11-19 22:10:42,342 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2019-11-19 22:10:42,342 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-19 22:10:42,342 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-19 22:10:42,343 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-19 22:10:42,343 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1] [2019-11-19 22:10:42,343 INFO L794 eck$LassoCheckResult]: Stem: 385#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 383#L-1 havoc main_#res;havoc main_#t~malloc0.base, main_#t~malloc0.offset, main_#t~malloc1.base, main_#t~malloc1.offset, main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem5, main_#t~mem6, main_#t~mem7, main_#t~mem4, main_~x0~0.base, main_~x0~0.offset, main_~x1~0.base, main_~x1~0.offset, main_~x2~0.base, main_~x2~0.offset, main_~x3~0.base, main_~x3~0.offset;call main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.allocOnStack(4);main_~x0~0.base, main_~x0~0.offset := main_#t~malloc0.base, main_#t~malloc0.offset;call main_#t~malloc1.base, main_#t~malloc1.offset := #Ultimate.allocOnStack(4);main_~x1~0.base, main_~x1~0.offset := main_#t~malloc1.base, main_#t~malloc1.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x2~0.base, main_~x2~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~x3~0.base, main_~x3~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call write~int(0, main_~x1~0.base, main_~x1~0.offset, 4);call write~int(0, main_~x2~0.base, main_~x2~0.offset, 4);call write~int(0, main_~x3~0.base, main_~x3~0.offset, 4); 384#L24-2 [2019-11-19 22:10:42,343 INFO L796 eck$LassoCheckResult]: Loop: 384#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 388#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 386#L16 assume 0 == main_#t~mem5;havoc main_#t~mem5;call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); 387#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 393#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 392#L16 assume !(0 == main_#t~mem5);havoc main_#t~mem5;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 391#L20 assume 0 == main_#t~mem6;havoc main_#t~mem6;call write~int(1, main_~x1~0.base, main_~x1~0.offset, 4); 384#L24-2 [2019-11-19 22:10:42,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:10:42,343 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2019-11-19 22:10:42,344 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:10:42,344 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076379221] [2019-11-19 22:10:42,344 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:10:42,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:10:42,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:10:42,396 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 22:10:42,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:10:42,398 INFO L82 PathProgramCache]: Analyzing trace with hash -276975247, now seen corresponding path program 1 times [2019-11-19 22:10:42,398 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:10:42,398 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385562747] [2019-11-19 22:10:42,398 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:10:42,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:10:42,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:10:42,415 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 22:10:42,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:10:42,416 INFO L82 PathProgramCache]: Analyzing trace with hash 1269321583, now seen corresponding path program 2 times [2019-11-19 22:10:42,416 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:10:42,416 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532443286] [2019-11-19 22:10:42,417 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:10:42,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:10:42,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:10:42,463 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 22:10:42,597 WARN L191 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 66 [2019-11-19 22:10:43,101 WARN L191 SmtUtils]: Spent 455.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 91 [2019-11-19 22:10:43,283 WARN L191 SmtUtils]: Spent 180.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2019-11-19 22:10:43,287 INFO L210 LassoAnalysis]: Preferences: [2019-11-19 22:10:43,287 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-19 22:10:43,288 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-19 22:10:43,288 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-19 22:10:43,288 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-19 22:10:43,288 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:10:43,288 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-19 22:10:43,288 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-19 22:10:43,288 INFO L133 ssoRankerPreferences]: Filename of dumped script: 4BitCounterPointer.c_Iteration4_Lasso [2019-11-19 22:10:43,288 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-19 22:10:43,289 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-19 22:10:43,291 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:10:43,306 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:10:43,753 WARN L191 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 76 [2019-11-19 22:10:43,882 WARN L191 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 69 [2019-11-19 22:10:43,883 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:10:43,884 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:10:43,886 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:10:43,889 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:10:43,890 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:10:43,892 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:10:43,894 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:10:43,896 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:10:44,352 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-19 22:10:44,352 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_347c403d-729d-4d89-bb97-94cf4a62af01/bin/uautomizer/z3 Starting monitored process 21 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 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:10:44,361 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-19 22:10:44,362 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:10:44,363 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:10:44,363 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:10:44,363 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:10:44,364 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-19 22:10:44,364 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-19 22:10:44,366 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_347c403d-729d-4d89-bb97-94cf4a62af01/bin/uautomizer/z3 Starting monitored process 22 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 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:10:44,371 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-19 22:10:44,372 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:10:44,372 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:10:44,372 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:10:44,372 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:10:44,376 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-19 22:10:44,376 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-19 22:10:44,385 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_347c403d-729d-4d89-bb97-94cf4a62af01/bin/uautomizer/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-19 22:10:44,393 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-19 22:10:44,395 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:10:44,395 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:10:44,395 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:10:44,395 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:10:44,398 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-19 22:10:44,398 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-19 22:10:44,404 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_347c403d-729d-4d89-bb97-94cf4a62af01/bin/uautomizer/z3 Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-19 22:10:44,412 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-19 22:10:44,413 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:10:44,414 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:10:44,414 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:10:44,414 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:10:44,416 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-19 22:10:44,416 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:10:44,425 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_347c403d-729d-4d89-bb97-94cf4a62af01/bin/uautomizer/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-19 22:10:44,433 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-19 22:10:44,435 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:10:44,435 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:10:44,435 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:10:44,435 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:10:44,438 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-19 22:10:44,438 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:10:44,443 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-19 22:10:44,451 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-19 22:10:44,451 INFO L444 ModelExtractionUtils]: 2 out of 7 variables were initially zero. Simplification set additionally 2 variables to zero. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_347c403d-729d-4d89-bb97-94cf4a62af01/bin/uautomizer/z3 Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-19 22:10:44,456 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:10:44,466 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-19 22:10:44,466 INFO L510 LassoAnalysis]: Proved termination. [2019-11-19 22:10:44,466 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~x1~0.base) ULTIMATE.start_main_~x1~0.offset)_2) = -2*v_rep(select (select #memory_int ULTIMATE.start_main_~x1~0.base) ULTIMATE.start_main_~x1~0.offset)_2 + 1 Supporting invariants [] [2019-11-19 22:10:44,603 INFO L297 tatePredicateManager]: 41 out of 41 supporting invariants were superfluous and have been removed [2019-11-19 22:10:44,605 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-19 22:10:44,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:10:44,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:10:44,641 INFO L255 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-19 22:10:44,641 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:10:44,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:10:44,655 INFO L255 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 13 conjunts are in the unsatisfiable core [2019-11-19 22:10:44,655 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:10:44,708 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:10:44,709 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 61 [2019-11-19 22:10:44,709 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:10:44,711 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:10:44,713 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:10:44,750 INFO L567 ElimStorePlain]: treesize reduction 32, result has 55.6 percent of original size [2019-11-19 22:10:44,750 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:10:44,750 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:30, output treesize:40 [2019-11-19 22:10:44,775 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:10:44,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:10:44,789 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2019-11-19 22:10:44,790 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:10:44,806 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:10:44,806 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 36 [2019-11-19 22:10:44,807 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 22:10:44,819 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 36 [2019-11-19 22:10:44,820 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-19 22:10:44,856 INFO L567 ElimStorePlain]: treesize reduction 34, result has 57.0 percent of original size [2019-11-19 22:10:44,857 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-11-19 22:10:44,857 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:112, output treesize:45 [2019-11-19 22:10:44,890 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:10:44,891 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2019-11-19 22:10:44,891 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 16 transitions. cyclomatic complexity: 4 Second operand 6 states. [2019-11-19 22:10:44,974 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states and 16 transitions. cyclomatic complexity: 4. Second operand 6 states. Result 27 states and 32 transitions. Complement of second has 13 states. [2019-11-19 22:10:44,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 1 stem states 5 non-accepting loop states 1 accepting loop states [2019-11-19 22:10:44,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-11-19 22:10:44,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 9 transitions. [2019-11-19 22:10:44,976 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 9 transitions. Stem has 2 letters. Loop has 7 letters. [2019-11-19 22:10:44,976 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-19 22:10:44,976 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 9 transitions. Stem has 9 letters. Loop has 7 letters. [2019-11-19 22:10:44,976 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-19 22:10:44,976 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 9 transitions. Stem has 2 letters. Loop has 14 letters. [2019-11-19 22:10:44,976 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-19 22:10:44,976 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 32 transitions. [2019-11-19 22:10:44,977 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2019-11-19 22:10:44,978 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 27 states and 32 transitions. [2019-11-19 22:10:44,978 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2019-11-19 22:10:44,978 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2019-11-19 22:10:44,979 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 32 transitions. [2019-11-19 22:10:44,979 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-19 22:10:44,979 INFO L688 BuchiCegarLoop]: Abstraction has 27 states and 32 transitions. [2019-11-19 22:10:44,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 32 transitions. [2019-11-19 22:10:44,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-11-19 22:10:44,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-11-19 22:10:44,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 32 transitions. [2019-11-19 22:10:44,983 INFO L711 BuchiCegarLoop]: Abstraction has 27 states and 32 transitions. [2019-11-19 22:10:44,983 INFO L591 BuchiCegarLoop]: Abstraction has 27 states and 32 transitions. [2019-11-19 22:10:44,983 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-19 22:10:44,983 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 32 transitions. [2019-11-19 22:10:44,984 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2019-11-19 22:10:44,984 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-19 22:10:44,984 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-19 22:10:44,985 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1] [2019-11-19 22:10:44,985 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-11-19 22:10:44,985 INFO L794 eck$LassoCheckResult]: Stem: 656#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 650#L-1 havoc main_#res;havoc main_#t~malloc0.base, main_#t~malloc0.offset, main_#t~malloc1.base, main_#t~malloc1.offset, main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem5, main_#t~mem6, main_#t~mem7, main_#t~mem4, main_~x0~0.base, main_~x0~0.offset, main_~x1~0.base, main_~x1~0.offset, main_~x2~0.base, main_~x2~0.offset, main_~x3~0.base, main_~x3~0.offset;call main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.allocOnStack(4);main_~x0~0.base, main_~x0~0.offset := main_#t~malloc0.base, main_#t~malloc0.offset;call main_#t~malloc1.base, main_#t~malloc1.offset := #Ultimate.allocOnStack(4);main_~x1~0.base, main_~x1~0.offset := main_#t~malloc1.base, main_#t~malloc1.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x2~0.base, main_~x2~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~x3~0.base, main_~x3~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call write~int(0, main_~x1~0.base, main_~x1~0.offset, 4);call write~int(0, main_~x2~0.base, main_~x2~0.offset, 4);call write~int(0, main_~x3~0.base, main_~x3~0.offset, 4); 651#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 662#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 663#L16 assume 0 == main_#t~mem5;havoc main_#t~mem5;call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); 675#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 674#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 673#L16 assume !(0 == main_#t~mem5);havoc main_#t~mem5;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 665#L20 assume !(0 == main_#t~mem6);havoc main_#t~mem6;call write~int(0, main_~x1~0.base, main_~x1~0.offset, 4);call main_#t~mem7 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 660#L24 [2019-11-19 22:10:44,985 INFO L796 eck$LassoCheckResult]: Loop: 660#L24 assume 0 == main_#t~mem7;havoc main_#t~mem7;call write~int(1, main_~x2~0.base, main_~x2~0.offset, 4); 657#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 658#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 671#L16 assume !(0 == main_#t~mem5);havoc main_#t~mem5;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 670#L20 assume !(0 == main_#t~mem6);havoc main_#t~mem6;call write~int(0, main_~x1~0.base, main_~x1~0.offset, 4);call main_#t~mem7 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 660#L24 [2019-11-19 22:10:44,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:10:44,985 INFO L82 PathProgramCache]: Analyzing trace with hash 1269321585, now seen corresponding path program 1 times [2019-11-19 22:10:44,985 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:10:44,985 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912193514] [2019-11-19 22:10:44,986 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:10:44,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:10:45,126 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:10:45,126 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912193514] [2019-11-19 22:10:45,126 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1057470546] [2019-11-19 22:10:45,127 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_347c403d-729d-4d89-bb97-94cf4a62af01/bin/uautomizer/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 22:10:45,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:10:45,185 INFO L255 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 26 conjunts are in the unsatisfiable core [2019-11-19 22:10:45,187 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:10:45,231 INFO L343 Elim1Store]: treesize reduction 105, result has 17.3 percent of original size [2019-11-19 22:10:45,231 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 3 case distinctions, treesize of input 123 treesize of output 29 [2019-11-19 22:10:45,232 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:10:45,242 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:10:45,243 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-19 22:10:45,243 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:133, output treesize:38 [2019-11-19 22:10:45,313 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:10:45,313 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 33 treesize of output 87 [2019-11-19 22:10:45,314 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:10:45,355 INFO L567 ElimStorePlain]: treesize reduction 24, result has 61.9 percent of original size [2019-11-19 22:10:45,355 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:10:45,356 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:42, output treesize:39 [2019-11-19 22:10:45,375 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:10:45,530 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:10:45,556 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:10:45,557 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 31 [2019-11-19 22:10:45,557 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:10:45,562 INFO L567 ElimStorePlain]: treesize reduction 22, result has 12.0 percent of original size [2019-11-19 22:10:45,563 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:10:45,563 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:3 [2019-11-19 22:10:45,563 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:10:45,564 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 22:10:45,564 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2019-11-19 22:10:45,564 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903956423] [2019-11-19 22:10:45,564 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-19 22:10:45,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:10:45,564 INFO L82 PathProgramCache]: Analyzing trace with hash 51937794, now seen corresponding path program 1 times [2019-11-19 22:10:45,564 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:10:45,565 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499805995] [2019-11-19 22:10:45,565 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:10:45,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:10:45,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:10:45,574 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 22:10:45,711 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:10:45,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-19 22:10:45,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-11-19 22:10:45,712 INFO L87 Difference]: Start difference. First operand 27 states and 32 transitions. cyclomatic complexity: 7 Second operand 11 states. [2019-11-19 22:10:45,946 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 40 [2019-11-19 22:10:46,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:10:46,116 INFO L93 Difference]: Finished difference Result 44 states and 49 transitions. [2019-11-19 22:10:46,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-19 22:10:46,117 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 49 transitions. [2019-11-19 22:10:46,119 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2019-11-19 22:10:46,119 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 38 states and 43 transitions. [2019-11-19 22:10:46,119 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2019-11-19 22:10:46,120 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2019-11-19 22:10:46,120 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 43 transitions. [2019-11-19 22:10:46,120 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-19 22:10:46,120 INFO L688 BuchiCegarLoop]: Abstraction has 38 states and 43 transitions. [2019-11-19 22:10:46,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states and 43 transitions. [2019-11-19 22:10:46,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 27. [2019-11-19 22:10:46,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-11-19 22:10:46,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2019-11-19 22:10:46,123 INFO L711 BuchiCegarLoop]: Abstraction has 27 states and 31 transitions. [2019-11-19 22:10:46,123 INFO L591 BuchiCegarLoop]: Abstraction has 27 states and 31 transitions. [2019-11-19 22:10:46,123 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-19 22:10:46,123 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 31 transitions. [2019-11-19 22:10:46,124 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2019-11-19 22:10:46,124 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-19 22:10:46,124 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-19 22:10:46,127 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 2, 2, 1, 1, 1, 1] [2019-11-19 22:10:46,128 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-11-19 22:10:46,128 INFO L794 eck$LassoCheckResult]: Stem: 775#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 769#L-1 havoc main_#res;havoc main_#t~malloc0.base, main_#t~malloc0.offset, main_#t~malloc1.base, main_#t~malloc1.offset, main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem5, main_#t~mem6, main_#t~mem7, main_#t~mem4, main_~x0~0.base, main_~x0~0.offset, main_~x1~0.base, main_~x1~0.offset, main_~x2~0.base, main_~x2~0.offset, main_~x3~0.base, main_~x3~0.offset;call main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.allocOnStack(4);main_~x0~0.base, main_~x0~0.offset := main_#t~malloc0.base, main_#t~malloc0.offset;call main_#t~malloc1.base, main_#t~malloc1.offset := #Ultimate.allocOnStack(4);main_~x1~0.base, main_~x1~0.offset := main_#t~malloc1.base, main_#t~malloc1.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x2~0.base, main_~x2~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~x3~0.base, main_~x3~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call write~int(0, main_~x1~0.base, main_~x1~0.offset, 4);call write~int(0, main_~x2~0.base, main_~x2~0.offset, 4);call write~int(0, main_~x3~0.base, main_~x3~0.offset, 4); 770#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 780#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 773#L16 assume 0 == main_#t~mem5;havoc main_#t~mem5;call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); 774#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 789#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 786#L16 assume !(0 == main_#t~mem5);havoc main_#t~mem5;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 785#L20 assume 0 == main_#t~mem6;havoc main_#t~mem6;call write~int(1, main_~x1~0.base, main_~x1~0.offset, 4); 778#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 779#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 790#L16 assume 0 == main_#t~mem5;havoc main_#t~mem5;call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); 794#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 793#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 792#L16 assume !(0 == main_#t~mem5);havoc main_#t~mem5;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 784#L20 assume !(0 == main_#t~mem6);havoc main_#t~mem6;call write~int(0, main_~x1~0.base, main_~x1~0.offset, 4);call main_#t~mem7 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 781#L24 [2019-11-19 22:10:46,128 INFO L796 eck$LassoCheckResult]: Loop: 781#L24 assume 0 == main_#t~mem7;havoc main_#t~mem7;call write~int(1, main_~x2~0.base, main_~x2~0.offset, 4); 776#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 777#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 783#L16 assume !(0 == main_#t~mem5);havoc main_#t~mem5;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 788#L20 assume !(0 == main_#t~mem6);havoc main_#t~mem6;call write~int(0, main_~x1~0.base, main_~x1~0.offset, 4);call main_#t~mem7 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 781#L24 [2019-11-19 22:10:46,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:10:46,129 INFO L82 PathProgramCache]: Analyzing trace with hash -697316795, now seen corresponding path program 1 times [2019-11-19 22:10:46,129 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:10:46,131 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684171399] [2019-11-19 22:10:46,131 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:10:46,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:10:46,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:10:46,202 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 22:10:46,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:10:46,205 INFO L82 PathProgramCache]: Analyzing trace with hash 51937794, now seen corresponding path program 2 times [2019-11-19 22:10:46,205 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:10:46,205 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336074987] [2019-11-19 22:10:46,205 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:10:46,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:10:46,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:10:46,221 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 22:10:46,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:10:46,224 INFO L82 PathProgramCache]: Analyzing trace with hash 16810558, now seen corresponding path program 1 times [2019-11-19 22:10:46,226 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:10:46,226 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399026260] [2019-11-19 22:10:46,226 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:10:46,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:10:46,341 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 12 proven. 12 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-11-19 22:10:46,342 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399026260] [2019-11-19 22:10:46,342 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2069012928] [2019-11-19 22:10:46,342 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_347c403d-729d-4d89-bb97-94cf4a62af01/bin/uautomizer/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 22:10:46,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:10:46,398 INFO L255 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 20 conjunts are in the unsatisfiable core [2019-11-19 22:10:46,403 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:10:46,415 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:10:46,415 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 27 [2019-11-19 22:10:46,416 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:10:46,425 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:10:46,425 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:10:46,425 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:13 [2019-11-19 22:10:46,437 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-19 22:10:46,437 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:10:46,444 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:10:46,444 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:10:46,444 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:20 [2019-11-19 22:10:46,461 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-19 22:10:46,461 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:10:46,466 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:10:46,466 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:10:46,466 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:16 [2019-11-19 22:10:46,485 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-19 22:10:46,485 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:10:46,491 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:10:46,491 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:10:46,492 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:20 [2019-11-19 22:10:46,510 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-11-19 22:10:46,510 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:10:46,518 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:10:46,518 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-19 22:10:46,518 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:31, output treesize:27 [2019-11-19 22:10:46,545 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 22:10:46,548 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2019-11-19 22:10:46,548 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:10:46,563 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:10:46,564 INFO L496 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:10:46,564 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:42, output treesize:3 [2019-11-19 22:10:46,578 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 3 proven. 20 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-11-19 22:10:46,578 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 22:10:46,578 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 14 [2019-11-19 22:10:46,578 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436430639] [2019-11-19 22:10:46,708 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:10:46,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-19 22:10:46,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2019-11-19 22:10:46,709 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. cyclomatic complexity: 6 Second operand 14 states. [2019-11-19 22:10:47,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:10:47,084 INFO L93 Difference]: Finished difference Result 40 states and 43 transitions. [2019-11-19 22:10:47,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-19 22:10:47,085 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 43 transitions. [2019-11-19 22:10:47,085 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 18 [2019-11-19 22:10:47,086 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 40 states and 43 transitions. [2019-11-19 22:10:47,086 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2019-11-19 22:10:47,087 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2019-11-19 22:10:47,087 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 43 transitions. [2019-11-19 22:10:47,087 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-19 22:10:47,087 INFO L688 BuchiCegarLoop]: Abstraction has 40 states and 43 transitions. [2019-11-19 22:10:47,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states and 43 transitions. [2019-11-19 22:10:47,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 31. [2019-11-19 22:10:47,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-11-19 22:10:47,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2019-11-19 22:10:47,090 INFO L711 BuchiCegarLoop]: Abstraction has 31 states and 34 transitions. [2019-11-19 22:10:47,090 INFO L591 BuchiCegarLoop]: Abstraction has 31 states and 34 transitions. [2019-11-19 22:10:47,090 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-11-19 22:10:47,090 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 34 transitions. [2019-11-19 22:10:47,090 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2019-11-19 22:10:47,091 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-19 22:10:47,091 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-19 22:10:47,091 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 2, 2, 1, 1, 1, 1] [2019-11-19 22:10:47,091 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1] [2019-11-19 22:10:47,091 INFO L794 eck$LassoCheckResult]: Stem: 947#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 941#L-1 havoc main_#res;havoc main_#t~malloc0.base, main_#t~malloc0.offset, main_#t~malloc1.base, main_#t~malloc1.offset, main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem5, main_#t~mem6, main_#t~mem7, main_#t~mem4, main_~x0~0.base, main_~x0~0.offset, main_~x1~0.base, main_~x1~0.offset, main_~x2~0.base, main_~x2~0.offset, main_~x3~0.base, main_~x3~0.offset;call main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.allocOnStack(4);main_~x0~0.base, main_~x0~0.offset := main_#t~malloc0.base, main_#t~malloc0.offset;call main_#t~malloc1.base, main_#t~malloc1.offset := #Ultimate.allocOnStack(4);main_~x1~0.base, main_~x1~0.offset := main_#t~malloc1.base, main_#t~malloc1.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x2~0.base, main_~x2~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~x3~0.base, main_~x3~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call write~int(0, main_~x1~0.base, main_~x1~0.offset, 4);call write~int(0, main_~x2~0.base, main_~x2~0.offset, 4);call write~int(0, main_~x3~0.base, main_~x3~0.offset, 4); 942#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 948#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 945#L16 assume 0 == main_#t~mem5;havoc main_#t~mem5;call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); 946#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 966#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 958#L16 assume !(0 == main_#t~mem5);havoc main_#t~mem5;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 956#L20 assume 0 == main_#t~mem6;havoc main_#t~mem6;call write~int(1, main_~x1~0.base, main_~x1~0.offset, 4); 949#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 950#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 971#L16 assume 0 == main_#t~mem5;havoc main_#t~mem5;call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); 970#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 969#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 968#L16 assume !(0 == main_#t~mem5);havoc main_#t~mem5;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 957#L20 assume !(0 == main_#t~mem6);havoc main_#t~mem6;call write~int(0, main_~x1~0.base, main_~x1~0.offset, 4);call main_#t~mem7 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 951#L24 [2019-11-19 22:10:47,092 INFO L796 eck$LassoCheckResult]: Loop: 951#L24 assume !(0 == main_#t~mem7);havoc main_#t~mem7;call write~int(0, main_~x2~0.base, main_~x2~0.offset, 4);call write~int(1, main_~x3~0.base, main_~x3~0.offset, 4); 953#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 954#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 943#L16 assume 0 == main_#t~mem5;havoc main_#t~mem5;call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); 944#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 967#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 964#L16 assume !(0 == main_#t~mem5);havoc main_#t~mem5;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 965#L20 assume !(0 == main_#t~mem6);havoc main_#t~mem6;call write~int(0, main_~x1~0.base, main_~x1~0.offset, 4);call main_#t~mem7 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 951#L24 [2019-11-19 22:10:47,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:10:47,092 INFO L82 PathProgramCache]: Analyzing trace with hash -697316795, now seen corresponding path program 2 times [2019-11-19 22:10:47,092 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:10:47,092 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234605194] [2019-11-19 22:10:47,092 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:10:47,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:10:47,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:10:47,123 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 22:10:47,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:10:47,124 INFO L82 PathProgramCache]: Analyzing trace with hash 278966042, now seen corresponding path program 1 times [2019-11-19 22:10:47,124 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:10:47,124 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770145146] [2019-11-19 22:10:47,124 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:10:47,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:10:47,141 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-19 22:10:47,141 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770145146] [2019-11-19 22:10:47,141 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:10:47,141 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 22:10:47,141 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751794990] [2019-11-19 22:10:47,142 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-19 22:10:47,142 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:10:47,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 22:10:47,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 22:10:47,142 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. cyclomatic complexity: 5 Second operand 4 states. [2019-11-19 22:10:47,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:10:47,172 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2019-11-19 22:10:47,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 22:10:47,172 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 35 transitions. [2019-11-19 22:10:47,172 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2019-11-19 22:10:47,173 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 31 states and 33 transitions. [2019-11-19 22:10:47,173 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2019-11-19 22:10:47,173 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2019-11-19 22:10:47,173 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 33 transitions. [2019-11-19 22:10:47,173 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-19 22:10:47,173 INFO L688 BuchiCegarLoop]: Abstraction has 31 states and 33 transitions. [2019-11-19 22:10:47,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 33 transitions. [2019-11-19 22:10:47,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-11-19 22:10:47,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-11-19 22:10:47,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 33 transitions. [2019-11-19 22:10:47,176 INFO L711 BuchiCegarLoop]: Abstraction has 31 states and 33 transitions. [2019-11-19 22:10:47,176 INFO L591 BuchiCegarLoop]: Abstraction has 31 states and 33 transitions. [2019-11-19 22:10:47,176 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-11-19 22:10:47,176 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 33 transitions. [2019-11-19 22:10:47,177 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2019-11-19 22:10:47,177 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-19 22:10:47,177 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-19 22:10:47,177 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 2, 2, 1, 1, 1, 1] [2019-11-19 22:10:47,177 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [4, 4, 2, 2, 1, 1, 1] [2019-11-19 22:10:47,178 INFO L794 eck$LassoCheckResult]: Stem: 1016#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1014#L-1 havoc main_#res;havoc main_#t~malloc0.base, main_#t~malloc0.offset, main_#t~malloc1.base, main_#t~malloc1.offset, main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem5, main_#t~mem6, main_#t~mem7, main_#t~mem4, main_~x0~0.base, main_~x0~0.offset, main_~x1~0.base, main_~x1~0.offset, main_~x2~0.base, main_~x2~0.offset, main_~x3~0.base, main_~x3~0.offset;call main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.allocOnStack(4);main_~x0~0.base, main_~x0~0.offset := main_#t~malloc0.base, main_#t~malloc0.offset;call main_#t~malloc1.base, main_#t~malloc1.offset := #Ultimate.allocOnStack(4);main_~x1~0.base, main_~x1~0.offset := main_#t~malloc1.base, main_#t~malloc1.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x2~0.base, main_~x2~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~x3~0.base, main_~x3~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call write~int(0, main_~x1~0.base, main_~x1~0.offset, 4);call write~int(0, main_~x2~0.base, main_~x2~0.offset, 4);call write~int(0, main_~x3~0.base, main_~x3~0.offset, 4); 1015#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1031#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 1019#L16 assume 0 == main_#t~mem5;havoc main_#t~mem5;call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); 1020#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1023#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 1026#L16 assume !(0 == main_#t~mem5);havoc main_#t~mem5;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 1028#L20 assume 0 == main_#t~mem6;havoc main_#t~mem6;call write~int(1, main_~x1~0.base, main_~x1~0.offset, 4); 1029#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1032#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 1044#L16 assume 0 == main_#t~mem5;havoc main_#t~mem5;call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); 1043#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1042#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 1041#L16 assume !(0 == main_#t~mem5);havoc main_#t~mem5;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 1030#L20 assume !(0 == main_#t~mem6);havoc main_#t~mem6;call write~int(0, main_~x1~0.base, main_~x1~0.offset, 4);call main_#t~mem7 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 1024#L24 [2019-11-19 22:10:47,178 INFO L796 eck$LassoCheckResult]: Loop: 1024#L24 assume 0 == main_#t~mem7;havoc main_#t~mem7;call write~int(1, main_~x2~0.base, main_~x2~0.offset, 4); 1025#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1037#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 1036#L16 assume 0 == main_#t~mem5;havoc main_#t~mem5;call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); 1035#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1034#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 1033#L16 assume !(0 == main_#t~mem5);havoc main_#t~mem5;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 1027#L20 assume 0 == main_#t~mem6;havoc main_#t~mem6;call write~int(1, main_~x1~0.base, main_~x1~0.offset, 4); 1021#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1022#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 1017#L16 assume 0 == main_#t~mem5;havoc main_#t~mem5;call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); 1018#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1040#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 1038#L16 assume !(0 == main_#t~mem5);havoc main_#t~mem5;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 1039#L20 assume !(0 == main_#t~mem6);havoc main_#t~mem6;call write~int(0, main_~x1~0.base, main_~x1~0.offset, 4);call main_#t~mem7 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 1024#L24 [2019-11-19 22:10:47,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:10:47,178 INFO L82 PathProgramCache]: Analyzing trace with hash -697316795, now seen corresponding path program 3 times [2019-11-19 22:10:47,178 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:10:47,178 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104374206] [2019-11-19 22:10:47,178 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:10:47,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:10:47,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:10:47,209 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 22:10:47,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:10:47,209 INFO L82 PathProgramCache]: Analyzing trace with hash 2047759866, now seen corresponding path program 1 times [2019-11-19 22:10:47,210 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:10:47,210 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897935777] [2019-11-19 22:10:47,210 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:10:47,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:10:47,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:10:47,235 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 22:10:47,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:10:47,237 INFO L82 PathProgramCache]: Analyzing trace with hash 462437174, now seen corresponding path program 2 times [2019-11-19 22:10:47,237 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:10:47,237 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114556838] [2019-11-19 22:10:47,237 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:10:47,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:10:47,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:10:47,287 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 22:10:47,993 WARN L191 SmtUtils]: Spent 701.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 118 [2019-11-19 22:10:48,137 WARN L191 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2019-11-19 22:10:50,723 WARN L191 SmtUtils]: Spent 2.58 s on a formula simplification. DAG size of input: 195 DAG size of output: 158 [2019-11-19 22:10:51,472 WARN L191 SmtUtils]: Spent 745.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2019-11-19 22:10:51,475 INFO L210 LassoAnalysis]: Preferences: [2019-11-19 22:10:51,475 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-19 22:10:51,476 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-19 22:10:51,476 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-19 22:10:51,476 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-19 22:10:51,476 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:10:51,476 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-19 22:10:51,476 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-19 22:10:51,476 INFO L133 ssoRankerPreferences]: Filename of dumped script: 4BitCounterPointer.c_Iteration8_Lasso [2019-11-19 22:10:51,476 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-19 22:10:51,476 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-19 22:10:51,478 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:10:51,488 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:10:51,490 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:10:51,492 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:10:51,494 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:10:51,495 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:10:51,497 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:10:51,499 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:10:51,501 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:10:52,096 WARN L191 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 80 [2019-11-19 22:10:52,256 WARN L191 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 78 [2019-11-19 22:10:52,438 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 45 [2019-11-19 22:10:52,781 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-19 22:10:52,782 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_347c403d-729d-4d89-bb97-94cf4a62af01/bin/uautomizer/z3 Starting monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-19 22:10:52,793 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-19 22:10:52,796 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:10:52,796 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 22:10:52,796 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:10:52,796 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:10:52,796 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:10:52,797 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 22:10:52,797 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:10:52,799 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_347c403d-729d-4d89-bb97-94cf4a62af01/bin/uautomizer/z3 Starting monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-19 22:10:52,805 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-19 22:10:52,806 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:10:52,806 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 22:10:52,806 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:10:52,806 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:10:52,807 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:10:52,807 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 22:10:52,807 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:10:52,809 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_347c403d-729d-4d89-bb97-94cf4a62af01/bin/uautomizer/z3 Starting monitored process 31 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 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:10:52,814 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-19 22:10:52,815 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:10:52,816 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:10:52,816 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:10:52,816 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:10:52,817 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-19 22:10:52,817 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-19 22:10:52,830 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_347c403d-729d-4d89-bb97-94cf4a62af01/bin/uautomizer/z3 Starting monitored process 32 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 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:10:52,833 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-19 22:10:52,835 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:10:52,835 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:10:52,835 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:10:52,835 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:10:52,836 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-19 22:10:52,836 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-19 22:10:52,838 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_347c403d-729d-4d89-bb97-94cf4a62af01/bin/uautomizer/z3 Starting monitored process 33 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 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:10:52,843 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-19 22:10:52,844 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:10:52,844 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 22:10:52,844 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:10:52,844 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:10:52,844 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:10:52,845 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 22:10:52,845 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-19 22:10:52,846 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_347c403d-729d-4d89-bb97-94cf4a62af01/bin/uautomizer/z3 Starting monitored process 34 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 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:10:52,850 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-19 22:10:52,851 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:10:52,851 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:10:52,851 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:10:52,851 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:10:52,853 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-19 22:10:52,853 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-19 22:10:52,855 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_347c403d-729d-4d89-bb97-94cf4a62af01/bin/uautomizer/z3 Starting monitored process 35 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 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:10:52,859 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-19 22:10:52,860 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:10:52,860 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 22:10:52,860 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:10:52,860 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:10:52,861 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:10:52,861 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 22:10:52,861 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-19 22:10:52,862 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_347c403d-729d-4d89-bb97-94cf4a62af01/bin/uautomizer/z3 Starting monitored process 36 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 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:10:52,866 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-19 22:10:52,867 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:10:52,867 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:10:52,867 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:10:52,867 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:10:52,868 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-19 22:10:52,868 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-19 22:10:52,871 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_347c403d-729d-4d89-bb97-94cf4a62af01/bin/uautomizer/z3 Starting monitored process 37 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 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:10:52,875 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-19 22:10:52,876 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:10:52,877 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:10:52,877 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:10:52,877 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:10:52,881 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-19 22:10:52,881 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-19 22:10:52,886 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_347c403d-729d-4d89-bb97-94cf4a62af01/bin/uautomizer/z3 Starting monitored process 38 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 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:10:52,891 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-19 22:10:52,892 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:10:52,893 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:10:52,893 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:10:52,893 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:10:52,905 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-19 22:10:52,905 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-19 22:10:52,921 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_347c403d-729d-4d89-bb97-94cf4a62af01/bin/uautomizer/z3 Starting monitored process 39 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 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:10:52,925 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-19 22:10:52,927 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:10:52,927 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:10:52,927 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:10:52,927 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:10:52,929 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-19 22:10:52,929 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-19 22:10:52,932 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_347c403d-729d-4d89-bb97-94cf4a62af01/bin/uautomizer/z3 Starting monitored process 40 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 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:10:52,936 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-19 22:10:52,938 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:10:52,938 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:10:52,938 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:10:52,938 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:10:52,947 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-19 22:10:52,947 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-19 22:10:52,963 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_347c403d-729d-4d89-bb97-94cf4a62af01/bin/uautomizer/z3 Starting monitored process 41 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 41 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:10:52,968 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-19 22:10:52,969 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:10:52,969 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:10:52,969 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:10:52,970 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:10:52,973 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-19 22:10:52,973 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-19 22:10:52,979 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_347c403d-729d-4d89-bb97-94cf4a62af01/bin/uautomizer/z3 Starting monitored process 42 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 42 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:10:52,983 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-19 22:10:52,984 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:10:52,985 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:10:52,985 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:10:52,985 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:10:52,990 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-19 22:10:52,990 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-19 22:10:52,996 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_347c403d-729d-4d89-bb97-94cf4a62af01/bin/uautomizer/z3 Starting monitored process 43 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 43 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:10:53,000 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-19 22:10:53,001 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:10:53,002 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:10:53,002 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:10:53,002 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:10:53,003 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-19 22:10:53,003 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-19 22:10:53,005 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_347c403d-729d-4d89-bb97-94cf4a62af01/bin/uautomizer/z3 Starting monitored process 44 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 44 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:10:53,009 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-19 22:10:53,010 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:10:53,010 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:10:53,010 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:10:53,010 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:10:53,013 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-19 22:10:53,013 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-19 22:10:53,018 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-19 22:10:53,024 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2019-11-19 22:10:53,024 INFO L444 ModelExtractionUtils]: 4 out of 10 variables were initially zero. Simplification set additionally 3 variables to zero. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_347c403d-729d-4d89-bb97-94cf4a62af01/bin/uautomizer/z3 Starting monitored process 45 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 45 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:10:53,027 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-19 22:10:53,029 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-19 22:10:53,029 INFO L510 LassoAnalysis]: Proved termination. [2019-11-19 22:10:53,029 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_#t~mem7) = -2*ULTIMATE.start_main_#t~mem7 + 1 Supporting invariants [] [2019-11-19 22:10:53,227 INFO L297 tatePredicateManager]: 42 out of 42 supporting invariants were superfluous and have been removed [2019-11-19 22:10:53,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:10:53,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:10:53,258 INFO L255 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-19 22:10:53,258 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:10:53,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:10:53,276 INFO L255 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 19 conjunts are in the unsatisfiable core [2019-11-19 22:10:53,277 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:10:53,282 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 11 treesize of output 7 [2019-11-19 22:10:53,283 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:10:53,286 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:10:53,286 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:10:53,287 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:15 [2019-11-19 22:10:53,326 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:10:53,326 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 57 [2019-11-19 22:10:53,327 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:10:53,348 INFO L567 ElimStorePlain]: treesize reduction 24, result has 56.4 percent of original size [2019-11-19 22:10:53,348 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:10:53,348 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:31 [2019-11-19 22:10:53,379 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:10:53,379 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 39 [2019-11-19 22:10:53,380 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:10:53,385 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 39 [2019-11-19 22:10:53,385 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 22:10:53,405 INFO L567 ElimStorePlain]: treesize reduction 38, result has 43.3 percent of original size [2019-11-19 22:10:53,406 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:10:53,406 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:89, output treesize:29 [2019-11-19 22:10:53,506 INFO L343 Elim1Store]: treesize reduction 12, result has 87.9 percent of original size [2019-11-19 22:10:53,507 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 33 treesize of output 103 [2019-11-19 22:10:53,507 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:10:53,546 INFO L567 ElimStorePlain]: treesize reduction 40, result has 53.5 percent of original size [2019-11-19 22:10:53,546 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:10:53,546 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:40, output treesize:46 [2019-11-19 22:10:53,573 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:10:53,643 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:10:53,643 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 44 treesize of output 114 [2019-11-19 22:10:53,644 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:10:53,655 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:10:53,656 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 38 [2019-11-19 22:10:53,656 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 22:10:53,711 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:10:53,711 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 44 treesize of output 114 [2019-11-19 22:10:53,712 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-19 22:10:53,724 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 38 [2019-11-19 22:10:53,724 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-19 22:10:53,856 WARN L191 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 36 [2019-11-19 22:10:53,856 INFO L567 ElimStorePlain]: treesize reduction 178, result has 32.3 percent of original size [2019-11-19 22:10:53,856 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-11-19 22:10:53,857 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:175, output treesize:85 [2019-11-19 22:10:53,902 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:10:53,903 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:10:53,943 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:10:53,943 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 82 [2019-11-19 22:10:53,944 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:10:53,982 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:10:53,982 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 48 treesize of output 82 [2019-11-19 22:10:53,983 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 22:10:54,028 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:10:54,028 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 48 treesize of output 82 [2019-11-19 22:10:54,029 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-19 22:10:54,060 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:10:54,060 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 48 treesize of output 82 [2019-11-19 22:10:54,061 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-19 22:10:54,128 INFO L567 ElimStorePlain]: treesize reduction 162, result has 33.9 percent of original size [2019-11-19 22:10:54,128 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:10:54,129 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2019-11-19 22:10:54,129 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:193, output treesize:83 [2019-11-19 22:10:54,129 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:10:54,130 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:10:54,175 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 9 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:10:54,176 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 8 loop predicates [2019-11-19 22:10:54,176 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 31 states and 33 transitions. cyclomatic complexity: 4 Second operand 9 states. [2019-11-19 22:10:54,518 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 31 states and 33 transitions. cyclomatic complexity: 4. Second operand 9 states. Result 46 states and 50 transitions. Complement of second has 22 states. [2019-11-19 22:10:54,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 12 states 1 stem states 10 non-accepting loop states 1 accepting loop states [2019-11-19 22:10:54,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-11-19 22:10:54,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 24 transitions. [2019-11-19 22:10:54,520 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 24 transitions. Stem has 16 letters. Loop has 15 letters. [2019-11-19 22:10:54,520 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-19 22:10:54,521 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 24 transitions. Stem has 31 letters. Loop has 15 letters. [2019-11-19 22:10:54,521 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-19 22:10:54,521 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 24 transitions. Stem has 16 letters. Loop has 30 letters. [2019-11-19 22:10:54,522 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-19 22:10:54,522 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 50 transitions. [2019-11-19 22:10:54,523 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-11-19 22:10:54,523 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 46 states and 50 transitions. [2019-11-19 22:10:54,523 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2019-11-19 22:10:54,523 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2019-11-19 22:10:54,524 INFO L73 IsDeterministic]: Start isDeterministic. Operand 46 states and 50 transitions. [2019-11-19 22:10:54,524 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-19 22:10:54,524 INFO L688 BuchiCegarLoop]: Abstraction has 46 states and 50 transitions. [2019-11-19 22:10:54,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states and 50 transitions. [2019-11-19 22:10:54,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 39. [2019-11-19 22:10:54,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-11-19 22:10:54,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2019-11-19 22:10:54,527 INFO L711 BuchiCegarLoop]: Abstraction has 39 states and 43 transitions. [2019-11-19 22:10:54,527 INFO L591 BuchiCegarLoop]: Abstraction has 39 states and 43 transitions. [2019-11-19 22:10:54,528 INFO L424 BuchiCegarLoop]: ======== Iteration 9============ [2019-11-19 22:10:54,528 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 43 transitions. [2019-11-19 22:10:54,528 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-11-19 22:10:54,528 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-19 22:10:54,529 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-19 22:10:54,529 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 2, 2, 1, 1, 1, 1, 1] [2019-11-19 22:10:54,529 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1] [2019-11-19 22:10:54,530 INFO L794 eck$LassoCheckResult]: Stem: 1415#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1409#L-1 havoc main_#res;havoc main_#t~malloc0.base, main_#t~malloc0.offset, main_#t~malloc1.base, main_#t~malloc1.offset, main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem5, main_#t~mem6, main_#t~mem7, main_#t~mem4, main_~x0~0.base, main_~x0~0.offset, main_~x1~0.base, main_~x1~0.offset, main_~x2~0.base, main_~x2~0.offset, main_~x3~0.base, main_~x3~0.offset;call main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.allocOnStack(4);main_~x0~0.base, main_~x0~0.offset := main_#t~malloc0.base, main_#t~malloc0.offset;call main_#t~malloc1.base, main_#t~malloc1.offset := #Ultimate.allocOnStack(4);main_~x1~0.base, main_~x1~0.offset := main_#t~malloc1.base, main_#t~malloc1.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x2~0.base, main_~x2~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~x3~0.base, main_~x3~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call write~int(0, main_~x1~0.base, main_~x1~0.offset, 4);call write~int(0, main_~x2~0.base, main_~x2~0.offset, 4);call write~int(0, main_~x3~0.base, main_~x3~0.offset, 4); 1410#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1422#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 1413#L16 assume 0 == main_#t~mem5;havoc main_#t~mem5;call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); 1414#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1443#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 1441#L16 assume !(0 == main_#t~mem5);havoc main_#t~mem5;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 1424#L20 assume 0 == main_#t~mem6;havoc main_#t~mem6;call write~int(1, main_~x1~0.base, main_~x1~0.offset, 4); 1425#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1438#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 1436#L16 assume 0 == main_#t~mem5;havoc main_#t~mem5;call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); 1434#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1432#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 1430#L16 assume !(0 == main_#t~mem5);havoc main_#t~mem5;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 1428#L20 assume !(0 == main_#t~mem6);havoc main_#t~mem6;call write~int(0, main_~x1~0.base, main_~x1~0.offset, 4);call main_#t~mem7 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 1420#L24 assume 0 == main_#t~mem7;havoc main_#t~mem7;call write~int(1, main_~x2~0.base, main_~x2~0.offset, 4); 1416#L24-2 [2019-11-19 22:10:54,530 INFO L796 eck$LassoCheckResult]: Loop: 1416#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1417#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 1411#L16 assume 0 == main_#t~mem5;havoc main_#t~mem5;call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); 1412#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1447#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 1446#L16 assume !(0 == main_#t~mem5);havoc main_#t~mem5;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 1423#L20 assume 0 == main_#t~mem6;havoc main_#t~mem6;call write~int(1, main_~x1~0.base, main_~x1~0.offset, 4); 1416#L24-2 [2019-11-19 22:10:54,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:10:54,530 INFO L82 PathProgramCache]: Analyzing trace with hash -141984140, now seen corresponding path program 3 times [2019-11-19 22:10:54,530 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:10:54,530 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635512438] [2019-11-19 22:10:54,531 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:10:54,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:10:54,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:10:54,559 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 22:10:54,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:10:54,559 INFO L82 PathProgramCache]: Analyzing trace with hash -276975247, now seen corresponding path program 2 times [2019-11-19 22:10:54,560 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:10:54,560 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486547491] [2019-11-19 22:10:54,560 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:10:54,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:10:54,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:10:54,567 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 22:10:54,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:10:54,568 INFO L82 PathProgramCache]: Analyzing trace with hash -1710122082, now seen corresponding path program 4 times [2019-11-19 22:10:54,568 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:10:54,568 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034211690] [2019-11-19 22:10:54,568 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:10:54,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:10:54,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:10:54,601 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 22:10:54,775 WARN L191 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 64 [2019-11-19 22:10:57,737 WARN L191 SmtUtils]: Spent 2.91 s on a formula simplification. DAG size of input: 200 DAG size of output: 149 [2019-11-19 22:10:58,239 WARN L191 SmtUtils]: Spent 498.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2019-11-19 22:10:58,242 INFO L210 LassoAnalysis]: Preferences: [2019-11-19 22:10:58,242 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-19 22:10:58,242 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-19 22:10:58,242 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-19 22:10:58,242 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-19 22:10:58,242 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:10:58,242 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-19 22:10:58,242 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-19 22:10:58,242 INFO L133 ssoRankerPreferences]: Filename of dumped script: 4BitCounterPointer.c_Iteration9_Lasso [2019-11-19 22:10:58,242 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-19 22:10:58,242 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-19 22:10:58,244 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:10:58,254 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:10:58,255 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:10:58,257 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:10:58,259 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:10:58,766 WARN L191 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 76 [2019-11-19 22:10:58,886 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 63 [2019-11-19 22:10:58,886 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:10:58,888 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:10:58,893 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 22:10:59,292 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-19 22:10:59,293 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_347c403d-729d-4d89-bb97-94cf4a62af01/bin/uautomizer/z3 Starting monitored process 46 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 46 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:10:59,300 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-19 22:10:59,301 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:10:59,301 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:10:59,301 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:10:59,301 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:10:59,303 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-19 22:10:59,303 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-19 22:10:59,305 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_347c403d-729d-4d89-bb97-94cf4a62af01/bin/uautomizer/z3 Starting monitored process 47 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 47 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:10:59,309 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-19 22:10:59,310 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:10:59,310 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 22:10:59,310 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:10:59,310 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:10:59,310 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:10:59,311 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 22:10:59,311 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-19 22:10:59,312 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_347c403d-729d-4d89-bb97-94cf4a62af01/bin/uautomizer/z3 Starting monitored process 48 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 48 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:10:59,315 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-19 22:10:59,317 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:10:59,317 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 22:10:59,317 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:10:59,317 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:10:59,317 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:10:59,317 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 22:10:59,317 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-19 22:10:59,318 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_347c403d-729d-4d89-bb97-94cf4a62af01/bin/uautomizer/z3 Starting monitored process 49 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 49 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:10:59,322 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-19 22:10:59,324 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:10:59,324 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:10:59,324 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:10:59,324 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:10:59,325 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-19 22:10:59,325 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-19 22:10:59,327 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_347c403d-729d-4d89-bb97-94cf4a62af01/bin/uautomizer/z3 Starting monitored process 50 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 50 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:10:59,331 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-19 22:10:59,332 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 22:10:59,332 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 22:10:59,332 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 22:10:59,332 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 22:10:59,335 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-19 22:10:59,335 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-19 22:10:59,338 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-19 22:10:59,342 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-19 22:10:59,342 INFO L444 ModelExtractionUtils]: 2 out of 7 variables were initially zero. Simplification set additionally 2 variables to zero. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_347c403d-729d-4d89-bb97-94cf4a62af01/bin/uautomizer/z3 Starting monitored process 51 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 51 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 22:10:59,345 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-19 22:10:59,346 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-19 22:10:59,347 INFO L510 LassoAnalysis]: Proved termination. [2019-11-19 22:10:59,347 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~x1~0.base) ULTIMATE.start_main_~x1~0.offset)_4) = -2*v_rep(select (select #memory_int ULTIMATE.start_main_~x1~0.base) ULTIMATE.start_main_~x1~0.offset)_4 + 1 Supporting invariants [] [2019-11-19 22:10:59,442 INFO L297 tatePredicateManager]: 37 out of 37 supporting invariants were superfluous and have been removed [2019-11-19 22:10:59,443 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-19 22:10:59,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:10:59,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:10:59,474 INFO L255 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-19 22:10:59,475 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:10:59,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:10:59,484 INFO L255 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 13 conjunts are in the unsatisfiable core [2019-11-19 22:10:59,484 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:10:59,511 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:10:59,511 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 61 [2019-11-19 22:10:59,512 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:10:59,512 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:10:59,513 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:10:59,546 INFO L567 ElimStorePlain]: treesize reduction 32, result has 55.6 percent of original size [2019-11-19 22:10:59,546 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:10:59,546 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:30, output treesize:40 [2019-11-19 22:10:59,584 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:10:59,585 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:10:59,609 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2019-11-19 22:10:59,609 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:10:59,627 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:10:59,627 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 36 [2019-11-19 22:10:59,628 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 22:10:59,635 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 36 [2019-11-19 22:10:59,635 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-19 22:10:59,680 INFO L567 ElimStorePlain]: treesize reduction 34, result has 57.0 percent of original size [2019-11-19 22:10:59,681 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-11-19 22:10:59,681 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:112, output treesize:45 [2019-11-19 22:10:59,710 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:10:59,710 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2019-11-19 22:10:59,710 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 39 states and 43 transitions. cyclomatic complexity: 7 Second operand 6 states. [2019-11-19 22:10:59,815 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 39 states and 43 transitions. cyclomatic complexity: 7. Second operand 6 states. Result 79 states and 85 transitions. Complement of second has 13 states. [2019-11-19 22:10:59,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 1 stem states 5 non-accepting loop states 1 accepting loop states [2019-11-19 22:10:59,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-11-19 22:10:59,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 16 transitions. [2019-11-19 22:10:59,816 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 16 transitions. Stem has 17 letters. Loop has 7 letters. [2019-11-19 22:10:59,817 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-19 22:10:59,817 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 16 transitions. Stem has 24 letters. Loop has 7 letters. [2019-11-19 22:10:59,817 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-19 22:10:59,817 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 16 transitions. Stem has 17 letters. Loop has 14 letters. [2019-11-19 22:10:59,818 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-19 22:10:59,818 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 79 states and 85 transitions. [2019-11-19 22:10:59,819 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-11-19 22:10:59,820 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 79 states to 59 states and 63 transitions. [2019-11-19 22:10:59,820 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2019-11-19 22:10:59,820 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2019-11-19 22:10:59,820 INFO L73 IsDeterministic]: Start isDeterministic. Operand 59 states and 63 transitions. [2019-11-19 22:10:59,820 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-19 22:10:59,820 INFO L688 BuchiCegarLoop]: Abstraction has 59 states and 63 transitions. [2019-11-19 22:10:59,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states and 63 transitions. [2019-11-19 22:10:59,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 53. [2019-11-19 22:10:59,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-11-19 22:10:59,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 57 transitions. [2019-11-19 22:10:59,829 INFO L711 BuchiCegarLoop]: Abstraction has 53 states and 57 transitions. [2019-11-19 22:10:59,829 INFO L591 BuchiCegarLoop]: Abstraction has 53 states and 57 transitions. [2019-11-19 22:10:59,829 INFO L424 BuchiCegarLoop]: ======== Iteration 10============ [2019-11-19 22:10:59,829 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 53 states and 57 transitions. [2019-11-19 22:10:59,830 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-11-19 22:10:59,830 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-19 22:10:59,830 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-19 22:10:59,832 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [8, 8, 4, 4, 2, 2, 2, 1, 1] [2019-11-19 22:10:59,832 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1] [2019-11-19 22:10:59,833 INFO L794 eck$LassoCheckResult]: Stem: 1785#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1783#L-1 havoc main_#res;havoc main_#t~malloc0.base, main_#t~malloc0.offset, main_#t~malloc1.base, main_#t~malloc1.offset, main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem5, main_#t~mem6, main_#t~mem7, main_#t~mem4, main_~x0~0.base, main_~x0~0.offset, main_~x1~0.base, main_~x1~0.offset, main_~x2~0.base, main_~x2~0.offset, main_~x3~0.base, main_~x3~0.offset;call main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.allocOnStack(4);main_~x0~0.base, main_~x0~0.offset := main_#t~malloc0.base, main_#t~malloc0.offset;call main_#t~malloc1.base, main_#t~malloc1.offset := #Ultimate.allocOnStack(4);main_~x1~0.base, main_~x1~0.offset := main_#t~malloc1.base, main_#t~malloc1.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x2~0.base, main_~x2~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~x3~0.base, main_~x3~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call write~int(0, main_~x1~0.base, main_~x1~0.offset, 4);call write~int(0, main_~x2~0.base, main_~x2~0.offset, 4);call write~int(0, main_~x3~0.base, main_~x3~0.offset, 4); 1784#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1790#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 1815#L16 assume 0 == main_#t~mem5;havoc main_#t~mem5;call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); 1814#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1813#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 1812#L16 assume !(0 == main_#t~mem5);havoc main_#t~mem5;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 1811#L20 assume 0 == main_#t~mem6;havoc main_#t~mem6;call write~int(1, main_~x1~0.base, main_~x1~0.offset, 4); 1810#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1797#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 1786#L16 assume 0 == main_#t~mem5;havoc main_#t~mem5;call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); 1787#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1806#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 1804#L16 assume !(0 == main_#t~mem5);havoc main_#t~mem5;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 1802#L20 assume !(0 == main_#t~mem6);havoc main_#t~mem6;call write~int(0, main_~x1~0.base, main_~x1~0.offset, 4);call main_#t~mem7 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 1793#L24 assume 0 == main_#t~mem7;havoc main_#t~mem7;call write~int(1, main_~x2~0.base, main_~x2~0.offset, 4); 1791#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1792#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 1788#L16 assume 0 == main_#t~mem5;havoc main_#t~mem5;call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); 1789#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1835#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 1834#L16 assume !(0 == main_#t~mem5);havoc main_#t~mem5;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 1828#L20 assume 0 == main_#t~mem6;havoc main_#t~mem6;call write~int(1, main_~x1~0.base, main_~x1~0.offset, 4); 1827#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1826#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 1825#L16 assume 0 == main_#t~mem5;havoc main_#t~mem5;call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); 1824#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1823#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 1822#L16 assume !(0 == main_#t~mem5);havoc main_#t~mem5;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 1801#L20 assume !(0 == main_#t~mem6);havoc main_#t~mem6;call write~int(0, main_~x1~0.base, main_~x1~0.offset, 4);call main_#t~mem7 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 1794#L24 assume 0 == main_#t~mem7;havoc main_#t~mem7;call write~int(1, main_~x2~0.base, main_~x2~0.offset, 4); 1795#L24-2 [2019-11-19 22:10:59,833 INFO L796 eck$LassoCheckResult]: Loop: 1795#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1809#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 1808#L16 assume 0 == main_#t~mem5;havoc main_#t~mem5;call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); 1807#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1805#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 1803#L16 assume !(0 == main_#t~mem5);havoc main_#t~mem5;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 1798#L20 assume 0 == main_#t~mem6;havoc main_#t~mem6;call write~int(1, main_~x1~0.base, main_~x1~0.offset, 4); 1795#L24-2 [2019-11-19 22:10:59,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:10:59,834 INFO L82 PathProgramCache]: Analyzing trace with hash 1450650531, now seen corresponding path program 5 times [2019-11-19 22:10:59,834 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:10:59,834 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540341504] [2019-11-19 22:10:59,834 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:10:59,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:11:00,105 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 50 proven. 22 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-11-19 22:11:00,106 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540341504] [2019-11-19 22:11:00,106 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1545936228] [2019-11-19 22:11:00,106 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_347c403d-729d-4d89-bb97-94cf4a62af01/bin/uautomizer/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 22:11:00,174 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2019-11-19 22:11:00,174 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-19 22:11:00,175 INFO L255 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 36 conjunts are in the unsatisfiable core [2019-11-19 22:11:00,177 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:11:00,192 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 11 treesize of output 7 [2019-11-19 22:11:00,192 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:11:00,198 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:11:00,198 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:11:00,198 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:17 [2019-11-19 22:11:00,218 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:11:00,219 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2019-11-19 22:11:00,219 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-11-19 22:11:00,235 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:11:00,235 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:11:00,235 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:18 [2019-11-19 22:11:00,269 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 11 treesize of output 7 [2019-11-19 22:11:00,269 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:11:00,277 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:11:00,277 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:11:00,277 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2019-11-19 22:11:00,338 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:11:00,338 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 45 [2019-11-19 22:11:00,339 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:11:00,361 INFO L567 ElimStorePlain]: treesize reduction 16, result has 66.7 percent of original size [2019-11-19 22:11:00,361 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:11:00,361 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:39, output treesize:32 [2019-11-19 22:11:00,397 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2019-11-19 22:11:00,398 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:11:00,418 INFO L567 ElimStorePlain]: treesize reduction 4, result has 89.7 percent of original size [2019-11-19 22:11:00,418 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:11:00,418 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:50, output treesize:35 [2019-11-19 22:11:00,465 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:11:00,465 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 63 [2019-11-19 22:11:00,466 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:11:00,513 INFO L567 ElimStorePlain]: treesize reduction 32, result has 52.2 percent of original size [2019-11-19 22:11:00,514 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:11:00,514 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:46, output treesize:35 [2019-11-19 22:11:00,605 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:11:00,606 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 33 treesize of output 79 [2019-11-19 22:11:00,606 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:11:00,654 INFO L567 ElimStorePlain]: treesize reduction 32, result has 57.3 percent of original size [2019-11-19 22:11:00,654 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:11:00,654 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:46, output treesize:43 [2019-11-19 22:11:00,696 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 31 [2019-11-19 22:11:00,696 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:11:00,715 INFO L567 ElimStorePlain]: treesize reduction 8, result has 80.0 percent of original size [2019-11-19 22:11:00,716 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-19 22:11:00,716 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:51, output treesize:32 [2019-11-19 22:11:00,744 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 22:11:00,752 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:11:00,753 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 29 [2019-11-19 22:11:00,753 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:11:00,765 INFO L567 ElimStorePlain]: treesize reduction 4, result has 80.0 percent of original size [2019-11-19 22:11:00,765 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:11:00,765 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:41, output treesize:3 [2019-11-19 22:11:00,784 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 69 proven. 19 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-19 22:11:00,785 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 22:11:00,785 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 13] total 21 [2019-11-19 22:11:00,785 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631618310] [2019-11-19 22:11:00,785 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-19 22:11:00,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:11:00,786 INFO L82 PathProgramCache]: Analyzing trace with hash -276975247, now seen corresponding path program 3 times [2019-11-19 22:11:00,786 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:11:00,786 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517860768] [2019-11-19 22:11:00,786 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:11:00,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:11:00,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:11:00,794 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 22:11:00,946 WARN L191 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 66 [2019-11-19 22:11:00,981 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:11:00,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-11-19 22:11:00,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=369, Unknown=0, NotChecked=0, Total=462 [2019-11-19 22:11:00,981 INFO L87 Difference]: Start difference. First operand 53 states and 57 transitions. cyclomatic complexity: 8 Second operand 22 states. [2019-11-19 22:11:01,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:11:01,778 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2019-11-19 22:11:01,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-11-19 22:11:01,778 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 44 transitions. [2019-11-19 22:11:01,779 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-19 22:11:01,779 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 0 states and 0 transitions. [2019-11-19 22:11:01,779 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-19 22:11:01,779 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-19 22:11:01,779 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-19 22:11:01,779 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-19 22:11:01,779 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-19 22:11:01,779 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-19 22:11:01,779 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-19 22:11:01,780 INFO L424 BuchiCegarLoop]: ======== Iteration 11============ [2019-11-19 22:11:01,780 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-11-19 22:11:01,780 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-19 22:11:01,780 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-11-19 22:11:01,785 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 19.11 10:11:01 BoogieIcfgContainer [2019-11-19 22:11:01,785 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-19 22:11:01,785 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-19 22:11:01,786 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-19 22:11:01,786 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-19 22:11:01,786 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:10:37" (3/4) ... [2019-11-19 22:11:01,789 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-19 22:11:01,789 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-19 22:11:01,790 INFO L168 Benchmark]: Toolchain (without parser) took 25464.96 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 303.6 MB). Free memory was 951.4 MB in the beginning and 896.7 MB in the end (delta: 54.7 MB). Peak memory consumption was 358.3 MB. Max. memory is 11.5 GB. [2019-11-19 22:11:01,790 INFO L168 Benchmark]: CDTParser took 0.29 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-19 22:11:01,791 INFO L168 Benchmark]: CACSL2BoogieTranslator took 394.15 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 155.7 MB). Free memory was 951.4 MB in the beginning and 1.2 GB in the end (delta: -202.0 MB). Peak memory consumption was 22.6 MB. Max. memory is 11.5 GB. [2019-11-19 22:11:01,791 INFO L168 Benchmark]: Boogie Procedure Inliner took 42.66 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-19 22:11:01,791 INFO L168 Benchmark]: Boogie Preprocessor took 45.60 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2019-11-19 22:11:01,791 INFO L168 Benchmark]: RCFGBuilder took 313.88 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. [2019-11-19 22:11:01,793 INFO L168 Benchmark]: BuchiAutomizer took 24655.98 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 147.8 MB). Free memory was 1.1 GB in the beginning and 896.7 MB in the end (delta: 231.6 MB). Peak memory consumption was 379.5 MB. Max. memory is 11.5 GB. [2019-11-19 22:11:01,793 INFO L168 Benchmark]: Witness Printer took 3.61 ms. Allocated memory is still 1.3 GB. Free memory is still 896.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-19 22:11:01,794 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.29 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 394.15 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 155.7 MB). Free memory was 951.4 MB in the beginning and 1.2 GB in the end (delta: -202.0 MB). Peak memory consumption was 22.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 42.66 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 45.60 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 313.88 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 24655.98 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 147.8 MB). Free memory was 1.1 GB in the beginning and 896.7 MB in the end (delta: 231.6 MB). Peak memory consumption was 379.5 MB. Max. memory is 11.5 GB. * Witness Printer took 3.61 ms. Allocated memory is still 1.3 GB. Free memory is still 896.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 10 terminating modules (6 trivial, 4 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -2 * unknown-#memory_int-unknown[x0][x0] + 1 and consists of 5 locations. One deterministic module has affine ranking function -2 * unknown-#memory_int-unknown[x1][x1] + 1 and consists of 7 locations. One deterministic module has affine ranking function -2 * aux-x2-aux + 1 and consists of 12 locations. One deterministic module has affine ranking function -2 * unknown-#memory_int-unknown[x1][x1] + 1 and consists of 7 locations. 6 modules have a trivial ranking function, the largest among these consists of 22 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 24.5s and 11 iterations. TraceHistogramMax:8. Analysis of lassos took 20.2s. Construction of modules took 0.8s. Büchi inclusion checks took 3.3s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 8. Automata minimization 0.0s AutomataMinimizationTime, 9 MinimizatonAttempts, 44 StatesRemovedByMinimization, 6 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 53 states and ocurred in iteration 9. Nontrivial modules had stage [4, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 13/25 HoareTripleCheckerStatistics: 47 SDtfs, 99 SDslu, 49 SDs, 0 SdLazy, 766 SolverSat, 111 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc2 concLT0 SILN0 SILU3 SILI0 SILT0 lasso4 LassoPreprocessingBenchmarks: Lassos: inital1981 mio100 ax100 hnf100 lsp98 ukn30 mio100 lsp39 div100 bol100 ite100 ukn100 eq190 hnf88 smp95 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 23ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 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...