./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/array-memsafety/count_down-alloca-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_fe238cd6-e0a9-4816-bfff-cee120fe357b/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_fe238cd6-e0a9-4816-bfff-cee120fe357b/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_fe238cd6-e0a9-4816-bfff-cee120fe357b/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_fe238cd6-e0a9-4816-bfff-cee120fe357b/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/array-memsafety/count_down-alloca-1.i -s /tmp/vcloud-vcloud-master/worker/working_dir_fe238cd6-e0a9-4816-bfff-cee120fe357b/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_fe238cd6-e0a9-4816-bfff-cee120fe357b/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 32bit --witnessprinter.graph.data.programhash 3e28603c63113c1566dc2e06da17c63059f80486 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-10-22 09:02:56,921 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 09:02:56,922 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 09:02:56,932 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 09:02:56,932 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 09:02:56,933 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 09:02:56,934 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 09:02:56,936 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 09:02:56,937 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 09:02:56,938 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 09:02:56,939 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 09:02:56,940 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 09:02:56,940 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 09:02:56,941 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 09:02:56,942 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 09:02:56,943 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 09:02:56,943 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 09:02:56,944 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 09:02:56,946 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 09:02:56,947 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 09:02:56,948 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 09:02:56,949 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 09:02:56,950 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 09:02:56,951 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 09:02:56,953 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 09:02:56,954 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 09:02:56,954 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 09:02:56,955 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 09:02:56,955 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 09:02:56,956 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 09:02:56,956 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 09:02:56,957 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 09:02:56,958 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 09:02:56,958 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 09:02:56,959 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 09:02:56,959 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 09:02:56,960 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 09:02:56,960 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 09:02:56,960 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 09:02:56,961 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 09:02:56,962 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 09:02:56,963 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_fe238cd6-e0a9-4816-bfff-cee120fe357b/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-10-22 09:02:56,975 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 09:02:56,975 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 09:02:56,976 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-22 09:02:56,976 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-22 09:02:56,977 INFO L138 SettingsManager]: * Use SBE=true [2019-10-22 09:02:56,977 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-10-22 09:02:56,977 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-10-22 09:02:56,977 INFO L138 SettingsManager]: * Use old map elimination=false [2019-10-22 09:02:56,978 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-10-22 09:02:56,978 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-10-22 09:02:56,978 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-10-22 09:02:56,978 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 09:02:56,978 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 09:02:56,978 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-10-22 09:02:56,979 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 09:02:56,979 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 09:02:56,979 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 09:02:56,979 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-10-22 09:02:56,979 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-10-22 09:02:56,979 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-10-22 09:02:56,980 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 09:02:56,980 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 09:02:56,980 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-10-22 09:02:56,980 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-22 09:02:56,980 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-10-22 09:02:56,980 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 09:02:56,981 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 09:02:56,981 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-10-22 09:02:56,981 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 09:02:56,982 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-22 09:02:56,982 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-10-22 09:02:56,983 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-10-22 09:02:56,983 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/working_dir_fe238cd6-e0a9-4816-bfff-cee120fe357b/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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 3e28603c63113c1566dc2e06da17c63059f80486 [2019-10-22 09:02:57,008 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 09:02:57,018 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 09:02:57,021 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 09:02:57,022 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 09:02:57,023 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 09:02:57,023 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_fe238cd6-e0a9-4816-bfff-cee120fe357b/bin/uautomizer/../../sv-benchmarks/c/array-memsafety/count_down-alloca-1.i [2019-10-22 09:02:57,069 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_fe238cd6-e0a9-4816-bfff-cee120fe357b/bin/uautomizer/data/0a00ff5bf/ea332388b37d4f6497a7c048f8fca328/FLAGd120eb4fc [2019-10-22 09:02:57,498 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 09:02:57,498 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_fe238cd6-e0a9-4816-bfff-cee120fe357b/sv-benchmarks/c/array-memsafety/count_down-alloca-1.i [2019-10-22 09:02:57,507 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_fe238cd6-e0a9-4816-bfff-cee120fe357b/bin/uautomizer/data/0a00ff5bf/ea332388b37d4f6497a7c048f8fca328/FLAGd120eb4fc [2019-10-22 09:02:57,519 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_fe238cd6-e0a9-4816-bfff-cee120fe357b/bin/uautomizer/data/0a00ff5bf/ea332388b37d4f6497a7c048f8fca328 [2019-10-22 09:02:57,521 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 09:02:57,522 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 09:02:57,523 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 09:02:57,523 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 09:02:57,526 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 09:02:57,527 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 09:02:57" (1/1) ... [2019-10-22 09:02:57,529 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5476c4b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:57, skipping insertion in model container [2019-10-22 09:02:57,529 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 09:02:57" (1/1) ... [2019-10-22 09:02:57,536 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 09:02:57,567 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 09:02:57,849 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 09:02:57,859 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 09:02:57,895 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 09:02:57,926 INFO L192 MainTranslator]: Completed translation [2019-10-22 09:02:57,926 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:57 WrapperNode [2019-10-22 09:02:57,927 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 09:02:57,927 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 09:02:57,927 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 09:02:57,928 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 09:02:57,936 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:57" (1/1) ... [2019-10-22 09:02:57,950 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:57" (1/1) ... [2019-10-22 09:02:57,969 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 09:02:57,970 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 09:02:57,970 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 09:02:57,970 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 09:02:57,978 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:57" (1/1) ... [2019-10-22 09:02:57,979 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:57" (1/1) ... [2019-10-22 09:02:57,981 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:57" (1/1) ... [2019-10-22 09:02:57,981 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:57" (1/1) ... [2019-10-22 09:02:57,986 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:57" (1/1) ... [2019-10-22 09:02:57,990 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:57" (1/1) ... [2019-10-22 09:02:57,991 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:57" (1/1) ... [2019-10-22 09:02:57,993 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 09:02:57,993 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 09:02:57,994 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 09:02:57,994 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 09:02:57,994 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:57" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fe238cd6-e0a9-4816-bfff-cee120fe357b/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-10-22 09:02:58,058 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-22 09:02:58,059 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-22 09:02:58,059 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-22 09:02:58,059 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-22 09:02:58,059 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 09:02:58,059 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 09:02:58,291 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 09:02:58,292 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-10-22 09:02:58,293 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 09:02:58 BoogieIcfgContainer [2019-10-22 09:02:58,293 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 09:02:58,293 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-10-22 09:02:58,293 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-10-22 09:02:58,296 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-10-22 09:02:58,297 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 09:02:58,297 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.10 09:02:57" (1/3) ... [2019-10-22 09:02:58,298 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@48831679 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 09:02:58, skipping insertion in model container [2019-10-22 09:02:58,299 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 09:02:58,299 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:57" (2/3) ... [2019-10-22 09:02:58,299 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@48831679 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 09:02:58, skipping insertion in model container [2019-10-22 09:02:58,299 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 09:02:58,299 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 09:02:58" (3/3) ... [2019-10-22 09:02:58,301 INFO L371 chiAutomizerObserver]: Analyzing ICFG count_down-alloca-1.i [2019-10-22 09:02:58,351 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-10-22 09:02:58,352 INFO L357 BuchiCegarLoop]: Hoare is false [2019-10-22 09:02:58,352 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-10-22 09:02:58,352 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 09:02:58,352 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 09:02:58,352 INFO L361 BuchiCegarLoop]: Difference is false [2019-10-22 09:02:58,352 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 09:02:58,352 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-10-22 09:02:58,377 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2019-10-22 09:02:58,426 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2019-10-22 09:02:58,427 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:02:58,428 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:02:58,434 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-10-22 09:02:58,434 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-10-22 09:02:58,434 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-10-22 09:02:58,434 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2019-10-22 09:02:58,436 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2019-10-22 09:02:58,436 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:02:58,436 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:02:58,436 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-10-22 09:02:58,436 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-10-22 09:02:58,445 INFO L791 eck$LassoCheckResult]: Stem: 14#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 12#L-1true havoc main_#res;havoc main_#t~nondet2, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~nondet5, main_#t~post4, main_#t~mem8, main_#t~post9, main_#t~mem7, main_#t~post6, main_~i~0, main_~j~0, main_~val~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;havoc main_~val~0;main_~length~0 := main_#t~nondet2;havoc main_#t~nondet2; 3#L516true assume !(main_~length~0 < 1 || main_~length~0 >= 536870911); 7#L516-2true call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 18#L518true assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 4#L519-3true [2019-10-22 09:02:58,446 INFO L793 eck$LassoCheckResult]: Loop: 4#L519-3true assume !!(main_~i~0 < main_~length~0);main_~val~0 := main_#t~nondet5;havoc main_#t~nondet5; 13#L521true assume main_~val~0 < 0;main_~val~0 := 0; 16#L521-2true call write~int(main_~val~0, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 20#L519-2true main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 4#L519-3true [2019-10-22 09:02:58,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:58,452 INFO L82 PathProgramCache]: Analyzing trace with hash 28695753, now seen corresponding path program 1 times [2019-10-22 09:02:58,460 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:58,460 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879084001] [2019-10-22 09:02:58,460 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:58,461 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:58,462 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:58,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:58,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:58,605 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:02:58,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:58,607 INFO L82 PathProgramCache]: Analyzing trace with hash 1603878, now seen corresponding path program 1 times [2019-10-22 09:02:58,607 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:58,607 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425514400] [2019-10-22 09:02:58,607 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:58,608 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:58,608 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:58,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:58,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:58,633 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:02:58,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:58,635 INFO L82 PathProgramCache]: Analyzing trace with hash 1182970350, now seen corresponding path program 1 times [2019-10-22 09:02:58,635 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:58,636 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306944097] [2019-10-22 09:02:58,636 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:58,636 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:58,637 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:58,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:58,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:58,679 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:02:58,890 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 09:02:58,890 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 09:02:58,891 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 09:02:58,891 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 09:02:58,891 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 09:02:58,891 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:02:58,891 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 09:02:58,891 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 09:02:58,891 INFO L131 ssoRankerPreferences]: Filename of dumped script: count_down-alloca-1.i_Iteration1_Lasso [2019-10-22 09:02:58,892 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 09:02:58,892 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 09:02:58,919 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:58,929 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:58,934 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:58,939 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:58,947 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:59,056 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:59,059 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:59,062 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:59,065 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:59,068 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:59,071 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:59,074 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:59,077 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:59,079 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:59,081 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:02:59,319 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 09:02:59,325 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 09:02:59,327 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-10-22 09:02:59,328 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:59,329 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:59,330 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:59,330 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:59,331 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:59,333 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:59,333 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:59,342 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:59,346 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-10-22 09:02:59,347 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:59,347 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:59,348 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:59,348 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:59,348 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:59,348 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:59,348 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:59,349 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:59,350 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-10-22 09:02:59,350 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:59,351 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:59,351 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:59,351 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:59,351 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:59,352 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:59,352 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:59,360 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:59,360 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-10-22 09:02:59,361 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:59,361 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:59,361 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:59,361 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:59,361 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:59,362 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:59,362 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:59,363 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:59,363 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-10-22 09:02:59,364 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:59,364 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:02:59,364 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:59,364 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:59,364 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:59,365 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:02:59,369 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:02:59,370 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:59,371 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:02:59,371 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:59,372 INFO L202 nArgumentSynthesizer]: 2 stem disjuncts [2019-10-22 09:02:59,372 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:59,372 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:59,377 INFO L400 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-10-22 09:02:59,381 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:02:59,409 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:59,410 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-10-22 09:02:59,411 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:59,412 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:59,413 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:59,413 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:59,415 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:02:59,417 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:02:59,434 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:02:59,436 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-10-22 09:02:59,436 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:02:59,437 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:02:59,437 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:02:59,437 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:02:59,440 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:02:59,441 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:02:59,568 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 09:02:59,631 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2019-10-22 09:02:59,635 INFO L444 ModelExtractionUtils]: 14 out of 22 variables were initially zero. Simplification set additionally 4 variables to zero. [2019-10-22 09:02:59,637 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 09:02:59,639 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-10-22 09:02:59,640 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 09:02:59,641 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~arr~0.base)_1, ULTIMATE.start_main_~arr~0.offset, ULTIMATE.start_main_~i~0) = 1*v_rep(select #length ULTIMATE.start_main_~arr~0.base)_1 - 1*ULTIMATE.start_main_~arr~0.offset - 4*ULTIMATE.start_main_~i~0 Supporting invariants [] [2019-10-22 09:02:59,652 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2019-10-22 09:02:59,661 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-10-22 09:02:59,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:59,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:59,696 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 09:02:59,697 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:02:59,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:59,713 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-22 09:02:59,714 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:02:59,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:02:59,745 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-10-22 09:02:59,746 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states. Second operand 4 states. [2019-10-22 09:02:59,803 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states.. Second operand 4 states. Result 43 states and 60 transitions. Complement of second has 7 states. [2019-10-22 09:02:59,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-10-22 09:02:59,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-10-22 09:02:59,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2019-10-22 09:02:59,808 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 40 transitions. Stem has 5 letters. Loop has 4 letters. [2019-10-22 09:02:59,809 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:02:59,809 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 40 transitions. Stem has 9 letters. Loop has 4 letters. [2019-10-22 09:02:59,809 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:02:59,810 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 40 transitions. Stem has 5 letters. Loop has 8 letters. [2019-10-22 09:02:59,810 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:02:59,811 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 60 transitions. [2019-10-22 09:02:59,814 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-10-22 09:02:59,818 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 15 states and 20 transitions. [2019-10-22 09:02:59,819 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-10-22 09:02:59,819 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-10-22 09:02:59,820 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 20 transitions. [2019-10-22 09:02:59,820 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 09:02:59,820 INFO L688 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2019-10-22 09:02:59,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 20 transitions. [2019-10-22 09:02:59,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-10-22 09:02:59,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-10-22 09:02:59,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 20 transitions. [2019-10-22 09:02:59,848 INFO L711 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2019-10-22 09:02:59,848 INFO L591 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2019-10-22 09:02:59,848 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-10-22 09:02:59,848 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 20 transitions. [2019-10-22 09:02:59,849 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-10-22 09:02:59,849 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:02:59,849 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:02:59,850 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:02:59,850 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-10-22 09:02:59,850 INFO L791 eck$LassoCheckResult]: Stem: 140#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 138#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~nondet5, main_#t~post4, main_#t~mem8, main_#t~post9, main_#t~mem7, main_#t~post6, main_~i~0, main_~j~0, main_~val~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;havoc main_~val~0;main_~length~0 := main_#t~nondet2;havoc main_#t~nondet2; 127#L516 assume !(main_~length~0 < 1 || main_~length~0 >= 536870911); 128#L516-2 call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 137#L518 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 129#L519-3 assume !(main_~i~0 < main_~length~0); 130#L519-4 main_~j~0 := 0; 136#L526-3 [2019-10-22 09:02:59,850 INFO L793 eck$LassoCheckResult]: Loop: 136#L526-3 assume !!(main_~j~0 < main_~length~0); 135#L527-3 call main_#t~mem7 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 133#L527-1 assume !(main_#t~mem7 > 0);havoc main_#t~mem7; 134#L526-2 main_#t~post6 := main_~j~0;main_~j~0 := 1 + main_#t~post6;havoc main_#t~post6; 136#L526-3 [2019-10-22 09:02:59,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:59,851 INFO L82 PathProgramCache]: Analyzing trace with hash 1806815512, now seen corresponding path program 1 times [2019-10-22 09:02:59,851 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:59,851 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781658843] [2019-10-22 09:02:59,851 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:59,852 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:59,852 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:59,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:59,915 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:02:59,916 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781658843] [2019-10-22 09:02:59,916 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:59,917 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 09:02:59,917 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886974536] [2019-10-22 09:02:59,919 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 09:02:59,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:59,920 INFO L82 PathProgramCache]: Analyzing trace with hash 2252300, now seen corresponding path program 1 times [2019-10-22 09:02:59,920 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:59,920 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919908276] [2019-10-22 09:02:59,920 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:59,920 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:59,921 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:59,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:59,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:59,932 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:02:59,965 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:59,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 09:02:59,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 09:02:59,969 INFO L87 Difference]: Start difference. First operand 15 states and 20 transitions. cyclomatic complexity: 7 Second operand 4 states. [2019-10-22 09:03:00,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:03:00,007 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2019-10-22 09:03:00,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 09:03:00,009 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 23 transitions. [2019-10-22 09:03:00,009 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-10-22 09:03:00,010 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 18 states and 23 transitions. [2019-10-22 09:03:00,010 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-10-22 09:03:00,010 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-10-22 09:03:00,010 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 23 transitions. [2019-10-22 09:03:00,011 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 09:03:00,011 INFO L688 BuchiCegarLoop]: Abstraction has 18 states and 23 transitions. [2019-10-22 09:03:00,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 23 transitions. [2019-10-22 09:03:00,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 15. [2019-10-22 09:03:00,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-10-22 09:03:00,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 19 transitions. [2019-10-22 09:03:00,012 INFO L711 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2019-10-22 09:03:00,013 INFO L591 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2019-10-22 09:03:00,013 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-10-22 09:03:00,013 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 19 transitions. [2019-10-22 09:03:00,013 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-10-22 09:03:00,013 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:03:00,014 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:03:00,014 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:03:00,014 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-10-22 09:03:00,014 INFO L791 eck$LassoCheckResult]: Stem: 180#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 178#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~nondet5, main_#t~post4, main_#t~mem8, main_#t~post9, main_#t~mem7, main_#t~post6, main_~i~0, main_~j~0, main_~val~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;havoc main_~val~0;main_~length~0 := main_#t~nondet2;havoc main_#t~nondet2; 167#L516 assume !(main_~length~0 < 1 || main_~length~0 >= 536870911); 168#L516-2 call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 177#L518 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 169#L519-3 assume !!(main_~i~0 < main_~length~0);main_~val~0 := main_#t~nondet5;havoc main_#t~nondet5; 170#L521 assume !(main_~val~0 < 0); 179#L521-2 call write~int(main_~val~0, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 181#L519-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 171#L519-3 assume !(main_~i~0 < main_~length~0); 172#L519-4 main_~j~0 := 0; 176#L526-3 [2019-10-22 09:03:00,015 INFO L793 eck$LassoCheckResult]: Loop: 176#L526-3 assume !!(main_~j~0 < main_~length~0); 175#L527-3 call main_#t~mem7 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 173#L527-1 assume !(main_#t~mem7 > 0);havoc main_#t~mem7; 174#L526-2 main_#t~post6 := main_~j~0;main_~j~0 := 1 + main_#t~post6;havoc main_#t~post6; 176#L526-3 [2019-10-22 09:03:00,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:03:00,015 INFO L82 PathProgramCache]: Analyzing trace with hash -1329979393, now seen corresponding path program 1 times [2019-10-22 09:03:00,015 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:03:00,015 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789229537] [2019-10-22 09:03:00,016 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:03:00,016 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:03:00,016 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:03:00,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:03:00,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:03:00,049 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:03:00,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:03:00,050 INFO L82 PathProgramCache]: Analyzing trace with hash 2252300, now seen corresponding path program 2 times [2019-10-22 09:03:00,050 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:03:00,050 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180018496] [2019-10-22 09:03:00,050 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:03:00,050 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:03:00,051 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:03:00,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:03:00,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:03:00,059 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:03:00,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:03:00,059 INFO L82 PathProgramCache]: Analyzing trace with hash -2035265782, now seen corresponding path program 1 times [2019-10-22 09:03:00,059 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:03:00,060 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320156079] [2019-10-22 09:03:00,060 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:03:00,060 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:03:00,060 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:03:00,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:03:00,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:03:00,082 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:03:00,247 WARN L191 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 63 [2019-10-22 09:03:00,295 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 09:03:00,295 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 09:03:00,295 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 09:03:00,295 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 09:03:00,295 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 09:03:00,295 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:03:00,296 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 09:03:00,296 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 09:03:00,296 INFO L131 ssoRankerPreferences]: Filename of dumped script: count_down-alloca-1.i_Iteration3_Lasso [2019-10-22 09:03:00,296 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 09:03:00,296 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 09:03:00,299 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:03:00,307 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:03:00,310 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:03:00,459 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:03:00,461 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:03:00,464 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:03:00,466 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:03:00,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-10-22 09:03:00,472 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:03:00,474 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:03:00,476 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:03:00,478 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:03:00,482 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:03:00,484 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:03:00,706 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 09:03:00,706 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 09:03:00,706 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-10-22 09:03:00,707 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:03:00,707 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:03:00,707 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:03:00,707 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:03:00,707 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:03:00,708 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:03:00,708 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:03:00,709 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:03:00,709 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-10-22 09:03:00,710 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:03:00,710 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:03:00,710 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:03:00,710 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:03:00,710 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:03:00,711 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:03:00,711 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:03:00,711 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:03:00,711 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-10-22 09:03:00,712 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:03:00,712 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:03:00,712 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:03:00,712 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:03:00,715 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:03:00,715 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:03:00,752 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 09:03:00,786 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2019-10-22 09:03:00,787 INFO L444 ModelExtractionUtils]: 17 out of 25 variables were initially zero. Simplification set additionally 3 variables to zero. [2019-10-22 09:03:00,787 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 09:03:00,789 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2019-10-22 09:03:00,789 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 09:03:00,789 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0) = -2*ULTIMATE.start_main_~j~0 + 1 Supporting invariants [-1*ULTIMATE.start_main_~length~0 + 1 >= 0] [2019-10-22 09:03:00,797 INFO L297 tatePredicateManager]: 3 out of 4 supporting invariants were superfluous and have been removed [2019-10-22 09:03:00,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:03:00,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:03:00,829 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-22 09:03:00,830 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:03:00,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:03:00,867 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-22 09:03:00,867 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:03:00,882 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:03:00,882 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.4 stem predicates 2 loop predicates [2019-10-22 09:03:00,882 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 19 transitions. cyclomatic complexity: 6 Second operand 6 states. [2019-10-22 09:03:01,029 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states and 19 transitions. cyclomatic complexity: 6. Second operand 6 states. Result 41 states and 53 transitions. Complement of second has 11 states. [2019-10-22 09:03:01,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 6 stem states 1 non-accepting loop states 2 accepting loop states [2019-10-22 09:03:01,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-10-22 09:03:01,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 39 transitions. [2019-10-22 09:03:01,031 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 39 transitions. Stem has 11 letters. Loop has 4 letters. [2019-10-22 09:03:01,031 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:03:01,031 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 39 transitions. Stem has 15 letters. Loop has 4 letters. [2019-10-22 09:03:01,031 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:03:01,031 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 39 transitions. Stem has 11 letters. Loop has 8 letters. [2019-10-22 09:03:01,031 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:03:01,031 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 53 transitions. [2019-10-22 09:03:01,032 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-10-22 09:03:01,035 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 40 states and 52 transitions. [2019-10-22 09:03:01,035 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2019-10-22 09:03:01,036 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2019-10-22 09:03:01,036 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 52 transitions. [2019-10-22 09:03:01,036 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 09:03:01,036 INFO L688 BuchiCegarLoop]: Abstraction has 40 states and 52 transitions. [2019-10-22 09:03:01,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states and 52 transitions. [2019-10-22 09:03:01,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 34. [2019-10-22 09:03:01,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-10-22 09:03:01,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 45 transitions. [2019-10-22 09:03:01,039 INFO L711 BuchiCegarLoop]: Abstraction has 34 states and 45 transitions. [2019-10-22 09:03:01,039 INFO L591 BuchiCegarLoop]: Abstraction has 34 states and 45 transitions. [2019-10-22 09:03:01,039 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-10-22 09:03:01,039 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 45 transitions. [2019-10-22 09:03:01,042 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-10-22 09:03:01,043 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:03:01,043 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:03:01,043 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:03:01,044 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-10-22 09:03:01,044 INFO L791 eck$LassoCheckResult]: Stem: 350#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 347#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~nondet5, main_#t~post4, main_#t~mem8, main_#t~post9, main_#t~mem7, main_#t~post6, main_~i~0, main_~j~0, main_~val~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;havoc main_~val~0;main_~length~0 := main_#t~nondet2;havoc main_#t~nondet2; 329#L516 assume main_~length~0 < 1 || main_~length~0 >= 536870911;main_~length~0 := 1; 330#L516-2 call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 352#L518 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 332#L519-3 assume !!(main_~i~0 < main_~length~0);main_~val~0 := main_#t~nondet5;havoc main_#t~nondet5; 333#L521 assume !(main_~val~0 < 0); 361#L521-2 call write~int(main_~val~0, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 353#L519-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 354#L519-3 assume !(main_~i~0 < main_~length~0); 357#L519-4 main_~j~0 := 0; 355#L526-3 assume !!(main_~j~0 < main_~length~0); 338#L527-3 [2019-10-22 09:03:01,044 INFO L793 eck$LassoCheckResult]: Loop: 338#L527-3 call main_#t~mem7 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 337#L527-1 assume !!(main_#t~mem7 > 0);havoc main_#t~mem7;call main_#t~mem8 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4);main_#t~post9 := main_#t~mem8;call write~int(main_#t~post9 - 1, main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4);havoc main_#t~mem8;havoc main_#t~post9; 338#L527-3 [2019-10-22 09:03:01,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:03:01,045 INFO L82 PathProgramCache]: Analyzing trace with hash 2113338830, now seen corresponding path program 1 times [2019-10-22 09:03:01,045 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:03:01,045 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903560258] [2019-10-22 09:03:01,045 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:03:01,045 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:03:01,045 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:03:01,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:03:01,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:03:01,071 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:03:01,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:03:01,075 INFO L82 PathProgramCache]: Analyzing trace with hash 2502, now seen corresponding path program 1 times [2019-10-22 09:03:01,075 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:03:01,075 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11444335] [2019-10-22 09:03:01,075 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:03:01,076 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:03:01,076 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:03:01,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:03:01,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:03:01,087 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:03:01,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:03:01,089 INFO L82 PathProgramCache]: Analyzing trace with hash -600913837, now seen corresponding path program 1 times [2019-10-22 09:03:01,090 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:03:01,090 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951277782] [2019-10-22 09:03:01,090 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:03:01,090 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:03:01,090 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:03:01,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:03:01,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:03:01,132 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:03:01,287 WARN L191 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 67 [2019-10-22 09:03:01,329 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 09:03:01,329 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 09:03:01,329 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 09:03:01,330 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 09:03:01,330 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 09:03:01,330 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:03:01,330 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 09:03:01,330 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 09:03:01,330 INFO L131 ssoRankerPreferences]: Filename of dumped script: count_down-alloca-1.i_Iteration4_Lasso [2019-10-22 09:03:01,330 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 09:03:01,330 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 09:03:01,338 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:03:01,340 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:03:01,341 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:03:01,344 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:03:01,345 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:03:01,348 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:03:01,349 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:03:01,352 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:03:01,481 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:03:01,482 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:03:01,491 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:03:01,493 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:03:01,495 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:03:01,497 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:03:01,709 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 09:03:01,709 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 09:03:01,710 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-10-22 09:03:01,710 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:03:01,711 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:03:01,711 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:03:01,711 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:03:01,711 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:03:01,711 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:03:01,711 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:03:01,712 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:03:01,712 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-10-22 09:03:01,713 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:03:01,713 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:03:01,713 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:03:01,713 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:03:01,713 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:03:01,714 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:03:01,714 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:03:01,714 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:03:01,714 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-10-22 09:03:01,715 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:03:01,715 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:03:01,715 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:03:01,715 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:03:01,716 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:03:01,716 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:03:01,718 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:03:01,718 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-10-22 09:03:01,719 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:03:01,719 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:03:01,719 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:03:01,719 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:03:01,719 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:03:01,720 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:03:01,720 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:03:01,720 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:03:01,721 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-10-22 09:03:01,721 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:03:01,722 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:03:01,722 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:03:01,722 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:03:01,723 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:03:01,723 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:03:01,725 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:03:01,725 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-10-22 09:03:01,726 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:03:01,726 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:03:01,726 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:03:01,726 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:03:01,726 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:03:01,726 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:03:01,727 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:03:01,727 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:03:01,727 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-10-22 09:03:01,728 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:03:01,728 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:03:01,728 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:03:01,728 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:03:01,730 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:03:01,730 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:03:01,732 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:03:01,733 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-10-22 09:03:01,733 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:03:01,733 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:03:01,733 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:03:01,734 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:03:01,735 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:03:01,735 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:03:01,746 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 09:03:01,749 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-10-22 09:03:01,749 INFO L444 ModelExtractionUtils]: 10 out of 13 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-10-22 09:03:01,750 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 09:03:01,751 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-10-22 09:03:01,751 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 09:03:01,751 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~arr~0.base) (+ (* ULTIMATE.start_main_~j~0 4) ULTIMATE.start_main_~arr~0.offset))_2) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~arr~0.base) (+ (* ULTIMATE.start_main_~j~0 4) ULTIMATE.start_main_~arr~0.offset))_2 Supporting invariants [] [2019-10-22 09:03:01,761 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2019-10-22 09:03:01,762 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-22 09:03:01,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:03:01,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:03:01,786 INFO L256 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 09:03:01,786 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:03:01,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:03:01,792 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-22 09:03:01,792 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:03:01,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:03:01,807 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-10-22 09:03:01,807 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 34 states and 45 transitions. cyclomatic complexity: 16 Second operand 3 states. [2019-10-22 09:03:01,822 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 34 states and 45 transitions. cyclomatic complexity: 16. Second operand 3 states. Result 50 states and 65 transitions. Complement of second has 7 states. [2019-10-22 09:03:01,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-10-22 09:03:01,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-10-22 09:03:01,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 17 transitions. [2019-10-22 09:03:01,823 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 12 letters. Loop has 2 letters. [2019-10-22 09:03:01,823 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:03:01,823 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 14 letters. Loop has 2 letters. [2019-10-22 09:03:01,823 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:03:01,824 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 12 letters. Loop has 4 letters. [2019-10-22 09:03:01,824 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:03:01,824 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 50 states and 65 transitions. [2019-10-22 09:03:01,825 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-10-22 09:03:01,825 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 50 states to 44 states and 57 transitions. [2019-10-22 09:03:01,826 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2019-10-22 09:03:01,826 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2019-10-22 09:03:01,826 INFO L73 IsDeterministic]: Start isDeterministic. Operand 44 states and 57 transitions. [2019-10-22 09:03:01,826 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 09:03:01,826 INFO L688 BuchiCegarLoop]: Abstraction has 44 states and 57 transitions. [2019-10-22 09:03:01,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states and 57 transitions. [2019-10-22 09:03:01,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 42. [2019-10-22 09:03:01,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-10-22 09:03:01,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 55 transitions. [2019-10-22 09:03:01,829 INFO L711 BuchiCegarLoop]: Abstraction has 42 states and 55 transitions. [2019-10-22 09:03:01,829 INFO L591 BuchiCegarLoop]: Abstraction has 42 states and 55 transitions. [2019-10-22 09:03:01,829 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-10-22 09:03:01,829 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 42 states and 55 transitions. [2019-10-22 09:03:01,830 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-10-22 09:03:01,830 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:03:01,830 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:03:01,831 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:03:01,831 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-10-22 09:03:01,831 INFO L791 eck$LassoCheckResult]: Stem: 516#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 514#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~nondet5, main_#t~post4, main_#t~mem8, main_#t~post9, main_#t~mem7, main_#t~post6, main_~i~0, main_~j~0, main_~val~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;havoc main_~val~0;main_~length~0 := main_#t~nondet2;havoc main_#t~nondet2; 499#L516 assume main_~length~0 < 1 || main_~length~0 >= 536870911;main_~length~0 := 1; 500#L516-2 call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 507#L518 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 495#L519-3 assume !!(main_~i~0 < main_~length~0);main_~val~0 := main_#t~nondet5;havoc main_#t~nondet5; 496#L521 assume !(main_~val~0 < 0); 515#L521-2 call write~int(main_~val~0, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 517#L519-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 497#L519-3 assume !(main_~i~0 < main_~length~0); 498#L519-4 main_~j~0 := 0; 506#L526-3 assume !!(main_~j~0 < main_~length~0); 513#L527-3 call main_#t~mem7 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 504#L527-1 assume !(main_#t~mem7 > 0);havoc main_#t~mem7; 505#L526-2 main_#t~post6 := main_~j~0;main_~j~0 := 1 + main_#t~post6;havoc main_#t~post6; 512#L526-3 assume !!(main_~j~0 < main_~length~0); 503#L527-3 [2019-10-22 09:03:01,831 INFO L793 eck$LassoCheckResult]: Loop: 503#L527-3 call main_#t~mem7 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 502#L527-1 assume !!(main_#t~mem7 > 0);havoc main_#t~mem7;call main_#t~mem8 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4);main_#t~post9 := main_#t~mem8;call write~int(main_#t~post9 - 1, main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4);havoc main_#t~mem8;havoc main_#t~post9; 503#L527-3 [2019-10-22 09:03:01,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:03:01,831 INFO L82 PathProgramCache]: Analyzing trace with hash -1952579805, now seen corresponding path program 1 times [2019-10-22 09:03:01,832 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:03:01,832 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577334887] [2019-10-22 09:03:01,832 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:03:01,832 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:03:01,832 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:03:01,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:03:01,939 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:03:01,940 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577334887] [2019-10-22 09:03:01,940 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [779531698] [2019-10-22 09:03:01,940 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fe238cd6-e0a9-4816-bfff-cee120fe357b/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 09:03:01,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:03:01,984 INFO L256 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-22 09:03:01,985 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:03:02,011 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-22 09:03:02,011 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-22 09:03:02,011 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 10 [2019-10-22 09:03:02,011 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783703551] [2019-10-22 09:03:02,012 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 09:03:02,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:03:02,012 INFO L82 PathProgramCache]: Analyzing trace with hash 2502, now seen corresponding path program 2 times [2019-10-22 09:03:02,012 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:03:02,012 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477986773] [2019-10-22 09:03:02,012 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:03:02,012 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:03:02,012 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:03:02,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:03:02,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:03:02,019 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:03:02,041 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:03:02,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 09:03:02,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2019-10-22 09:03:02,042 INFO L87 Difference]: Start difference. First operand 42 states and 55 transitions. cyclomatic complexity: 20 Second operand 5 states. [2019-10-22 09:03:02,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:03:02,076 INFO L93 Difference]: Finished difference Result 49 states and 62 transitions. [2019-10-22 09:03:02,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 09:03:02,076 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 62 transitions. [2019-10-22 09:03:02,077 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-10-22 09:03:02,078 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 35 states and 45 transitions. [2019-10-22 09:03:02,078 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2019-10-22 09:03:02,078 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2019-10-22 09:03:02,078 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 45 transitions. [2019-10-22 09:03:02,078 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 09:03:02,078 INFO L688 BuchiCegarLoop]: Abstraction has 35 states and 45 transitions. [2019-10-22 09:03:02,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 45 transitions. [2019-10-22 09:03:02,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-10-22 09:03:02,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-10-22 09:03:02,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 45 transitions. [2019-10-22 09:03:02,084 INFO L711 BuchiCegarLoop]: Abstraction has 35 states and 45 transitions. [2019-10-22 09:03:02,085 INFO L591 BuchiCegarLoop]: Abstraction has 35 states and 45 transitions. [2019-10-22 09:03:02,085 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-10-22 09:03:02,085 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 45 transitions. [2019-10-22 09:03:02,085 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-10-22 09:03:02,085 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:03:02,086 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:03:02,086 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:03:02,086 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-10-22 09:03:02,086 INFO L791 eck$LassoCheckResult]: Stem: 667#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 665#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~nondet5, main_#t~post4, main_#t~mem8, main_#t~post9, main_#t~mem7, main_#t~post6, main_~i~0, main_~j~0, main_~val~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;havoc main_~val~0;main_~length~0 := main_#t~nondet2;havoc main_#t~nondet2; 645#L516 assume !(main_~length~0 < 1 || main_~length~0 >= 536870911); 646#L516-2 call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 657#L518 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 647#L519-3 assume !!(main_~i~0 < main_~length~0);main_~val~0 := main_#t~nondet5;havoc main_#t~nondet5; 648#L521 assume !(main_~val~0 < 0); 666#L521-2 call write~int(main_~val~0, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 668#L519-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 649#L519-3 assume !(main_~i~0 < main_~length~0); 650#L519-4 main_~j~0 := 0; 656#L526-3 assume !!(main_~j~0 < main_~length~0); 655#L527-3 call main_#t~mem7 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 670#L527-1 assume !(main_#t~mem7 > 0);havoc main_#t~mem7; 660#L526-2 main_#t~post6 := main_~j~0;main_~j~0 := 1 + main_#t~post6;havoc main_#t~post6; 661#L526-3 assume !!(main_~j~0 < main_~length~0); 653#L527-3 [2019-10-22 09:03:02,086 INFO L793 eck$LassoCheckResult]: Loop: 653#L527-3 call main_#t~mem7 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 652#L527-1 assume !!(main_#t~mem7 > 0);havoc main_#t~mem7;call main_#t~mem8 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4);main_#t~post9 := main_#t~mem8;call write~int(main_#t~post9 - 1, main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4);havoc main_#t~mem8;havoc main_#t~post9; 653#L527-3 [2019-10-22 09:03:02,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:03:02,087 INFO L82 PathProgramCache]: Analyzing trace with hash 1331270241, now seen corresponding path program 2 times [2019-10-22 09:03:02,087 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:03:02,087 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946656675] [2019-10-22 09:03:02,087 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:03:02,087 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:03:02,087 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:03:02,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:03:02,174 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:03:02,174 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946656675] [2019-10-22 09:03:02,175 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1104783555] [2019-10-22 09:03:02,175 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fe238cd6-e0a9-4816-bfff-cee120fe357b/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 09:03:02,223 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-22 09:03:02,223 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-22 09:03:02,224 INFO L256 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-22 09:03:02,225 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:03:02,268 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:03:02,268 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 09:03:02,268 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 13 [2019-10-22 09:03:02,268 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334296718] [2019-10-22 09:03:02,269 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 09:03:02,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:03:02,269 INFO L82 PathProgramCache]: Analyzing trace with hash 2502, now seen corresponding path program 3 times [2019-10-22 09:03:02,269 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:03:02,269 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470874425] [2019-10-22 09:03:02,269 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:03:02,269 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:03:02,269 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:03:02,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:03:02,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:03:02,275 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:03:02,297 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:03:02,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-22 09:03:02,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2019-10-22 09:03:02,298 INFO L87 Difference]: Start difference. First operand 35 states and 45 transitions. cyclomatic complexity: 16 Second operand 14 states. [2019-10-22 09:03:02,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:03:02,426 INFO L93 Difference]: Finished difference Result 34 states and 42 transitions. [2019-10-22 09:03:02,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-22 09:03:02,427 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 42 transitions. [2019-10-22 09:03:02,428 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-10-22 09:03:02,428 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 27 states and 34 transitions. [2019-10-22 09:03:02,428 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2019-10-22 09:03:02,428 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2019-10-22 09:03:02,429 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 34 transitions. [2019-10-22 09:03:02,429 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 09:03:02,429 INFO L688 BuchiCegarLoop]: Abstraction has 27 states and 34 transitions. [2019-10-22 09:03:02,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 34 transitions. [2019-10-22 09:03:02,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 24. [2019-10-22 09:03:02,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-10-22 09:03:02,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 30 transitions. [2019-10-22 09:03:02,430 INFO L711 BuchiCegarLoop]: Abstraction has 24 states and 30 transitions. [2019-10-22 09:03:02,431 INFO L591 BuchiCegarLoop]: Abstraction has 24 states and 30 transitions. [2019-10-22 09:03:02,431 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-10-22 09:03:02,431 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 30 transitions. [2019-10-22 09:03:02,431 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-10-22 09:03:02,431 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:03:02,431 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:03:02,432 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:03:02,432 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-10-22 09:03:02,432 INFO L791 eck$LassoCheckResult]: Stem: 802#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 800#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~nondet5, main_#t~post4, main_#t~mem8, main_#t~post9, main_#t~mem7, main_#t~post6, main_~i~0, main_~j~0, main_~val~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;havoc main_~val~0;main_~length~0 := main_#t~nondet2;havoc main_#t~nondet2; 784#L516 assume !(main_~length~0 < 1 || main_~length~0 >= 536870911); 785#L516-2 call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 796#L518 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 786#L519-3 assume !!(main_~i~0 < main_~length~0);main_~val~0 := main_#t~nondet5;havoc main_#t~nondet5; 787#L521 assume !(main_~val~0 < 0); 807#L521-2 call write~int(main_~val~0, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 804#L519-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 788#L519-3 assume !!(main_~i~0 < main_~length~0);main_~val~0 := main_#t~nondet5;havoc main_#t~nondet5; 789#L521 assume !(main_~val~0 < 0); 801#L521-2 call write~int(main_~val~0, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 803#L519-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 806#L519-3 assume !(main_~i~0 < main_~length~0); 794#L519-4 main_~j~0 := 0; 795#L526-3 assume !!(main_~j~0 < main_~length~0); 805#L527-3 call main_#t~mem7 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 790#L527-1 assume !(main_#t~mem7 > 0);havoc main_#t~mem7; 791#L526-2 [2019-10-22 09:03:02,432 INFO L793 eck$LassoCheckResult]: Loop: 791#L526-2 main_#t~post6 := main_~j~0;main_~j~0 := 1 + main_#t~post6;havoc main_#t~post6; 799#L526-3 assume !!(main_~j~0 < main_~length~0); 797#L527-3 call main_#t~mem7 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 798#L527-1 assume !(main_#t~mem7 > 0);havoc main_#t~mem7; 791#L526-2 [2019-10-22 09:03:02,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:03:02,433 INFO L82 PathProgramCache]: Analyzing trace with hash -983203256, now seen corresponding path program 1 times [2019-10-22 09:03:02,433 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:03:02,433 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082565813] [2019-10-22 09:03:02,433 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:03:02,434 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:03:02,434 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:03:02,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:03:02,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:03:02,450 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:03:02,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:03:02,450 INFO L82 PathProgramCache]: Analyzing trace with hash 2664470, now seen corresponding path program 3 times [2019-10-22 09:03:02,450 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:03:02,451 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700279556] [2019-10-22 09:03:02,451 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:03:02,451 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:03:02,451 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:03:02,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:03:02,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:03:02,456 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:03:02,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:03:02,457 INFO L82 PathProgramCache]: Analyzing trace with hash -1226461475, now seen corresponding path program 3 times [2019-10-22 09:03:02,457 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:03:02,457 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36831745] [2019-10-22 09:03:02,457 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:03:02,457 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:03:02,457 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:03:02,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:03:02,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:03:02,474 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:03:02,694 WARN L191 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 87 [2019-10-22 09:03:02,744 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 09:03:02,744 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 09:03:02,744 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 09:03:02,744 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 09:03:02,744 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 09:03:02,744 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:03:02,744 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 09:03:02,744 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 09:03:02,744 INFO L131 ssoRankerPreferences]: Filename of dumped script: count_down-alloca-1.i_Iteration7_Lasso [2019-10-22 09:03:02,744 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 09:03:02,744 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 09:03:02,746 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:03:02,748 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:03:02,749 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:03:02,751 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:03:02,753 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:03:02,835 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:03:02,840 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:03:02,842 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:03:02,843 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:03:02,845 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:03:02,846 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:03:02,847 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:03:02,849 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:03:02,858 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:03:02,860 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:03:03,043 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 09:03:03,043 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 09:03:03,043 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-10-22 09:03:03,044 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:03:03,044 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:03:03,044 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:03:03,044 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:03:03,045 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:03:03,045 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:03:03,045 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:03:03,046 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:03:03,046 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-10-22 09:03:03,047 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:03:03,047 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:03:03,047 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:03:03,047 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:03:03,047 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:03:03,048 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:03:03,048 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:03:03,049 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:03:03,049 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-10-22 09:03:03,049 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:03:03,050 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:03:03,050 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:03:03,050 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:03:03,050 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:03:03,050 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:03:03,050 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:03:03,051 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:03:03,051 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-10-22 09:03:03,051 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:03:03,052 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:03:03,052 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:03:03,052 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:03:03,052 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:03:03,053 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:03:03,054 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:03:03,055 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-10-22 09:03:03,055 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:03:03,055 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:03:03,055 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:03:03,055 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:03:03,056 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:03:03,056 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:03:03,058 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:03:03,058 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-10-22 09:03:03,058 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:03:03,059 INFO L202 nArgumentSynthesizer]: 2 stem disjuncts [2019-10-22 09:03:03,059 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:03:03,059 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:03:03,060 INFO L400 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-10-22 09:03:03,060 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:03:03,064 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:03:03,065 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-10-22 09:03:03,065 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:03:03,066 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:03:03,066 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:03:03,066 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:03:03,066 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:03:03,067 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:03:03,067 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:03:03,068 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-10-22 09:03:03,068 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:03:03,068 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:03:03,068 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:03:03,068 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:03:03,070 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:03:03,070 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:03:03,074 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:03:03,074 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-10-22 09:03:03,074 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:03:03,075 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:03:03,075 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:03:03,075 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:03:03,075 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:03:03,076 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:03:03,077 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:03:03,078 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-10-22 09:03:03,078 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:03:03,078 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:03:03,078 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:03:03,078 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:03:03,080 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:03:03,080 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:03:03,098 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 09:03:03,118 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2019-10-22 09:03:03,118 INFO L444 ModelExtractionUtils]: 16 out of 22 variables were initially zero. Simplification set additionally 3 variables to zero. [2019-10-22 09:03:03,118 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 09:03:03,119 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-10-22 09:03:03,119 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 09:03:03,119 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~length~0) = -1*ULTIMATE.start_main_~j~0 + 1*ULTIMATE.start_main_~length~0 Supporting invariants [] [2019-10-22 09:03:03,141 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2019-10-22 09:03:03,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:03:03,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:03:03,162 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 09:03:03,163 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:03:03,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:03:03,169 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-22 09:03:03,169 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:03:03,184 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:03:03,184 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2019-10-22 09:03:03,185 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24 states and 30 transitions. cyclomatic complexity: 9 Second operand 4 states. [2019-10-22 09:03:03,207 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 24 states and 30 transitions. cyclomatic complexity: 9. Second operand 4 states. Result 32 states and 40 transitions. Complement of second has 6 states. [2019-10-22 09:03:03,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-10-22 09:03:03,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-10-22 09:03:03,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 23 transitions. [2019-10-22 09:03:03,209 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 18 letters. Loop has 4 letters. [2019-10-22 09:03:03,209 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:03:03,209 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 22 letters. Loop has 4 letters. [2019-10-22 09:03:03,209 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:03:03,209 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 18 letters. Loop has 8 letters. [2019-10-22 09:03:03,210 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:03:03,210 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 40 transitions. [2019-10-22 09:03:03,210 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-10-22 09:03:03,211 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 29 states and 36 transitions. [2019-10-22 09:03:03,211 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2019-10-22 09:03:03,211 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2019-10-22 09:03:03,211 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 36 transitions. [2019-10-22 09:03:03,211 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 09:03:03,211 INFO L688 BuchiCegarLoop]: Abstraction has 29 states and 36 transitions. [2019-10-22 09:03:03,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 36 transitions. [2019-10-22 09:03:03,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2019-10-22 09:03:03,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-10-22 09:03:03,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 35 transitions. [2019-10-22 09:03:03,215 INFO L711 BuchiCegarLoop]: Abstraction has 28 states and 35 transitions. [2019-10-22 09:03:03,215 INFO L591 BuchiCegarLoop]: Abstraction has 28 states and 35 transitions. [2019-10-22 09:03:03,215 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-10-22 09:03:03,216 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 35 transitions. [2019-10-22 09:03:03,216 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-10-22 09:03:03,216 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:03:03,216 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:03:03,217 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:03:03,217 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-10-22 09:03:03,218 INFO L791 eck$LassoCheckResult]: Stem: 964#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 962#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~nondet5, main_#t~post4, main_#t~mem8, main_#t~post9, main_#t~mem7, main_#t~post6, main_~i~0, main_~j~0, main_~val~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;havoc main_~val~0;main_~length~0 := main_#t~nondet2;havoc main_#t~nondet2; 942#L516 assume !(main_~length~0 < 1 || main_~length~0 >= 536870911); 943#L516-2 call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset; 954#L518 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 944#L519-3 assume !!(main_~i~0 < main_~length~0);main_~val~0 := main_#t~nondet5;havoc main_#t~nondet5; 945#L521 assume !(main_~val~0 < 0); 963#L521-2 call write~int(main_~val~0, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 965#L519-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 946#L519-3 assume !!(main_~i~0 < main_~length~0);main_~val~0 := main_#t~nondet5;havoc main_#t~nondet5; 947#L521 assume !(main_~val~0 < 0); 969#L521-2 call write~int(main_~val~0, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 968#L519-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 967#L519-3 assume !(main_~i~0 < main_~length~0); 952#L519-4 main_~j~0 := 0; 953#L526-3 assume !!(main_~j~0 < main_~length~0); 960#L527-3 call main_#t~mem7 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 966#L527-1 assume !(main_#t~mem7 > 0);havoc main_#t~mem7; 957#L526-2 main_#t~post6 := main_~j~0;main_~j~0 := 1 + main_#t~post6;havoc main_#t~post6; 958#L526-3 assume !!(main_~j~0 < main_~length~0); 961#L527-3 call main_#t~mem7 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 948#L527-1 [2019-10-22 09:03:03,218 INFO L793 eck$LassoCheckResult]: Loop: 948#L527-1 assume !!(main_#t~mem7 > 0);havoc main_#t~mem7;call main_#t~mem8 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4);main_#t~post9 := main_#t~mem8;call write~int(main_#t~post9 - 1, main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4);havoc main_#t~mem8;havoc main_#t~post9; 949#L527-3 call main_#t~mem7 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 948#L527-1 [2019-10-22 09:03:03,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:03:03,218 INFO L82 PathProgramCache]: Analyzing trace with hash 1068815382, now seen corresponding path program 4 times [2019-10-22 09:03:03,218 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:03:03,218 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557184953] [2019-10-22 09:03:03,219 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:03:03,219 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:03:03,219 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:03:03,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:03:03,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:03:03,240 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:03:03,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:03:03,243 INFO L82 PathProgramCache]: Analyzing trace with hash 2652, now seen corresponding path program 4 times [2019-10-22 09:03:03,243 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:03:03,243 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120086468] [2019-10-22 09:03:03,244 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:03:03,244 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:03:03,244 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:03:03,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:03:03,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:03:03,251 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:03:03,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:03:03,252 INFO L82 PathProgramCache]: Analyzing trace with hash 634400049, now seen corresponding path program 1 times [2019-10-22 09:03:03,252 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:03:03,252 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724568787] [2019-10-22 09:03:03,253 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:03:03,253 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:03:03,253 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:03:03,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:03:03,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:03:03,298 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:03:03,524 WARN L191 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 90 [2019-10-22 09:03:03,584 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 09:03:03,584 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 09:03:03,584 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 09:03:03,584 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 09:03:03,584 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 09:03:03,584 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:03:03,584 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 09:03:03,585 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 09:03:03,585 INFO L131 ssoRankerPreferences]: Filename of dumped script: count_down-alloca-1.i_Iteration8_Lasso [2019-10-22 09:03:03,585 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 09:03:03,585 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 09:03:03,586 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:03:03,588 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:03:03,590 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:03:03,592 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:03:03,594 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:03:03,691 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:03:03,694 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:03:03,696 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:03:03,698 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:03:03,699 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:03:03,702 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:03:03,704 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:03:03,706 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:03:03,899 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 09:03:03,899 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 09:03:03,899 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-10-22 09:03:03,900 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:03:03,900 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:03:03,900 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:03:03,900 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:03:03,900 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:03:03,901 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:03:03,901 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:03:03,901 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:03:03,902 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-10-22 09:03:03,902 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:03:03,902 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:03:03,902 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:03:03,902 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:03:03,903 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:03:03,903 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:03:03,903 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:03:03,903 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:03:03,904 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-10-22 09:03:03,904 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:03:03,904 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:03:03,904 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:03:03,904 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:03:03,906 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:03:03,906 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:03:03,907 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:03:03,907 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-10-22 09:03:03,907 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:03:03,908 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:03:03,908 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:03:03,908 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:03:03,908 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:03:03,908 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:03:03,908 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:03:03,909 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:03:03,909 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-10-22 09:03:03,910 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:03:03,910 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:03:03,910 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:03:03,910 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:03:03,911 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:03:03,911 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:03:03,912 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:03:03,912 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-10-22 09:03:03,912 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:03:03,913 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:03:03,913 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:03:03,913 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:03:03,914 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:03:03,915 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:03:03,920 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:03:03,920 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-10-22 09:03:03,921 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:03:03,921 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:03:03,921 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:03:03,921 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:03:03,922 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:03:03,922 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:03:03,923 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:03:03,924 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-10-22 09:03:03,924 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:03:03,924 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:03:03,924 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:03:03,924 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:03:03,925 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:03:03,925 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:03:03,926 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:03:03,926 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-10-22 09:03:03,927 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:03:03,927 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:03:03,927 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:03:03,927 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:03:03,928 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:03:03,928 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:03:03,928 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:03:03,929 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-10-22 09:03:03,930 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:03:03,930 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:03:03,930 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:03:03,930 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:03:03,931 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:03:03,931 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:03:03,934 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:03:03,934 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-10-22 09:03:03,935 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:03:03,935 INFO L202 nArgumentSynthesizer]: 2 stem disjuncts [2019-10-22 09:03:03,935 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:03:03,935 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:03:03,936 INFO L400 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-10-22 09:03:03,936 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:03:03,940 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:03:03,940 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-10-22 09:03:03,940 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:03:03,941 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:03:03,941 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:03:03,941 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:03:03,942 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:03:03,942 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:03:03,947 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 09:03:03,952 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-10-22 09:03:03,952 INFO L444 ModelExtractionUtils]: 5 out of 10 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-10-22 09:03:03,952 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 09:03:03,953 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2019-10-22 09:03:03,954 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 09:03:03,954 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_#t~mem7) = 1*ULTIMATE.start_main_#t~mem7 Supporting invariants [1*ULTIMATE.start_main_#t~mem7 - 1*v_rep(select (select #memory_int ULTIMATE.start_main_~arr~0.base) (+ ULTIMATE.start_main_~arr~0.offset (* ULTIMATE.start_main_~j~0 4)))_1 >= 0] [2019-10-22 09:03:03,969 INFO L297 tatePredicateManager]: 4 out of 5 supporting invariants were superfluous and have been removed [2019-10-22 09:03:03,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:03:04,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:03:04,005 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-22 09:03:04,006 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:03:04,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:03:04,013 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-22 09:03:04,014 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:03:04,039 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 17 [2019-10-22 09:03:04,039 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 09:03:04,049 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 09:03:04,050 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 09:03:04,050 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:40, output treesize:17 [2019-10-22 09:03:04,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:03:04,062 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-10-22 09:03:04,063 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 28 states and 35 transitions. cyclomatic complexity: 11 Second operand 3 states. [2019-10-22 09:03:04,088 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 28 states and 35 transitions. cyclomatic complexity: 11. Second operand 3 states. Result 29 states and 36 transitions. Complement of second has 5 states. [2019-10-22 09:03:04,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-10-22 09:03:04,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-10-22 09:03:04,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 16 transitions. [2019-10-22 09:03:04,089 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 21 letters. Loop has 2 letters. [2019-10-22 09:03:04,089 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:03:04,090 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-10-22 09:03:04,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:03:04,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:03:04,121 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-22 09:03:04,122 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:03:04,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:03:04,129 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-22 09:03:04,129 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:03:04,134 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 17 [2019-10-22 09:03:04,135 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 09:03:04,144 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 09:03:04,144 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 09:03:04,145 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:40, output treesize:17 [2019-10-22 09:03:04,156 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:03:04,156 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2019-10-22 09:03:04,156 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 28 states and 35 transitions. cyclomatic complexity: 11 Second operand 3 states. [2019-10-22 09:03:04,180 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 28 states and 35 transitions. cyclomatic complexity: 11. Second operand 3 states. Result 29 states and 36 transitions. Complement of second has 5 states. [2019-10-22 09:03:04,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-10-22 09:03:04,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-10-22 09:03:04,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 16 transitions. [2019-10-22 09:03:04,181 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 21 letters. Loop has 2 letters. [2019-10-22 09:03:04,181 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:03:04,182 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-10-22 09:03:04,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:03:04,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:03:04,216 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-22 09:03:04,217 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:03:04,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:03:04,222 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-22 09:03:04,223 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:03:04,229 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 17 [2019-10-22 09:03:04,229 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 09:03:04,232 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 09:03:04,232 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 09:03:04,232 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:40, output treesize:17 [2019-10-22 09:03:04,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:03:04,241 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-10-22 09:03:04,241 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 28 states and 35 transitions. cyclomatic complexity: 11 Second operand 3 states. [2019-10-22 09:03:04,265 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 28 states and 35 transitions. cyclomatic complexity: 11. Second operand 3 states. Result 32 states and 40 transitions. Complement of second has 4 states. [2019-10-22 09:03:04,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-10-22 09:03:04,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-10-22 09:03:04,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 20 transitions. [2019-10-22 09:03:04,266 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 20 transitions. Stem has 21 letters. Loop has 2 letters. [2019-10-22 09:03:04,266 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:03:04,266 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 20 transitions. Stem has 23 letters. Loop has 2 letters. [2019-10-22 09:03:04,267 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:03:04,267 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 20 transitions. Stem has 21 letters. Loop has 4 letters. [2019-10-22 09:03:04,267 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:03:04,267 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 40 transitions. [2019-10-22 09:03:04,268 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-10-22 09:03:04,268 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 0 states and 0 transitions. [2019-10-22 09:03:04,268 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-10-22 09:03:04,268 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-10-22 09:03:04,268 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-10-22 09:03:04,268 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 09:03:04,268 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 09:03:04,268 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 09:03:04,268 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 09:03:04,268 INFO L424 BuchiCegarLoop]: ======== Iteration 9============ [2019-10-22 09:03:04,269 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-10-22 09:03:04,269 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-10-22 09:03:04,269 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-10-22 09:03:04,275 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.10 09:03:04 BoogieIcfgContainer [2019-10-22 09:03:04,275 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-10-22 09:03:04,275 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 09:03:04,275 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 09:03:04,276 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 09:03:04,276 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 09:02:58" (3/4) ... [2019-10-22 09:03:04,279 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-10-22 09:03:04,279 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 09:03:04,280 INFO L168 Benchmark]: Toolchain (without parser) took 6758.16 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 196.6 MB). Free memory was 935.6 MB in the beginning and 1.0 GB in the end (delta: -79.4 MB). Peak memory consumption was 117.2 MB. Max. memory is 11.5 GB. [2019-10-22 09:03:04,281 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 963.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 09:03:04,281 INFO L168 Benchmark]: CACSL2BoogieTranslator took 404.19 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.8 MB). Free memory was 935.6 MB in the beginning and 1.1 GB in the end (delta: -194.9 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2019-10-22 09:03:04,281 INFO L168 Benchmark]: Boogie Procedure Inliner took 42.13 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 09:03:04,282 INFO L168 Benchmark]: Boogie Preprocessor took 23.51 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-10-22 09:03:04,282 INFO L168 Benchmark]: RCFGBuilder took 299.45 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.3 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. [2019-10-22 09:03:04,283 INFO L168 Benchmark]: BuchiAutomizer took 5981.81 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 49.8 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 91.8 MB). Peak memory consumption was 141.6 MB. Max. memory is 11.5 GB. [2019-10-22 09:03:04,283 INFO L168 Benchmark]: Witness Printer took 3.67 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 09:03:04,285 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.19 ms. Allocated memory is still 1.0 GB. Free memory is still 963.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 404.19 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.8 MB). Free memory was 935.6 MB in the beginning and 1.1 GB in the end (delta: -194.9 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 42.13 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 23.51 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 299.45 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.3 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 5981.81 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 49.8 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 91.8 MB). Peak memory consumption was 141.6 MB. Max. memory is 11.5 GB. * Witness Printer took 3.67 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 8 terminating modules (3 trivial, 4 deterministic, 1 nondeterministic). One deterministic module has affine ranking function unknown-#length-unknown[arr] + -1 * arr + -4 * i and consists of 5 locations. One deterministic module has affine ranking function -2 * j + 1 and consists of 9 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[arr][j * 4 + arr] and consists of 4 locations. One deterministic module has affine ranking function -1 * j + length and consists of 4 locations. One nondeterministic module has affine ranking function org.eclipse.cdt.internal.core.dom.parser.c.CASTArraySubscriptExpression@432c8de4 and consists of 3 locations. 3 modules have a trivial ranking function, the largest among these consists of 14 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 5.9s and 9 iterations. TraceHistogramMax:2. Analysis of lassos took 4.7s. Construction of modules took 0.2s. Büchi inclusion checks took 0.8s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 5. Automata minimization 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 15 StatesRemovedByMinimization, 5 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 42 states and ocurred in iteration 4. Nontrivial modules had stage [4, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 137 SDtfs, 236 SDslu, 113 SDs, 0 SdLazy, 219 SolverSat, 49 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU3 SILI0 SILT0 lasso5 LassoPreprocessingBenchmarks: Lassos: inital139 mio100 ax113 hnf98 lsp83 ukn77 mio100 lsp56 div100 bol100 ite100 ukn100 eq162 hnf90 smp91 dnf100 smp100 tf100 neg100 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 38ms VariablesStem: 3 VariablesLoop: 2 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...