./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/array03-alloca-1.i --full-output --architecture 64bit -------------------------------------------------------------------------------- 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/run_dir_6ca84e4c-ceea-4924-894a-f51d9de78a94/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_6ca84e4c-ceea-4924-894a-f51d9de78a94/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_6ca84e4c-ceea-4924-894a-f51d9de78a94/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_6ca84e4c-ceea-4924-894a-f51d9de78a94/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/array03-alloca-1.i -s /tmp/vcloud-vcloud-master/worker/run_dir_6ca84e4c-ceea-4924-894a-f51d9de78a94/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_6ca84e4c-ceea-4924-894a-f51d9de78a94/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 987435cc8130e848f1b087d0b65ab8d71c3dfa3c .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-15 21:11:30,660 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 21:11:30,661 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 21:11:30,672 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 21:11:30,672 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 21:11:30,673 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 21:11:30,675 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 21:11:30,676 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 21:11:30,678 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 21:11:30,679 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 21:11:30,680 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 21:11:30,681 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 21:11:30,682 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 21:11:30,682 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 21:11:30,683 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 21:11:30,685 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 21:11:30,685 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 21:11:30,686 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 21:11:30,688 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 21:11:30,691 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 21:11:30,693 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 21:11:30,694 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 21:11:30,695 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 21:11:30,696 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 21:11:30,699 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 21:11:30,700 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 21:11:30,700 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 21:11:30,701 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 21:11:30,701 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 21:11:30,703 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 21:11:30,703 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 21:11:30,704 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 21:11:30,704 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 21:11:30,705 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 21:11:30,707 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 21:11:30,707 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 21:11:30,708 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 21:11:30,708 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 21:11:30,708 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 21:11:30,709 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 21:11:30,710 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 21:11:30,711 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_6ca84e4c-ceea-4924-894a-f51d9de78a94/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-11-15 21:11:30,728 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 21:11:30,728 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 21:11:30,729 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 21:11:30,730 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 21:11:30,730 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 21:11:30,730 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-15 21:11:30,731 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-15 21:11:30,731 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-15 21:11:30,731 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-15 21:11:30,731 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-15 21:11:30,732 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-15 21:11:30,732 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 21:11:30,732 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-15 21:11:30,732 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 21:11:30,733 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 21:11:30,733 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-15 21:11:30,733 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-15 21:11:30,733 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-15 21:11:30,734 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 21:11:30,734 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-15 21:11:30,734 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 21:11:30,735 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-15 21:11:30,735 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 21:11:30,735 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 21:11:30,735 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-15 21:11:30,736 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 21:11:30,736 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 21:11:30,736 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-15 21:11:30,737 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-15 21:11:30,737 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_6ca84e4c-ceea-4924-894a-f51d9de78a94/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 987435cc8130e848f1b087d0b65ab8d71c3dfa3c [2019-11-15 21:11:30,764 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 21:11:30,775 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 21:11:30,778 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 21:11:30,779 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 21:11:30,780 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 21:11:30,781 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_6ca84e4c-ceea-4924-894a-f51d9de78a94/bin/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/array03-alloca-1.i [2019-11-15 21:11:30,835 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_6ca84e4c-ceea-4924-894a-f51d9de78a94/bin/uautomizer/data/b0cee89b7/4e859c66d4854fee924e989267e48b17/FLAGb8926e53f [2019-11-15 21:11:31,304 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 21:11:31,310 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_6ca84e4c-ceea-4924-894a-f51d9de78a94/sv-benchmarks/c/termination-memory-alloca/array03-alloca-1.i [2019-11-15 21:11:31,333 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_6ca84e4c-ceea-4924-894a-f51d9de78a94/bin/uautomizer/data/b0cee89b7/4e859c66d4854fee924e989267e48b17/FLAGb8926e53f [2019-11-15 21:11:31,350 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_6ca84e4c-ceea-4924-894a-f51d9de78a94/bin/uautomizer/data/b0cee89b7/4e859c66d4854fee924e989267e48b17 [2019-11-15 21:11:31,353 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 21:11:31,355 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 21:11:31,360 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 21:11:31,361 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 21:11:31,364 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 21:11:31,365 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 09:11:31" (1/1) ... [2019-11-15 21:11:31,368 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b02b00f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:11:31, skipping insertion in model container [2019-11-15 21:11:31,374 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 09:11:31" (1/1) ... [2019-11-15 21:11:31,381 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 21:11:31,433 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 21:11:31,795 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 21:11:31,804 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 21:11:31,844 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 21:11:31,902 INFO L192 MainTranslator]: Completed translation [2019-11-15 21:11:31,902 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:11:31 WrapperNode [2019-11-15 21:11:31,903 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 21:11:31,904 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 21:11:31,904 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 21:11:31,904 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 21:11:31,913 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:11:31" (1/1) ... [2019-11-15 21:11:31,936 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:11:31" (1/1) ... [2019-11-15 21:11:31,953 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 21:11:31,954 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 21:11:31,954 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 21:11:31,954 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 21:11:31,963 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:11:31" (1/1) ... [2019-11-15 21:11:31,963 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:11:31" (1/1) ... [2019-11-15 21:11:31,966 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:11:31" (1/1) ... [2019-11-15 21:11:31,966 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:11:31" (1/1) ... [2019-11-15 21:11:31,972 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:11:31" (1/1) ... [2019-11-15 21:11:31,977 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:11:31" (1/1) ... [2019-11-15 21:11:31,983 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:11:31" (1/1) ... [2019-11-15 21:11:31,987 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 21:11:31,988 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 21:11:31,988 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 21:11:31,988 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 21:11:31,989 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:11:31" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6ca84e4c-ceea-4924-894a-f51d9de78a94/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 21:11:32,071 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-15 21:11:32,071 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-15 21:11:32,071 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-15 21:11:32,071 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-15 21:11:32,072 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 21:11:32,072 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 21:11:32,308 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 21:11:32,308 INFO L284 CfgBuilder]: Removed 8 assume(true) statements. [2019-11-15 21:11:32,309 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:11:32 BoogieIcfgContainer [2019-11-15 21:11:32,309 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 21:11:32,310 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-15 21:11:32,310 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-15 21:11:32,313 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-15 21:11:32,314 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 21:11:32,314 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 15.11 09:11:31" (1/3) ... [2019-11-15 21:11:32,315 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2fa76db8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 09:11:32, skipping insertion in model container [2019-11-15 21:11:32,316 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 21:11:32,316 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:11:31" (2/3) ... [2019-11-15 21:11:32,316 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2fa76db8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 09:11:32, skipping insertion in model container [2019-11-15 21:11:32,316 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 21:11:32,317 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:11:32" (3/3) ... [2019-11-15 21:11:32,318 INFO L371 chiAutomizerObserver]: Analyzing ICFG array03-alloca-1.i [2019-11-15 21:11:32,367 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-15 21:11:32,367 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-15 21:11:32,368 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-15 21:11:32,368 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 21:11:32,368 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 21:11:32,368 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-15 21:11:32,368 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 21:11:32,369 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-15 21:11:32,380 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2019-11-15 21:11:32,400 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-11-15 21:11:32,401 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 21:11:32,401 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 21:11:32,409 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-11-15 21:11:32,409 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-11-15 21:11:32,409 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-15 21:11:32,410 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2019-11-15 21:11:32,411 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-11-15 21:11:32,411 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 21:11:32,411 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 21:11:32,412 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-11-15 21:11:32,412 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-11-15 21:11:32,419 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~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet9;havoc main_#t~nondet9; 6#L567true assume !(main_~array_size~0 < 1); 10#L567-2true call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;test_fun_#in~a.base, test_fun_#in~a.offset, test_fun_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc test_fun_#t~mem3, test_fun_#t~mem4, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~post8, test_fun_#t~mem5, test_fun_#t~post2, test_fun_~a.base, test_fun_~a.offset, test_fun_~N, test_fun_~i~0, test_fun_~res~0;test_fun_~a.base, test_fun_~a.offset := test_fun_#in~a.base, test_fun_#in~a.offset;test_fun_~N := test_fun_#in~N;havoc test_fun_~i~0;havoc test_fun_~res~0;test_fun_~i~0 := 0; 3#L551-3true [2019-11-15 21:11:32,420 INFO L793 eck$LassoCheckResult]: Loop: 3#L551-3true assume !!(test_fun_~i~0 < test_fun_~N);test_fun_~res~0 := 1;call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 13#L553true assume 0 == test_fun_#t~mem3;havoc test_fun_#t~mem3;test_fun_~res~0 := 1; 7#L558-2true assume !true; 9#L558-3true call write~int(test_fun_~res~0, test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 17#L551-2true test_fun_#t~post2 := test_fun_~i~0;test_fun_~i~0 := 1 + test_fun_#t~post2;havoc test_fun_#t~post2; 3#L551-3true [2019-11-15 21:11:32,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:11:32,424 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2019-11-15 21:11:32,433 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:11:32,433 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524301394] [2019-11-15 21:11:32,433 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:11:32,434 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:11:32,434 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:11:32,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:11:32,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:11:32,554 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:11:32,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:11:32,555 INFO L82 PathProgramCache]: Analyzing trace with hash 44963621, now seen corresponding path program 1 times [2019-11-15 21:11:32,555 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:11:32,556 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56044553] [2019-11-15 21:11:32,556 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:11:32,556 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:11:32,556 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:11:32,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:11:32,591 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:11:32,591 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56044553] [2019-11-15 21:11:32,592 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:11:32,593 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 21:11:32,593 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073399284] [2019-11-15 21:11:32,598 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-15 21:11:32,599 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:11:32,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-15 21:11:32,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-15 21:11:32,615 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 2 states. [2019-11-15 21:11:32,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:11:32,621 INFO L93 Difference]: Finished difference Result 15 states and 19 transitions. [2019-11-15 21:11:32,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-15 21:11:32,622 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 19 transitions. [2019-11-15 21:11:32,624 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-11-15 21:11:32,628 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 11 states and 15 transitions. [2019-11-15 21:11:32,629 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-11-15 21:11:32,630 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-11-15 21:11:32,630 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 15 transitions. [2019-11-15 21:11:32,631 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 21:11:32,631 INFO L688 BuchiCegarLoop]: Abstraction has 11 states and 15 transitions. [2019-11-15 21:11:32,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 15 transitions. [2019-11-15 21:11:32,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-11-15 21:11:32,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-11-15 21:11:32,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 15 transitions. [2019-11-15 21:11:32,655 INFO L711 BuchiCegarLoop]: Abstraction has 11 states and 15 transitions. [2019-11-15 21:11:32,655 INFO L591 BuchiCegarLoop]: Abstraction has 11 states and 15 transitions. [2019-11-15 21:11:32,655 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-15 21:11:32,655 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 15 transitions. [2019-11-15 21:11:32,656 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-11-15 21:11:32,656 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 21:11:32,656 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 21:11:32,657 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-11-15 21:11:32,657 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-11-15 21:11:32,658 INFO L791 eck$LassoCheckResult]: Stem: 46#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 38#L-1 havoc main_#res;havoc main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet9;havoc main_#t~nondet9; 39#L567 assume !(main_~array_size~0 < 1); 47#L567-2 call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;test_fun_#in~a.base, test_fun_#in~a.offset, test_fun_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc test_fun_#t~mem3, test_fun_#t~mem4, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~post8, test_fun_#t~mem5, test_fun_#t~post2, test_fun_~a.base, test_fun_~a.offset, test_fun_~N, test_fun_~i~0, test_fun_~res~0;test_fun_~a.base, test_fun_~a.offset := test_fun_#in~a.base, test_fun_#in~a.offset;test_fun_~N := test_fun_#in~N;havoc test_fun_~i~0;havoc test_fun_~res~0;test_fun_~i~0 := 0; 40#L551-3 [2019-11-15 21:11:32,658 INFO L793 eck$LassoCheckResult]: Loop: 40#L551-3 assume !!(test_fun_~i~0 < test_fun_~N);test_fun_~res~0 := 1;call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 41#L553 assume 0 == test_fun_#t~mem3;havoc test_fun_#t~mem3;test_fun_~res~0 := 1; 42#L558-2 call test_fun_#t~mem5 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 44#L558 assume !(test_fun_#t~mem5 > 0);havoc test_fun_#t~mem5; 45#L558-3 call write~int(test_fun_~res~0, test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 48#L551-2 test_fun_#t~post2 := test_fun_~i~0;test_fun_~i~0 := 1 + test_fun_#t~post2;havoc test_fun_#t~post2; 40#L551-3 [2019-11-15 21:11:32,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:11:32,658 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 2 times [2019-11-15 21:11:32,659 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:11:32,659 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951181480] [2019-11-15 21:11:32,659 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:11:32,659 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:11:32,659 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:11:32,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:11:32,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:11:32,682 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:11:32,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:11:32,683 INFO L82 PathProgramCache]: Analyzing trace with hash 1393657929, now seen corresponding path program 1 times [2019-11-15 21:11:32,683 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:11:32,683 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075140163] [2019-11-15 21:11:32,684 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:11:32,684 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:11:32,684 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:11:32,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:11:32,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:11:32,711 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:11:32,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:11:32,712 INFO L82 PathProgramCache]: Analyzing trace with hash -1898369747, now seen corresponding path program 1 times [2019-11-15 21:11:32,712 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:11:32,712 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949845270] [2019-11-15 21:11:32,712 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:11:32,713 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:11:32,713 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:11:32,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:11:32,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:11:32,760 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:11:32,895 WARN L191 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 40 [2019-11-15 21:11:33,097 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 21:11:33,098 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 21:11:33,098 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 21:11:33,099 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 21:11:33,099 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 21:11:33,099 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 21:11:33,099 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 21:11:33,106 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 21:11:33,107 INFO L131 ssoRankerPreferences]: Filename of dumped script: array03-alloca-1.i_Iteration2_Lasso [2019-11-15 21:11:33,107 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 21:11:33,107 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 21:11:33,144 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:11:33,151 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:11:33,155 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:11:33,161 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:11:33,165 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:11:33,170 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:11:33,173 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:11:33,177 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:11:33,182 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:11:33,188 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:11:33,192 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:11:33,195 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:11:33,340 WARN L191 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 42 [2019-11-15 21:11:33,378 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:11:33,382 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:11:33,385 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:11:33,870 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 21:11:33,875 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 21:11:33,878 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:11:33,882 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:11:33,883 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:11:33,884 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:11:33,884 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:11:33,885 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:11:33,887 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:11:33,887 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:11:33,889 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:11:33,890 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:11:33,892 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:11:33,892 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:11:33,892 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:11:33,893 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:11:33,893 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:11:33,893 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:11:33,894 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:11:33,904 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:11:33,906 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:11:33,907 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:11:33,908 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:11:33,908 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:11:33,909 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:11:33,909 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:11:33,909 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:11:33,910 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:11:33,911 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:11:33,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-11-15 21:11:33,914 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:11:33,914 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:11:33,914 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:11:33,915 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:11:33,915 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:11:33,917 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:11:33,917 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:11:33,920 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:11:33,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-11-15 21:11:33,921 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:11:33,921 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:11:33,922 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:11:33,922 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:11:33,927 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:11:33,929 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:11:33,939 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:11:33,939 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:11:33,940 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:11:33,941 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:11:33,941 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:11:33,941 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:11:33,941 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:11:33,942 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:11:33,942 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:11:33,948 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:11:33,949 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:11:33,952 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:11:33,952 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:11:33,952 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:11:33,952 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:11:33,961 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:11:33,962 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:11:33,974 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:11:33,975 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:11:33,976 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:11:33,977 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:11:33,978 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:11:33,978 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:11:33,981 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:11:33,982 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:11:33,990 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:11:33,991 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:11:33,992 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:11:33,992 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:11:33,993 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:11:33,993 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:11:33,993 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:11:33,994 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:11:33,994 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:11:33,995 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:11:33,995 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:11:33,997 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:11:33,998 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:11:33,999 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:11:33,999 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:11:33,999 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:11:34,000 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:11:34,000 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:11:34,009 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:11:34,014 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:11:34,015 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:11:34,016 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:11:34,016 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:11:34,017 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:11:34,017 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:11:34,017 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:11:34,018 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:11:34,019 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:11:34,019 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:11:34,020 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:11:34,021 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:11:34,021 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:11:34,021 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:11:34,021 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:11:34,022 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:11:34,022 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:11:34,025 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:11:34,026 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:11:34,027 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:11:34,027 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:11:34,027 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:11:34,027 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:11:34,030 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:11:34,031 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:11:34,032 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:11:34,033 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:11:34,034 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:11:34,034 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:11:34,035 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:11:34,036 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:11:34,036 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:11:34,038 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:11:34,039 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:11:34,042 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:11:34,044 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:11:34,046 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:11:34,046 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:11:34,047 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:11:34,047 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:11:34,053 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:11:34,054 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:11:34,071 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:11:34,073 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:11:34,075 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:11:34,076 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:11:34,076 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:11:34,076 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:11:34,083 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:11:34,084 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:11:34,197 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 21:11:34,264 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2019-11-15 21:11:34,265 INFO L444 ModelExtractionUtils]: 27 out of 34 variables were initially zero. Simplification set additionally 4 variables to zero. [2019-11-15 21:11:34,267 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 21:11:34,269 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-15 21:11:34,269 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 21:11:34,270 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_test_fun_~N, ULTIMATE.start_test_fun_~i~0) = 1*ULTIMATE.start_test_fun_~N - 1*ULTIMATE.start_test_fun_~i~0 Supporting invariants [] [2019-11-15 21:11:34,281 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2019-11-15 21:11:34,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:11:34,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:11:34,332 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 21:11:34,333 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:11:34,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:11:34,357 INFO L256 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 21:11:34,357 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:11:34,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:11:34,382 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-15 21:11:34,383 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 15 transitions. cyclomatic complexity: 5 Second operand 3 states. [2019-11-15 21:11:34,428 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states and 15 transitions. cyclomatic complexity: 5. Second operand 3 states. Result 18 states and 26 transitions. Complement of second has 4 states. [2019-11-15 21:11:34,429 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-11-15 21:11:34,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 21:11:34,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 15 transitions. [2019-11-15 21:11:34,431 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 4 letters. Loop has 6 letters. [2019-11-15 21:11:34,432 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:11:34,433 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 10 letters. Loop has 6 letters. [2019-11-15 21:11:34,433 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:11:34,433 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 4 letters. Loop has 12 letters. [2019-11-15 21:11:34,433 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:11:34,434 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 26 transitions. [2019-11-15 21:11:34,435 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-15 21:11:34,436 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 16 states and 24 transitions. [2019-11-15 21:11:34,436 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2019-11-15 21:11:34,437 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2019-11-15 21:11:34,437 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 24 transitions. [2019-11-15 21:11:34,437 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 21:11:34,437 INFO L688 BuchiCegarLoop]: Abstraction has 16 states and 24 transitions. [2019-11-15 21:11:34,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 24 transitions. [2019-11-15 21:11:34,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-11-15 21:11:34,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-11-15 21:11:34,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 24 transitions. [2019-11-15 21:11:34,440 INFO L711 BuchiCegarLoop]: Abstraction has 16 states and 24 transitions. [2019-11-15 21:11:34,440 INFO L591 BuchiCegarLoop]: Abstraction has 16 states and 24 transitions. [2019-11-15 21:11:34,440 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-15 21:11:34,440 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 24 transitions. [2019-11-15 21:11:34,441 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-15 21:11:34,441 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 21:11:34,442 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 21:11:34,442 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-11-15 21:11:34,442 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-15 21:11:34,443 INFO L791 eck$LassoCheckResult]: Stem: 142#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 133#L-1 havoc main_#res;havoc main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet9;havoc main_#t~nondet9; 134#L567 assume !(main_~array_size~0 < 1); 143#L567-2 call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;test_fun_#in~a.base, test_fun_#in~a.offset, test_fun_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc test_fun_#t~mem3, test_fun_#t~mem4, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~post8, test_fun_#t~mem5, test_fun_#t~post2, test_fun_~a.base, test_fun_~a.offset, test_fun_~N, test_fun_~i~0, test_fun_~res~0;test_fun_~a.base, test_fun_~a.offset := test_fun_#in~a.base, test_fun_#in~a.offset;test_fun_~N := test_fun_#in~N;havoc test_fun_~i~0;havoc test_fun_~res~0;test_fun_~i~0 := 0; 129#L551-3 assume !!(test_fun_~i~0 < test_fun_~N);test_fun_~res~0 := 1;call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 131#L553 assume 0 == test_fun_#t~mem3;havoc test_fun_#t~mem3;test_fun_~res~0 := 1; 135#L558-2 [2019-11-15 21:11:34,443 INFO L793 eck$LassoCheckResult]: Loop: 135#L558-2 call test_fun_#t~mem5 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 139#L558 assume !!(test_fun_#t~mem5 > 0);havoc test_fun_#t~mem5;call test_fun_#t~mem6 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);test_fun_~res~0 := test_fun_~res~0 * test_fun_#t~mem6;havoc test_fun_#t~mem6;call test_fun_#t~mem7 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);test_fun_#t~post8 := test_fun_#t~mem7;call write~int(test_fun_#t~post8 - 1, test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);havoc test_fun_#t~mem7;havoc test_fun_#t~post8; 135#L558-2 [2019-11-15 21:11:34,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:11:34,443 INFO L82 PathProgramCache]: Analyzing trace with hash 889568456, now seen corresponding path program 1 times [2019-11-15 21:11:34,444 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:11:34,444 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927078477] [2019-11-15 21:11:34,444 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:11:34,444 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:11:34,444 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:11:34,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:11:34,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:11:34,490 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:11:34,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:11:34,496 INFO L82 PathProgramCache]: Analyzing trace with hash 1990, now seen corresponding path program 1 times [2019-11-15 21:11:34,496 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:11:34,496 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800659839] [2019-11-15 21:11:34,497 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:11:34,497 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:11:34,497 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:11:34,502 ERROR L273 tionRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-15 21:11:34,504 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1880395623] [2019-11-15 21:11:34,504 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6ca84e4c-ceea-4924-894a-f51d9de78a94/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-11-15 21:11:34,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:11:34,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:11:34,583 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:11:34,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:11:34,584 INFO L82 PathProgramCache]: Analyzing trace with hash 176795341, now seen corresponding path program 1 times [2019-11-15 21:11:34,588 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:11:34,588 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752059153] [2019-11-15 21:11:34,589 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:11:34,589 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:11:34,589 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:11:34,597 ERROR L273 tionRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-15 21:11:34,602 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1017048577] [2019-11-15 21:11:34,603 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6ca84e4c-ceea-4924-894a-f51d9de78a94/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-11-15 21:11:34,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:11:34,718 INFO L256 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 21:11:34,719 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:11:34,818 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2019-11-15 21:11:34,820 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:11:34,823 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:11:34,824 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:11:34,824 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:23, output treesize:3 [2019-11-15 21:11:34,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:11:34,832 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752059153] [2019-11-15 21:11:34,832 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-15 21:11:34,832 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1017048577] [2019-11-15 21:11:34,833 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:11:34,833 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:11:34,833 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363249151] [2019-11-15 21:11:34,877 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:11:34,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 21:11:34,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:11:34,878 INFO L87 Difference]: Start difference. First operand 16 states and 24 transitions. cyclomatic complexity: 10 Second operand 5 states. [2019-11-15 21:11:34,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:11:34,929 INFO L93 Difference]: Finished difference Result 21 states and 28 transitions. [2019-11-15 21:11:34,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 21:11:34,929 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 28 transitions. [2019-11-15 21:11:34,930 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-15 21:11:34,931 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 19 states and 26 transitions. [2019-11-15 21:11:34,931 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2019-11-15 21:11:34,931 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2019-11-15 21:11:34,932 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 26 transitions. [2019-11-15 21:11:34,932 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 21:11:34,932 INFO L688 BuchiCegarLoop]: Abstraction has 19 states and 26 transitions. [2019-11-15 21:11:34,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 26 transitions. [2019-11-15 21:11:34,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2019-11-15 21:11:34,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-11-15 21:11:34,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 25 transitions. [2019-11-15 21:11:34,934 INFO L711 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2019-11-15 21:11:34,934 INFO L591 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2019-11-15 21:11:34,934 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-15 21:11:34,934 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 25 transitions. [2019-11-15 21:11:34,935 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-15 21:11:34,935 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 21:11:34,935 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 21:11:34,936 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:11:34,936 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-15 21:11:34,936 INFO L791 eck$LassoCheckResult]: Stem: 212#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 203#L-1 havoc main_#res;havoc main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet9;havoc main_#t~nondet9; 204#L567 assume !(main_~array_size~0 < 1); 213#L567-2 call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;test_fun_#in~a.base, test_fun_#in~a.offset, test_fun_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc test_fun_#t~mem3, test_fun_#t~mem4, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~post8, test_fun_#t~mem5, test_fun_#t~post2, test_fun_~a.base, test_fun_~a.offset, test_fun_~N, test_fun_~i~0, test_fun_~res~0;test_fun_~a.base, test_fun_~a.offset := test_fun_#in~a.base, test_fun_#in~a.offset;test_fun_~N := test_fun_#in~N;havoc test_fun_~i~0;havoc test_fun_~res~0;test_fun_~i~0 := 0; 199#L551-3 assume !!(test_fun_~i~0 < test_fun_~N);test_fun_~res~0 := 1;call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 201#L553 assume !(0 == test_fun_#t~mem3);havoc test_fun_#t~mem3;call test_fun_#t~mem4 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 205#L555 assume !(test_fun_#t~mem4 < 0);havoc test_fun_#t~mem4; 209#L558-2 [2019-11-15 21:11:34,936 INFO L793 eck$LassoCheckResult]: Loop: 209#L558-2 call test_fun_#t~mem5 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 208#L558 assume !!(test_fun_#t~mem5 > 0);havoc test_fun_#t~mem5;call test_fun_#t~mem6 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);test_fun_~res~0 := test_fun_~res~0 * test_fun_#t~mem6;havoc test_fun_#t~mem6;call test_fun_#t~mem7 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);test_fun_#t~post8 := test_fun_#t~mem7;call write~int(test_fun_#t~post8 - 1, test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);havoc test_fun_#t~mem7;havoc test_fun_#t~post8; 209#L558-2 [2019-11-15 21:11:34,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:11:34,937 INFO L82 PathProgramCache]: Analyzing trace with hash 1806818449, now seen corresponding path program 1 times [2019-11-15 21:11:34,937 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:11:34,937 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637777188] [2019-11-15 21:11:34,937 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:11:34,937 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:11:34,938 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:11:34,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:11:34,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:11:34,957 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:11:34,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:11:34,958 INFO L82 PathProgramCache]: Analyzing trace with hash 1990, now seen corresponding path program 2 times [2019-11-15 21:11:34,959 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:11:34,959 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847822052] [2019-11-15 21:11:34,959 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:11:34,959 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:11:34,959 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:11:34,962 ERROR L273 tionRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-15 21:11:34,963 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [135675365] [2019-11-15 21:11:34,963 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6ca84e4c-ceea-4924-894a-f51d9de78a94/bin/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:11:35,026 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-11-15 21:11:35,027 INFO L250 tOrderPrioritization]: Conjunction of SSA is sat [2019-11-15 21:11:35,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:11:35,035 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:11:35,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:11:35,036 INFO L82 PathProgramCache]: Analyzing trace with hash 1185742934, now seen corresponding path program 1 times [2019-11-15 21:11:35,036 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:11:35,036 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907087177] [2019-11-15 21:11:35,036 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:11:35,037 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:11:35,037 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:11:35,043 ERROR L273 tionRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-15 21:11:35,043 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1404575970] [2019-11-15 21:11:35,043 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6ca84e4c-ceea-4924-894a-f51d9de78a94/bin/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:11:35,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:11:35,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:11:35,142 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:11:35,439 WARN L191 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 69 [2019-11-15 21:11:35,525 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 21:11:35,525 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 21:11:35,525 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 21:11:35,525 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 21:11:35,525 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 21:11:35,525 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 21:11:35,525 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 21:11:35,526 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 21:11:35,526 INFO L131 ssoRankerPreferences]: Filename of dumped script: array03-alloca-1.i_Iteration4_Lasso [2019-11-15 21:11:35,526 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 21:11:35,526 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 21:11:35,530 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:11:35,539 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:11:35,542 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:11:35,545 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:11:35,547 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:11:35,550 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:11:35,703 WARN L191 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 50 [2019-11-15 21:11:35,733 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:11:35,737 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:11:35,739 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:11:35,742 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:11:35,745 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:11:35,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-11-15 21:11:35,750 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:11:35,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-11-15 21:11:35,755 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:11:36,165 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 21:11:36,165 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 21:11:36,165 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:11:36,166 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:11:36,166 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:11:36,166 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:11:36,166 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:11:36,166 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:11:36,167 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:11:36,167 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:11:36,168 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:11:36,168 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:11:36,168 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:11:36,168 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:11:36,169 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:11:36,169 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:11:36,169 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:11:36,169 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:11:36,169 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:11:36,178 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:11:36,179 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:11:36,183 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:11:36,183 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:11:36,183 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:11:36,183 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:11:36,184 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:11:36,184 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:11:36,186 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:11:36,188 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:11:36,189 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:11:36,190 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:11:36,190 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:11:36,190 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:11:36,191 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:11:36,191 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:11:36,191 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:11:36,192 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:11:36,192 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:11:36,193 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:11:36,193 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:11:36,194 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:11:36,194 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:11:36,194 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:11:36,194 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:11:36,195 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:11:36,196 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:11:36,196 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:11:36,197 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:11:36,197 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:11:36,197 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:11:36,198 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:11:36,199 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:11:36,199 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:11:36,220 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 21:11:36,231 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-15 21:11:36,233 INFO L444 ModelExtractionUtils]: 7 out of 10 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-15 21:11:36,234 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 21:11:36,235 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-15 21:11:36,236 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 21:11:36,239 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~a.base) (+ (* ULTIMATE.start_test_fun_~i~0 4) ULTIMATE.start_test_fun_~a.offset))_2) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~a.base) (+ (* ULTIMATE.start_test_fun_~i~0 4) ULTIMATE.start_test_fun_~a.offset))_2 Supporting invariants [] [2019-11-15 21:11:36,248 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2019-11-15 21:11:36,250 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-15 21:11:36,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:11:36,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:11:36,295 INFO L256 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 21:11:36,296 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:11:36,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:11:36,304 INFO L256 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-15 21:11:36,305 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:11:36,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:11:36,318 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-15 21:11:36,318 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 25 transitions. cyclomatic complexity: 9 Second operand 3 states. [2019-11-15 21:11:36,341 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 25 transitions. cyclomatic complexity: 9. Second operand 3 states. Result 40 states and 54 transitions. Complement of second has 7 states. [2019-11-15 21:11:36,342 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-11-15 21:11:36,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 21:11:36,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2019-11-15 21:11:36,343 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 7 letters. Loop has 2 letters. [2019-11-15 21:11:36,343 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:11:36,343 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 9 letters. Loop has 2 letters. [2019-11-15 21:11:36,343 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:11:36,343 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 7 letters. Loop has 4 letters. [2019-11-15 21:11:36,344 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:11:36,344 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 54 transitions. [2019-11-15 21:11:36,345 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-11-15 21:11:36,346 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 35 states and 47 transitions. [2019-11-15 21:11:36,346 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2019-11-15 21:11:36,346 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2019-11-15 21:11:36,347 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 47 transitions. [2019-11-15 21:11:36,347 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 21:11:36,347 INFO L688 BuchiCegarLoop]: Abstraction has 35 states and 47 transitions. [2019-11-15 21:11:36,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 47 transitions. [2019-11-15 21:11:36,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 31. [2019-11-15 21:11:36,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-11-15 21:11:36,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 43 transitions. [2019-11-15 21:11:36,351 INFO L711 BuchiCegarLoop]: Abstraction has 31 states and 43 transitions. [2019-11-15 21:11:36,351 INFO L591 BuchiCegarLoop]: Abstraction has 31 states and 43 transitions. [2019-11-15 21:11:36,351 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-15 21:11:36,351 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 43 transitions. [2019-11-15 21:11:36,352 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-15 21:11:36,352 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 21:11:36,353 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 21:11:36,353 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:11:36,353 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-15 21:11:36,353 INFO L791 eck$LassoCheckResult]: Stem: 335#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 320#L-1 havoc main_#res;havoc main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet9;havoc main_#t~nondet9; 321#L567 assume !(main_~array_size~0 < 1); 336#L567-2 call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;test_fun_#in~a.base, test_fun_#in~a.offset, test_fun_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc test_fun_#t~mem3, test_fun_#t~mem4, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~post8, test_fun_#t~mem5, test_fun_#t~post2, test_fun_~a.base, test_fun_~a.offset, test_fun_~N, test_fun_~i~0, test_fun_~res~0;test_fun_~a.base, test_fun_~a.offset := test_fun_#in~a.base, test_fun_#in~a.offset;test_fun_~N := test_fun_#in~N;havoc test_fun_~i~0;havoc test_fun_~res~0;test_fun_~i~0 := 0; 322#L551-3 assume !!(test_fun_~i~0 < test_fun_~N);test_fun_~res~0 := 1;call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 324#L553 assume !(0 == test_fun_#t~mem3);havoc test_fun_#t~mem3;call test_fun_#t~mem4 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 338#L555 assume test_fun_#t~mem4 < 0;havoc test_fun_#t~mem4;test_fun_~res~0 := 0; 332#L558-2 [2019-11-15 21:11:36,354 INFO L793 eck$LassoCheckResult]: Loop: 332#L558-2 call test_fun_#t~mem5 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 331#L558 assume !!(test_fun_#t~mem5 > 0);havoc test_fun_#t~mem5;call test_fun_#t~mem6 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);test_fun_~res~0 := test_fun_~res~0 * test_fun_#t~mem6;havoc test_fun_#t~mem6;call test_fun_#t~mem7 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);test_fun_#t~post8 := test_fun_#t~mem7;call write~int(test_fun_#t~post8 - 1, test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);havoc test_fun_#t~mem7;havoc test_fun_#t~post8; 332#L558-2 [2019-11-15 21:11:36,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:11:36,354 INFO L82 PathProgramCache]: Analyzing trace with hash 1806818447, now seen corresponding path program 1 times [2019-11-15 21:11:36,354 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:11:36,355 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061324891] [2019-11-15 21:11:36,355 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:11:36,355 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:11:36,355 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:11:36,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:11:36,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:11:36,370 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:11:36,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:11:36,371 INFO L82 PathProgramCache]: Analyzing trace with hash 1990, now seen corresponding path program 3 times [2019-11-15 21:11:36,371 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:11:36,371 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991201357] [2019-11-15 21:11:36,371 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:11:36,371 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:11:36,372 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:11:36,374 ERROR L273 tionRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-15 21:11:36,374 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2115706055] [2019-11-15 21:11:36,375 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6ca84e4c-ceea-4924-894a-f51d9de78a94/bin/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:11:36,427 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2019-11-15 21:11:36,427 INFO L250 tOrderPrioritization]: Conjunction of SSA is sat [2019-11-15 21:11:36,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:11:36,434 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:11:36,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:11:36,435 INFO L82 PathProgramCache]: Analyzing trace with hash 1185741012, now seen corresponding path program 1 times [2019-11-15 21:11:36,435 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:11:36,435 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183846467] [2019-11-15 21:11:36,435 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:11:36,436 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:11:36,436 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:11:36,441 ERROR L273 tionRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-15 21:11:36,441 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [993343886] [2019-11-15 21:11:36,441 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6ca84e4c-ceea-4924-894a-f51d9de78a94/bin/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:11:36,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:11:36,503 INFO L256 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 21:11:36,505 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:11:36,527 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 9 [2019-11-15 21:11:36,527 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 21:11:36,530 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 21:11:36,530 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 21:11:36,530 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:25, output treesize:5 [2019-11-15 21:11:36,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:11:36,538 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183846467] [2019-11-15 21:11:36,538 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-15 21:11:36,539 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [993343886] [2019-11-15 21:11:36,539 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:11:36,539 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:11:36,539 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283787212] [2019-11-15 21:11:36,592 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:11:36,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 21:11:36,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:11:36,593 INFO L87 Difference]: Start difference. First operand 31 states and 43 transitions. cyclomatic complexity: 16 Second operand 5 states. [2019-11-15 21:11:36,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:11:36,667 INFO L93 Difference]: Finished difference Result 37 states and 47 transitions. [2019-11-15 21:11:36,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 21:11:36,668 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 47 transitions. [2019-11-15 21:11:36,669 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-15 21:11:36,670 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 33 states and 41 transitions. [2019-11-15 21:11:36,670 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2019-11-15 21:11:36,670 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2019-11-15 21:11:36,671 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 41 transitions. [2019-11-15 21:11:36,671 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 21:11:36,671 INFO L688 BuchiCegarLoop]: Abstraction has 33 states and 41 transitions. [2019-11-15 21:11:36,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 41 transitions. [2019-11-15 21:11:36,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 27. [2019-11-15 21:11:36,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-11-15 21:11:36,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 35 transitions. [2019-11-15 21:11:36,674 INFO L711 BuchiCegarLoop]: Abstraction has 27 states and 35 transitions. [2019-11-15 21:11:36,674 INFO L591 BuchiCegarLoop]: Abstraction has 27 states and 35 transitions. [2019-11-15 21:11:36,674 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-15 21:11:36,674 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 35 transitions. [2019-11-15 21:11:36,675 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-15 21:11:36,675 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 21:11:36,675 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 21:11:36,676 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:11:36,676 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-15 21:11:36,676 INFO L791 eck$LassoCheckResult]: Stem: 437#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 424#L-1 havoc main_#res;havoc main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet9;havoc main_#t~nondet9; 425#L567 assume !(main_~array_size~0 < 1); 438#L567-2 call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;test_fun_#in~a.base, test_fun_#in~a.offset, test_fun_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc test_fun_#t~mem3, test_fun_#t~mem4, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~post8, test_fun_#t~mem5, test_fun_#t~post2, test_fun_~a.base, test_fun_~a.offset, test_fun_~N, test_fun_~i~0, test_fun_~res~0;test_fun_~a.base, test_fun_~a.offset := test_fun_#in~a.base, test_fun_#in~a.offset;test_fun_~N := test_fun_#in~N;havoc test_fun_~i~0;havoc test_fun_~res~0;test_fun_~i~0 := 0; 426#L551-3 assume !!(test_fun_~i~0 < test_fun_~N);test_fun_~res~0 := 1;call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 427#L553 assume !(0 == test_fun_#t~mem3);havoc test_fun_#t~mem3;call test_fun_#t~mem4 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 432#L555 assume !(test_fun_#t~mem4 < 0);havoc test_fun_#t~mem4; 436#L558-2 call test_fun_#t~mem5 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 440#L558 assume !(test_fun_#t~mem5 > 0);havoc test_fun_#t~mem5; 448#L558-3 call write~int(test_fun_~res~0, test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 447#L551-2 test_fun_#t~post2 := test_fun_~i~0;test_fun_~i~0 := 1 + test_fun_#t~post2;havoc test_fun_#t~post2; 445#L551-3 assume !!(test_fun_~i~0 < test_fun_~N);test_fun_~res~0 := 1;call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 429#L553 assume !(0 == test_fun_#t~mem3);havoc test_fun_#t~mem3;call test_fun_#t~mem4 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 430#L555 assume !(test_fun_#t~mem4 < 0);havoc test_fun_#t~mem4; 434#L558-2 [2019-11-15 21:11:36,676 INFO L793 eck$LassoCheckResult]: Loop: 434#L558-2 call test_fun_#t~mem5 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 433#L558 assume !!(test_fun_#t~mem5 > 0);havoc test_fun_#t~mem5;call test_fun_#t~mem6 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);test_fun_~res~0 := test_fun_~res~0 * test_fun_#t~mem6;havoc test_fun_#t~mem6;call test_fun_#t~mem7 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);test_fun_#t~post8 := test_fun_#t~mem7;call write~int(test_fun_#t~post8 - 1, test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);havoc test_fun_#t~mem7;havoc test_fun_#t~post8; 434#L558-2 [2019-11-15 21:11:36,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:11:36,676 INFO L82 PathProgramCache]: Analyzing trace with hash 1864345184, now seen corresponding path program 1 times [2019-11-15 21:11:36,677 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:11:36,677 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521351268] [2019-11-15 21:11:36,677 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:11:36,677 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:11:36,677 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:11:36,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:11:36,772 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:11:36,773 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521351268] [2019-11-15 21:11:36,773 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:11:36,773 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 21:11:36,773 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217231466] [2019-11-15 21:11:36,773 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 21:11:36,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:11:36,774 INFO L82 PathProgramCache]: Analyzing trace with hash 1990, now seen corresponding path program 4 times [2019-11-15 21:11:36,774 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:11:36,774 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036975330] [2019-11-15 21:11:36,774 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:11:36,774 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:11:36,774 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:11:36,777 ERROR L273 tionRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-15 21:11:36,777 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [822621499] [2019-11-15 21:11:36,777 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6ca84e4c-ceea-4924-894a-f51d9de78a94/bin/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:11:36,831 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-15 21:11:36,831 INFO L250 tOrderPrioritization]: Conjunction of SSA is sat [2019-11-15 21:11:36,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:11:36,838 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:11:36,878 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:11:36,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 21:11:36,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-15 21:11:36,879 INFO L87 Difference]: Start difference. First operand 27 states and 35 transitions. cyclomatic complexity: 12 Second operand 6 states. [2019-11-15 21:11:36,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:11:36,947 INFO L93 Difference]: Finished difference Result 34 states and 42 transitions. [2019-11-15 21:11:36,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 21:11:36,949 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 42 transitions. [2019-11-15 21:11:36,950 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-15 21:11:36,950 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 33 states and 41 transitions. [2019-11-15 21:11:36,951 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-11-15 21:11:36,951 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-11-15 21:11:36,951 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 41 transitions. [2019-11-15 21:11:36,951 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 21:11:36,951 INFO L688 BuchiCegarLoop]: Abstraction has 33 states and 41 transitions. [2019-11-15 21:11:36,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 41 transitions. [2019-11-15 21:11:36,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 30. [2019-11-15 21:11:36,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-11-15 21:11:36,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 38 transitions. [2019-11-15 21:11:36,955 INFO L711 BuchiCegarLoop]: Abstraction has 30 states and 38 transitions. [2019-11-15 21:11:36,955 INFO L591 BuchiCegarLoop]: Abstraction has 30 states and 38 transitions. [2019-11-15 21:11:36,955 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-11-15 21:11:36,955 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 38 transitions. [2019-11-15 21:11:36,955 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-15 21:11:36,956 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 21:11:36,956 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 21:11:36,956 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:11:36,956 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-15 21:11:36,957 INFO L791 eck$LassoCheckResult]: Stem: 510#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 496#L-1 havoc main_#res;havoc main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet9;havoc main_#t~nondet9; 497#L567 assume !(main_~array_size~0 < 1); 511#L567-2 call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;test_fun_#in~a.base, test_fun_#in~a.offset, test_fun_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc test_fun_#t~mem3, test_fun_#t~mem4, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~post8, test_fun_#t~mem5, test_fun_#t~post2, test_fun_~a.base, test_fun_~a.offset, test_fun_~N, test_fun_~i~0, test_fun_~res~0;test_fun_~a.base, test_fun_~a.offset := test_fun_#in~a.base, test_fun_#in~a.offset;test_fun_~N := test_fun_#in~N;havoc test_fun_~i~0;havoc test_fun_~res~0;test_fun_~i~0 := 0; 498#L551-3 assume !!(test_fun_~i~0 < test_fun_~N);test_fun_~res~0 := 1;call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 499#L553 assume !(0 == test_fun_#t~mem3);havoc test_fun_#t~mem3;call test_fun_#t~mem4 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 524#L555 assume !(test_fun_#t~mem4 < 0);havoc test_fun_#t~mem4; 512#L558-2 call test_fun_#t~mem5 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 508#L558 assume !!(test_fun_#t~mem5 > 0);havoc test_fun_#t~mem5;call test_fun_#t~mem6 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);test_fun_~res~0 := test_fun_~res~0 * test_fun_#t~mem6;havoc test_fun_#t~mem6;call test_fun_#t~mem7 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);test_fun_#t~post8 := test_fun_#t~mem7;call write~int(test_fun_#t~post8 - 1, test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);havoc test_fun_#t~mem7;havoc test_fun_#t~post8; 509#L558-2 call test_fun_#t~mem5 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 519#L558 assume !(test_fun_#t~mem5 > 0);havoc test_fun_#t~mem5; 518#L558-3 call write~int(test_fun_~res~0, test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 517#L551-2 test_fun_#t~post2 := test_fun_~i~0;test_fun_~i~0 := 1 + test_fun_#t~post2;havoc test_fun_#t~post2; 516#L551-3 assume !!(test_fun_~i~0 < test_fun_~N);test_fun_~res~0 := 1;call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 501#L553 assume !(0 == test_fun_#t~mem3);havoc test_fun_#t~mem3;call test_fun_#t~mem4 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 502#L555 assume !(test_fun_#t~mem4 < 0);havoc test_fun_#t~mem4; 507#L558-2 [2019-11-15 21:11:36,957 INFO L793 eck$LassoCheckResult]: Loop: 507#L558-2 call test_fun_#t~mem5 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 506#L558 assume !!(test_fun_#t~mem5 > 0);havoc test_fun_#t~mem5;call test_fun_#t~mem6 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);test_fun_~res~0 := test_fun_~res~0 * test_fun_#t~mem6;havoc test_fun_#t~mem6;call test_fun_#t~mem7 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);test_fun_#t~post8 := test_fun_#t~mem7;call write~int(test_fun_#t~post8 - 1, test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);havoc test_fun_#t~mem7;havoc test_fun_#t~post8; 507#L558-2 [2019-11-15 21:11:36,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:11:36,957 INFO L82 PathProgramCache]: Analyzing trace with hash 221162235, now seen corresponding path program 1 times [2019-11-15 21:11:36,957 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:11:36,957 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290216658] [2019-11-15 21:11:36,962 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:11:36,962 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:11:36,962 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:11:36,970 ERROR L273 tionRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-15 21:11:36,971 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1648958908] [2019-11-15 21:11:36,971 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6ca84e4c-ceea-4924-894a-f51d9de78a94/bin/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:11:37,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:11:37,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:11:37,065 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:11:37,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:11:37,068 INFO L82 PathProgramCache]: Analyzing trace with hash 1990, now seen corresponding path program 5 times [2019-11-15 21:11:37,069 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:11:37,069 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894085017] [2019-11-15 21:11:37,069 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:11:37,069 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:11:37,069 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:11:37,076 ERROR L273 tionRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-15 21:11:37,077 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [939747081] [2019-11-15 21:11:37,077 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6ca84e4c-ceea-4924-894a-f51d9de78a94/bin/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:11:37,146 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-11-15 21:11:37,146 INFO L250 tOrderPrioritization]: Conjunction of SSA is sat [2019-11-15 21:11:37,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:11:37,153 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:11:37,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:11:37,153 INFO L82 PathProgramCache]: Analyzing trace with hash 2083511360, now seen corresponding path program 2 times [2019-11-15 21:11:37,153 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:11:37,154 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946394602] [2019-11-15 21:11:37,154 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:11:37,154 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:11:37,154 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:11:37,162 ERROR L273 tionRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-15 21:11:37,163 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [562374624] [2019-11-15 21:11:37,163 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6ca84e4c-ceea-4924-894a-f51d9de78a94/bin/uautomizer/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:11:37,241 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-15 21:11:37,241 INFO L250 tOrderPrioritization]: Conjunction of SSA is sat [2019-11-15 21:11:37,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:11:37,263 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:11:37,710 WARN L191 SmtUtils]: Spent 395.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 104 [2019-11-15 21:11:37,808 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 21:11:37,808 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 21:11:37,808 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 21:11:37,808 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 21:11:37,808 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 21:11:37,808 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 21:11:37,808 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 21:11:37,808 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 21:11:37,809 INFO L131 ssoRankerPreferences]: Filename of dumped script: array03-alloca-1.i_Iteration7_Lasso [2019-11-15 21:11:37,809 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 21:11:37,809 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 21:11:37,812 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:11:37,816 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:11:37,830 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:11:37,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-11-15 21:11:37,839 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:11:37,997 WARN L191 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 53 [2019-11-15 21:11:38,037 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:11:38,043 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:11:38,045 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:11:38,049 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:11:38,050 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:11:38,053 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:11:38,055 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:11:38,057 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:11:38,060 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:11:38,066 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:11:38,366 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 21:11:38,366 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 21:11:38,366 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:11:38,369 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:11:38,369 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:11:38,369 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:11:38,369 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:11:38,369 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:11:38,370 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:11:38,370 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:11:38,371 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:11:38,371 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:11:38,372 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:11:38,372 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:11:38,372 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:11:38,372 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:11:38,372 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:11:38,372 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:11:38,373 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:11:38,373 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:11:38,374 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:11:38,398 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:11:38,398 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:11:38,399 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:11:38,399 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:11:38,399 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:11:38,400 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:11:38,401 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:11:38,401 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:11:38,402 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:11:38,402 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:11:38,402 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:11:38,403 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:11:38,403 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:11:38,404 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:11:38,405 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:11:38,406 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:11:38,406 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:11:38,407 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:11:38,407 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:11:38,407 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:11:38,408 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:11:38,408 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:11:38,413 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:11:38,413 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:11:38,414 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:11:38,414 INFO L202 nArgumentSynthesizer]: 2 stem disjuncts [2019-11-15 21:11:38,414 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:11:38,414 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:11:38,416 INFO L400 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-11-15 21:11:38,416 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:11:38,422 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:11:38,423 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:11:38,424 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:11:38,424 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:11:38,424 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:11:38,424 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:11:38,425 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:11:38,425 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:11:38,431 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 21:11:38,434 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-15 21:11:38,434 INFO L444 ModelExtractionUtils]: 7 out of 10 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-15 21:11:38,434 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 21:11:38,435 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-15 21:11:38,436 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 21:11:38,436 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~a.base) (+ ULTIMATE.start_test_fun_~a.offset (* ULTIMATE.start_test_fun_~i~0 4)))_1) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~a.base) (+ ULTIMATE.start_test_fun_~a.offset (* ULTIMATE.start_test_fun_~i~0 4)))_1 Supporting invariants [] [2019-11-15 21:11:38,449 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2019-11-15 21:11:38,450 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-15 21:11:38,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:11:38,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:11:38,489 INFO L256 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 21:11:38,490 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:11:38,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:11:38,498 INFO L256 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-15 21:11:38,499 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:11:38,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:11:38,512 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-15 21:11:38,513 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 30 states and 38 transitions. cyclomatic complexity: 12 Second operand 3 states. [2019-11-15 21:11:38,530 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 30 states and 38 transitions. cyclomatic complexity: 12. Second operand 3 states. Result 35 states and 44 transitions. Complement of second has 7 states. [2019-11-15 21:11:38,531 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-11-15 21:11:38,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 21:11:38,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 17 transitions. [2019-11-15 21:11:38,531 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 16 letters. Loop has 2 letters. [2019-11-15 21:11:38,531 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:11:38,532 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-15 21:11:38,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:11:38,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:11:38,560 INFO L256 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 21:11:38,561 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:11:38,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:11:38,570 INFO L256 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-15 21:11:38,570 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:11:38,584 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:11:38,584 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-11-15 21:11:38,584 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 30 states and 38 transitions. cyclomatic complexity: 12 Second operand 3 states. [2019-11-15 21:11:38,606 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 30 states and 38 transitions. cyclomatic complexity: 12. Second operand 3 states. Result 35 states and 44 transitions. Complement of second has 7 states. [2019-11-15 21:11:38,607 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-11-15 21:11:38,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 21:11:38,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 17 transitions. [2019-11-15 21:11:38,608 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 16 letters. Loop has 2 letters. [2019-11-15 21:11:38,608 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:11:38,608 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-15 21:11:38,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:11:38,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:11:38,642 INFO L256 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 21:11:38,644 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:11:38,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:11:38,653 INFO L256 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-15 21:11:38,653 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:11:38,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:11:38,667 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-11-15 21:11:38,667 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 30 states and 38 transitions. cyclomatic complexity: 12 Second operand 3 states. [2019-11-15 21:11:38,689 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 30 states and 38 transitions. cyclomatic complexity: 12. Second operand 3 states. Result 39 states and 50 transitions. Complement of second has 6 states. [2019-11-15 21:11:38,690 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-11-15 21:11:38,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 21:11:38,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 19 transitions. [2019-11-15 21:11:38,690 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 16 letters. Loop has 2 letters. [2019-11-15 21:11:38,691 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:11:38,691 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 18 letters. Loop has 2 letters. [2019-11-15 21:11:38,691 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:11:38,692 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 16 letters. Loop has 4 letters. [2019-11-15 21:11:38,692 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:11:38,692 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 50 transitions. [2019-11-15 21:11:38,694 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-15 21:11:38,694 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 0 states and 0 transitions. [2019-11-15 21:11:38,695 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-15 21:11:38,695 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-15 21:11:38,695 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-15 21:11:38,695 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 21:11:38,695 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 21:11:38,695 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 21:11:38,695 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 21:11:38,696 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-11-15 21:11:38,696 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-11-15 21:11:38,696 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-15 21:11:38,696 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-11-15 21:11:38,702 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 15.11 09:11:38 BoogieIcfgContainer [2019-11-15 21:11:38,702 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-15 21:11:38,703 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 21:11:38,703 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 21:11:38,703 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 21:11:38,704 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:11:32" (3/4) ... [2019-11-15 21:11:38,714 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-15 21:11:38,714 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 21:11:38,716 INFO L168 Benchmark]: Toolchain (without parser) took 7361.21 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 295.2 MB). Free memory was 946.1 MB in the beginning and 1.2 GB in the end (delta: -290.8 MB). Peak memory consumption was 4.4 MB. Max. memory is 11.5 GB. [2019-11-15 21:11:38,716 INFO L168 Benchmark]: CDTParser took 0.29 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 21:11:38,717 INFO L168 Benchmark]: CACSL2BoogieTranslator took 542.74 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 123.7 MB). Free memory was 946.1 MB in the beginning and 1.1 GB in the end (delta: -159.1 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. [2019-11-15 21:11:38,723 INFO L168 Benchmark]: Boogie Procedure Inliner took 49.84 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: 7.1 MB). Peak memory consumption was 7.1 MB. Max. memory is 11.5 GB. [2019-11-15 21:11:38,724 INFO L168 Benchmark]: Boogie Preprocessor took 33.81 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-11-15 21:11:38,724 INFO L168 Benchmark]: RCFGBuilder took 321.37 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: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. [2019-11-15 21:11:38,726 INFO L168 Benchmark]: BuchiAutomizer took 6392.61 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 171.4 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -161.1 MB). Peak memory consumption was 10.3 MB. Max. memory is 11.5 GB. [2019-11-15 21:11:38,726 INFO L168 Benchmark]: Witness Printer took 11.78 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 21:11:38,735 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.29 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 542.74 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 123.7 MB). Free memory was 946.1 MB in the beginning and 1.1 GB in the end (delta: -159.1 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 49.84 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: 7.1 MB). Peak memory consumption was 7.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 33.81 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 321.37 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: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 6392.61 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 171.4 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -161.1 MB). Peak memory consumption was 10.3 MB. Max. memory is 11.5 GB. * Witness Printer took 11.78 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 7 terminating modules (4 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function N + -1 * i and consists of 3 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[a][i * 4 + a] and consists of 4 locations. One nondeterministic module has affine ranking function unknown-#memory_int-unknown[a][a + i * 4] and consists of 4 locations. 4 modules have a trivial ranking function, the largest among these consists of 6 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 6.3s and 8 iterations. TraceHistogramMax:2. Analysis of lassos took 5.4s. Construction of modules took 0.1s. Büchi inclusion checks took 0.5s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 5. Automata minimization 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 14 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 31 states and ocurred in iteration 4. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 119 SDtfs, 72 SDslu, 68 SDs, 0 SdLazy, 149 SolverSat, 16 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc2 concLT0 SILN0 SILU1 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital180 mio100 ax110 hnf99 lsp87 ukn66 mio100 lsp51 div100 bol100 ite100 ukn100 eq178 hnf89 smp100 dnf100 smp100 tf100 neg100 sie101 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 9ms VariablesStem: 5 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...