./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-15/array14_alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 6b5699aa Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_e078c5e2-cbdd-4d44-bb3e-207f46d1b800/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_e078c5e2-cbdd-4d44-bb3e-207f46d1b800/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_e078c5e2-cbdd-4d44-bb3e-207f46d1b800/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_e078c5e2-cbdd-4d44-bb3e-207f46d1b800/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-15/array14_alloca.i -s /tmp/vcloud-vcloud-master/worker/run_dir_e078c5e2-cbdd-4d44-bb3e-207f46d1b800/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_e078c5e2-cbdd-4d44-bb3e-207f46d1b800/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 519b4f74907cdda12f126cdccb2c6422dda5240e .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM) --- Real Ultimate output --- This is Ultimate 0.1.24-6b5699a [2019-11-25 08:46:22,103 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-25 08:46:22,105 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-25 08:46:22,116 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-25 08:46:22,116 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-25 08:46:22,117 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-25 08:46:22,119 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-25 08:46:22,121 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-25 08:46:22,123 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-25 08:46:22,123 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-25 08:46:22,124 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-25 08:46:22,125 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-25 08:46:22,126 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-25 08:46:22,127 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-25 08:46:22,128 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-25 08:46:22,129 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-25 08:46:22,129 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-25 08:46:22,130 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-25 08:46:22,132 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-25 08:46:22,134 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-25 08:46:22,135 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-25 08:46:22,137 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-25 08:46:22,138 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-25 08:46:22,138 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-25 08:46:22,141 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-25 08:46:22,141 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-25 08:46:22,141 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-25 08:46:22,142 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-25 08:46:22,142 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-25 08:46:22,143 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-25 08:46:22,143 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-25 08:46:22,144 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-25 08:46:22,145 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-25 08:46:22,145 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-25 08:46:22,146 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-25 08:46:22,146 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-25 08:46:22,147 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-25 08:46:22,147 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-25 08:46:22,147 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-25 08:46:22,148 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-25 08:46:22,148 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-25 08:46:22,149 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_e078c5e2-cbdd-4d44-bb3e-207f46d1b800/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-11-25 08:46:22,164 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-25 08:46:22,164 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-25 08:46:22,165 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-25 08:46:22,165 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-25 08:46:22,165 INFO L138 SettingsManager]: * Use SBE=true [2019-11-25 08:46:22,165 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-25 08:46:22,166 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-25 08:46:22,166 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-25 08:46:22,166 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-25 08:46:22,166 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-25 08:46:22,166 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-25 08:46:22,167 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-25 08:46:22,167 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-25 08:46:22,167 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-25 08:46:22,167 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-25 08:46:22,167 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-25 08:46:22,167 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-25 08:46:22,168 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-25 08:46:22,168 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-25 08:46:22,168 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-25 08:46:22,168 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-25 08:46:22,168 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-25 08:46:22,169 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-25 08:46:22,169 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-25 08:46:22,169 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-25 08:46:22,169 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-25 08:46:22,169 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-25 08:46:22,169 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-25 08:46:22,170 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-25 08:46:22,170 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_e078c5e2-cbdd-4d44-bb3e-207f46d1b800/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 -> 519b4f74907cdda12f126cdccb2c6422dda5240e [2019-11-25 08:46:22,305 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-25 08:46:22,315 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-25 08:46:22,318 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-25 08:46:22,319 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-25 08:46:22,319 INFO L275 PluginConnector]: CDTParser initialized [2019-11-25 08:46:22,320 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_e078c5e2-cbdd-4d44-bb3e-207f46d1b800/bin/uautomizer/../../sv-benchmarks/c/termination-15/array14_alloca.i [2019-11-25 08:46:22,378 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_e078c5e2-cbdd-4d44-bb3e-207f46d1b800/bin/uautomizer/data/f0e73ba9d/4ef5f7309d934eb8bf9e362833bcf8bc/FLAG349640fc6 [2019-11-25 08:46:22,784 INFO L306 CDTParser]: Found 1 translation units. [2019-11-25 08:46:22,785 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_e078c5e2-cbdd-4d44-bb3e-207f46d1b800/sv-benchmarks/c/termination-15/array14_alloca.i [2019-11-25 08:46:22,797 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_e078c5e2-cbdd-4d44-bb3e-207f46d1b800/bin/uautomizer/data/f0e73ba9d/4ef5f7309d934eb8bf9e362833bcf8bc/FLAG349640fc6 [2019-11-25 08:46:23,099 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_e078c5e2-cbdd-4d44-bb3e-207f46d1b800/bin/uautomizer/data/f0e73ba9d/4ef5f7309d934eb8bf9e362833bcf8bc [2019-11-25 08:46:23,101 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-25 08:46:23,102 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-25 08:46:23,103 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-25 08:46:23,103 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-25 08:46:23,106 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-25 08:46:23,107 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 08:46:23" (1/1) ... [2019-11-25 08:46:23,111 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@26c6cc54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:46:23, skipping insertion in model container [2019-11-25 08:46:23,112 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 08:46:23" (1/1) ... [2019-11-25 08:46:23,118 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-25 08:46:23,162 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-25 08:46:23,534 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 08:46:23,546 INFO L201 MainTranslator]: Completed pre-run [2019-11-25 08:46:23,617 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 08:46:23,686 INFO L205 MainTranslator]: Completed translation [2019-11-25 08:46:23,687 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:46:23 WrapperNode [2019-11-25 08:46:23,687 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-25 08:46:23,688 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-25 08:46:23,688 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-25 08:46:23,688 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-25 08:46:23,696 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:46:23" (1/1) ... [2019-11-25 08:46:23,719 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:46:23" (1/1) ... [2019-11-25 08:46:23,738 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-25 08:46:23,738 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-25 08:46:23,738 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-25 08:46:23,738 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-25 08:46:23,746 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:46:23" (1/1) ... [2019-11-25 08:46:23,747 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:46:23" (1/1) ... [2019-11-25 08:46:23,748 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:46:23" (1/1) ... [2019-11-25 08:46:23,748 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:46:23" (1/1) ... [2019-11-25 08:46:23,753 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:46:23" (1/1) ... [2019-11-25 08:46:23,757 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:46:23" (1/1) ... [2019-11-25 08:46:23,758 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:46:23" (1/1) ... [2019-11-25 08:46:23,760 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-25 08:46:23,760 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-25 08:46:23,760 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-25 08:46:23,760 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-25 08:46:23,761 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:46:23" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e078c5e2-cbdd-4d44-bb3e-207f46d1b800/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-25 08:46:23,820 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-25 08:46:23,820 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-25 08:46:23,821 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-25 08:46:23,821 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-25 08:46:23,821 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-25 08:46:23,821 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-25 08:46:24,022 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-25 08:46:24,023 INFO L284 CfgBuilder]: Removed 6 assume(true) statements. [2019-11-25 08:46:24,024 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:46:24 BoogieIcfgContainer [2019-11-25 08:46:24,024 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-25 08:46:24,024 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-25 08:46:24,024 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-25 08:46:24,027 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-25 08:46:24,045 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-25 08:46:24,046 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 25.11 08:46:23" (1/3) ... [2019-11-25 08:46:24,047 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@108701cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 25.11 08:46:24, skipping insertion in model container [2019-11-25 08:46:24,047 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-25 08:46:24,047 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:46:23" (2/3) ... [2019-11-25 08:46:24,048 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@108701cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 25.11 08:46:24, skipping insertion in model container [2019-11-25 08:46:24,048 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-25 08:46:24,048 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:46:24" (3/3) ... [2019-11-25 08:46:24,049 INFO L371 chiAutomizerObserver]: Analyzing ICFG array14_alloca.i [2019-11-25 08:46:24,134 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-25 08:46:24,134 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-25 08:46:24,135 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-25 08:46:24,135 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-25 08:46:24,135 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-25 08:46:24,135 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-25 08:46:24,135 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-25 08:46:24,135 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-25 08:46:24,147 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2019-11-25 08:46:24,166 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2019-11-25 08:46:24,166 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-25 08:46:24,167 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-25 08:46:24,172 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-25 08:46:24,173 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-25 08:46:24,173 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-25 08:46:24,173 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2019-11-25 08:46:24,174 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2019-11-25 08:46:24,175 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-25 08:46:24,175 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-25 08:46:24,175 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-25 08:46:24,175 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-25 08:46:24,182 INFO L794 eck$LassoCheckResult]: Stem: 10#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 8#L-1true havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~nondet208, main_#t~mem209, main_#t~post207, main_#t~mem210, main_#t~post211, main_#t~post212, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet205;havoc main_#t~nondet205; 16#L367true assume !(main_~length~0 < 1); 5#L367-2true call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; 12#L369true assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 17#L370-3true [2019-11-25 08:46:24,183 INFO L796 eck$LassoCheckResult]: Loop: 17#L370-3true assume !!(main_~i~0 < main_~length~0);call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet208;call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 9#L372true assume main_#t~mem209 > 0;havoc main_#t~mem209;call write~int(0, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 14#L370-2true main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 17#L370-3true [2019-11-25 08:46:24,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:46:24,188 INFO L82 PathProgramCache]: Analyzing trace with hash 28695753, now seen corresponding path program 1 times [2019-11-25 08:46:24,196 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:46:24,196 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474578545] [2019-11-25 08:46:24,197 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:46:24,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:46:24,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:46:24,314 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:46:24,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:46:24,315 INFO L82 PathProgramCache]: Analyzing trace with hash 51737, now seen corresponding path program 1 times [2019-11-25 08:46:24,315 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:46:24,315 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445328442] [2019-11-25 08:46:24,315 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:46:24,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:46:24,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:46:24,337 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:46:24,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:46:24,338 INFO L82 PathProgramCache]: Analyzing trace with hash 176707665, now seen corresponding path program 1 times [2019-11-25 08:46:24,339 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:46:24,339 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218310206] [2019-11-25 08:46:24,339 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:46:24,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:46:24,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:46:24,376 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:46:24,566 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 39 [2019-11-25 08:46:24,619 INFO L210 LassoAnalysis]: Preferences: [2019-11-25 08:46:24,620 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-25 08:46:24,620 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-25 08:46:24,620 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-25 08:46:24,620 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-25 08:46:24,621 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:46:24,621 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-25 08:46:24,621 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-25 08:46:24,621 INFO L133 ssoRankerPreferences]: Filename of dumped script: array14_alloca.i_Iteration1_Lasso [2019-11-25 08:46:24,621 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-25 08:46:24,622 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-25 08:46:24,648 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-25 08:46:24,655 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-25 08:46:24,658 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-25 08:46:24,661 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-25 08:46:24,663 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-25 08:46:24,670 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-25 08:46:24,674 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-25 08:46:24,677 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-25 08:46:24,680 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-25 08:46:24,685 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-25 08:46:24,803 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-25 08:46:24,806 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-25 08:46:25,046 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-25 08:46:25,051 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e078c5e2-cbdd-4d44-bb3e-207f46d1b800/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-25 08:46:25,066 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-25 08:46:25,069 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:46:25,069 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-25 08:46:25,070 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:46:25,070 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:46:25,070 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:46:25,072 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-25 08:46:25,073 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:46:25,075 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e078c5e2-cbdd-4d44-bb3e-207f46d1b800/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) [2019-11-25 08:46:25,091 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-25 08:46:25,093 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:46:25,093 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-25 08:46:25,093 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:46:25,093 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:46:25,093 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:46:25,096 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-25 08:46:25,096 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:46:25,099 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e078c5e2-cbdd-4d44-bb3e-207f46d1b800/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-25 08:46:25,110 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-25 08:46:25,112 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:46:25,112 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-25 08:46:25,112 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:46:25,112 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:46:25,113 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:46:25,113 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-25 08:46:25,114 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-25 08:46:25,119 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e078c5e2-cbdd-4d44-bb3e-207f46d1b800/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) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:46:25,136 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-25 08:46:25,138 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:46:25,138 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-25 08:46:25,138 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:46:25,139 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:46:25,139 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:46:25,139 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-25 08:46:25,140 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-25 08:46:25,141 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e078c5e2-cbdd-4d44-bb3e-207f46d1b800/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) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:46:25,154 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-25 08:46:25,156 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:46:25,156 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:46:25,156 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:46:25,156 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:46:25,162 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-25 08:46:25,162 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-25 08:46:25,167 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e078c5e2-cbdd-4d44-bb3e-207f46d1b800/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-25 08:46:25,172 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-25 08:46:25,173 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:46:25,174 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-25 08:46:25,174 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:46:25,174 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:46:25,174 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:46:25,175 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-25 08:46:25,175 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-25 08:46:25,176 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e078c5e2-cbdd-4d44-bb3e-207f46d1b800/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-25 08:46:25,186 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-25 08:46:25,188 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:46:25,188 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-25 08:46:25,188 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:46:25,188 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:46:25,188 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:46:25,189 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-25 08:46:25,189 INFO L402 nArgumentSynthesizer]: A total of 0 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-25 08:46:25,191 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e078c5e2-cbdd-4d44-bb3e-207f46d1b800/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-25 08:46:25,196 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-25 08:46:25,198 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:46:25,198 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-25 08:46:25,198 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:46:25,198 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:46:25,198 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:46:25,203 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-25 08:46:25,203 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-25 08:46:25,206 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e078c5e2-cbdd-4d44-bb3e-207f46d1b800/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) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:46:25,218 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-25 08:46:25,220 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:46:25,220 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:46:25,220 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:46:25,221 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:46:25,227 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-25 08:46:25,229 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-25 08:46:25,238 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e078c5e2-cbdd-4d44-bb3e-207f46d1b800/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) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:46:25,248 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-25 08:46:25,250 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:46:25,250 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:46:25,250 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:46:25,250 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:46:25,268 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-25 08:46:25,269 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-25 08:46:25,286 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-25 08:46:25,327 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2019-11-25 08:46:25,328 INFO L444 ModelExtractionUtils]: 8 out of 22 variables were initially zero. Simplification set additionally 9 variables to zero. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e078c5e2-cbdd-4d44-bb3e-207f46d1b800/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-25 08:46:25,342 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:46:25,345 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2019-11-25 08:46:25,346 INFO L510 LassoAnalysis]: Proved termination. [2019-11-25 08:46:25,346 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc206.base)_1, ULTIMATE.start_main_~i~0) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc206.base)_1 - 4*ULTIMATE.start_main_~i~0 Supporting invariants [1*v_rep(select #length ULTIMATE.start_main_~arr~0.base)_1 - 4*ULTIMATE.start_main_~length~0 >= 0] [2019-11-25 08:46:25,367 INFO L297 tatePredicateManager]: 2 out of 4 supporting invariants were superfluous and have been removed [2019-11-25 08:46:25,384 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-25 08:46:25,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:46:25,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:46:25,449 INFO L255 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-25 08:46:25,451 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:46:25,517 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-11-25 08:46:25,517 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-25 08:46:25,525 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-25 08:46:25,525 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-25 08:46:25,525 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-11-25 08:46:25,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:46:25,560 INFO L255 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-25 08:46:25,562 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:46:25,590 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-25 08:46:25,605 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2019-11-25 08:46:25,606 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states. Second operand 4 states. [2019-11-25 08:46:25,700 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states.. Second operand 4 states. Result 32 states and 47 transitions. Complement of second has 9 states. [2019-11-25 08:46:25,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-25 08:46:25,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-25 08:46:25,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 30 transitions. [2019-11-25 08:46:25,704 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 30 transitions. Stem has 5 letters. Loop has 3 letters. [2019-11-25 08:46:25,705 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-25 08:46:25,705 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 30 transitions. Stem has 8 letters. Loop has 3 letters. [2019-11-25 08:46:25,705 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-25 08:46:25,706 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 30 transitions. Stem has 5 letters. Loop has 6 letters. [2019-11-25 08:46:25,706 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-25 08:46:25,707 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 47 transitions. [2019-11-25 08:46:25,713 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-25 08:46:25,717 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 12 states and 17 transitions. [2019-11-25 08:46:25,718 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2019-11-25 08:46:25,719 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2019-11-25 08:46:25,722 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 17 transitions. [2019-11-25 08:46:25,723 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-25 08:46:25,723 INFO L688 BuchiCegarLoop]: Abstraction has 12 states and 17 transitions. [2019-11-25 08:46:25,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 17 transitions. [2019-11-25 08:46:25,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-11-25 08:46:25,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-11-25 08:46:25,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 17 transitions. [2019-11-25 08:46:25,749 INFO L711 BuchiCegarLoop]: Abstraction has 12 states and 17 transitions. [2019-11-25 08:46:25,749 INFO L591 BuchiCegarLoop]: Abstraction has 12 states and 17 transitions. [2019-11-25 08:46:25,750 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-25 08:46:25,750 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 17 transitions. [2019-11-25 08:46:25,752 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-25 08:46:25,752 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-25 08:46:25,752 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-25 08:46:25,752 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:46:25,752 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-25 08:46:25,753 INFO L794 eck$LassoCheckResult]: Stem: 129#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 125#L-1 havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~nondet208, main_#t~mem209, main_#t~post207, main_#t~mem210, main_#t~post211, main_#t~post212, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet205;havoc main_#t~nondet205; 126#L367 assume !(main_~length~0 < 1); 131#L367-2 call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; 132#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 133#L370-3 assume !(main_~i~0 < main_~length~0); 127#L370-4 main_~j~0 := 0; 128#L378-2 [2019-11-25 08:46:25,753 INFO L796 eck$LassoCheckResult]: Loop: 128#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 130#L378 assume main_#t~mem210 < 0;havoc main_#t~mem210;main_#t~post211 := main_~j~0;main_~j~0 := main_#t~post211 - 1;havoc main_#t~post211; 128#L378-2 [2019-11-25 08:46:25,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:46:25,754 INFO L82 PathProgramCache]: Analyzing trace with hash 1806815510, now seen corresponding path program 1 times [2019-11-25 08:46:25,754 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:46:25,755 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664094995] [2019-11-25 08:46:25,755 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:46:25,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:46:25,851 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-25 08:46:25,851 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664094995] [2019-11-25 08:46:25,852 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:46:25,852 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:46:25,852 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009305275] [2019-11-25 08:46:25,855 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-25 08:46:25,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:46:25,856 INFO L82 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 1 times [2019-11-25 08:46:25,856 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:46:25,856 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062215080] [2019-11-25 08:46:25,856 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:46:25,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:46:25,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:46:25,881 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:46:25,929 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:46:25,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:46:25,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:46:25,933 INFO L87 Difference]: Start difference. First operand 12 states and 17 transitions. cyclomatic complexity: 7 Second operand 4 states. [2019-11-25 08:46:25,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:46:25,970 INFO L93 Difference]: Finished difference Result 14 states and 19 transitions. [2019-11-25 08:46:25,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:46:25,971 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 19 transitions. [2019-11-25 08:46:25,972 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-25 08:46:25,973 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 14 states and 19 transitions. [2019-11-25 08:46:25,978 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2019-11-25 08:46:25,978 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2019-11-25 08:46:25,978 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 19 transitions. [2019-11-25 08:46:25,978 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-25 08:46:25,979 INFO L688 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2019-11-25 08:46:25,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 19 transitions. [2019-11-25 08:46:25,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 12. [2019-11-25 08:46:25,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-11-25 08:46:25,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 16 transitions. [2019-11-25 08:46:25,980 INFO L711 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2019-11-25 08:46:25,981 INFO L591 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2019-11-25 08:46:25,981 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-25 08:46:25,981 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 16 transitions. [2019-11-25 08:46:25,981 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-25 08:46:25,982 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-25 08:46:25,982 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-25 08:46:25,982 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:46:25,982 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-25 08:46:25,983 INFO L794 eck$LassoCheckResult]: Stem: 162#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 156#L-1 havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~nondet208, main_#t~mem209, main_#t~post207, main_#t~mem210, main_#t~post211, main_#t~post212, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet205;havoc main_#t~nondet205; 157#L367 assume !(main_~length~0 < 1); 164#L367-2 call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; 165#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 166#L370-3 assume !!(main_~i~0 < main_~length~0);call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet208;call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 158#L372 assume !(main_#t~mem209 > 0);havoc main_#t~mem209; 159#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 167#L370-3 assume !(main_~i~0 < main_~length~0); 160#L370-4 main_~j~0 := 0; 161#L378-2 [2019-11-25 08:46:25,983 INFO L796 eck$LassoCheckResult]: Loop: 161#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 163#L378 assume main_#t~mem210 < 0;havoc main_#t~mem210;main_#t~post211 := main_~j~0;main_~j~0 := main_#t~post211 - 1;havoc main_#t~post211; 161#L378-2 [2019-11-25 08:46:25,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:46:25,983 INFO L82 PathProgramCache]: Analyzing trace with hash -1982565540, now seen corresponding path program 1 times [2019-11-25 08:46:25,983 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:46:25,984 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597097376] [2019-11-25 08:46:25,984 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:46:25,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:46:26,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:46:26,028 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:46:26,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:46:26,033 INFO L82 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 2 times [2019-11-25 08:46:26,033 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:46:26,033 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776396349] [2019-11-25 08:46:26,033 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:46:26,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:46:26,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:46:26,041 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:46:26,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:46:26,042 INFO L82 PathProgramCache]: Analyzing trace with hash 1719996831, now seen corresponding path program 1 times [2019-11-25 08:46:26,042 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:46:26,042 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431451666] [2019-11-25 08:46:26,042 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:46:26,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:46:26,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:46:26,068 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:46:26,286 WARN L192 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 64 [2019-11-25 08:46:26,346 INFO L210 LassoAnalysis]: Preferences: [2019-11-25 08:46:26,346 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-25 08:46:26,346 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-25 08:46:26,346 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-25 08:46:26,346 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-25 08:46:26,346 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:46:26,347 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-25 08:46:26,347 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-25 08:46:26,347 INFO L133 ssoRankerPreferences]: Filename of dumped script: array14_alloca.i_Iteration3_Lasso [2019-11-25 08:46:26,347 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-25 08:46:26,347 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-25 08:46:26,350 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-25 08:46:26,353 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-25 08:46:26,355 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-25 08:46:26,362 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-25 08:46:26,505 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 37 [2019-11-25 08:46:26,534 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-25 08:46:26,537 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-25 08:46:26,539 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-25 08:46:26,541 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-25 08:46:26,543 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-25 08:46:26,545 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-25 08:46:26,548 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-25 08:46:26,555 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-25 08:46:26,816 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-25 08:46:26,817 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e078c5e2-cbdd-4d44-bb3e-207f46d1b800/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-25 08:46:26,827 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-25 08:46:26,831 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:46:26,832 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-25 08:46:26,832 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:46:26,832 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:46:26,832 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:46:26,838 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-25 08:46:26,838 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-25 08:46:26,842 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e078c5e2-cbdd-4d44-bb3e-207f46d1b800/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-25 08:46:26,858 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-25 08:46:26,860 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:46:26,860 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-25 08:46:26,860 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:46:26,860 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:46:26,860 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:46:26,861 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-25 08:46:26,861 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-25 08:46:26,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_e078c5e2-cbdd-4d44-bb3e-207f46d1b800/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) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:46:26,870 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-25 08:46:26,872 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:46:26,872 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:46:26,872 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:46:26,872 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:46:26,874 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-25 08:46:26,874 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-25 08:46:26,877 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e078c5e2-cbdd-4d44-bb3e-207f46d1b800/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-25 08:46:26,886 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-25 08:46:26,888 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:46:26,888 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:46:26,888 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:46:26,888 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:46:26,891 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-25 08:46:26,892 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-25 08:46:26,897 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e078c5e2-cbdd-4d44-bb3e-207f46d1b800/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) [2019-11-25 08:46:26,911 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-25 08:46:26,912 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:46:26,913 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:46:26,913 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:46:26,913 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:46:26,915 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-25 08:46:26,915 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:46:26,919 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e078c5e2-cbdd-4d44-bb3e-207f46d1b800/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) [2019-11-25 08:46:26,933 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-25 08:46:26,935 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:46:26,935 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:46:26,935 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:46:26,936 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:46:26,942 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-25 08:46:26,943 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-25 08:46:26,958 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:46:27,000 INFO L443 ModelExtractionUtils]: Simplification made 18 calls to the SMT solver. [2019-11-25 08:46:27,000 INFO L444 ModelExtractionUtils]: 1 out of 22 variables were initially zero. Simplification set additionally 18 variables to zero. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e078c5e2-cbdd-4d44-bb3e-207f46d1b800/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-25 08:46:27,010 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-25 08:46:27,013 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-25 08:46:27,013 INFO L510 LassoAnalysis]: Proved termination. [2019-11-25 08:46:27,013 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc206.base)_2, ULTIMATE.start_main_~j~0) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc206.base)_2 + 8*ULTIMATE.start_main_~j~0 Supporting invariants [] [2019-11-25 08:46:27,027 INFO L297 tatePredicateManager]: 2 out of 3 supporting invariants were superfluous and have been removed [2019-11-25 08:46:27,030 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-25 08:46:27,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:46:27,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:46:27,068 INFO L255 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-25 08:46:27,068 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:46:27,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:46:27,080 WARN L253 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-25 08:46:27,081 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:46:27,103 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-25 08:46:27,104 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2019-11-25 08:46:27,104 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states and 16 transitions. cyclomatic complexity: 6 Second operand 4 states. [2019-11-25 08:46:27,145 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states and 16 transitions. cyclomatic complexity: 6. Second operand 4 states. Result 16 states and 22 transitions. Complement of second has 6 states. [2019-11-25 08:46:27,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-25 08:46:27,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-25 08:46:27,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 14 transitions. [2019-11-25 08:46:27,145 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 10 letters. Loop has 2 letters. [2019-11-25 08:46:27,146 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-25 08:46:27,146 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 12 letters. Loop has 2 letters. [2019-11-25 08:46:27,146 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-25 08:46:27,146 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 10 letters. Loop has 4 letters. [2019-11-25 08:46:27,146 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-25 08:46:27,146 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 22 transitions. [2019-11-25 08:46:27,147 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-25 08:46:27,147 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 16 states and 22 transitions. [2019-11-25 08:46:27,148 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-11-25 08:46:27,148 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-11-25 08:46:27,148 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 22 transitions. [2019-11-25 08:46:27,148 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-25 08:46:27,148 INFO L688 BuchiCegarLoop]: Abstraction has 16 states and 22 transitions. [2019-11-25 08:46:27,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 22 transitions. [2019-11-25 08:46:27,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-11-25 08:46:27,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-11-25 08:46:27,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 22 transitions. [2019-11-25 08:46:27,150 INFO L711 BuchiCegarLoop]: Abstraction has 16 states and 22 transitions. [2019-11-25 08:46:27,150 INFO L591 BuchiCegarLoop]: Abstraction has 16 states and 22 transitions. [2019-11-25 08:46:27,150 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-25 08:46:27,150 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 22 transitions. [2019-11-25 08:46:27,151 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-25 08:46:27,151 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-25 08:46:27,151 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-25 08:46:27,152 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:46:27,152 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-25 08:46:27,152 INFO L794 eck$LassoCheckResult]: Stem: 266#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 260#L-1 havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~nondet208, main_#t~mem209, main_#t~post207, main_#t~mem210, main_#t~post211, main_#t~post212, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet205;havoc main_#t~nondet205; 261#L367 assume !(main_~length~0 < 1); 272#L367-2 call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; 273#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 274#L370-3 assume !!(main_~i~0 < main_~length~0);call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet208;call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 262#L372 assume !(main_#t~mem209 > 0);havoc main_#t~mem209; 263#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 275#L370-3 assume !(main_~i~0 < main_~length~0); 264#L370-4 main_~j~0 := 0; 265#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 271#L378 assume !(main_#t~mem210 < 0);havoc main_#t~mem210;main_#t~post212 := main_~j~0;main_~j~0 := 1 + main_#t~post212;havoc main_#t~post212; 267#L378-2 [2019-11-25 08:46:27,152 INFO L796 eck$LassoCheckResult]: Loop: 267#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 268#L378 assume main_#t~mem210 < 0;havoc main_#t~mem210;main_#t~post211 := main_~j~0;main_~j~0 := main_#t~post211 - 1;havoc main_#t~post211; 267#L378-2 [2019-11-25 08:46:27,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:46:27,153 INFO L82 PathProgramCache]: Analyzing trace with hash 1719996833, now seen corresponding path program 1 times [2019-11-25 08:46:27,153 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:46:27,153 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186493495] [2019-11-25 08:46:27,153 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:46:27,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:46:27,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:46:27,180 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:46:27,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:46:27,180 INFO L82 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 3 times [2019-11-25 08:46:27,180 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:46:27,181 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431717968] [2019-11-25 08:46:27,181 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:46:27,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:46:27,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:46:27,187 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:46:27,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:46:27,188 INFO L82 PathProgramCache]: Analyzing trace with hash -645451100, now seen corresponding path program 1 times [2019-11-25 08:46:27,188 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:46:27,188 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382328347] [2019-11-25 08:46:27,188 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:46:27,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:46:27,359 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:46:27,359 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382328347] [2019-11-25 08:46:27,360 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2129431792] [2019-11-25 08:46:27,360 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e078c5e2-cbdd-4d44-bb3e-207f46d1b800/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-25 08:46:27,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:46:27,406 INFO L255 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-25 08:46:27,407 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:46:27,475 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-25 08:46:27,475 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 08:46:27,475 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 13 [2019-11-25 08:46:27,475 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289199371] [2019-11-25 08:46:27,515 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:46:27,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-25 08:46:27,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2019-11-25 08:46:27,516 INFO L87 Difference]: Start difference. First operand 16 states and 22 transitions. cyclomatic complexity: 9 Second operand 13 states. [2019-11-25 08:46:27,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:46:27,739 INFO L93 Difference]: Finished difference Result 33 states and 45 transitions. [2019-11-25 08:46:27,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-25 08:46:27,740 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 45 transitions. [2019-11-25 08:46:27,741 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-25 08:46:27,742 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 21 states and 28 transitions. [2019-11-25 08:46:27,742 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-11-25 08:46:27,742 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-11-25 08:46:27,743 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 28 transitions. [2019-11-25 08:46:27,743 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-25 08:46:27,743 INFO L688 BuchiCegarLoop]: Abstraction has 21 states and 28 transitions. [2019-11-25 08:46:27,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 28 transitions. [2019-11-25 08:46:27,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 19. [2019-11-25 08:46:27,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-11-25 08:46:27,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 25 transitions. [2019-11-25 08:46:27,745 INFO L711 BuchiCegarLoop]: Abstraction has 19 states and 25 transitions. [2019-11-25 08:46:27,745 INFO L591 BuchiCegarLoop]: Abstraction has 19 states and 25 transitions. [2019-11-25 08:46:27,745 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-25 08:46:27,748 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 25 transitions. [2019-11-25 08:46:27,750 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-25 08:46:27,751 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-25 08:46:27,751 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-25 08:46:27,752 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:46:27,752 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-25 08:46:27,753 INFO L794 eck$LassoCheckResult]: Stem: 380#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 376#L-1 havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~nondet208, main_#t~mem209, main_#t~post207, main_#t~mem210, main_#t~post211, main_#t~post212, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet205;havoc main_#t~nondet205; 377#L367 assume !(main_~length~0 < 1); 386#L367-2 call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; 387#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 388#L370-3 assume !!(main_~i~0 < main_~length~0);call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet208;call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 391#L372 assume !(main_#t~mem209 > 0);havoc main_#t~mem209; 389#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 390#L370-3 assume !!(main_~i~0 < main_~length~0);call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet208;call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 374#L372 assume !(main_#t~mem209 > 0);havoc main_#t~mem209; 375#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 392#L370-3 assume !(main_~i~0 < main_~length~0); 378#L370-4 main_~j~0 := 0; 379#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 385#L378 assume !(main_#t~mem210 < 0);havoc main_#t~mem210;main_#t~post212 := main_~j~0;main_~j~0 := 1 + main_#t~post212;havoc main_#t~post212; 381#L378-2 [2019-11-25 08:46:27,753 INFO L796 eck$LassoCheckResult]: Loop: 381#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 382#L378 assume main_#t~mem210 < 0;havoc main_#t~mem210;main_#t~post211 := main_~j~0;main_~j~0 := main_#t~post211 - 1;havoc main_#t~post211; 381#L378-2 [2019-11-25 08:46:27,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:46:27,754 INFO L82 PathProgramCache]: Analyzing trace with hash -1238701285, now seen corresponding path program 2 times [2019-11-25 08:46:27,754 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:46:27,754 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295567356] [2019-11-25 08:46:27,755 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:46:27,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:46:27,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:46:27,810 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:46:27,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:46:27,813 INFO L82 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 4 times [2019-11-25 08:46:27,814 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:46:27,814 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252013246] [2019-11-25 08:46:27,814 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:46:27,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:46:27,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:46:27,827 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:46:27,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:46:27,828 INFO L82 PathProgramCache]: Analyzing trace with hash -685992546, now seen corresponding path program 2 times [2019-11-25 08:46:27,829 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:46:27,829 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188072230] [2019-11-25 08:46:27,829 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:46:27,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:46:27,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:46:27,890 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:46:28,208 WARN L192 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 91 [2019-11-25 08:46:28,272 INFO L210 LassoAnalysis]: Preferences: [2019-11-25 08:46:28,272 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-25 08:46:28,272 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-25 08:46:28,272 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-25 08:46:28,272 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-25 08:46:28,272 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:46:28,272 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-25 08:46:28,272 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-25 08:46:28,272 INFO L133 ssoRankerPreferences]: Filename of dumped script: array14_alloca.i_Iteration5_Lasso [2019-11-25 08:46:28,272 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-25 08:46:28,273 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-25 08:46:28,275 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-25 08:46:28,278 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-25 08:46:28,446 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-25 08:46:28,449 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-25 08:46:28,454 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-25 08:46:28,456 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-25 08:46:28,458 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-25 08:46:28,463 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-25 08:46:28,465 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-25 08:46:28,468 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-25 08:46:28,469 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-25 08:46:28,742 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-25 08:46:28,743 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e078c5e2-cbdd-4d44-bb3e-207f46d1b800/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-25 08:46:28,751 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-25 08:46:28,752 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:46:28,752 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-25 08:46:28,752 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:46:28,752 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:46:28,752 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:46:28,753 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-25 08:46:28,753 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-25 08:46:28,754 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e078c5e2-cbdd-4d44-bb3e-207f46d1b800/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-25 08:46:28,762 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-25 08:46:28,763 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:46:28,764 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:46:28,764 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:46:28,764 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:46:28,768 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-25 08:46:28,768 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-25 08:46:28,775 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e078c5e2-cbdd-4d44-bb3e-207f46d1b800/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-25 08:46:28,791 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-25 08:46:28,793 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-25 08:46:28,794 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-25 08:46:28,794 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-25 08:46:28,794 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-25 08:46:28,803 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-25 08:46:28,804 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:46:28,822 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-25 08:46:28,889 INFO L443 ModelExtractionUtils]: Simplification made 22 calls to the SMT solver. [2019-11-25 08:46:28,890 INFO L444 ModelExtractionUtils]: 6 out of 25 variables were initially zero. Simplification set additionally 16 variables to zero. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e078c5e2-cbdd-4d44-bb3e-207f46d1b800/bin/uautomizer/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-25 08:46:28,903 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-25 08:46:28,906 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-25 08:46:28,906 INFO L510 LassoAnalysis]: Proved termination. [2019-11-25 08:46:28,907 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0, v_rep(select #length ULTIMATE.start_main_#t~malloc206.base)_3) = 8*ULTIMATE.start_main_~j~0 + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc206.base)_3 Supporting invariants [] [2019-11-25 08:46:28,938 INFO L297 tatePredicateManager]: 3 out of 4 supporting invariants were superfluous and have been removed [2019-11-25 08:46:28,946 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-25 08:46:29,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:46:29,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:46:29,054 INFO L255 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-25 08:46:29,059 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:46:29,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:46:29,074 WARN L253 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-25 08:46:29,075 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:46:29,120 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-25 08:46:29,121 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2019-11-25 08:46:29,123 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 19 states and 25 transitions. cyclomatic complexity: 9 Second operand 4 states. [2019-11-25 08:46:29,162 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 19 states and 25 transitions. cyclomatic complexity: 9. Second operand 4 states. Result 23 states and 31 transitions. Complement of second has 6 states. [2019-11-25 08:46:29,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-25 08:46:29,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-25 08:46:29,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2019-11-25 08:46:29,163 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 15 letters. Loop has 2 letters. [2019-11-25 08:46:29,163 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-25 08:46:29,163 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 17 letters. Loop has 2 letters. [2019-11-25 08:46:29,163 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-25 08:46:29,164 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 15 letters. Loop has 4 letters. [2019-11-25 08:46:29,164 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-25 08:46:29,164 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 31 transitions. [2019-11-25 08:46:29,165 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-25 08:46:29,165 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 23 states and 31 transitions. [2019-11-25 08:46:29,165 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2019-11-25 08:46:29,165 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2019-11-25 08:46:29,166 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 31 transitions. [2019-11-25 08:46:29,166 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-25 08:46:29,166 INFO L688 BuchiCegarLoop]: Abstraction has 23 states and 31 transitions. [2019-11-25 08:46:29,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 31 transitions. [2019-11-25 08:46:29,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-11-25 08:46:29,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-11-25 08:46:29,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 31 transitions. [2019-11-25 08:46:29,168 INFO L711 BuchiCegarLoop]: Abstraction has 23 states and 31 transitions. [2019-11-25 08:46:29,168 INFO L591 BuchiCegarLoop]: Abstraction has 23 states and 31 transitions. [2019-11-25 08:46:29,168 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-25 08:46:29,168 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 31 transitions. [2019-11-25 08:46:29,169 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-25 08:46:29,169 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-25 08:46:29,169 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-25 08:46:29,170 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:46:29,170 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-25 08:46:29,170 INFO L794 eck$LassoCheckResult]: Stem: 517#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 513#L-1 havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~nondet208, main_#t~mem209, main_#t~post207, main_#t~mem210, main_#t~post211, main_#t~post212, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet205;havoc main_#t~nondet205; 514#L367 assume !(main_~length~0 < 1); 523#L367-2 call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; 524#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 525#L370-3 assume !!(main_~i~0 < main_~length~0);call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet208;call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 529#L372 assume !(main_#t~mem209 > 0);havoc main_#t~mem209; 526#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 527#L370-3 assume !!(main_~i~0 < main_~length~0);call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet208;call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 511#L372 assume !(main_#t~mem209 > 0);havoc main_#t~mem209; 512#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 530#L370-3 assume !(main_~i~0 < main_~length~0); 515#L370-4 main_~j~0 := 0; 516#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 522#L378 assume !(main_#t~mem210 < 0);havoc main_#t~mem210;main_#t~post212 := main_~j~0;main_~j~0 := 1 + main_#t~post212;havoc main_#t~post212; 528#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 531#L378 assume !(main_#t~mem210 < 0);havoc main_#t~mem210;main_#t~post212 := main_~j~0;main_~j~0 := 1 + main_#t~post212;havoc main_#t~post212; 518#L378-2 [2019-11-25 08:46:29,170 INFO L796 eck$LassoCheckResult]: Loop: 518#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 519#L378 assume main_#t~mem210 < 0;havoc main_#t~mem210;main_#t~post211 := main_~j~0;main_~j~0 := main_#t~post211 - 1;havoc main_#t~post211; 518#L378-2 [2019-11-25 08:46:29,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:46:29,170 INFO L82 PathProgramCache]: Analyzing trace with hash -685992544, now seen corresponding path program 3 times [2019-11-25 08:46:29,171 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:46:29,171 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818292906] [2019-11-25 08:46:29,171 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:46:29,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:46:29,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:46:29,192 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:46:29,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:46:29,193 INFO L82 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 5 times [2019-11-25 08:46:29,193 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:46:29,193 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168890913] [2019-11-25 08:46:29,193 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:46:29,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:46:29,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:46:29,198 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:46:29,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:46:29,199 INFO L82 PathProgramCache]: Analyzing trace with hash -2108837149, now seen corresponding path program 3 times [2019-11-25 08:46:29,199 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:46:29,199 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801365929] [2019-11-25 08:46:29,199 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:46:29,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:46:29,336 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:46:29,336 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801365929] [2019-11-25 08:46:29,336 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2016319744] [2019-11-25 08:46:29,336 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e078c5e2-cbdd-4d44-bb3e-207f46d1b800/bin/uautomizer/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:46:29,391 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-11-25 08:46:29,391 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-25 08:46:29,391 INFO L255 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-25 08:46:29,393 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:46:29,475 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:46:29,475 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 08:46:29,475 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 17 [2019-11-25 08:46:29,475 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317059067] [2019-11-25 08:46:29,504 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:46:29,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-11-25 08:46:29,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=212, Unknown=0, NotChecked=0, Total=272 [2019-11-25 08:46:29,504 INFO L87 Difference]: Start difference. First operand 23 states and 31 transitions. cyclomatic complexity: 12 Second operand 17 states. [2019-11-25 08:46:29,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:46:29,668 INFO L93 Difference]: Finished difference Result 46 states and 63 transitions. [2019-11-25 08:46:29,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-25 08:46:29,668 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 63 transitions. [2019-11-25 08:46:29,669 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2019-11-25 08:46:29,670 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 44 states and 60 transitions. [2019-11-25 08:46:29,670 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2019-11-25 08:46:29,671 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2019-11-25 08:46:29,671 INFO L73 IsDeterministic]: Start isDeterministic. Operand 44 states and 60 transitions. [2019-11-25 08:46:29,671 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-25 08:46:29,671 INFO L688 BuchiCegarLoop]: Abstraction has 44 states and 60 transitions. [2019-11-25 08:46:29,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states and 60 transitions. [2019-11-25 08:46:29,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 39. [2019-11-25 08:46:29,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-11-25 08:46:29,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 53 transitions. [2019-11-25 08:46:29,677 INFO L711 BuchiCegarLoop]: Abstraction has 39 states and 53 transitions. [2019-11-25 08:46:29,677 INFO L591 BuchiCegarLoop]: Abstraction has 39 states and 53 transitions. [2019-11-25 08:46:29,677 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-11-25 08:46:29,677 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 53 transitions. [2019-11-25 08:46:29,678 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-11-25 08:46:29,678 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-25 08:46:29,678 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-25 08:46:29,679 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:46:29,679 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1] [2019-11-25 08:46:29,679 INFO L794 eck$LassoCheckResult]: Stem: 670#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 664#L-1 havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~nondet208, main_#t~mem209, main_#t~post207, main_#t~mem210, main_#t~post211, main_#t~post212, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet205;havoc main_#t~nondet205; 665#L367 assume !(main_~length~0 < 1); 676#L367-2 call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; 677#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 678#L370-3 assume !!(main_~i~0 < main_~length~0);call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet208;call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 684#L372 assume !(main_#t~mem209 > 0);havoc main_#t~mem209; 687#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 685#L370-3 assume !!(main_~i~0 < main_~length~0);call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet208;call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 686#L372 assume !(main_#t~mem209 > 0);havoc main_#t~mem209; 679#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 680#L370-3 assume !(main_~i~0 < main_~length~0); 668#L370-4 main_~j~0 := 0; 669#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 689#L378 assume !(main_#t~mem210 < 0);havoc main_#t~mem210;main_#t~post212 := main_~j~0;main_~j~0 := 1 + main_#t~post212;havoc main_#t~post212; 688#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 682#L378 assume main_#t~mem210 < 0;havoc main_#t~mem210;main_#t~post211 := main_~j~0;main_~j~0 := main_#t~post211 - 1;havoc main_#t~post211; 683#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 697#L378 assume !(main_#t~mem210 < 0);havoc main_#t~mem210;main_#t~post212 := main_~j~0;main_~j~0 := 1 + main_#t~post212;havoc main_#t~post212; 695#L378-2 [2019-11-25 08:46:29,679 INFO L796 eck$LassoCheckResult]: Loop: 695#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 692#L378 assume main_#t~mem210 < 0;havoc main_#t~mem210;main_#t~post211 := main_~j~0;main_~j~0 := main_#t~post211 - 1;havoc main_#t~post211; 671#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 672#L378 assume !(main_#t~mem210 < 0);havoc main_#t~mem210;main_#t~post212 := main_~j~0;main_~j~0 := 1 + main_#t~post212;havoc main_#t~post212; 695#L378-2 [2019-11-25 08:46:29,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:46:29,680 INFO L82 PathProgramCache]: Analyzing trace with hash -2108839069, now seen corresponding path program 4 times [2019-11-25 08:46:29,680 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:46:29,680 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53287798] [2019-11-25 08:46:29,680 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:46:29,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:46:29,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:46:29,702 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:46:29,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:46:29,702 INFO L82 PathProgramCache]: Analyzing trace with hash 2219337, now seen corresponding path program 1 times [2019-11-25 08:46:29,703 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:46:29,703 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797152386] [2019-11-25 08:46:29,703 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:46:29,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:46:29,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:46:29,715 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:46:29,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:46:29,716 INFO L82 PathProgramCache]: Analyzing trace with hash 50792363, now seen corresponding path program 5 times [2019-11-25 08:46:29,716 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:46:29,716 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969575430] [2019-11-25 08:46:29,716 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:46:29,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:46:29,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:46:29,777 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:46:30,174 WARN L192 SmtUtils]: Spent 328.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 105 [2019-11-25 08:46:30,291 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 25.11 08:46:30 BoogieIcfgContainer [2019-11-25 08:46:30,291 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-25 08:46:30,293 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-25 08:46:30,294 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-25 08:46:30,294 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-25 08:46:30,295 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:46:24" (3/4) ... [2019-11-25 08:46:30,308 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2019-11-25 08:46:30,394 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_e078c5e2-cbdd-4d44-bb3e-207f46d1b800/bin/uautomizer/witness.graphml [2019-11-25 08:46:30,395 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-25 08:46:30,396 INFO L168 Benchmark]: Toolchain (without parser) took 7293.82 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 300.9 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -158.2 MB). Peak memory consumption was 142.7 MB. Max. memory is 11.5 GB. [2019-11-25 08:46:30,396 INFO L168 Benchmark]: CDTParser took 0.18 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-25 08:46:30,397 INFO L168 Benchmark]: CACSL2BoogieTranslator took 584.37 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 191.4 MB). Free memory was 939.3 MB in the beginning and 1.2 GB in the end (delta: -230.4 MB). Peak memory consumption was 17.7 MB. Max. memory is 11.5 GB. [2019-11-25 08:46:30,398 INFO L168 Benchmark]: Boogie Procedure Inliner took 50.08 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: 6.3 MB). Peak memory consumption was 6.3 MB. Max. memory is 11.5 GB. [2019-11-25 08:46:30,399 INFO L168 Benchmark]: Boogie Preprocessor took 21.69 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-25 08:46:30,399 INFO L168 Benchmark]: RCFGBuilder took 263.98 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: 19.9 MB). Peak memory consumption was 19.9 MB. Max. memory is 11.5 GB. [2019-11-25 08:46:30,399 INFO L168 Benchmark]: BuchiAutomizer took 6266.55 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 109.6 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 35.6 MB). Peak memory consumption was 145.2 MB. Max. memory is 11.5 GB. [2019-11-25 08:46:30,400 INFO L168 Benchmark]: Witness Printer took 101.24 ms. Allocated memory is still 1.3 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 10.4 MB). Peak memory consumption was 10.4 MB. Max. memory is 11.5 GB. [2019-11-25 08:46:30,402 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.18 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 584.37 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 191.4 MB). Free memory was 939.3 MB in the beginning and 1.2 GB in the end (delta: -230.4 MB). Peak memory consumption was 17.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 50.08 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: 6.3 MB). Peak memory consumption was 6.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 21.69 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. * RCFGBuilder took 263.98 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: 19.9 MB). Peak memory consumption was 19.9 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 6266.55 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 109.6 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 35.6 MB). Peak memory consumption was 145.2 MB. Max. memory is 11.5 GB. * Witness Printer took 101.24 ms. Allocated memory is still 1.3 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 10.4 MB). Peak memory consumption was 10.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 6 terminating modules (3 trivial, 3 deterministic, 0 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function unknown-#length-unknown[__builtin_alloca(length*sizeof(int))] + -4 * i and consists of 6 locations. One deterministic module has affine ranking function unknown-#length-unknown[__builtin_alloca(length*sizeof(int))] + 8 * j and consists of 4 locations. One deterministic module has affine ranking function 8 * j + unknown-#length-unknown[__builtin_alloca(length*sizeof(int))] and consists of 4 locations. 3 modules have a trivial ranking function, the largest among these consists of 17 locations. The remainder module has 39 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 6.1s and 7 iterations. TraceHistogramMax:3. Analysis of lassos took 4.8s. Construction of modules took 0.2s. Büchi inclusion checks took 0.8s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 4. Automata minimization 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 9 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 39 states and ocurred in iteration 6. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 51 SDtfs, 161 SDslu, 76 SDs, 0 SdLazy, 230 SolverSat, 55 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT0 conc2 concLT0 SILN0 SILU1 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital130 mio100 ax100 hnf99 lsp93 ukn82 mio100 lsp63 div100 bol100 ite100 ukn100 eq159 hnf90 smp94 dnf100 smp100 tf100 neg100 sie102 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: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 377]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {NULL=1} State at position 1 is {NULL=0, \result=0, NULL=1, arr=2, arr=0, i=2, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@601c1308=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3731c335=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@679083d6=0, length=2, org.eclipse.cdt.internal.core.dom.parser.c.CASTArraySubscriptExpression@1a46c9c0=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@679083d6=2, j=1, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTUnaryExpression@3955f1f0=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTArraySubscriptExpression@55d99826=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTUnaryExpression@26cb805b=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTUnaryExpression@519aba4e=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 377]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L365] int i, j; [L366] int length = __VERIFIER_nondet_int(); [L367] COND FALSE !(length < 1) [L368] int *arr = __builtin_alloca(length*sizeof(int)); [L369] COND FALSE !(!arr) [L370] i=0 [L370] COND TRUE i 0) [L370] i++ [L370] COND TRUE i 0) [L370] i++ [L370] COND FALSE !(i