./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-memory-alloca/array01-alloca-1.i --full-output -ea --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 8bd4bc60 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/termination-memory-alloca/array01-alloca-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 10c50c605d9fb7cd886e3d668ba568a2b619230b ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-8bd4bc6 [2020-07-29 01:34:15,300 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-29 01:34:15,302 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-29 01:34:15,315 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-29 01:34:15,315 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-29 01:34:15,317 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-29 01:34:15,318 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-29 01:34:15,320 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-29 01:34:15,322 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-29 01:34:15,323 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-29 01:34:15,324 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-29 01:34:15,325 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-29 01:34:15,326 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-29 01:34:15,327 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-29 01:34:15,328 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-29 01:34:15,329 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-29 01:34:15,330 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-29 01:34:15,331 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-29 01:34:15,333 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-29 01:34:15,335 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-29 01:34:15,337 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-29 01:34:15,338 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-29 01:34:15,339 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-29 01:34:15,340 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-29 01:34:15,343 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-29 01:34:15,343 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-29 01:34:15,344 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-29 01:34:15,345 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-29 01:34:15,345 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-29 01:34:15,346 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-29 01:34:15,347 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-29 01:34:15,347 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-29 01:34:15,348 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-29 01:34:15,349 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-29 01:34:15,351 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-29 01:34:15,351 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-29 01:34:15,352 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-29 01:34:15,352 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-29 01:34:15,353 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-29 01:34:15,354 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-29 01:34:15,355 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-29 01:34:15,356 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2020-07-29 01:34:15,374 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-29 01:34:15,375 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-29 01:34:15,376 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-29 01:34:15,376 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-29 01:34:15,377 INFO L138 SettingsManager]: * Use SBE=true [2020-07-29 01:34:15,377 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-07-29 01:34:15,377 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-07-29 01:34:15,377 INFO L138 SettingsManager]: * Use old map elimination=false [2020-07-29 01:34:15,378 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-07-29 01:34:15,378 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-07-29 01:34:15,378 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-07-29 01:34:15,379 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-29 01:34:15,379 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-29 01:34:15,379 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-29 01:34:15,379 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-29 01:34:15,380 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-07-29 01:34:15,380 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-07-29 01:34:15,380 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-07-29 01:34:15,380 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-29 01:34:15,381 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-07-29 01:34:15,381 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-29 01:34:15,381 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-07-29 01:34:15,382 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-29 01:34:15,382 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-29 01:34:15,382 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-07-29 01:34:15,383 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-29 01:34:15,383 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-29 01:34:15,383 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-29 01:34:15,383 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-07-29 01:34:15,385 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-07-29 01:34:15,385 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> 10c50c605d9fb7cd886e3d668ba568a2b619230b [2020-07-29 01:34:15,712 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-29 01:34:15,724 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-29 01:34:15,728 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-29 01:34:15,729 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-29 01:34:15,730 INFO L275 PluginConnector]: CDTParser initialized [2020-07-29 01:34:15,731 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-memory-alloca/array01-alloca-1.i [2020-07-29 01:34:15,812 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e6434d1a/a8fe07d6c366453e8c282c6ad416fda0/FLAG112fcb23b [2020-07-29 01:34:16,422 INFO L306 CDTParser]: Found 1 translation units. [2020-07-29 01:34:16,423 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/array01-alloca-1.i [2020-07-29 01:34:16,439 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e6434d1a/a8fe07d6c366453e8c282c6ad416fda0/FLAG112fcb23b [2020-07-29 01:34:16,676 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e6434d1a/a8fe07d6c366453e8c282c6ad416fda0 [2020-07-29 01:34:16,679 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-29 01:34:16,683 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-29 01:34:16,684 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-29 01:34:16,685 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-29 01:34:16,689 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-29 01:34:16,691 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:34:16" (1/1) ... [2020-07-29 01:34:16,695 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@610d84f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:34:16, skipping insertion in model container [2020-07-29 01:34:16,695 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:34:16" (1/1) ... [2020-07-29 01:34:16,705 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-29 01:34:16,740 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-29 01:34:17,196 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:34:17,208 INFO L203 MainTranslator]: Completed pre-run [2020-07-29 01:34:17,252 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:34:17,306 INFO L208 MainTranslator]: Completed translation [2020-07-29 01:34:17,307 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:34:17 WrapperNode [2020-07-29 01:34:17,307 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-29 01:34:17,308 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-29 01:34:17,308 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-29 01:34:17,308 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-29 01:34:17,318 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:34:17" (1/1) ... [2020-07-29 01:34:17,334 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:34:17" (1/1) ... [2020-07-29 01:34:17,358 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-29 01:34:17,359 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-29 01:34:17,359 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-29 01:34:17,359 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-29 01:34:17,367 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:34:17" (1/1) ... [2020-07-29 01:34:17,367 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:34:17" (1/1) ... [2020-07-29 01:34:17,371 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:34:17" (1/1) ... [2020-07-29 01:34:17,371 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:34:17" (1/1) ... [2020-07-29 01:34:17,379 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:34:17" (1/1) ... [2020-07-29 01:34:17,384 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:34:17" (1/1) ... [2020-07-29 01:34:17,386 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:34:17" (1/1) ... [2020-07-29 01:34:17,389 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-29 01:34:17,390 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-29 01:34:17,390 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-29 01:34:17,390 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-29 01:34:17,391 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:34:17" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2020-07-29 01:34:17,467 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-29 01:34:17,468 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-29 01:34:17,468 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-29 01:34:17,468 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-29 01:34:17,468 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-29 01:34:17,468 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-29 01:34:17,861 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-29 01:34:17,862 INFO L295 CfgBuilder]: Removed 8 assume(true) statements. [2020-07-29 01:34:17,865 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:34:17 BoogieIcfgContainer [2020-07-29 01:34:17,866 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-29 01:34:17,866 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-07-29 01:34:17,867 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-07-29 01:34:17,871 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-07-29 01:34:17,872 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:34:17,872 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 29.07 01:34:16" (1/3) ... [2020-07-29 01:34:17,874 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@640ce06d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 01:34:17, skipping insertion in model container [2020-07-29 01:34:17,874 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:34:17,874 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:34:17" (2/3) ... [2020-07-29 01:34:17,875 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@640ce06d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 01:34:17, skipping insertion in model container [2020-07-29 01:34:17,875 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:34:17,875 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:34:17" (3/3) ... [2020-07-29 01:34:17,878 INFO L371 chiAutomizerObserver]: Analyzing ICFG array01-alloca-1.i [2020-07-29 01:34:17,928 INFO L356 BuchiCegarLoop]: Interprodecural is true [2020-07-29 01:34:17,929 INFO L357 BuchiCegarLoop]: Hoare is false [2020-07-29 01:34:17,929 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-29 01:34:17,929 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-29 01:34:17,929 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-29 01:34:17,930 INFO L361 BuchiCegarLoop]: Difference is false [2020-07-29 01:34:17,930 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-29 01:34:17,930 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-07-29 01:34:17,944 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states. [2020-07-29 01:34:17,967 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-29 01:34:17,968 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:34:17,968 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:34:17,975 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-07-29 01:34:17,975 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-29 01:34:17,975 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2020-07-29 01:34:17,976 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states. [2020-07-29 01:34:17,979 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-29 01:34:17,979 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:34:17,979 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:34:17,980 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-07-29 01:34:17,980 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-29 01:34:17,989 INFO L794 eck$LassoCheckResult]: Stem: 7#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 6#L-1true havoc main_#res;havoc main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~ret9, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet7;havoc main_#t~nondet7; 10#L561true assume !(main_~array_size~0 < 1); 14#L561-2true call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc8.base, main_#t~malloc8.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_#res;havoc test_fun_#t~mem4, test_fun_#t~post5, test_fun_#t~post6, test_fun_#t~mem3, 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;test_fun_~res~0 := 0;test_fun_~i~0 := 0; 3#L551-3true [2020-07-29 01:34:17,990 INFO L796 eck$LassoCheckResult]: Loop: 3#L551-3true assume !!(test_fun_~i~0 < test_fun_~N); 12#L552-3true assume !true; 13#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 [2020-07-29 01:34:17,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:34:17,998 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2020-07-29 01:34:18,006 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:34:18,007 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713944314] [2020-07-29 01:34:18,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:34:18,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:34:18,102 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:34:18,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:34:18,118 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:34:18,137 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:34:18,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:34:18,139 INFO L82 PathProgramCache]: Analyzing trace with hash 47058, now seen corresponding path program 1 times [2020-07-29 01:34:18,139 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:34:18,139 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762896741] [2020-07-29 01:34:18,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:34:18,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:34:18,179 INFO L280 TraceCheckUtils]: 0: Hoare triple {19#true} assume !!(test_fun_~i~0 < test_fun_~N); {19#true} is VALID [2020-07-29 01:34:18,181 INFO L280 TraceCheckUtils]: 1: Hoare triple {19#true} assume !true; {20#false} is VALID [2020-07-29 01:34:18,181 INFO L280 TraceCheckUtils]: 2: Hoare triple {20#false} test_fun_#t~post2 := test_fun_~i~0;test_fun_~i~0 := 1 + test_fun_#t~post2;havoc test_fun_#t~post2; {20#false} is VALID [2020-07-29 01:34:18,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:34:18,184 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762896741] [2020-07-29 01:34:18,184 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:34:18,185 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-29 01:34:18,185 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231724911] [2020-07-29 01:34:18,190 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-07-29 01:34:18,191 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:34:18,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-07-29 01:34:18,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-29 01:34:18,203 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 2 states. [2020-07-29 01:34:18,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:34:18,247 INFO L93 Difference]: Finished difference Result 13 states and 15 transitions. [2020-07-29 01:34:18,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-07-29 01:34:18,248 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2020-07-29 01:34:18,262 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 3 edges. 3 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:34:18,265 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 15 transitions. [2020-07-29 01:34:18,267 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-29 01:34:18,272 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 8 states and 10 transitions. [2020-07-29 01:34:18,273 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2020-07-29 01:34:18,274 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2020-07-29 01:34:18,274 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 10 transitions. [2020-07-29 01:34:18,275 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 01:34:18,275 INFO L688 BuchiCegarLoop]: Abstraction has 8 states and 10 transitions. [2020-07-29 01:34:18,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states and 10 transitions. [2020-07-29 01:34:18,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2020-07-29 01:34:18,302 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:34:18,303 INFO L82 GeneralOperation]: Start isEquivalent. First operand 8 states and 10 transitions. Second operand 8 states. [2020-07-29 01:34:18,303 INFO L74 IsIncluded]: Start isIncluded. First operand 8 states and 10 transitions. Second operand 8 states. [2020-07-29 01:34:18,305 INFO L87 Difference]: Start difference. First operand 8 states and 10 transitions. Second operand 8 states. [2020-07-29 01:34:18,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:34:18,306 INFO L93 Difference]: Finished difference Result 8 states and 10 transitions. [2020-07-29 01:34:18,307 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 10 transitions. [2020-07-29 01:34:18,308 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:34:18,308 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:34:18,308 INFO L74 IsIncluded]: Start isIncluded. First operand 8 states. Second operand 8 states and 10 transitions. [2020-07-29 01:34:18,308 INFO L87 Difference]: Start difference. First operand 8 states. Second operand 8 states and 10 transitions. [2020-07-29 01:34:18,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:34:18,310 INFO L93 Difference]: Finished difference Result 8 states and 10 transitions. [2020-07-29 01:34:18,310 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 10 transitions. [2020-07-29 01:34:18,310 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:34:18,311 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:34:18,311 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:34:18,311 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:34:18,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-29 01:34:18,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 10 transitions. [2020-07-29 01:34:18,314 INFO L711 BuchiCegarLoop]: Abstraction has 8 states and 10 transitions. [2020-07-29 01:34:18,314 INFO L591 BuchiCegarLoop]: Abstraction has 8 states and 10 transitions. [2020-07-29 01:34:18,314 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2020-07-29 01:34:18,314 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 10 transitions. [2020-07-29 01:34:18,315 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-29 01:34:18,315 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:34:18,315 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:34:18,316 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-07-29 01:34:18,316 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-07-29 01:34:18,316 INFO L794 eck$LassoCheckResult]: Stem: 38#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 34#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~ret9, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet7;havoc main_#t~nondet7; 35#L561 assume !(main_~array_size~0 < 1); 41#L561-2 call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc8.base, main_#t~malloc8.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_#res;havoc test_fun_#t~mem4, test_fun_#t~post5, test_fun_#t~post6, test_fun_#t~mem3, 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;test_fun_~res~0 := 0;test_fun_~i~0 := 0; 36#L551-3 [2020-07-29 01:34:18,316 INFO L796 eck$LassoCheckResult]: Loop: 36#L551-3 assume !!(test_fun_~i~0 < test_fun_~N); 37#L552-3 call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 39#L552-1 assume !(test_fun_#t~mem3 > 0);havoc test_fun_#t~mem3; 40#L551-2 test_fun_#t~post2 := test_fun_~i~0;test_fun_~i~0 := 1 + test_fun_#t~post2;havoc test_fun_#t~post2; 36#L551-3 [2020-07-29 01:34:18,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:34:18,317 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 2 times [2020-07-29 01:34:18,317 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:34:18,317 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085366112] [2020-07-29 01:34:18,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:34:18,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:34:18,331 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:34:18,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:34:18,342 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:34:18,346 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:34:18,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:34:18,347 INFO L82 PathProgramCache]: Analyzing trace with hash 1451916, now seen corresponding path program 1 times [2020-07-29 01:34:18,347 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:34:18,348 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171673017] [2020-07-29 01:34:18,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:34:18,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:34:18,356 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:34:18,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:34:18,362 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:34:18,365 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:34:18,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:34:18,366 INFO L82 PathProgramCache]: Analyzing trace with hash 176797040, now seen corresponding path program 1 times [2020-07-29 01:34:18,366 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:34:18,367 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335648999] [2020-07-29 01:34:18,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:34:18,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:34:18,399 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:34:18,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:34:18,430 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:34:18,440 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:34:18,684 WARN L193 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 53 [2020-07-29 01:34:18,787 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:34:18,788 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:34:18,789 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:34:18,789 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:34:18,789 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:34:18,789 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:34:18,789 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:34:18,790 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:34:18,790 INFO L133 ssoRankerPreferences]: Filename of dumped script: array01-alloca-1.i_Iteration2_Lasso [2020-07-29 01:34:18,790 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:34:18,790 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:34:18,842 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:18,851 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:18,856 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:18,861 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:18,868 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:18,874 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:18,879 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:18,885 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:18,892 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:19,052 WARN L193 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 41 [2020-07-29 01:34:19,088 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:19,094 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:19,098 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:19,104 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:19,108 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:19,114 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:19,125 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:19,814 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:34:19,819 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:34:19,825 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 [2020-07-29 01:34:19,828 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:19,828 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:34:19,829 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:19,829 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:19,829 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:19,831 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:34:19,831 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:34:19,834 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:34:19,866 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:34:19,868 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:19,868 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:34:19,868 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:19,869 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:19,869 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:19,870 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:34:19,870 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:34:19,872 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:34:19,908 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 [2020-07-29 01:34:19,910 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:19,910 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:34:19,910 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:19,910 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:19,911 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:19,912 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:34:19,912 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:34:19,914 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:34:19,942 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 [2020-07-29 01:34:19,944 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:19,945 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:19,945 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:19,945 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:19,949 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:34:19,949 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:34:19,954 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:34:19,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 [2020-07-29 01:34:19,993 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:19,993 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:19,994 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:19,994 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:34:19,997 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:34:19,998 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:34:20,003 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:34:20,046 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:34:20,048 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:20,048 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:34:20,049 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:20,049 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:20,049 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:20,050 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:34:20,050 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:34:20,053 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 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 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:34:20,090 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 [2020-07-29 01:34:20,093 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:20,093 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:20,093 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:20,093 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:20,098 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:34:20,100 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:34:20,104 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:34:20,130 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 [2020-07-29 01:34:20,131 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:20,132 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:20,132 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:20,132 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:20,136 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:34:20,136 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:34:20,146 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:34:20,205 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 [2020-07-29 01:34:20,208 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:20,209 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:20,209 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:20,209 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:20,219 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:34:20,219 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:34:20,237 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:34:20,277 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2020-07-29 01:34:20,277 INFO L444 ModelExtractionUtils]: 19 out of 34 variables were initially zero. Simplification set additionally 12 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:34:20,309 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:34:20,343 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-07-29 01:34:20,344 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:34:20,345 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 [] [2020-07-29 01:34:20,442 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2020-07-29 01:34:20,447 INFO L393 LassoCheck]: Loop: "assume !!(test_fun_~i~0 < test_fun_~N);" "call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);" "assume !(test_fun_#t~mem3 > 0);havoc test_fun_#t~mem3;" "test_fun_#t~post2 := test_fun_~i~0;test_fun_~i~0 := 1 + test_fun_#t~post2;havoc test_fun_#t~post2;" [2020-07-29 01:34:20,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:34:20,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:34:20,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:34:20,496 INFO L263 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:34:20,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:34:20,504 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:34:20,516 INFO L280 TraceCheckUtils]: 0: Hoare triple {67#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {67#unseeded} is VALID [2020-07-29 01:34:20,517 INFO L280 TraceCheckUtils]: 1: Hoare triple {67#unseeded} havoc main_#res;havoc main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~ret9, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet7;havoc main_#t~nondet7; {67#unseeded} is VALID [2020-07-29 01:34:20,518 INFO L280 TraceCheckUtils]: 2: Hoare triple {67#unseeded} assume !(main_~array_size~0 < 1); {67#unseeded} is VALID [2020-07-29 01:34:20,519 INFO L280 TraceCheckUtils]: 3: Hoare triple {67#unseeded} call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc8.base, main_#t~malloc8.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_#res;havoc test_fun_#t~mem4, test_fun_#t~post5, test_fun_#t~post6, test_fun_#t~mem3, 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;test_fun_~res~0 := 0;test_fun_~i~0 := 0; {67#unseeded} is VALID [2020-07-29 01:34:20,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:34:20,526 INFO L263 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 01:34:20,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:34:20,532 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:34:20,561 INFO L280 TraceCheckUtils]: 0: Hoare triple {70#(>= oldRank0 (+ ULTIMATE.start_test_fun_~N (* (- 1) ULTIMATE.start_test_fun_~i~0)))} assume !!(test_fun_~i~0 < test_fun_~N); {109#(and (< ULTIMATE.start_test_fun_~i~0 ULTIMATE.start_test_fun_~N) (<= ULTIMATE.start_test_fun_~N (+ ULTIMATE.start_test_fun_~i~0 oldRank0)))} is VALID [2020-07-29 01:34:20,562 INFO L280 TraceCheckUtils]: 1: Hoare triple {109#(and (< ULTIMATE.start_test_fun_~i~0 ULTIMATE.start_test_fun_~N) (<= ULTIMATE.start_test_fun_~N (+ ULTIMATE.start_test_fun_~i~0 oldRank0)))} call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); {109#(and (< ULTIMATE.start_test_fun_~i~0 ULTIMATE.start_test_fun_~N) (<= ULTIMATE.start_test_fun_~N (+ ULTIMATE.start_test_fun_~i~0 oldRank0)))} is VALID [2020-07-29 01:34:20,563 INFO L280 TraceCheckUtils]: 2: Hoare triple {109#(and (< ULTIMATE.start_test_fun_~i~0 ULTIMATE.start_test_fun_~N) (<= ULTIMATE.start_test_fun_~N (+ ULTIMATE.start_test_fun_~i~0 oldRank0)))} assume !(test_fun_#t~mem3 > 0);havoc test_fun_#t~mem3; {109#(and (< ULTIMATE.start_test_fun_~i~0 ULTIMATE.start_test_fun_~N) (<= ULTIMATE.start_test_fun_~N (+ ULTIMATE.start_test_fun_~i~0 oldRank0)))} is VALID [2020-07-29 01:34:20,565 INFO L280 TraceCheckUtils]: 3: Hoare triple {109#(and (< ULTIMATE.start_test_fun_~i~0 ULTIMATE.start_test_fun_~N) (<= ULTIMATE.start_test_fun_~N (+ ULTIMATE.start_test_fun_~i~0 oldRank0)))} test_fun_#t~post2 := test_fun_~i~0;test_fun_~i~0 := 1 + test_fun_#t~post2;havoc test_fun_#t~post2; {95#(or (and (>= oldRank0 0) (> oldRank0 (+ ULTIMATE.start_test_fun_~N (* (- 1) ULTIMATE.start_test_fun_~i~0)))) unseeded)} is VALID [2020-07-29 01:34:20,565 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:34:20,566 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 01:34:20,576 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:34:20,578 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:34:20,579 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:20,583 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 [2020-07-29 01:34:20,584 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 8 states and 10 transitions. cyclomatic complexity: 3 Second operand 3 states. [2020-07-29 01:34:20,652 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 8 states and 10 transitions. cyclomatic complexity: 3. Second operand 3 states. Result 13 states and 17 transitions. Complement of second has 4 states. [2020-07-29 01:34:20,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2020-07-29 01:34:20,653 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:34:20,653 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 10 transitions. cyclomatic complexity: 3 [2020-07-29 01:34:20,653 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:34:20,653 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:34:20,653 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. [2020-07-29 01:34:20,658 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:34:20,658 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:34:20,659 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:34:20,659 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 17 transitions. [2020-07-29 01:34:20,660 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:34:20,660 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:34:20,660 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:34:20,662 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 8 states and 10 transitions. cyclomatic complexity: 3 [2020-07-29 01:34:20,664 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 4 examples of accepted words. [2020-07-29 01:34:20,664 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 3 states. [2020-07-29 01:34:20,666 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:34:20,668 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:34:20,669 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 13 states and 17 transitions. cyclomatic complexity: 6 [2020-07-29 01:34:20,669 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 01:34:20,670 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 10 transitions. cyclomatic complexity: 3 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:34:20,670 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:20,670 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:34:20,670 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:20,671 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 6 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:34:20,672 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:20,673 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 10 transitions. cyclomatic complexity: 3 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:34:20,673 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:20,673 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:34:20,674 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:20,674 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 6 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:34:20,674 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:20,674 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 10 transitions. cyclomatic complexity: 3 Stem has 6 letters. Loop has 2 letters. [2020-07-29 01:34:20,675 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:20,675 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 6 letters. Loop has 2 letters. [2020-07-29 01:34:20,675 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:20,676 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 6 Stem has 6 letters. Loop has 2 letters. [2020-07-29 01:34:20,676 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:20,676 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 10 transitions. cyclomatic complexity: 3 Stem has 13 letters. Loop has 13 letters. [2020-07-29 01:34:20,676 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:20,677 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 13 letters. Loop has 13 letters. [2020-07-29 01:34:20,677 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:20,677 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 6 Stem has 13 letters. Loop has 13 letters. [2020-07-29 01:34:20,677 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:20,678 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 10 transitions. cyclomatic complexity: 3 Stem has 8 letters. Loop has 8 letters. [2020-07-29 01:34:20,678 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:20,678 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 8 letters. Loop has 8 letters. [2020-07-29 01:34:20,678 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:20,680 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 6 Stem has 8 letters. Loop has 8 letters. [2020-07-29 01:34:20,681 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:20,681 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 10 transitions. cyclomatic complexity: 3 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:34:20,681 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:20,681 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:34:20,681 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:20,682 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 6 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:34:20,682 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:20,682 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 10 transitions. cyclomatic complexity: 3 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:34:20,682 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:20,683 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:34:20,687 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:20,688 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 6 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:34:20,688 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:20,688 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 10 transitions. cyclomatic complexity: 3 Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:34:20,688 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:20,688 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:34:20,688 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:20,689 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 6 Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:34:20,689 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:20,689 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 10 transitions. cyclomatic complexity: 3 Stem has 6 letters. Loop has 2 letters. [2020-07-29 01:34:20,689 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:20,689 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 6 letters. Loop has 2 letters. [2020-07-29 01:34:20,689 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:20,689 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 6 Stem has 6 letters. Loop has 2 letters. [2020-07-29 01:34:20,690 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:20,690 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 10 transitions. cyclomatic complexity: 3 Stem has 7 letters. Loop has 4 letters. [2020-07-29 01:34:20,690 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:20,690 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 7 letters. Loop has 4 letters. [2020-07-29 01:34:20,690 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:20,690 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 6 Stem has 7 letters. Loop has 4 letters. [2020-07-29 01:34:20,691 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:20,691 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 10 transitions. cyclomatic complexity: 3 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:34:20,691 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:20,691 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:34:20,691 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:20,691 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 6 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:34:20,692 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:20,692 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 10 transitions. cyclomatic complexity: 3 Stem has 6 letters. Loop has 2 letters. [2020-07-29 01:34:20,692 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:20,692 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 6 letters. Loop has 2 letters. [2020-07-29 01:34:20,693 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:20,693 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 6 Stem has 6 letters. Loop has 2 letters. [2020-07-29 01:34:20,693 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:20,694 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 10 transitions. cyclomatic complexity: 3 Stem has 7 letters. Loop has 2 letters. [2020-07-29 01:34:20,694 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:20,694 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 7 letters. Loop has 2 letters. [2020-07-29 01:34:20,694 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:20,696 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 6 Stem has 7 letters. Loop has 2 letters. [2020-07-29 01:34:20,697 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:20,697 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:34:20,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 01:34:20,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 10 transitions. [2020-07-29 01:34:20,701 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:34:20,701 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:20,701 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 8 letters. Loop has 4 letters. [2020-07-29 01:34:20,702 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:20,702 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 4 letters. Loop has 8 letters. [2020-07-29 01:34:20,702 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:20,702 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 17 transitions. cyclomatic complexity: 6 [2020-07-29 01:34:20,704 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:34:20,705 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 12 states and 16 transitions. [2020-07-29 01:34:20,709 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2020-07-29 01:34:20,709 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2020-07-29 01:34:20,710 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 16 transitions. [2020-07-29 01:34:20,710 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:34:20,710 INFO L688 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2020-07-29 01:34:20,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 16 transitions. [2020-07-29 01:34:20,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 11. [2020-07-29 01:34:20,711 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:34:20,711 INFO L82 GeneralOperation]: Start isEquivalent. First operand 12 states and 16 transitions. Second operand 11 states. [2020-07-29 01:34:20,711 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states and 16 transitions. Second operand 11 states. [2020-07-29 01:34:20,711 INFO L87 Difference]: Start difference. First operand 12 states and 16 transitions. Second operand 11 states. [2020-07-29 01:34:20,712 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:34:20,718 INFO L93 Difference]: Finished difference Result 12 states and 16 transitions. [2020-07-29 01:34:20,718 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 16 transitions. [2020-07-29 01:34:20,719 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:34:20,719 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:34:20,719 INFO L74 IsIncluded]: Start isIncluded. First operand 11 states. Second operand 12 states and 16 transitions. [2020-07-29 01:34:20,720 INFO L87 Difference]: Start difference. First operand 11 states. Second operand 12 states and 16 transitions. [2020-07-29 01:34:20,721 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:34:20,723 INFO L93 Difference]: Finished difference Result 13 states and 17 transitions. [2020-07-29 01:34:20,724 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 17 transitions. [2020-07-29 01:34:20,724 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:34:20,724 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:34:20,724 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:34:20,724 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:34:20,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-29 01:34:20,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 15 transitions. [2020-07-29 01:34:20,726 INFO L711 BuchiCegarLoop]: Abstraction has 11 states and 15 transitions. [2020-07-29 01:34:20,726 INFO L591 BuchiCegarLoop]: Abstraction has 11 states and 15 transitions. [2020-07-29 01:34:20,726 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2020-07-29 01:34:20,726 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 15 transitions. [2020-07-29 01:34:20,727 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:34:20,727 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:34:20,727 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:34:20,727 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-07-29 01:34:20,727 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-29 01:34:20,728 INFO L794 eck$LassoCheckResult]: Stem: 144#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 138#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~ret9, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet7;havoc main_#t~nondet7; 139#L561 assume !(main_~array_size~0 < 1); 148#L561-2 call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc8.base, main_#t~malloc8.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_#res;havoc test_fun_#t~mem4, test_fun_#t~post5, test_fun_#t~post6, test_fun_#t~mem3, 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;test_fun_~res~0 := 0;test_fun_~i~0 := 0; 140#L551-3 assume !!(test_fun_~i~0 < test_fun_~N); 142#L552-3 [2020-07-29 01:34:20,728 INFO L796 eck$LassoCheckResult]: Loop: 142#L552-3 call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 145#L552-1 assume !!(test_fun_#t~mem3 > 0);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);test_fun_#t~post5 := test_fun_#t~mem4;call write~int(test_fun_#t~post5 - 1, test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);havoc test_fun_#t~post5;havoc test_fun_#t~mem4;test_fun_#t~post6 := test_fun_~res~0;test_fun_~res~0 := 1 + test_fun_#t~post6;havoc test_fun_#t~post6; 142#L552-3 [2020-07-29 01:34:20,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:34:20,728 INFO L82 PathProgramCache]: Analyzing trace with hash 28695756, now seen corresponding path program 1 times [2020-07-29 01:34:20,729 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:34:20,729 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940492879] [2020-07-29 01:34:20,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:34:20,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:34:20,741 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:34:20,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:34:20,750 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:34:20,754 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:34:20,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:34:20,755 INFO L82 PathProgramCache]: Analyzing trace with hash 1670, now seen corresponding path program 1 times [2020-07-29 01:34:20,755 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:34:20,755 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856670645] [2020-07-29 01:34:20,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:34:20,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:34:20,762 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:34:20,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:34:20,770 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:34:20,773 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:34:20,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:34:20,773 INFO L82 PathProgramCache]: Analyzing trace with hash 1806818449, now seen corresponding path program 1 times [2020-07-29 01:34:20,774 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:34:20,774 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817439340] [2020-07-29 01:34:20,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:34:20,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:34:20,790 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:34:20,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:34:20,806 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:34:20,811 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:34:20,979 WARN L193 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 53 [2020-07-29 01:34:21,052 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:34:21,052 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:34:21,052 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:34:21,052 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:34:21,052 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:34:21,052 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:34:21,053 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:34:21,053 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:34:21,053 INFO L133 ssoRankerPreferences]: Filename of dumped script: array01-alloca-1.i_Iteration3_Lasso [2020-07-29 01:34:21,053 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:34:21,053 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:34:21,082 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:21,087 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:21,093 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:21,097 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:21,102 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:21,250 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:21,255 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:21,259 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:21,262 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:21,265 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:21,269 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:21,273 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:21,277 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:21,281 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:21,285 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:21,289 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:21,853 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:34:21,853 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 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 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:34:21,865 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 [2020-07-29 01:34:21,867 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:21,867 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:34:21,867 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:21,868 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:21,868 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:21,868 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:34:21,868 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:34:21,870 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:34:21,908 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 [2020-07-29 01:34:21,910 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:21,911 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:21,911 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:21,911 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:21,914 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:34:21,914 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:34:21,920 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:34:21,960 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 [2020-07-29 01:34:21,961 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:21,961 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:34:21,962 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:21,962 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:21,962 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:21,963 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:34:21,963 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:34:21,964 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:34:21,996 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 [2020-07-29 01:34:21,999 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:21,999 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:21,999 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:21,999 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:22,001 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:34:22,001 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:34:22,005 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:34:22,028 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 [2020-07-29 01:34:22,029 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:22,030 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:34:22,030 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:22,030 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:22,030 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:22,031 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:34:22,031 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:34:22,038 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:34:22,044 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-07-29 01:34:22,045 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:34:22,047 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 01:34:22,047 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-07-29 01:34:22,048 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:34:22,048 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 [] [2020-07-29 01:34:22,084 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2020-07-29 01:34:22,091 INFO L393 LassoCheck]: Loop: "call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);" "assume !!(test_fun_#t~mem3 > 0);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);test_fun_#t~post5 := test_fun_#t~mem4;call write~int(test_fun_#t~post5 - 1, test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);havoc test_fun_#t~post5;havoc test_fun_#t~mem4;test_fun_#t~post6 := test_fun_~res~0;test_fun_~res~0 := 1 + test_fun_#t~post6;havoc test_fun_#t~post6;" [2020-07-29 01:34:22,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:34:22,097 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-29 01:34:22,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:34:22,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:34:22,140 INFO L263 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:34:22,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:34:22,148 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:34:22,152 INFO L280 TraceCheckUtils]: 0: Hoare triple {216#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {216#unseeded} is VALID [2020-07-29 01:34:22,153 INFO L280 TraceCheckUtils]: 1: Hoare triple {216#unseeded} havoc main_#res;havoc main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~ret9, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet7;havoc main_#t~nondet7; {216#unseeded} is VALID [2020-07-29 01:34:22,154 INFO L280 TraceCheckUtils]: 2: Hoare triple {216#unseeded} assume !(main_~array_size~0 < 1); {216#unseeded} is VALID [2020-07-29 01:34:22,155 INFO L280 TraceCheckUtils]: 3: Hoare triple {216#unseeded} call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc8.base, main_#t~malloc8.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_#res;havoc test_fun_#t~mem4, test_fun_#t~post5, test_fun_#t~post6, test_fun_#t~mem3, 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;test_fun_~res~0 := 0;test_fun_~i~0 := 0; {216#unseeded} is VALID [2020-07-29 01:34:22,156 INFO L280 TraceCheckUtils]: 4: Hoare triple {216#unseeded} assume !!(test_fun_~i~0 < test_fun_~N); {216#unseeded} is VALID [2020-07-29 01:34:22,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:34:22,164 INFO L263 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-29 01:34:22,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:34:22,170 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:34:22,194 INFO L280 TraceCheckUtils]: 0: Hoare triple {219#(>= oldRank0 (select (select |#memory_int| ULTIMATE.start_test_fun_~a.base) (+ (* ULTIMATE.start_test_fun_~i~0 4) ULTIMATE.start_test_fun_~a.offset)))} call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); {261#(and (<= (select (select |#memory_int| ULTIMATE.start_test_fun_~a.base) (+ (* ULTIMATE.start_test_fun_~i~0 4) ULTIMATE.start_test_fun_~a.offset)) oldRank0) (<= |ULTIMATE.start_test_fun_#t~mem3| (select (select |#memory_int| ULTIMATE.start_test_fun_~a.base) (+ (* ULTIMATE.start_test_fun_~i~0 4) ULTIMATE.start_test_fun_~a.offset))))} is VALID [2020-07-29 01:34:22,196 INFO L280 TraceCheckUtils]: 1: Hoare triple {261#(and (<= (select (select |#memory_int| ULTIMATE.start_test_fun_~a.base) (+ (* ULTIMATE.start_test_fun_~i~0 4) ULTIMATE.start_test_fun_~a.offset)) oldRank0) (<= |ULTIMATE.start_test_fun_#t~mem3| (select (select |#memory_int| ULTIMATE.start_test_fun_~a.base) (+ (* ULTIMATE.start_test_fun_~i~0 4) ULTIMATE.start_test_fun_~a.offset))))} assume !!(test_fun_#t~mem3 > 0);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);test_fun_#t~post5 := test_fun_#t~mem4;call write~int(test_fun_#t~post5 - 1, test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);havoc test_fun_#t~post5;havoc test_fun_#t~mem4;test_fun_#t~post6 := test_fun_~res~0;test_fun_~res~0 := 1 + test_fun_#t~post6;havoc test_fun_#t~post6; {244#(or (and (> oldRank0 (select (select |#memory_int| ULTIMATE.start_test_fun_~a.base) (+ (* ULTIMATE.start_test_fun_~i~0 4) ULTIMATE.start_test_fun_~a.offset))) (>= oldRank0 0)) unseeded)} is VALID [2020-07-29 01:34:22,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:34:22,197 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 01:34:22,206 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:34:22,207 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:34:22,207 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:22,208 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 [2020-07-29 01:34:22,208 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 15 transitions. cyclomatic complexity: 6 Second operand 3 states. [2020-07-29 01:34:22,267 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states and 15 transitions. cyclomatic complexity: 6. Second operand 3 states. Result 20 states and 26 transitions. Complement of second has 7 states. [2020-07-29 01:34:22,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-07-29 01:34:22,268 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:34:22,268 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 15 transitions. cyclomatic complexity: 6 [2020-07-29 01:34:22,268 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:34:22,268 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:34:22,268 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. [2020-07-29 01:34:22,270 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:34:22,270 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:34:22,272 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:34:22,272 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 26 transitions. [2020-07-29 01:34:22,273 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:34:22,273 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:34:22,274 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:34:22,276 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 11 states and 15 transitions. cyclomatic complexity: 6 [2020-07-29 01:34:22,276 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 01:34:22,277 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 3 states. [2020-07-29 01:34:22,278 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:34:22,278 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:34:22,280 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 20 states and 26 transitions. cyclomatic complexity: 10 [2020-07-29 01:34:22,281 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 01:34:22,281 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 15 transitions. cyclomatic complexity: 6 Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:34:22,282 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:22,282 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:34:22,282 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:22,282 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 26 transitions. cyclomatic complexity: 10 Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:34:22,283 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:22,283 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 15 transitions. cyclomatic complexity: 6 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:34:22,283 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:22,283 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:34:22,283 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:22,284 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 26 transitions. cyclomatic complexity: 10 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:34:22,284 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:22,284 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 15 transitions. cyclomatic complexity: 6 Stem has 9 letters. Loop has 2 letters. [2020-07-29 01:34:22,284 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:22,284 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 9 letters. Loop has 2 letters. [2020-07-29 01:34:22,285 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:22,285 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 26 transitions. cyclomatic complexity: 10 Stem has 9 letters. Loop has 2 letters. [2020-07-29 01:34:22,285 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:22,285 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 15 transitions. cyclomatic complexity: 6 Stem has 20 letters. Loop has 20 letters. [2020-07-29 01:34:22,286 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:22,286 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 20 letters. Loop has 20 letters. [2020-07-29 01:34:22,286 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:22,286 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 26 transitions. cyclomatic complexity: 10 Stem has 20 letters. Loop has 20 letters. [2020-07-29 01:34:22,286 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:22,286 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 15 transitions. cyclomatic complexity: 6 Stem has 11 letters. Loop has 11 letters. [2020-07-29 01:34:22,287 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:22,287 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 11 letters. Loop has 11 letters. [2020-07-29 01:34:22,287 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:22,287 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 26 transitions. cyclomatic complexity: 10 Stem has 11 letters. Loop has 11 letters. [2020-07-29 01:34:22,287 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:22,287 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 15 transitions. cyclomatic complexity: 6 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:34:22,287 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:22,288 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:34:22,288 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:22,288 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 26 transitions. cyclomatic complexity: 10 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:34:22,288 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:22,288 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 15 transitions. cyclomatic complexity: 6 Stem has 6 letters. Loop has 2 letters. [2020-07-29 01:34:22,288 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:22,289 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 6 letters. Loop has 2 letters. [2020-07-29 01:34:22,289 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:22,289 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 26 transitions. cyclomatic complexity: 10 Stem has 6 letters. Loop has 2 letters. [2020-07-29 01:34:22,291 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:22,292 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 15 transitions. cyclomatic complexity: 6 Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:34:22,292 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:22,292 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:34:22,292 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:22,292 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 26 transitions. cyclomatic complexity: 10 Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:34:22,293 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:22,293 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 15 transitions. cyclomatic complexity: 6 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:34:22,293 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:22,293 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:34:22,293 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:22,294 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 26 transitions. cyclomatic complexity: 10 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:34:22,294 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:22,294 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 15 transitions. cyclomatic complexity: 6 Stem has 9 letters. Loop has 2 letters. [2020-07-29 01:34:22,294 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:22,294 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 9 letters. Loop has 2 letters. [2020-07-29 01:34:22,294 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:22,295 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 26 transitions. cyclomatic complexity: 10 Stem has 9 letters. Loop has 2 letters. [2020-07-29 01:34:22,295 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:22,295 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 15 transitions. cyclomatic complexity: 6 Stem has 10 letters. Loop has 2 letters. [2020-07-29 01:34:22,295 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:22,295 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 10 letters. Loop has 2 letters. [2020-07-29 01:34:22,296 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:22,296 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 26 transitions. cyclomatic complexity: 10 Stem has 10 letters. Loop has 2 letters. [2020-07-29 01:34:22,296 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:22,296 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:34:22,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 01:34:22,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 9 transitions. [2020-07-29 01:34:22,299 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:34:22,299 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:22,299 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 7 letters. Loop has 2 letters. [2020-07-29 01:34:22,299 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:22,299 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 5 letters. Loop has 4 letters. [2020-07-29 01:34:22,300 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:22,300 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 26 transitions. cyclomatic complexity: 10 [2020-07-29 01:34:22,304 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:34:22,306 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 15 states and 19 transitions. [2020-07-29 01:34:22,306 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2020-07-29 01:34:22,306 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2020-07-29 01:34:22,307 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 19 transitions. [2020-07-29 01:34:22,307 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:34:22,307 INFO L688 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2020-07-29 01:34:22,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 19 transitions. [2020-07-29 01:34:22,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2020-07-29 01:34:22,309 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:34:22,309 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states and 19 transitions. Second operand 14 states. [2020-07-29 01:34:22,309 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states and 19 transitions. Second operand 14 states. [2020-07-29 01:34:22,309 INFO L87 Difference]: Start difference. First operand 15 states and 19 transitions. Second operand 14 states. [2020-07-29 01:34:22,310 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:34:22,322 INFO L93 Difference]: Finished difference Result 15 states and 19 transitions. [2020-07-29 01:34:22,322 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 19 transitions. [2020-07-29 01:34:22,322 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:34:22,323 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:34:22,323 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand 15 states and 19 transitions. [2020-07-29 01:34:22,323 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 15 states and 19 transitions. [2020-07-29 01:34:22,323 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:34:22,328 INFO L93 Difference]: Finished difference Result 15 states and 19 transitions. [2020-07-29 01:34:22,328 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 19 transitions. [2020-07-29 01:34:22,328 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:34:22,329 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:34:22,329 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:34:22,329 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:34:22,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-29 01:34:22,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 18 transitions. [2020-07-29 01:34:22,330 INFO L711 BuchiCegarLoop]: Abstraction has 14 states and 18 transitions. [2020-07-29 01:34:22,330 INFO L591 BuchiCegarLoop]: Abstraction has 14 states and 18 transitions. [2020-07-29 01:34:22,330 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2020-07-29 01:34:22,331 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 18 transitions. [2020-07-29 01:34:22,334 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:34:22,334 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:34:22,334 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:34:22,336 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:34:22,336 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-29 01:34:22,336 INFO L794 eck$LassoCheckResult]: Stem: 302#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 300#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~ret9, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet7;havoc main_#t~nondet7; 301#L561 assume !(main_~array_size~0 < 1); 306#L561-2 call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc8.base, main_#t~malloc8.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_#res;havoc test_fun_#t~mem4, test_fun_#t~post5, test_fun_#t~post6, test_fun_#t~mem3, 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;test_fun_~res~0 := 0;test_fun_~i~0 := 0; 295#L551-3 assume !!(test_fun_~i~0 < test_fun_~N); 296#L552-3 call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 304#L552-1 assume !(test_fun_#t~mem3 > 0);havoc test_fun_#t~mem3; 305#L551-2 test_fun_#t~post2 := test_fun_~i~0;test_fun_~i~0 := 1 + test_fun_#t~post2;havoc test_fun_#t~post2; 297#L551-3 assume !!(test_fun_~i~0 < test_fun_~N); 299#L552-3 [2020-07-29 01:34:22,337 INFO L796 eck$LassoCheckResult]: Loop: 299#L552-3 call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 303#L552-1 assume !!(test_fun_#t~mem3 > 0);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);test_fun_#t~post5 := test_fun_#t~mem4;call write~int(test_fun_#t~post5 - 1, test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);havoc test_fun_#t~post5;havoc test_fun_#t~mem4;test_fun_#t~post6 := test_fun_~res~0;test_fun_~res~0 := 1 + test_fun_#t~post6;havoc test_fun_#t~post6; 299#L552-3 [2020-07-29 01:34:22,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:34:22,337 INFO L82 PathProgramCache]: Analyzing trace with hash 1185740961, now seen corresponding path program 2 times [2020-07-29 01:34:22,337 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:34:22,338 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542776791] [2020-07-29 01:34:22,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:34:22,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:34:22,380 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:34:22,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:34:22,413 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:34:22,422 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:34:22,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:34:22,423 INFO L82 PathProgramCache]: Analyzing trace with hash 1670, now seen corresponding path program 2 times [2020-07-29 01:34:22,423 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:34:22,424 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821451529] [2020-07-29 01:34:22,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:34:22,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:34:22,437 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:34:22,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:34:22,446 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:34:22,450 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:34:22,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:34:22,451 INFO L82 PathProgramCache]: Analyzing trace with hash 1330730790, now seen corresponding path program 1 times [2020-07-29 01:34:22,453 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:34:22,453 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332419857] [2020-07-29 01:34:22,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:34:22,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:34:22,496 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:34:22,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:34:22,517 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:34:22,522 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:34:22,749 WARN L193 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 64 [2020-07-29 01:34:22,870 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:34:22,870 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:34:22,871 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:34:22,871 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:34:22,871 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:34:22,871 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:34:22,871 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:34:22,871 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:34:22,871 INFO L133 ssoRankerPreferences]: Filename of dumped script: array01-alloca-1.i_Iteration4_Lasso [2020-07-29 01:34:22,872 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:34:22,872 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:34:22,911 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:22,914 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:22,920 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:22,929 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:22,933 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:22,938 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:22,941 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:22,947 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:23,130 WARN L193 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 43 [2020-07-29 01:34:23,222 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:23,227 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:23,230 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:23,234 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:23,239 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:23,242 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:23,246 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:23,250 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:34:23,837 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:34:23,837 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:34:23,842 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 [2020-07-29 01:34:23,843 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:23,843 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:34:23,843 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:23,844 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:23,844 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:23,844 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:34:23,844 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:34:23,845 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 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 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:34:23,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 [2020-07-29 01:34:23,879 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:23,879 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:23,879 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:23,879 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:23,882 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:34:23,883 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:34:23,886 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 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 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:34:23,910 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 [2020-07-29 01:34:23,911 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:23,911 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:23,911 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:23,912 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:23,914 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:34:23,914 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:34:23,923 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:34:23,954 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 [2020-07-29 01:34:23,956 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:23,957 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:23,957 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:23,957 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:23,959 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:34:23,959 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:34:23,965 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:34:23,990 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 [2020-07-29 01:34:23,997 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:23,997 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:34:23,997 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:23,997 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:23,997 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:23,998 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:34:23,998 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:34:23,999 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 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 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:34:24,032 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 [2020-07-29 01:34:24,033 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:24,033 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:34:24,033 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:24,034 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:24,034 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:24,034 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:34:24,034 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:34:24,040 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:34:24,076 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 [2020-07-29 01:34:24,077 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:24,078 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:24,078 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:24,078 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:24,080 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:34:24,080 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:34:24,084 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:34:24,121 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 [2020-07-29 01:34:24,122 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:24,123 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:24,123 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:24,123 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:24,126 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:34:24,127 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:34:24,134 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:34:24,171 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 [2020-07-29 01:34:24,173 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:24,173 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:24,173 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:24,173 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:24,176 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:34:24,177 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:34:24,183 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 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 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:34:24,214 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 [2020-07-29 01:34:24,218 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:24,218 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:24,218 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:24,218 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:24,230 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:34:24,230 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:34:24,245 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:34:24,281 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 [2020-07-29 01:34:24,283 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:34:24,283 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:34:24,283 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:34:24,283 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:34:24,284 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:34:24,284 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:34:24,285 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:34:24,293 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:34:24,298 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2020-07-29 01:34:24,299 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 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 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:34:24,306 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 01:34:24,306 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-07-29 01:34:24,306 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:34:24,306 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 [] [2020-07-29 01:34:24,343 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2020-07-29 01:34:24,346 INFO L393 LassoCheck]: Loop: "call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);" "assume !!(test_fun_#t~mem3 > 0);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);test_fun_#t~post5 := test_fun_#t~mem4;call write~int(test_fun_#t~post5 - 1, test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);havoc test_fun_#t~post5;havoc test_fun_#t~mem4;test_fun_#t~post6 := test_fun_~res~0;test_fun_~res~0 := 1 + test_fun_#t~post6;havoc test_fun_#t~post6;" [2020-07-29 01:34:24,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:34:24,352 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-29 01:34:24,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:34:24,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:34:24,382 INFO L263 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:34:24,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:34:24,388 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:34:24,397 INFO L280 TraceCheckUtils]: 0: Hoare triple {387#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {387#unseeded} is VALID [2020-07-29 01:34:24,398 INFO L280 TraceCheckUtils]: 1: Hoare triple {387#unseeded} havoc main_#res;havoc main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~ret9, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet7;havoc main_#t~nondet7; {387#unseeded} is VALID [2020-07-29 01:34:24,399 INFO L280 TraceCheckUtils]: 2: Hoare triple {387#unseeded} assume !(main_~array_size~0 < 1); {387#unseeded} is VALID [2020-07-29 01:34:24,399 INFO L280 TraceCheckUtils]: 3: Hoare triple {387#unseeded} call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc8.base, main_#t~malloc8.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_#res;havoc test_fun_#t~mem4, test_fun_#t~post5, test_fun_#t~post6, test_fun_#t~mem3, 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;test_fun_~res~0 := 0;test_fun_~i~0 := 0; {387#unseeded} is VALID [2020-07-29 01:34:24,400 INFO L280 TraceCheckUtils]: 4: Hoare triple {387#unseeded} assume !!(test_fun_~i~0 < test_fun_~N); {387#unseeded} is VALID [2020-07-29 01:34:24,401 INFO L280 TraceCheckUtils]: 5: Hoare triple {387#unseeded} call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); {387#unseeded} is VALID [2020-07-29 01:34:24,401 INFO L280 TraceCheckUtils]: 6: Hoare triple {387#unseeded} assume !(test_fun_#t~mem3 > 0);havoc test_fun_#t~mem3; {387#unseeded} is VALID [2020-07-29 01:34:24,402 INFO L280 TraceCheckUtils]: 7: Hoare triple {387#unseeded} test_fun_#t~post2 := test_fun_~i~0;test_fun_~i~0 := 1 + test_fun_#t~post2;havoc test_fun_#t~post2; {387#unseeded} is VALID [2020-07-29 01:34:24,402 INFO L280 TraceCheckUtils]: 8: Hoare triple {387#unseeded} assume !!(test_fun_~i~0 < test_fun_~N); {387#unseeded} is VALID [2020-07-29 01:34:24,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:34:24,408 INFO L263 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-29 01:34:24,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:34:24,413 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:34:24,433 INFO L280 TraceCheckUtils]: 0: Hoare triple {390#(>= oldRank0 (select (select |#memory_int| ULTIMATE.start_test_fun_~a.base) (+ ULTIMATE.start_test_fun_~a.offset (* ULTIMATE.start_test_fun_~i~0 4))))} call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); {449#(and (<= |ULTIMATE.start_test_fun_#t~mem3| (select (select |#memory_int| ULTIMATE.start_test_fun_~a.base) (+ (* ULTIMATE.start_test_fun_~i~0 4) ULTIMATE.start_test_fun_~a.offset))) (<= (select (select |#memory_int| ULTIMATE.start_test_fun_~a.base) (+ ULTIMATE.start_test_fun_~a.offset (* ULTIMATE.start_test_fun_~i~0 4))) oldRank0))} is VALID [2020-07-29 01:34:24,435 INFO L280 TraceCheckUtils]: 1: Hoare triple {449#(and (<= |ULTIMATE.start_test_fun_#t~mem3| (select (select |#memory_int| ULTIMATE.start_test_fun_~a.base) (+ (* ULTIMATE.start_test_fun_~i~0 4) ULTIMATE.start_test_fun_~a.offset))) (<= (select (select |#memory_int| ULTIMATE.start_test_fun_~a.base) (+ ULTIMATE.start_test_fun_~a.offset (* ULTIMATE.start_test_fun_~i~0 4))) oldRank0))} assume !!(test_fun_#t~mem3 > 0);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);test_fun_#t~post5 := test_fun_#t~mem4;call write~int(test_fun_#t~post5 - 1, test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);havoc test_fun_#t~post5;havoc test_fun_#t~mem4;test_fun_#t~post6 := test_fun_~res~0;test_fun_~res~0 := 1 + test_fun_#t~post6;havoc test_fun_#t~post6; {420#(or (and (>= oldRank0 0) (> oldRank0 (select (select |#memory_int| ULTIMATE.start_test_fun_~a.base) (+ ULTIMATE.start_test_fun_~a.offset (* ULTIMATE.start_test_fun_~i~0 4))))) unseeded)} is VALID [2020-07-29 01:34:24,435 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:34:24,435 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 01:34:24,447 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:34:24,447 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 9 letters. Loop has 2 letters. [2020-07-29 01:34:24,447 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:24,448 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 [2020-07-29 01:34:24,448 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states and 18 transitions. cyclomatic complexity: 7 Second operand 3 states. [2020-07-29 01:34:24,507 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 14 states and 18 transitions. cyclomatic complexity: 7. Second operand 3 states. Result 18 states and 22 transitions. Complement of second has 7 states. [2020-07-29 01:34:24,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-07-29 01:34:24,507 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:34:24,507 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 18 transitions. cyclomatic complexity: 7 [2020-07-29 01:34:24,508 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:34:24,508 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:34:24,508 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. [2020-07-29 01:34:24,508 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:34:24,509 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:34:24,509 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:34:24,509 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 22 transitions. [2020-07-29 01:34:24,511 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:34:24,512 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:34:24,512 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:34:24,515 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 14 states and 18 transitions. cyclomatic complexity: 7 [2020-07-29 01:34:24,516 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 01:34:24,516 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 3 states. [2020-07-29 01:34:24,517 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:34:24,517 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:34:24,517 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 18 states and 22 transitions. cyclomatic complexity: 7 [2020-07-29 01:34:24,518 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 01:34:24,518 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 18 transitions. cyclomatic complexity: 7 Stem has 9 letters. Loop has 2 letters. [2020-07-29 01:34:24,518 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:24,518 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 9 letters. Loop has 2 letters. [2020-07-29 01:34:24,518 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:24,518 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 22 transitions. cyclomatic complexity: 7 Stem has 9 letters. Loop has 2 letters. [2020-07-29 01:34:24,518 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:24,518 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 18 transitions. cyclomatic complexity: 7 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:34:24,519 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:24,519 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:34:24,519 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:24,519 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 22 transitions. cyclomatic complexity: 7 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:34:24,519 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:24,519 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 18 transitions. cyclomatic complexity: 7 Stem has 9 letters. Loop has 2 letters. [2020-07-29 01:34:24,519 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:24,519 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 9 letters. Loop has 2 letters. [2020-07-29 01:34:24,519 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:24,520 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 22 transitions. cyclomatic complexity: 7 Stem has 9 letters. Loop has 2 letters. [2020-07-29 01:34:24,520 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:24,520 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 18 transitions. cyclomatic complexity: 7 Stem has 18 letters. Loop has 18 letters. [2020-07-29 01:34:24,520 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:24,520 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 18 letters. Loop has 18 letters. [2020-07-29 01:34:24,520 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:24,520 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 22 transitions. cyclomatic complexity: 7 Stem has 18 letters. Loop has 18 letters. [2020-07-29 01:34:24,520 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:24,521 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 18 transitions. cyclomatic complexity: 7 Stem has 14 letters. Loop has 14 letters. [2020-07-29 01:34:24,521 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:24,521 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 14 letters. Loop has 14 letters. [2020-07-29 01:34:24,521 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:24,521 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 22 transitions. cyclomatic complexity: 7 Stem has 14 letters. Loop has 14 letters. [2020-07-29 01:34:24,521 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:24,521 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 18 transitions. cyclomatic complexity: 7 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:34:24,521 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:24,522 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:34:24,522 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:24,522 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 22 transitions. cyclomatic complexity: 7 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:34:24,522 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:24,522 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 18 transitions. cyclomatic complexity: 7 Stem has 9 letters. Loop has 2 letters. [2020-07-29 01:34:24,522 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:24,522 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 9 letters. Loop has 2 letters. [2020-07-29 01:34:24,522 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:24,523 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 22 transitions. cyclomatic complexity: 7 Stem has 9 letters. Loop has 2 letters. [2020-07-29 01:34:24,523 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:24,523 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 18 transitions. cyclomatic complexity: 7 Stem has 10 letters. Loop has 2 letters. [2020-07-29 01:34:24,523 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:24,523 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 10 letters. Loop has 2 letters. [2020-07-29 01:34:24,523 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:24,523 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 22 transitions. cyclomatic complexity: 7 Stem has 10 letters. Loop has 2 letters. [2020-07-29 01:34:24,524 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:24,524 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 18 transitions. cyclomatic complexity: 7 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:34:24,524 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:24,524 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:34:24,524 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:24,524 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 22 transitions. cyclomatic complexity: 7 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:34:24,524 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:24,525 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 18 transitions. cyclomatic complexity: 7 Stem has 9 letters. Loop has 2 letters. [2020-07-29 01:34:24,525 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:24,525 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 9 letters. Loop has 2 letters. [2020-07-29 01:34:24,525 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:24,525 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 22 transitions. cyclomatic complexity: 7 Stem has 9 letters. Loop has 2 letters. [2020-07-29 01:34:24,525 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:24,525 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 18 transitions. cyclomatic complexity: 7 Stem has 10 letters. Loop has 2 letters. [2020-07-29 01:34:24,526 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:24,526 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 10 letters. Loop has 2 letters. [2020-07-29 01:34:24,526 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:24,526 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 22 transitions. cyclomatic complexity: 7 Stem has 10 letters. Loop has 2 letters. [2020-07-29 01:34:24,526 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:24,526 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:34:24,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 01:34:24,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 9 transitions. [2020-07-29 01:34:24,527 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 9 letters. Loop has 2 letters. [2020-07-29 01:34:24,527 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:24,527 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-07-29 01:34:24,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:34:24,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:34:24,552 INFO L263 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:34:24,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:34:24,557 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:34:24,566 INFO L280 TraceCheckUtils]: 0: Hoare triple {387#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {387#unseeded} is VALID [2020-07-29 01:34:24,567 INFO L280 TraceCheckUtils]: 1: Hoare triple {387#unseeded} havoc main_#res;havoc main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~ret9, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet7;havoc main_#t~nondet7; {387#unseeded} is VALID [2020-07-29 01:34:24,569 INFO L280 TraceCheckUtils]: 2: Hoare triple {387#unseeded} assume !(main_~array_size~0 < 1); {387#unseeded} is VALID [2020-07-29 01:34:24,570 INFO L280 TraceCheckUtils]: 3: Hoare triple {387#unseeded} call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc8.base, main_#t~malloc8.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_#res;havoc test_fun_#t~mem4, test_fun_#t~post5, test_fun_#t~post6, test_fun_#t~mem3, 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;test_fun_~res~0 := 0;test_fun_~i~0 := 0; {387#unseeded} is VALID [2020-07-29 01:34:24,570 INFO L280 TraceCheckUtils]: 4: Hoare triple {387#unseeded} assume !!(test_fun_~i~0 < test_fun_~N); {387#unseeded} is VALID [2020-07-29 01:34:24,571 INFO L280 TraceCheckUtils]: 5: Hoare triple {387#unseeded} call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); {387#unseeded} is VALID [2020-07-29 01:34:24,571 INFO L280 TraceCheckUtils]: 6: Hoare triple {387#unseeded} assume !(test_fun_#t~mem3 > 0);havoc test_fun_#t~mem3; {387#unseeded} is VALID [2020-07-29 01:34:24,571 INFO L280 TraceCheckUtils]: 7: Hoare triple {387#unseeded} test_fun_#t~post2 := test_fun_~i~0;test_fun_~i~0 := 1 + test_fun_#t~post2;havoc test_fun_#t~post2; {387#unseeded} is VALID [2020-07-29 01:34:24,572 INFO L280 TraceCheckUtils]: 8: Hoare triple {387#unseeded} assume !!(test_fun_~i~0 < test_fun_~N); {387#unseeded} is VALID [2020-07-29 01:34:24,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:34:24,578 INFO L263 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-29 01:34:24,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:34:24,584 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:34:24,605 INFO L280 TraceCheckUtils]: 0: Hoare triple {390#(>= oldRank0 (select (select |#memory_int| ULTIMATE.start_test_fun_~a.base) (+ ULTIMATE.start_test_fun_~a.offset (* ULTIMATE.start_test_fun_~i~0 4))))} call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); {509#(and (<= |ULTIMATE.start_test_fun_#t~mem3| (select (select |#memory_int| ULTIMATE.start_test_fun_~a.base) (+ (* ULTIMATE.start_test_fun_~i~0 4) ULTIMATE.start_test_fun_~a.offset))) (<= (select (select |#memory_int| ULTIMATE.start_test_fun_~a.base) (+ ULTIMATE.start_test_fun_~a.offset (* ULTIMATE.start_test_fun_~i~0 4))) oldRank0))} is VALID [2020-07-29 01:34:24,607 INFO L280 TraceCheckUtils]: 1: Hoare triple {509#(and (<= |ULTIMATE.start_test_fun_#t~mem3| (select (select |#memory_int| ULTIMATE.start_test_fun_~a.base) (+ (* ULTIMATE.start_test_fun_~i~0 4) ULTIMATE.start_test_fun_~a.offset))) (<= (select (select |#memory_int| ULTIMATE.start_test_fun_~a.base) (+ ULTIMATE.start_test_fun_~a.offset (* ULTIMATE.start_test_fun_~i~0 4))) oldRank0))} assume !!(test_fun_#t~mem3 > 0);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);test_fun_#t~post5 := test_fun_#t~mem4;call write~int(test_fun_#t~post5 - 1, test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);havoc test_fun_#t~post5;havoc test_fun_#t~mem4;test_fun_#t~post6 := test_fun_~res~0;test_fun_~res~0 := 1 + test_fun_#t~post6;havoc test_fun_#t~post6; {420#(or (and (>= oldRank0 0) (> oldRank0 (select (select |#memory_int| ULTIMATE.start_test_fun_~a.base) (+ ULTIMATE.start_test_fun_~a.offset (* ULTIMATE.start_test_fun_~i~0 4))))) unseeded)} is VALID [2020-07-29 01:34:24,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:34:24,608 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 01:34:24,623 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:34:24,624 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 9 letters. Loop has 2 letters. [2020-07-29 01:34:24,624 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:24,625 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 [2020-07-29 01:34:24,625 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states and 18 transitions. cyclomatic complexity: 7 Second operand 3 states. [2020-07-29 01:34:24,662 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 14 states and 18 transitions. cyclomatic complexity: 7. Second operand 3 states. Result 18 states and 22 transitions. Complement of second has 7 states. [2020-07-29 01:34:24,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-07-29 01:34:24,662 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:34:24,663 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 18 transitions. cyclomatic complexity: 7 [2020-07-29 01:34:24,663 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:34:24,663 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:34:24,663 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. [2020-07-29 01:34:24,664 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:34:24,664 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:34:24,664 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:34:24,664 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 22 transitions. [2020-07-29 01:34:24,665 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:34:24,665 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:34:24,665 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:34:24,665 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 14 states and 18 transitions. cyclomatic complexity: 7 [2020-07-29 01:34:24,665 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 01:34:24,666 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 3 states. [2020-07-29 01:34:24,666 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:34:24,666 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:34:24,667 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 18 states and 22 transitions. cyclomatic complexity: 7 [2020-07-29 01:34:24,667 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 01:34:24,667 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 18 transitions. cyclomatic complexity: 7 Stem has 9 letters. Loop has 2 letters. [2020-07-29 01:34:24,667 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:24,667 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 9 letters. Loop has 2 letters. [2020-07-29 01:34:24,667 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:24,668 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 22 transitions. cyclomatic complexity: 7 Stem has 9 letters. Loop has 2 letters. [2020-07-29 01:34:24,668 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:24,668 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 18 transitions. cyclomatic complexity: 7 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:34:24,668 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:24,668 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:34:24,668 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:24,668 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 22 transitions. cyclomatic complexity: 7 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:34:24,668 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:24,669 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 18 transitions. cyclomatic complexity: 7 Stem has 9 letters. Loop has 2 letters. [2020-07-29 01:34:24,669 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:24,669 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 9 letters. Loop has 2 letters. [2020-07-29 01:34:24,669 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:24,669 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 22 transitions. cyclomatic complexity: 7 Stem has 9 letters. Loop has 2 letters. [2020-07-29 01:34:24,669 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:24,669 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 18 transitions. cyclomatic complexity: 7 Stem has 18 letters. Loop has 18 letters. [2020-07-29 01:34:24,669 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:24,669 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 18 letters. Loop has 18 letters. [2020-07-29 01:34:24,670 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:24,670 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 22 transitions. cyclomatic complexity: 7 Stem has 18 letters. Loop has 18 letters. [2020-07-29 01:34:24,670 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:24,670 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 18 transitions. cyclomatic complexity: 7 Stem has 14 letters. Loop has 14 letters. [2020-07-29 01:34:24,670 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:24,670 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 14 letters. Loop has 14 letters. [2020-07-29 01:34:24,670 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:24,670 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 22 transitions. cyclomatic complexity: 7 Stem has 14 letters. Loop has 14 letters. [2020-07-29 01:34:24,671 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:24,671 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 18 transitions. cyclomatic complexity: 7 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:34:24,671 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:24,671 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:34:24,671 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:24,671 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 22 transitions. cyclomatic complexity: 7 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:34:24,671 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:24,671 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 18 transitions. cyclomatic complexity: 7 Stem has 9 letters. Loop has 2 letters. [2020-07-29 01:34:24,672 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:24,672 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 9 letters. Loop has 2 letters. [2020-07-29 01:34:24,672 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:24,672 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 22 transitions. cyclomatic complexity: 7 Stem has 9 letters. Loop has 2 letters. [2020-07-29 01:34:24,672 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:24,672 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 18 transitions. cyclomatic complexity: 7 Stem has 10 letters. Loop has 2 letters. [2020-07-29 01:34:24,672 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:24,672 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 10 letters. Loop has 2 letters. [2020-07-29 01:34:24,673 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:24,673 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 22 transitions. cyclomatic complexity: 7 Stem has 10 letters. Loop has 2 letters. [2020-07-29 01:34:24,673 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:24,673 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 18 transitions. cyclomatic complexity: 7 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:34:24,673 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:24,673 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:34:24,674 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:24,674 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 22 transitions. cyclomatic complexity: 7 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:34:24,674 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:24,674 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 18 transitions. cyclomatic complexity: 7 Stem has 9 letters. Loop has 2 letters. [2020-07-29 01:34:24,674 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:24,674 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 9 letters. Loop has 2 letters. [2020-07-29 01:34:24,674 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:24,674 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 22 transitions. cyclomatic complexity: 7 Stem has 9 letters. Loop has 2 letters. [2020-07-29 01:34:24,675 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:24,675 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 18 transitions. cyclomatic complexity: 7 Stem has 10 letters. Loop has 2 letters. [2020-07-29 01:34:24,675 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:24,675 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 10 letters. Loop has 2 letters. [2020-07-29 01:34:24,675 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:24,675 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 22 transitions. cyclomatic complexity: 7 Stem has 10 letters. Loop has 2 letters. [2020-07-29 01:34:24,675 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:24,675 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:34:24,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 01:34:24,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 9 transitions. [2020-07-29 01:34:24,676 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 9 letters. Loop has 2 letters. [2020-07-29 01:34:24,676 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:24,677 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-07-29 01:34:24,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:34:24,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:34:24,709 INFO L263 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:34:24,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:34:24,715 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:34:24,722 INFO L280 TraceCheckUtils]: 0: Hoare triple {387#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {387#unseeded} is VALID [2020-07-29 01:34:24,723 INFO L280 TraceCheckUtils]: 1: Hoare triple {387#unseeded} havoc main_#res;havoc main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~ret9, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet7;havoc main_#t~nondet7; {387#unseeded} is VALID [2020-07-29 01:34:24,724 INFO L280 TraceCheckUtils]: 2: Hoare triple {387#unseeded} assume !(main_~array_size~0 < 1); {387#unseeded} is VALID [2020-07-29 01:34:24,724 INFO L280 TraceCheckUtils]: 3: Hoare triple {387#unseeded} call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc8.base, main_#t~malloc8.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_#res;havoc test_fun_#t~mem4, test_fun_#t~post5, test_fun_#t~post6, test_fun_#t~mem3, 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;test_fun_~res~0 := 0;test_fun_~i~0 := 0; {387#unseeded} is VALID [2020-07-29 01:34:24,725 INFO L280 TraceCheckUtils]: 4: Hoare triple {387#unseeded} assume !!(test_fun_~i~0 < test_fun_~N); {387#unseeded} is VALID [2020-07-29 01:34:24,725 INFO L280 TraceCheckUtils]: 5: Hoare triple {387#unseeded} call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); {387#unseeded} is VALID [2020-07-29 01:34:24,726 INFO L280 TraceCheckUtils]: 6: Hoare triple {387#unseeded} assume !(test_fun_#t~mem3 > 0);havoc test_fun_#t~mem3; {387#unseeded} is VALID [2020-07-29 01:34:24,727 INFO L280 TraceCheckUtils]: 7: Hoare triple {387#unseeded} test_fun_#t~post2 := test_fun_~i~0;test_fun_~i~0 := 1 + test_fun_#t~post2;havoc test_fun_#t~post2; {387#unseeded} is VALID [2020-07-29 01:34:24,727 INFO L280 TraceCheckUtils]: 8: Hoare triple {387#unseeded} assume !!(test_fun_~i~0 < test_fun_~N); {387#unseeded} is VALID [2020-07-29 01:34:24,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:34:24,733 INFO L263 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-29 01:34:24,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:34:24,738 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:34:24,762 INFO L280 TraceCheckUtils]: 0: Hoare triple {390#(>= oldRank0 (select (select |#memory_int| ULTIMATE.start_test_fun_~a.base) (+ ULTIMATE.start_test_fun_~a.offset (* ULTIMATE.start_test_fun_~i~0 4))))} call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); {569#(and (<= |ULTIMATE.start_test_fun_#t~mem3| (select (select |#memory_int| ULTIMATE.start_test_fun_~a.base) (+ (* ULTIMATE.start_test_fun_~i~0 4) ULTIMATE.start_test_fun_~a.offset))) (<= (select (select |#memory_int| ULTIMATE.start_test_fun_~a.base) (+ ULTIMATE.start_test_fun_~a.offset (* ULTIMATE.start_test_fun_~i~0 4))) oldRank0))} is VALID [2020-07-29 01:34:24,764 INFO L280 TraceCheckUtils]: 1: Hoare triple {569#(and (<= |ULTIMATE.start_test_fun_#t~mem3| (select (select |#memory_int| ULTIMATE.start_test_fun_~a.base) (+ (* ULTIMATE.start_test_fun_~i~0 4) ULTIMATE.start_test_fun_~a.offset))) (<= (select (select |#memory_int| ULTIMATE.start_test_fun_~a.base) (+ ULTIMATE.start_test_fun_~a.offset (* ULTIMATE.start_test_fun_~i~0 4))) oldRank0))} assume !!(test_fun_#t~mem3 > 0);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);test_fun_#t~post5 := test_fun_#t~mem4;call write~int(test_fun_#t~post5 - 1, test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);havoc test_fun_#t~post5;havoc test_fun_#t~mem4;test_fun_#t~post6 := test_fun_~res~0;test_fun_~res~0 := 1 + test_fun_#t~post6;havoc test_fun_#t~post6; {420#(or (and (>= oldRank0 0) (> oldRank0 (select (select |#memory_int| ULTIMATE.start_test_fun_~a.base) (+ ULTIMATE.start_test_fun_~a.offset (* ULTIMATE.start_test_fun_~i~0 4))))) unseeded)} is VALID [2020-07-29 01:34:24,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:34:24,764 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 01:34:24,774 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:34:24,774 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 9 letters. Loop has 2 letters. [2020-07-29 01:34:24,774 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:24,775 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 [2020-07-29 01:34:24,775 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states and 18 transitions. cyclomatic complexity: 7 Second operand 3 states. [2020-07-29 01:34:24,834 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 14 states and 18 transitions. cyclomatic complexity: 7. Second operand 3 states. Result 20 states and 26 transitions. Complement of second has 6 states. [2020-07-29 01:34:24,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-07-29 01:34:24,835 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:34:24,835 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 18 transitions. cyclomatic complexity: 7 [2020-07-29 01:34:24,835 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:34:24,835 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:34:24,835 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. [2020-07-29 01:34:24,840 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:34:24,841 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:34:24,841 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:34:24,841 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 26 transitions. [2020-07-29 01:34:24,842 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:34:24,842 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 01:34:24,842 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 14 states and 18 transitions. cyclomatic complexity: 7 [2020-07-29 01:34:24,842 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 01:34:24,842 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 3 states. [2020-07-29 01:34:24,846 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:34:24,847 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:34:24,847 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 20 states and 26 transitions. cyclomatic complexity: 9 [2020-07-29 01:34:24,847 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 26 transitions. cyclomatic complexity: 9 [2020-07-29 01:34:24,848 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 01:34:24,848 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2020-07-29 01:34:24,848 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 18 transitions. cyclomatic complexity: 7 Stem has 9 letters. Loop has 2 letters. [2020-07-29 01:34:24,848 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:24,849 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 9 letters. Loop has 2 letters. [2020-07-29 01:34:24,849 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:24,850 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 26 transitions. cyclomatic complexity: 9 Stem has 9 letters. Loop has 2 letters. [2020-07-29 01:34:24,851 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:24,851 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 18 transitions. cyclomatic complexity: 7 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:34:24,851 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:24,851 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:34:24,852 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:24,852 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 26 transitions. cyclomatic complexity: 9 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:34:24,853 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:24,853 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 18 transitions. cyclomatic complexity: 7 Stem has 20 letters. Loop has 20 letters. [2020-07-29 01:34:24,853 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:24,853 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 20 letters. Loop has 20 letters. [2020-07-29 01:34:24,854 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:24,854 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 26 transitions. cyclomatic complexity: 9 Stem has 20 letters. Loop has 20 letters. [2020-07-29 01:34:24,854 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:24,854 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 18 transitions. cyclomatic complexity: 7 Stem has 14 letters. Loop has 14 letters. [2020-07-29 01:34:24,854 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:24,855 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 14 letters. Loop has 14 letters. [2020-07-29 01:34:24,855 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:24,855 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 26 transitions. cyclomatic complexity: 9 Stem has 14 letters. Loop has 14 letters. [2020-07-29 01:34:24,855 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:24,855 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 18 transitions. cyclomatic complexity: 7 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:34:24,856 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:24,856 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:34:24,856 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:24,856 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 26 transitions. cyclomatic complexity: 9 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:34:24,856 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:24,857 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 18 transitions. cyclomatic complexity: 7 Stem has 9 letters. Loop has 2 letters. [2020-07-29 01:34:24,857 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:24,857 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 9 letters. Loop has 2 letters. [2020-07-29 01:34:24,858 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:24,858 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 26 transitions. cyclomatic complexity: 9 Stem has 9 letters. Loop has 2 letters. [2020-07-29 01:34:24,859 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:24,859 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 18 transitions. cyclomatic complexity: 7 Stem has 10 letters. Loop has 2 letters. [2020-07-29 01:34:24,859 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:24,859 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 10 letters. Loop has 2 letters. [2020-07-29 01:34:24,860 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:24,860 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 26 transitions. cyclomatic complexity: 9 Stem has 10 letters. Loop has 2 letters. [2020-07-29 01:34:24,860 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:24,860 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 18 transitions. cyclomatic complexity: 7 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:34:24,860 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:24,861 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:34:24,861 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:24,861 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 26 transitions. cyclomatic complexity: 9 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:34:24,861 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:24,862 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:34:24,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 01:34:24,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 14 transitions. [2020-07-29 01:34:24,863 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 9 letters. Loop has 2 letters. [2020-07-29 01:34:24,863 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:24,864 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 11 letters. Loop has 2 letters. [2020-07-29 01:34:24,864 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:24,864 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 9 letters. Loop has 4 letters. [2020-07-29 01:34:24,865 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:34:24,865 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 26 transitions. cyclomatic complexity: 9 [2020-07-29 01:34:24,866 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:34:24,867 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 0 states and 0 transitions. [2020-07-29 01:34:24,867 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-07-29 01:34:24,867 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-07-29 01:34:24,867 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-07-29 01:34:24,867 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 01:34:24,868 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 01:34:24,868 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 01:34:24,868 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 01:34:24,868 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2020-07-29 01:34:24,868 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-07-29 01:34:24,869 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:34:24,869 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 01:34:24,878 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 29.07 01:34:24 BoogieIcfgContainer [2020-07-29 01:34:24,879 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-07-29 01:34:24,879 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-07-29 01:34:24,879 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-07-29 01:34:24,880 INFO L275 PluginConnector]: Witness Printer initialized [2020-07-29 01:34:24,880 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:34:17" (3/4) ... [2020-07-29 01:34:24,884 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-07-29 01:34:24,885 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-07-29 01:34:24,889 INFO L168 Benchmark]: Toolchain (without parser) took 8205.82 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 266.3 MB). Free memory was 960.2 MB in the beginning and 964.7 MB in the end (delta: -4.4 MB). Peak memory consumption was 261.9 MB. Max. memory is 11.5 GB. [2020-07-29 01:34:24,889 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 1.0 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:34:24,891 INFO L168 Benchmark]: CACSL2BoogieTranslator took 622.98 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 85.5 MB). Free memory was 960.2 MB in the beginning and 1.1 GB in the end (delta: -106.8 MB). Peak memory consumption was 26.3 MB. Max. memory is 11.5 GB. [2020-07-29 01:34:24,896 INFO L168 Benchmark]: Boogie Procedure Inliner took 50.68 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 11.5 GB. [2020-07-29 01:34:24,897 INFO L168 Benchmark]: Boogie Preprocessor took 30.42 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2020-07-29 01:34:24,898 INFO L168 Benchmark]: RCFGBuilder took 476.35 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 19.4 MB). Peak memory consumption was 19.4 MB. Max. memory is 11.5 GB. [2020-07-29 01:34:24,898 INFO L168 Benchmark]: BuchiAutomizer took 7012.45 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 180.9 MB). Free memory was 1.0 GB in the beginning and 964.7 MB in the end (delta: 74.3 MB). Peak memory consumption was 255.2 MB. Max. memory is 11.5 GB. [2020-07-29 01:34:24,899 INFO L168 Benchmark]: Witness Printer took 5.56 ms. Allocated memory is still 1.3 GB. Free memory is still 964.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:34:24,902 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.26 ms. Allocated memory is still 1.0 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 622.98 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 85.5 MB). Free memory was 960.2 MB in the beginning and 1.1 GB in the end (delta: -106.8 MB). Peak memory consumption was 26.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 50.68 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 30.42 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. * RCFGBuilder took 476.35 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 19.4 MB). Peak memory consumption was 19.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 7012.45 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 180.9 MB). Free memory was 1.0 GB in the beginning and 964.7 MB in the end (delta: 74.3 MB). Peak memory consumption was 255.2 MB. Max. memory is 11.5 GB. * Witness Printer took 5.56 ms. Allocated memory is still 1.3 GB. Free memory is still 964.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 4 terminating modules (1 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. 1 modules have a trivial ranking function, the largest among these consists of 2 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 6.9s and 5 iterations. TraceHistogramMax:2. Analysis of lassos took 5.7s. Construction of modules took 0.1s. Büchi inclusion checks took 0.9s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 2. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 2 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 14 states and ocurred in iteration 3. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 49 SDtfs, 43 SDslu, 1 SDs, 0 SdLazy, 42 SolverSat, 19 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital136 mio100 ax113 hnf98 lsp80 ukn80 mio100 lsp57 div100 bol100 ite100 ukn100 eq180 hnf89 smp100 dnf100 smp100 tf100 neg100 sie101 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 14ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...