./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/array-memsafety/array01-alloca-2.i --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- 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/array-memsafety/array01-alloca-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-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 32bit --witnessprinter.graph.data.programhash 0e0283c2b515067609d1d09b2bc4afe3d1f1d910 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 03:25:09,797 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-29 03:25:09,799 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-29 03:25:09,811 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-29 03:25:09,811 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-29 03:25:09,813 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-29 03:25:09,814 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-29 03:25:09,816 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-29 03:25:09,818 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-29 03:25:09,819 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-29 03:25:09,820 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-29 03:25:09,821 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-29 03:25:09,821 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-29 03:25:09,822 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-29 03:25:09,826 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-29 03:25:09,827 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-29 03:25:09,831 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-29 03:25:09,832 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-29 03:25:09,834 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-29 03:25:09,837 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-29 03:25:09,838 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-29 03:25:09,839 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-29 03:25:09,840 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-29 03:25:09,841 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-29 03:25:09,844 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-29 03:25:09,844 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-29 03:25:09,844 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-29 03:25:09,845 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-29 03:25:09,846 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-29 03:25:09,847 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-29 03:25:09,847 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-29 03:25:09,848 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-29 03:25:09,849 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-29 03:25:09,849 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-29 03:25:09,851 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-29 03:25:09,851 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-29 03:25:09,852 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-29 03:25:09,852 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-29 03:25:09,852 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-29 03:25:09,853 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-29 03:25:09,854 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-29 03:25:09,855 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2020-07-29 03:25:09,871 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-29 03:25:09,871 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-29 03:25:09,873 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-29 03:25:09,873 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-29 03:25:09,873 INFO L138 SettingsManager]: * Use SBE=true [2020-07-29 03:25:09,874 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-07-29 03:25:09,874 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-07-29 03:25:09,874 INFO L138 SettingsManager]: * Use old map elimination=false [2020-07-29 03:25:09,874 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-07-29 03:25:09,875 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-07-29 03:25:09,875 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-07-29 03:25:09,875 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-29 03:25:09,875 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-29 03:25:09,876 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-29 03:25:09,876 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-29 03:25:09,876 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-29 03:25:09,877 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-29 03:25:09,877 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-07-29 03:25:09,877 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-07-29 03:25:09,877 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-07-29 03:25:09,878 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-29 03:25:09,878 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-29 03:25:09,878 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-07-29 03:25:09,878 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-29 03:25:09,879 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-07-29 03:25:09,879 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-29 03:25:09,879 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-29 03:25:09,879 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-07-29 03:25:09,880 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-29 03:25:09,880 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-29 03:25:09,880 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-29 03:25:09,881 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-07-29 03:25:09,882 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-07-29 03:25:09,882 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0e0283c2b515067609d1d09b2bc4afe3d1f1d910 [2020-07-29 03:25:10,160 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-29 03:25:10,175 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-29 03:25:10,178 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-29 03:25:10,179 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-29 03:25:10,180 INFO L275 PluginConnector]: CDTParser initialized [2020-07-29 03:25:10,181 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-memsafety/array01-alloca-2.i [2020-07-29 03:25:10,254 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e856e4394/713333ea5a7342eeb0e4e314bbe442f5/FLAG7b1e2b184 [2020-07-29 03:25:10,735 INFO L306 CDTParser]: Found 1 translation units. [2020-07-29 03:25:10,736 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/array01-alloca-2.i [2020-07-29 03:25:10,751 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e856e4394/713333ea5a7342eeb0e4e314bbe442f5/FLAG7b1e2b184 [2020-07-29 03:25:11,095 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e856e4394/713333ea5a7342eeb0e4e314bbe442f5 [2020-07-29 03:25:11,099 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-29 03:25:11,103 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-29 03:25:11,104 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-29 03:25:11,105 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-29 03:25:11,108 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-29 03:25:11,110 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 03:25:11" (1/1) ... [2020-07-29 03:25:11,113 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49a37da1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:25:11, skipping insertion in model container [2020-07-29 03:25:11,113 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 03:25:11" (1/1) ... [2020-07-29 03:25:11,122 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-29 03:25:11,181 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-29 03:25:11,557 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 03:25:11,567 INFO L203 MainTranslator]: Completed pre-run [2020-07-29 03:25:11,614 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 03:25:11,669 INFO L208 MainTranslator]: Completed translation [2020-07-29 03:25:11,670 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:25:11 WrapperNode [2020-07-29 03:25:11,670 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-29 03:25:11,671 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-29 03:25:11,671 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-29 03:25:11,671 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-29 03:25:11,679 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:25:11" (1/1) ... [2020-07-29 03:25:11,694 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:25:11" (1/1) ... [2020-07-29 03:25:11,723 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-29 03:25:11,724 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-29 03:25:11,724 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-29 03:25:11,724 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-29 03:25:11,733 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:25:11" (1/1) ... [2020-07-29 03:25:11,733 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:25:11" (1/1) ... [2020-07-29 03:25:11,736 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:25:11" (1/1) ... [2020-07-29 03:25:11,737 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:25:11" (1/1) ... [2020-07-29 03:25:11,744 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:25:11" (1/1) ... [2020-07-29 03:25:11,748 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:25:11" (1/1) ... [2020-07-29 03:25:11,750 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:25:11" (1/1) ... [2020-07-29 03:25:11,752 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-29 03:25:11,753 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-29 03:25:11,753 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-29 03:25:11,753 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-29 03:25:11,754 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:25:11" (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 03:25:11,826 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-29 03:25:11,827 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-29 03:25:11,827 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-29 03:25:11,827 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-29 03:25:11,828 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-29 03:25:11,829 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-29 03:25:12,171 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-29 03:25:12,172 INFO L295 CfgBuilder]: Removed 9 assume(true) statements. [2020-07-29 03:25:12,175 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 03:25:12 BoogieIcfgContainer [2020-07-29 03:25:12,175 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-29 03:25:12,176 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-07-29 03:25:12,176 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-07-29 03:25:12,180 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-07-29 03:25:12,181 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 03:25:12,181 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 29.07 03:25:11" (1/3) ... [2020-07-29 03:25:12,182 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@21c7562b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 03:25:12, skipping insertion in model container [2020-07-29 03:25:12,182 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 03:25:12,182 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:25:11" (2/3) ... [2020-07-29 03:25:12,183 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@21c7562b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 03:25:12, skipping insertion in model container [2020-07-29 03:25:12,183 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 03:25:12,183 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 03:25:12" (3/3) ... [2020-07-29 03:25:12,185 INFO L371 chiAutomizerObserver]: Analyzing ICFG array01-alloca-2.i [2020-07-29 03:25:12,238 INFO L356 BuchiCegarLoop]: Interprodecural is true [2020-07-29 03:25:12,238 INFO L357 BuchiCegarLoop]: Hoare is false [2020-07-29 03:25:12,238 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-29 03:25:12,241 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-29 03:25:12,241 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-29 03:25:12,242 INFO L361 BuchiCegarLoop]: Difference is false [2020-07-29 03:25:12,242 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-29 03:25:12,242 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-07-29 03:25:12,256 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states. [2020-07-29 03:25:12,285 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2020-07-29 03:25:12,286 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:25:12,286 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:25:12,292 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-07-29 03:25:12,293 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-29 03:25:12,293 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2020-07-29 03:25:12,293 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states. [2020-07-29 03:25:12,298 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2020-07-29 03:25:12,298 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:25:12,298 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:25:12,299 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-07-29 03:25:12,299 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-29 03:25:12,307 INFO L794 eck$LassoCheckResult]: Stem: 13#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 12#L-1true havoc main_#res;havoc main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~nondet10, main_#t~post9, main_~k~0, main_#t~ret11, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet7;havoc main_#t~nondet7; 4#L526true assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 7#L526-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;main_~k~0 := 0; 16#L531-3true [2020-07-29 03:25:12,309 INFO L796 eck$LassoCheckResult]: Loop: 16#L531-3true assume !!(main_~k~0 < main_~array_size~0);call write~int(main_#t~nondet10, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~k~0, 4);havoc main_#t~nondet10; 15#L531-2true main_#t~post9 := main_~k~0;main_~k~0 := 1 + main_#t~post9;havoc main_#t~post9; 16#L531-3true [2020-07-29 03:25:12,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:12,315 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2020-07-29 03:25:12,325 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:25:12,326 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094929212] [2020-07-29 03:25:12,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:25:12,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:12,412 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:12,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:12,425 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:12,445 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:25:12,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:12,446 INFO L82 PathProgramCache]: Analyzing trace with hash 1507, now seen corresponding path program 1 times [2020-07-29 03:25:12,446 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:25:12,447 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765105139] [2020-07-29 03:25:12,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:25:12,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:12,459 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:12,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:12,472 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:12,475 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:25:12,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:12,480 INFO L82 PathProgramCache]: Analyzing trace with hash 889568455, now seen corresponding path program 1 times [2020-07-29 03:25:12,480 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:25:12,481 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857675563] [2020-07-29 03:25:12,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:25:12,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:12,506 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:12,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:12,523 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:12,529 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:25:12,811 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 03:25:12,812 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 03:25:12,812 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 03:25:12,812 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 03:25:12,812 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 03:25:12,813 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:12,813 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 03:25:12,813 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 03:25:12,813 INFO L133 ssoRankerPreferences]: Filename of dumped script: array01-alloca-2.i_Iteration1_Lasso [2020-07-29 03:25:12,813 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 03:25:12,814 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 03:25:12,866 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 03:25:12,876 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 03:25:12,881 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 03:25:12,888 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 03:25:12,895 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 03:25:12,901 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 03:25:13,056 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 03:25:13,062 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 03:25:13,066 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 03:25:13,071 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 03:25:13,613 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 03:25:13,618 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 03:25:13,628 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:13,631 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:13,631 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:25:13,632 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:13,632 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:13,632 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:13,634 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:25:13,635 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:25:13,640 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) [2020-07-29 03:25:13,678 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 03:25:13,680 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:13,680 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:25:13,680 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:13,680 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:13,680 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:13,681 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:25:13,681 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:25:13,683 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 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 03:25:13,730 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 03:25:13,733 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:13,734 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:13,734 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:13,734 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:13,742 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:25:13,742 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:25:13,747 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 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) [2020-07-29 03:25:13,786 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 03:25:13,788 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:13,788 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:13,788 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:13,788 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:13,792 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:25:13,792 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:13,803 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 03:25:13,837 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 03:25:13,839 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:13,839 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:13,839 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:13,839 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:13,843 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:25:13,843 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:13,848 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) [2020-07-29 03:25:13,885 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 03:25:13,887 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:13,887 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:25:13,888 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:13,888 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:13,888 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:13,889 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:25:13,889 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:13,891 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) [2020-07-29 03:25:13,928 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 03:25:13,930 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:13,930 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:13,931 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:13,931 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:13,940 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:25:13,940 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:13,956 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 03:25:14,005 INFO L443 ModelExtractionUtils]: Simplification made 15 calls to the SMT solver. [2020-07-29 03:25:14,005 INFO L444 ModelExtractionUtils]: 4 out of 22 variables were initially zero. Simplification set additionally 13 variables to zero. 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) [2020-07-29 03:25:14,011 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:14,049 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2020-07-29 03:25:14,050 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 03:25:14,051 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~k~0, v_rep(select #length ULTIMATE.start_main_#t~malloc8.base)_1) = -2*ULTIMATE.start_main_~k~0 + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc8.base)_1 Supporting invariants [-2*ULTIMATE.start_main_~array_size~0 + 1*v_rep(select #length ULTIMATE.start_main_~numbers~0.base)_1 >= 0] [2020-07-29 03:25:14,118 INFO L297 tatePredicateManager]: 2 out of 4 supporting invariants were superfluous and have been removed [2020-07-29 03:25:14,128 INFO L393 LassoCheck]: Loop: "assume !!(main_~k~0 < main_~array_size~0);call write~int(main_#t~nondet10, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~k~0, 4);havoc main_#t~nondet10;" "main_#t~post9 := main_~k~0;main_~k~0 := 1 + main_#t~post9;havoc main_#t~post9;" [2020-07-29 03:25:14,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:14,144 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-29 03:25:14,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:14,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:14,194 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-29 03:25:14,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:14,203 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:25:14,232 INFO L280 TraceCheckUtils]: 0: Hoare triple {26#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {26#unseeded} is VALID [2020-07-29 03:25:14,233 INFO L280 TraceCheckUtils]: 1: Hoare triple {26#unseeded} havoc main_#res;havoc main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~nondet10, main_#t~post9, main_~k~0, main_#t~ret11, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet7;havoc main_#t~nondet7; {26#unseeded} is VALID [2020-07-29 03:25:14,234 INFO L280 TraceCheckUtils]: 2: Hoare triple {26#unseeded} assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); {76#(and (<= 1 ULTIMATE.start_main_~array_size~0) unseeded)} is VALID [2020-07-29 03:25:14,236 INFO L280 TraceCheckUtils]: 3: Hoare triple {76#(and (<= 1 ULTIMATE.start_main_~array_size~0) 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;main_~k~0 := 0; {61#(and (= ULTIMATE.start_main_~numbers~0.base |ULTIMATE.start_main_#t~malloc8.base|) (>= (+ (* (- 2) ULTIMATE.start_main_~array_size~0) (select |#length| ULTIMATE.start_main_~numbers~0.base)) 0) unseeded)} is VALID [2020-07-29 03:25:14,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:14,244 WARN L261 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-29 03:25:14,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:14,249 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:25:14,283 INFO L280 TraceCheckUtils]: 0: Hoare triple {62#(and (>= oldRank0 (+ (* (- 2) ULTIMATE.start_main_~k~0) (select |#length| |ULTIMATE.start_main_#t~malloc8.base|))) (= ULTIMATE.start_main_~numbers~0.base |ULTIMATE.start_main_#t~malloc8.base|) (>= (+ (* (- 2) ULTIMATE.start_main_~array_size~0) (select |#length| ULTIMATE.start_main_~numbers~0.base)) 0))} assume !!(main_~k~0 < main_~array_size~0);call write~int(main_#t~nondet10, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~k~0, 4);havoc main_#t~nondet10; {80#(and (< ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~array_size~0) (<= (select |#length| |ULTIMATE.start_main_#t~malloc8.base|) (+ oldRank0 (* 2 ULTIMATE.start_main_~k~0))) (= ULTIMATE.start_main_~numbers~0.base |ULTIMATE.start_main_#t~malloc8.base|) (<= (* 2 ULTIMATE.start_main_~array_size~0) (select |#length| ULTIMATE.start_main_~numbers~0.base)))} is VALID [2020-07-29 03:25:14,284 INFO L280 TraceCheckUtils]: 1: Hoare triple {80#(and (< ULTIMATE.start_main_~k~0 ULTIMATE.start_main_~array_size~0) (<= (select |#length| |ULTIMATE.start_main_#t~malloc8.base|) (+ oldRank0 (* 2 ULTIMATE.start_main_~k~0))) (= ULTIMATE.start_main_~numbers~0.base |ULTIMATE.start_main_#t~malloc8.base|) (<= (* 2 ULTIMATE.start_main_~array_size~0) (select |#length| ULTIMATE.start_main_~numbers~0.base)))} main_#t~post9 := main_~k~0;main_~k~0 := 1 + main_#t~post9;havoc main_#t~post9; {64#(and (= ULTIMATE.start_main_~numbers~0.base |ULTIMATE.start_main_#t~malloc8.base|) (or (and (>= oldRank0 0) (> oldRank0 (+ (* (- 2) ULTIMATE.start_main_~k~0) (select |#length| |ULTIMATE.start_main_#t~malloc8.base|)))) unseeded) (>= (+ (* (- 2) ULTIMATE.start_main_~array_size~0) (select |#length| ULTIMATE.start_main_~numbers~0.base)) 0))} is VALID [2020-07-29 03:25:14,285 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 03:25:14,295 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 03:25:14,312 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:25:14,314 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 4 letters. Loop has 2 letters. [2020-07-29 03:25:14,317 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:14,323 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2020-07-29 03:25:14,324 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states. Second operand 4 states. [2020-07-29 03:25:14,545 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 16 states.. Second operand 4 states. Result 35 states and 50 transitions. Complement of second has 9 states. [2020-07-29 03:25:14,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2020-07-29 03:25:14,546 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:25:14,546 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states. [2020-07-29 03:25:14,549 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2020-07-29 03:25:14,550 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:25:14,550 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:25:14,550 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4 states. [2020-07-29 03:25:14,555 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2020-07-29 03:25:14,556 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:25:14,556 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:25:14,556 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 50 transitions. [2020-07-29 03:25:14,558 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-29 03:25:14,558 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:25:14,558 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:25:14,560 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 16 states. [2020-07-29 03:25:14,567 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2020-07-29 03:25:14,569 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 6 examples of accepted words. [2020-07-29 03:25:14,572 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 4 states. [2020-07-29 03:25:14,580 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2020-07-29 03:25:14,580 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 03:25:14,580 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 35 states and 50 transitions. cyclomatic complexity: 19 [2020-07-29 03:25:14,582 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 4 examples of accepted words. [2020-07-29 03:25:14,582 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states. Stem has 4 letters. Loop has 2 letters. [2020-07-29 03:25:14,584 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:14,584 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 4 letters. Loop has 2 letters. [2020-07-29 03:25:14,585 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:14,585 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 50 transitions. cyclomatic complexity: 19 Stem has 4 letters. Loop has 2 letters. [2020-07-29 03:25:14,585 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:14,585 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states. Stem has 2 letters. Loop has 2 letters. [2020-07-29 03:25:14,585 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:14,586 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 2 letters. Loop has 2 letters. [2020-07-29 03:25:14,586 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:14,586 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 50 transitions. cyclomatic complexity: 19 Stem has 2 letters. Loop has 2 letters. [2020-07-29 03:25:14,586 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:14,586 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states. Stem has 6 letters. Loop has 4 letters. [2020-07-29 03:25:14,587 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:14,587 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 6 letters. Loop has 4 letters. [2020-07-29 03:25:14,587 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:14,590 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 50 transitions. cyclomatic complexity: 19 Stem has 6 letters. Loop has 4 letters. [2020-07-29 03:25:14,591 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:14,591 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states. Stem has 35 letters. Loop has 35 letters. [2020-07-29 03:25:14,591 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:14,591 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 35 letters. Loop has 35 letters. [2020-07-29 03:25:14,591 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:14,592 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 50 transitions. cyclomatic complexity: 19 Stem has 35 letters. Loop has 35 letters. [2020-07-29 03:25:14,592 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:14,592 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states. Stem has 16 letters. Loop has 16 letters. [2020-07-29 03:25:14,594 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:14,594 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 16 letters. Loop has 16 letters. [2020-07-29 03:25:14,595 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:14,595 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 50 transitions. cyclomatic complexity: 19 Stem has 16 letters. Loop has 16 letters. [2020-07-29 03:25:14,595 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:14,595 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states. Stem has 6 letters. Loop has 6 letters. [2020-07-29 03:25:14,595 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:14,595 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 6 letters. Loop has 6 letters. [2020-07-29 03:25:14,595 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:14,596 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 50 transitions. cyclomatic complexity: 19 Stem has 6 letters. Loop has 6 letters. [2020-07-29 03:25:14,596 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:14,596 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states. Stem has 8 letters. Loop has 2 letters. [2020-07-29 03:25:14,596 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:14,596 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 8 letters. Loop has 2 letters. [2020-07-29 03:25:14,597 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:14,597 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 50 transitions. cyclomatic complexity: 19 Stem has 8 letters. Loop has 2 letters. [2020-07-29 03:25:14,597 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:14,597 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states. Stem has 7 letters. Loop has 2 letters. [2020-07-29 03:25:14,598 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:14,598 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 7 letters. Loop has 2 letters. [2020-07-29 03:25:14,598 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:14,611 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 50 transitions. cyclomatic complexity: 19 Stem has 7 letters. Loop has 2 letters. [2020-07-29 03:25:14,611 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:14,612 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states. Stem has 8 letters. Loop has 3 letters. [2020-07-29 03:25:14,612 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:14,612 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 8 letters. Loop has 3 letters. [2020-07-29 03:25:14,612 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:14,612 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 50 transitions. cyclomatic complexity: 19 Stem has 8 letters. Loop has 3 letters. [2020-07-29 03:25:14,613 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:14,613 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states. Stem has 6 letters. Loop has 3 letters. [2020-07-29 03:25:14,613 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:14,613 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 6 letters. Loop has 3 letters. [2020-07-29 03:25:14,614 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:14,614 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 50 transitions. cyclomatic complexity: 19 Stem has 6 letters. Loop has 3 letters. [2020-07-29 03:25:14,614 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:14,614 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states. Stem has 4 letters. Loop has 2 letters. [2020-07-29 03:25:14,615 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:14,615 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 4 letters. Loop has 2 letters. [2020-07-29 03:25:14,615 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:14,615 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 50 transitions. cyclomatic complexity: 19 Stem has 4 letters. Loop has 2 letters. [2020-07-29 03:25:14,615 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:14,615 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states. Stem has 5 letters. Loop has 2 letters. [2020-07-29 03:25:14,616 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:14,616 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 5 letters. Loop has 2 letters. [2020-07-29 03:25:14,616 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:14,616 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 50 transitions. cyclomatic complexity: 19 Stem has 5 letters. Loop has 2 letters. [2020-07-29 03:25:14,616 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:14,617 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states. Stem has 3 letters. Loop has 1 letters. [2020-07-29 03:25:14,617 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:14,617 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 3 letters. Loop has 1 letters. [2020-07-29 03:25:14,617 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:14,617 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 50 transitions. cyclomatic complexity: 19 Stem has 3 letters. Loop has 1 letters. [2020-07-29 03:25:14,617 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:14,617 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states. Stem has 2 letters. Loop has 2 letters. [2020-07-29 03:25:14,618 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:14,618 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 2 letters. Loop has 2 letters. [2020-07-29 03:25:14,618 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:14,618 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 50 transitions. cyclomatic complexity: 19 Stem has 2 letters. Loop has 2 letters. [2020-07-29 03:25:14,618 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:14,618 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states. Stem has 9 letters. Loop has 4 letters. [2020-07-29 03:25:14,619 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:14,619 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 9 letters. Loop has 4 letters. [2020-07-29 03:25:14,619 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:14,619 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 50 transitions. cyclomatic complexity: 19 Stem has 9 letters. Loop has 4 letters. [2020-07-29 03:25:14,620 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:14,620 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states. Stem has 7 letters. Loop has 2 letters. [2020-07-29 03:25:14,620 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:14,620 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 7 letters. Loop has 2 letters. [2020-07-29 03:25:14,620 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:14,620 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 50 transitions. cyclomatic complexity: 19 Stem has 7 letters. Loop has 2 letters. [2020-07-29 03:25:14,621 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:14,621 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states. Stem has 8 letters. Loop has 2 letters. [2020-07-29 03:25:14,621 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:14,621 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 8 letters. Loop has 2 letters. [2020-07-29 03:25:14,622 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:14,622 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 50 transitions. cyclomatic complexity: 19 Stem has 8 letters. Loop has 2 letters. [2020-07-29 03:25:14,622 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:14,622 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states. Stem has 6 letters. Loop has 4 letters. [2020-07-29 03:25:14,622 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:14,622 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 6 letters. Loop has 4 letters. [2020-07-29 03:25:14,623 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:14,623 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 50 transitions. cyclomatic complexity: 19 Stem has 6 letters. Loop has 4 letters. [2020-07-29 03:25:14,623 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:14,623 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:25:14,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 03:25:14,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 32 transitions. [2020-07-29 03:25:14,628 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 32 transitions. Stem has 4 letters. Loop has 2 letters. [2020-07-29 03:25:14,628 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:14,628 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 32 transitions. Stem has 6 letters. Loop has 2 letters. [2020-07-29 03:25:14,628 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:14,629 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 32 transitions. Stem has 4 letters. Loop has 4 letters. [2020-07-29 03:25:14,629 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:14,630 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 50 transitions. cyclomatic complexity: 19 [2020-07-29 03:25:14,634 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-29 03:25:14,641 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 12 states and 16 transitions. [2020-07-29 03:25:14,642 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2020-07-29 03:25:14,642 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2020-07-29 03:25:14,643 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 16 transitions. [2020-07-29 03:25:14,643 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 03:25:14,643 INFO L688 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2020-07-29 03:25:14,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 16 transitions. [2020-07-29 03:25:14,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2020-07-29 03:25:14,671 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:25:14,672 INFO L82 GeneralOperation]: Start isEquivalent. First operand 12 states and 16 transitions. Second operand 12 states. [2020-07-29 03:25:14,672 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states and 16 transitions. Second operand 12 states. [2020-07-29 03:25:14,675 INFO L87 Difference]: Start difference. First operand 12 states and 16 transitions. Second operand 12 states. [2020-07-29 03:25:14,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:25:14,680 INFO L93 Difference]: Finished difference Result 12 states and 16 transitions. [2020-07-29 03:25:14,681 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 16 transitions. [2020-07-29 03:25:14,682 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:25:14,682 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:25:14,682 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states. Second operand 12 states and 16 transitions. [2020-07-29 03:25:14,682 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 12 states and 16 transitions. [2020-07-29 03:25:14,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:25:14,683 INFO L93 Difference]: Finished difference Result 12 states and 16 transitions. [2020-07-29 03:25:14,684 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 16 transitions. [2020-07-29 03:25:14,684 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:25:14,684 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:25:14,684 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:25:14,684 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:25:14,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-29 03:25:14,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 16 transitions. [2020-07-29 03:25:14,687 INFO L711 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2020-07-29 03:25:14,687 INFO L591 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2020-07-29 03:25:14,687 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2020-07-29 03:25:14,687 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 16 transitions. [2020-07-29 03:25:14,688 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-29 03:25:14,688 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:25:14,688 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:25:14,688 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2020-07-29 03:25:14,688 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-07-29 03:25:14,689 INFO L794 eck$LassoCheckResult]: Stem: 139#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 133#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~nondet10, main_#t~post9, main_~k~0, main_#t~ret11, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet7;havoc main_#t~nondet7; 134#L526 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 138#L526-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;main_~k~0 := 0; 141#L531-3 assume !(main_~k~0 < main_~array_size~0); 144#L531-4 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#L516-3 [2020-07-29 03:25:14,689 INFO L796 eck$LassoCheckResult]: Loop: 140#L516-3 assume !!(test_fun_~i~0 < test_fun_~N); 137#L517-3 call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 135#L517-1 assume !(test_fun_#t~mem3 > 0);havoc test_fun_#t~mem3; 136#L516-2 test_fun_#t~post2 := test_fun_~i~0;test_fun_~i~0 := 1 + test_fun_#t~post2;havoc test_fun_#t~post2; 140#L516-3 [2020-07-29 03:25:14,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:14,689 INFO L82 PathProgramCache]: Analyzing trace with hash 889568397, now seen corresponding path program 1 times [2020-07-29 03:25:14,690 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:25:14,690 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076656559] [2020-07-29 03:25:14,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:25:14,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:14,768 INFO L280 TraceCheckUtils]: 0: Hoare triple {172#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {172#true} is VALID [2020-07-29 03:25:14,768 INFO L280 TraceCheckUtils]: 1: Hoare triple {172#true} havoc main_#res;havoc main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~nondet10, main_#t~post9, main_~k~0, main_#t~ret11, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet7;havoc main_#t~nondet7; {172#true} is VALID [2020-07-29 03:25:14,769 INFO L280 TraceCheckUtils]: 2: Hoare triple {172#true} assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); {174#(<= 1 ULTIMATE.start_main_~array_size~0)} is VALID [2020-07-29 03:25:14,770 INFO L280 TraceCheckUtils]: 3: Hoare triple {174#(<= 1 ULTIMATE.start_main_~array_size~0)} 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;main_~k~0 := 0; {175#(and (<= 1 ULTIMATE.start_main_~array_size~0) (= 0 ULTIMATE.start_main_~k~0))} is VALID [2020-07-29 03:25:14,771 INFO L280 TraceCheckUtils]: 4: Hoare triple {175#(and (<= 1 ULTIMATE.start_main_~array_size~0) (= 0 ULTIMATE.start_main_~k~0))} assume !(main_~k~0 < main_~array_size~0); {173#false} is VALID [2020-07-29 03:25:14,771 INFO L280 TraceCheckUtils]: 5: Hoare triple {173#false} 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; {173#false} is VALID [2020-07-29 03:25:14,772 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 03:25:14,773 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076656559] [2020-07-29 03:25:14,773 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 03:25:14,774 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-29 03:25:14,774 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596448830] [2020-07-29 03:25:14,777 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-29 03:25:14,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:14,778 INFO L82 PathProgramCache]: Analyzing trace with hash 1882892, now seen corresponding path program 1 times [2020-07-29 03:25:14,778 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:25:14,778 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995423954] [2020-07-29 03:25:14,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:25:14,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:14,785 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:14,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:14,790 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:14,792 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:25:14,837 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 03:25:14,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-29 03:25:14,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-07-29 03:25:14,840 INFO L87 Difference]: Start difference. First operand 12 states and 16 transitions. cyclomatic complexity: 6 Second operand 4 states. [2020-07-29 03:25:14,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:25:14,894 INFO L93 Difference]: Finished difference Result 13 states and 16 transitions. [2020-07-29 03:25:14,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-29 03:25:14,894 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 03:25:14,903 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:25:14,904 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 16 transitions. [2020-07-29 03:25:14,905 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-29 03:25:14,906 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 13 states and 16 transitions. [2020-07-29 03:25:14,906 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2020-07-29 03:25:14,906 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2020-07-29 03:25:14,906 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 16 transitions. [2020-07-29 03:25:14,907 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 03:25:14,907 INFO L688 BuchiCegarLoop]: Abstraction has 13 states and 16 transitions. [2020-07-29 03:25:14,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 16 transitions. [2020-07-29 03:25:14,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12. [2020-07-29 03:25:14,908 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:25:14,908 INFO L82 GeneralOperation]: Start isEquivalent. First operand 13 states and 16 transitions. Second operand 12 states. [2020-07-29 03:25:14,908 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states and 16 transitions. Second operand 12 states. [2020-07-29 03:25:14,908 INFO L87 Difference]: Start difference. First operand 13 states and 16 transitions. Second operand 12 states. [2020-07-29 03:25:14,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:25:14,909 INFO L93 Difference]: Finished difference Result 13 states and 16 transitions. [2020-07-29 03:25:14,909 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 16 transitions. [2020-07-29 03:25:14,910 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:25:14,910 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:25:14,910 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states. Second operand 13 states and 16 transitions. [2020-07-29 03:25:14,910 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 13 states and 16 transitions. [2020-07-29 03:25:14,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:25:14,911 INFO L93 Difference]: Finished difference Result 13 states and 16 transitions. [2020-07-29 03:25:14,911 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 16 transitions. [2020-07-29 03:25:14,912 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:25:14,912 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:25:14,912 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:25:14,912 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:25:14,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-29 03:25:14,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 15 transitions. [2020-07-29 03:25:14,913 INFO L711 BuchiCegarLoop]: Abstraction has 12 states and 15 transitions. [2020-07-29 03:25:14,913 INFO L591 BuchiCegarLoop]: Abstraction has 12 states and 15 transitions. [2020-07-29 03:25:14,913 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2020-07-29 03:25:14,913 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 15 transitions. [2020-07-29 03:25:14,914 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-29 03:25:14,914 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:25:14,914 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:25:14,915 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:25:14,915 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-07-29 03:25:14,915 INFO L794 eck$LassoCheckResult]: Stem: 197#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 191#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~nondet10, main_#t~post9, main_~k~0, main_#t~ret11, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet7;havoc main_#t~nondet7; 192#L526 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 196#L526-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;main_~k~0 := 0; 199#L531-3 assume !!(main_~k~0 < main_~array_size~0);call write~int(main_#t~nondet10, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~k~0, 4);havoc main_#t~nondet10; 200#L531-2 main_#t~post9 := main_~k~0;main_~k~0 := 1 + main_#t~post9;havoc main_#t~post9; 201#L531-3 assume !(main_~k~0 < main_~array_size~0); 202#L531-4 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; 198#L516-3 [2020-07-29 03:25:14,915 INFO L796 eck$LassoCheckResult]: Loop: 198#L516-3 assume !!(test_fun_~i~0 < test_fun_~N); 195#L517-3 call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 193#L517-1 assume !(test_fun_#t~mem3 > 0);havoc test_fun_#t~mem3; 194#L516-2 test_fun_#t~post2 := test_fun_~i~0;test_fun_~i~0 := 1 + test_fun_#t~post2;havoc test_fun_#t~post2; 198#L516-3 [2020-07-29 03:25:14,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:14,915 INFO L82 PathProgramCache]: Analyzing trace with hash 176793839, now seen corresponding path program 1 times [2020-07-29 03:25:14,916 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:25:14,916 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73580125] [2020-07-29 03:25:14,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:25:14,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:14,930 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:14,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:14,943 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:14,947 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:25:14,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:14,948 INFO L82 PathProgramCache]: Analyzing trace with hash 1882892, now seen corresponding path program 2 times [2020-07-29 03:25:14,948 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:25:14,948 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111465517] [2020-07-29 03:25:14,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:25:14,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:14,955 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:14,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:14,959 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:14,962 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:25:14,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:14,962 INFO L82 PathProgramCache]: Analyzing trace with hash -357810950, now seen corresponding path program 1 times [2020-07-29 03:25:14,962 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:25:14,963 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598343113] [2020-07-29 03:25:14,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:25:14,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:14,980 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:15,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:15,005 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:15,018 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:25:15,379 WARN L193 SmtUtils]: Spent 299.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 68 [2020-07-29 03:25:15,499 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 03:25:15,500 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 03:25:15,500 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 03:25:15,500 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 03:25:15,500 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 03:25:15,501 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:15,501 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 03:25:15,501 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 03:25:15,501 INFO L133 ssoRankerPreferences]: Filename of dumped script: array01-alloca-2.i_Iteration3_Lasso [2020-07-29 03:25:15,501 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 03:25:15,501 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 03:25:15,524 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 03:25:15,696 WARN L193 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 55 [2020-07-29 03:25:15,720 WARN L257 bleTransFormulaUtils]: 1 quantified variables [2020-07-29 03:25:15,720 WARN L257 bleTransFormulaUtils]: 1 quantified variables [2020-07-29 03:25:15,725 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 03:25:15,728 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 03:25:15,731 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 03:25:15,742 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 03:25:15,745 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 03:25:15,750 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 03:25:15,754 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 03:25:15,757 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 03:25:15,760 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 03:25:15,763 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 03:25:15,767 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 03:25:15,771 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 03:25:15,775 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 03:25:15,779 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 03:25:15,782 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 03:25:15,786 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 03:25:15,790 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 03:25:16,414 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 03:25:16,414 INFO L489 LassoAnalysis]: Using template 'affine'. 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 03:25:16,419 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 03:25:16,421 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:16,421 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:16,421 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:16,422 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:16,427 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:25:16,427 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:25:16,433 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 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:16,469 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 03:25:16,471 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:16,471 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:16,472 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:16,472 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:16,475 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:25:16,475 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:25:16,481 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 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 03:25:16,509 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 03:25:16,510 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:16,510 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:16,510 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:16,510 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:16,513 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:25:16,514 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:25:16,518 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 03:25:16,552 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 03:25:16,555 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:16,555 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:16,555 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:16,556 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:16,564 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:25:16,564 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:25:16,584 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 03:25:16,605 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2020-07-29 03:25:16,605 INFO L444 ModelExtractionUtils]: 25 out of 37 variables were initially zero. Simplification set additionally 9 variables to zero. 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 03:25:16,608 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 03:25:16,612 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-07-29 03:25:16,613 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 03:25:16,613 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 03:25:16,654 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2020-07-29 03:25:16,658 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 03:25:16,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:16,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:16,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:16,691 INFO L263 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 03:25:16,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:16,698 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:25:16,706 INFO L280 TraceCheckUtils]: 0: Hoare triple {238#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {238#unseeded} is VALID [2020-07-29 03:25:16,707 INFO L280 TraceCheckUtils]: 1: Hoare triple {238#unseeded} havoc main_#res;havoc main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~nondet10, main_#t~post9, main_~k~0, main_#t~ret11, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet7;havoc main_#t~nondet7; {238#unseeded} is VALID [2020-07-29 03:25:16,708 INFO L280 TraceCheckUtils]: 2: Hoare triple {238#unseeded} assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); {238#unseeded} is VALID [2020-07-29 03:25:16,709 INFO L280 TraceCheckUtils]: 3: Hoare triple {238#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;main_~k~0 := 0; {238#unseeded} is VALID [2020-07-29 03:25:16,710 INFO L280 TraceCheckUtils]: 4: Hoare triple {238#unseeded} assume !!(main_~k~0 < main_~array_size~0);call write~int(main_#t~nondet10, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~k~0, 4);havoc main_#t~nondet10; {238#unseeded} is VALID [2020-07-29 03:25:16,711 INFO L280 TraceCheckUtils]: 5: Hoare triple {238#unseeded} main_#t~post9 := main_~k~0;main_~k~0 := 1 + main_#t~post9;havoc main_#t~post9; {238#unseeded} is VALID [2020-07-29 03:25:16,712 INFO L280 TraceCheckUtils]: 6: Hoare triple {238#unseeded} assume !(main_~k~0 < main_~array_size~0); {238#unseeded} is VALID [2020-07-29 03:25:16,713 INFO L280 TraceCheckUtils]: 7: Hoare triple {238#unseeded} 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; {238#unseeded} is VALID [2020-07-29 03:25:16,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:16,719 INFO L263 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 03:25:16,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:16,723 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:25:16,746 INFO L280 TraceCheckUtils]: 0: Hoare triple {241#(>= oldRank0 (+ ULTIMATE.start_test_fun_~N (* (- 1) ULTIMATE.start_test_fun_~i~0)))} assume !!(test_fun_~i~0 < test_fun_~N); {297#(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 03:25:16,747 INFO L280 TraceCheckUtils]: 1: Hoare triple {297#(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); {297#(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 03:25:16,748 INFO L280 TraceCheckUtils]: 2: Hoare triple {297#(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; {297#(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 03:25:16,749 INFO L280 TraceCheckUtils]: 3: Hoare triple {297#(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; {271#(or (and (>= oldRank0 0) (> oldRank0 (+ ULTIMATE.start_test_fun_~N (* (- 1) ULTIMATE.start_test_fun_~i~0)))) unseeded)} is VALID [2020-07-29 03:25:16,749 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 03:25:16,750 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 03:25:16,760 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:25:16,760 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 8 letters. Loop has 4 letters. [2020-07-29 03:25:16,760 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:16,760 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 03:25:16,760 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states and 15 transitions. cyclomatic complexity: 5 Second operand 3 states. [2020-07-29 03:25:16,798 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states and 15 transitions. cyclomatic complexity: 5. Second operand 3 states. Result 17 states and 22 transitions. Complement of second has 4 states. [2020-07-29 03:25:16,799 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 03:25:16,799 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:25:16,799 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 15 transitions. cyclomatic complexity: 5 [2020-07-29 03:25:16,799 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:25:16,799 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:25:16,799 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. [2020-07-29 03:25:16,800 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 03:25:16,801 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:25:16,801 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:25:16,801 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 22 transitions. [2020-07-29 03:25:16,802 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 03:25:16,802 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:25:16,802 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:25:16,803 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 12 states and 15 transitions. cyclomatic complexity: 5 [2020-07-29 03:25:16,804 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 4 examples of accepted words. [2020-07-29 03:25:16,804 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 3 states. [2020-07-29 03:25:16,805 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 03:25:16,806 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 03:25:16,806 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 17 states and 22 transitions. cyclomatic complexity: 8 [2020-07-29 03:25:16,807 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 03:25:16,807 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 15 transitions. cyclomatic complexity: 5 Stem has 8 letters. Loop has 4 letters. [2020-07-29 03:25:16,807 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:16,807 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 8 letters. Loop has 4 letters. [2020-07-29 03:25:16,807 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:16,807 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 22 transitions. cyclomatic complexity: 8 Stem has 8 letters. Loop has 4 letters. [2020-07-29 03:25:16,808 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:16,808 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 15 transitions. cyclomatic complexity: 5 Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:25:16,808 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:16,808 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:25:16,808 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:16,809 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 22 transitions. cyclomatic complexity: 8 Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:25:16,809 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:16,809 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 15 transitions. cyclomatic complexity: 5 Stem has 10 letters. Loop has 2 letters. [2020-07-29 03:25:16,809 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:16,809 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 10 letters. Loop has 2 letters. [2020-07-29 03:25:16,810 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:16,810 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 22 transitions. cyclomatic complexity: 8 Stem has 10 letters. Loop has 2 letters. [2020-07-29 03:25:16,810 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:16,810 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 15 transitions. cyclomatic complexity: 5 Stem has 17 letters. Loop has 17 letters. [2020-07-29 03:25:16,810 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:16,810 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 17 letters. Loop has 17 letters. [2020-07-29 03:25:16,811 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:16,811 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 22 transitions. cyclomatic complexity: 8 Stem has 17 letters. Loop has 17 letters. [2020-07-29 03:25:16,811 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:16,811 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 15 transitions. cyclomatic complexity: 5 Stem has 12 letters. Loop has 12 letters. [2020-07-29 03:25:16,811 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:16,811 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 12 letters. Loop has 12 letters. [2020-07-29 03:25:16,812 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:16,812 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 22 transitions. cyclomatic complexity: 8 Stem has 12 letters. Loop has 12 letters. [2020-07-29 03:25:16,812 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:16,812 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 15 transitions. cyclomatic complexity: 5 Stem has 3 letters. Loop has 3 letters. [2020-07-29 03:25:16,812 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:16,812 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 03:25:16,812 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:16,813 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 22 transitions. cyclomatic complexity: 8 Stem has 3 letters. Loop has 3 letters. [2020-07-29 03:25:16,813 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:16,813 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 15 transitions. cyclomatic complexity: 5 Stem has 10 letters. Loop has 2 letters. [2020-07-29 03:25:16,813 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:16,813 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 10 letters. Loop has 2 letters. [2020-07-29 03:25:16,814 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:16,814 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 22 transitions. cyclomatic complexity: 8 Stem has 10 letters. Loop has 2 letters. [2020-07-29 03:25:16,814 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:16,814 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 15 transitions. cyclomatic complexity: 5 Stem has 11 letters. Loop has 4 letters. [2020-07-29 03:25:16,814 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:16,815 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 11 letters. Loop has 4 letters. [2020-07-29 03:25:16,815 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:16,815 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 22 transitions. cyclomatic complexity: 8 Stem has 11 letters. Loop has 4 letters. [2020-07-29 03:25:16,815 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:16,815 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 15 transitions. cyclomatic complexity: 5 Stem has 9 letters. Loop has 2 letters. [2020-07-29 03:25:16,816 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:16,816 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 9 letters. Loop has 2 letters. [2020-07-29 03:25:16,816 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:16,816 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 22 transitions. cyclomatic complexity: 8 Stem has 9 letters. Loop has 2 letters. [2020-07-29 03:25:16,816 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:16,816 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 15 transitions. cyclomatic complexity: 5 Stem has 8 letters. Loop has 4 letters. [2020-07-29 03:25:16,817 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:16,817 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 8 letters. Loop has 4 letters. [2020-07-29 03:25:16,817 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:16,817 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 22 transitions. cyclomatic complexity: 8 Stem has 8 letters. Loop has 4 letters. [2020-07-29 03:25:16,817 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:16,818 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 15 transitions. cyclomatic complexity: 5 Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:25:16,818 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:16,818 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:25:16,818 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:16,818 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 22 transitions. cyclomatic complexity: 8 Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:25:16,818 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:16,819 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 15 transitions. cyclomatic complexity: 5 Stem has 10 letters. Loop has 2 letters. [2020-07-29 03:25:16,819 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:16,819 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 10 letters. Loop has 2 letters. [2020-07-29 03:25:16,819 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:16,819 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 22 transitions. cyclomatic complexity: 8 Stem has 10 letters. Loop has 2 letters. [2020-07-29 03:25:16,820 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:16,820 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 15 transitions. cyclomatic complexity: 5 Stem has 11 letters. Loop has 2 letters. [2020-07-29 03:25:16,820 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:16,820 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 11 letters. Loop has 2 letters. [2020-07-29 03:25:16,820 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:16,821 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 22 transitions. cyclomatic complexity: 8 Stem has 11 letters. Loop has 2 letters. [2020-07-29 03:25:16,821 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:16,821 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:25:16,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 03:25:16,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 14 transitions. [2020-07-29 03:25:16,822 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 8 letters. Loop has 4 letters. [2020-07-29 03:25:16,822 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:16,822 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 12 letters. Loop has 4 letters. [2020-07-29 03:25:16,823 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:16,823 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 8 letters. Loop has 8 letters. [2020-07-29 03:25:16,823 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:16,823 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 22 transitions. cyclomatic complexity: 8 [2020-07-29 03:25:16,825 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 03:25:16,826 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 16 states and 21 transitions. [2020-07-29 03:25:16,826 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2020-07-29 03:25:16,826 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2020-07-29 03:25:16,826 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 21 transitions. [2020-07-29 03:25:16,826 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 03:25:16,826 INFO L688 BuchiCegarLoop]: Abstraction has 16 states and 21 transitions. [2020-07-29 03:25:16,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 21 transitions. [2020-07-29 03:25:16,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2020-07-29 03:25:16,828 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:25:16,828 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states and 21 transitions. Second operand 15 states. [2020-07-29 03:25:16,828 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states and 21 transitions. Second operand 15 states. [2020-07-29 03:25:16,828 INFO L87 Difference]: Start difference. First operand 16 states and 21 transitions. Second operand 15 states. [2020-07-29 03:25:16,831 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 03:25:16,833 INFO L93 Difference]: Finished difference Result 16 states and 21 transitions. [2020-07-29 03:25:16,833 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 21 transitions. [2020-07-29 03:25:16,834 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:25:16,834 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:25:16,834 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand 16 states and 21 transitions. [2020-07-29 03:25:16,834 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 16 states and 21 transitions. [2020-07-29 03:25:16,835 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 03:25:16,837 INFO L93 Difference]: Finished difference Result 17 states and 22 transitions. [2020-07-29 03:25:16,837 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 22 transitions. [2020-07-29 03:25:16,837 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:25:16,837 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:25:16,837 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:25:16,838 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:25:16,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-07-29 03:25:16,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 20 transitions. [2020-07-29 03:25:16,839 INFO L711 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2020-07-29 03:25:16,839 INFO L591 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2020-07-29 03:25:16,839 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2020-07-29 03:25:16,839 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 20 transitions. [2020-07-29 03:25:16,840 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 03:25:16,840 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:25:16,840 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:25:16,840 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:25:16,840 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-29 03:25:16,841 INFO L794 eck$LassoCheckResult]: Stem: 338#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 335#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~nondet10, main_#t~post9, main_~k~0, main_#t~ret11, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet7;havoc main_#t~nondet7; 336#L526 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 337#L526-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;main_~k~0 := 0; 340#L531-3 assume !!(main_~k~0 < main_~array_size~0);call write~int(main_#t~nondet10, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~k~0, 4);havoc main_#t~nondet10; 342#L531-2 main_#t~post9 := main_~k~0;main_~k~0 := 1 + main_#t~post9;havoc main_#t~post9; 343#L531-3 assume !(main_~k~0 < main_~array_size~0); 344#L531-4 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; 341#L516-3 assume !!(test_fun_~i~0 < test_fun_~N); 331#L517-3 [2020-07-29 03:25:16,841 INFO L796 eck$LassoCheckResult]: Loop: 331#L517-3 call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 330#L517-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; 331#L517-3 [2020-07-29 03:25:16,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:16,841 INFO L82 PathProgramCache]: Analyzing trace with hash 1185641744, now seen corresponding path program 1 times [2020-07-29 03:25:16,842 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:25:16,842 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275849717] [2020-07-29 03:25:16,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:25:16,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:16,855 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:16,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:16,866 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:16,870 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:25:16,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:16,871 INFO L82 PathProgramCache]: Analyzing trace with hash 2118, now seen corresponding path program 1 times [2020-07-29 03:25:16,871 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:25:16,871 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054950016] [2020-07-29 03:25:16,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:25:16,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:16,877 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:16,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:16,885 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:16,889 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:25:16,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:16,892 INFO L82 PathProgramCache]: Analyzing trace with hash 1235383701, now seen corresponding path program 1 times [2020-07-29 03:25:16,892 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:25:16,892 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811764639] [2020-07-29 03:25:16,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:25:16,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:16,926 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:16,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:16,949 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:16,953 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:25:17,233 WARN L193 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 71 [2020-07-29 03:25:17,352 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 03:25:17,352 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 03:25:17,352 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 03:25:17,352 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 03:25:17,353 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 03:25:17,353 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:17,353 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 03:25:17,353 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 03:25:17,353 INFO L133 ssoRankerPreferences]: Filename of dumped script: array01-alloca-2.i_Iteration4_Lasso [2020-07-29 03:25:17,353 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 03:25:17,353 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 03:25:17,377 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 03:25:17,381 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 03:25:17,385 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 03:25:17,389 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 03:25:17,392 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 03:25:17,396 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 03:25:17,400 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 03:25:17,405 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 03:25:17,407 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 03:25:17,411 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 03:25:17,414 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 03:25:17,418 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 03:25:17,421 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 03:25:17,604 WARN L193 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 58 [2020-07-29 03:25:17,671 WARN L257 bleTransFormulaUtils]: 1 quantified variables [2020-07-29 03:25:17,672 WARN L257 bleTransFormulaUtils]: 1 quantified variables [2020-07-29 03:25:17,678 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 03:25:17,680 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 03:25:17,698 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 03:25:17,703 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 03:25:17,707 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 03:25:18,405 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 03:25:18,405 INFO L489 LassoAnalysis]: Using template 'affine'. 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 03:25:18,409 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:25:18,410 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:18,410 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:25:18,411 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:18,411 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:18,411 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:18,411 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:25:18,411 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:25:18,412 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 03:25:18,436 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:25:18,437 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:18,438 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:18,438 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:18,438 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:18,440 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:25:18,440 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:25:18,443 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 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 03:25:18,469 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 03:25:18,471 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:18,471 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:18,471 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:18,471 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:18,473 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:25:18,473 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:25:18,478 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 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 03:25:18,500 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 03:25:18,501 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:18,501 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:25:18,501 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:18,501 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:18,502 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:18,502 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:25:18,502 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:25:18,506 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 03:25:18,529 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 03:25:18,531 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:18,531 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:25:18,531 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:18,531 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:18,531 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:18,532 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:25:18,532 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:25:18,533 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 03:25:18,556 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 03:25:18,558 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:18,558 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:18,558 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:18,558 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:18,559 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:25:18,559 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:25:18,563 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 03:25:18,592 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 03:25:18,593 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:18,594 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:25:18,594 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:18,594 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:18,594 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:18,594 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:25:18,595 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:25:18,606 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) [2020-07-29 03:25:18,643 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 03:25:18,646 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:18,646 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:25:18,646 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:18,647 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:18,647 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:18,647 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:25:18,647 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:18,649 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) [2020-07-29 03:25:18,688 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:18,690 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:18,690 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:25:18,691 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:18,691 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:18,691 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:18,691 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:25:18,691 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:25:18,693 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) Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:18,715 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 03:25:18,716 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:18,716 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:25:18,716 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:18,716 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:18,716 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:18,716 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:25:18,717 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:25:18,718 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) Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:18,740 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 03:25:18,742 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:18,742 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:18,742 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:18,742 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:18,744 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:25:18,744 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:25:18,747 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) Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:18,770 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 03:25:18,771 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:18,771 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:25:18,771 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:18,771 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:18,771 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:18,772 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:25:18,772 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:25:18,773 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 03:25:18,796 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 03:25:18,797 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:18,798 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:18,798 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:18,798 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:18,803 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:25:18,803 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:25:18,816 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) Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:18,849 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 03:25:18,850 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:18,850 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:18,850 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:18,851 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:18,856 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:25:18,856 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:25:18,863 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 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 03:25:18,886 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:25:18,887 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:18,887 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:18,887 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:18,888 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:18,891 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:25:18,891 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:25:18,899 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 03:25:18,916 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2020-07-29 03:25:18,916 INFO L444 ModelExtractionUtils]: 5 out of 10 variables were initially zero. Simplification set additionally 3 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:25:18,925 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:18,928 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-07-29 03:25:18,929 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 03:25:18,929 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~numbers~0.base) (+ ULTIMATE.start_main_~numbers~0.offset (* ULTIMATE.start_main_~k~0 4) (- 4)))_1) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~numbers~0.base) (+ ULTIMATE.start_main_~numbers~0.offset (* ULTIMATE.start_main_~k~0 4) (- 4)))_1 Supporting invariants [] [2020-07-29 03:25:18,977 INFO L297 tatePredicateManager]: 4 out of 6 supporting invariants were superfluous and have been removed [2020-07-29 03:25:18,987 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 03:25:18,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:18,993 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-29 03:25:19,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:19,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:19,037 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 16 conjunts are in the unsatisfiable core [2020-07-29 03:25:19,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:19,052 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:25:19,116 INFO L280 TraceCheckUtils]: 0: Hoare triple {436#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {436#unseeded} is VALID [2020-07-29 03:25:19,118 INFO L280 TraceCheckUtils]: 1: Hoare triple {436#unseeded} havoc main_#res;havoc main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~nondet10, main_#t~post9, main_~k~0, main_#t~ret11, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet7;havoc main_#t~nondet7; {436#unseeded} is VALID [2020-07-29 03:25:19,118 INFO L280 TraceCheckUtils]: 2: Hoare triple {436#unseeded} assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); {436#unseeded} is VALID [2020-07-29 03:25:19,119 INFO L280 TraceCheckUtils]: 3: Hoare triple {436#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;main_~k~0 := 0; {499#(and (= 0 ULTIMATE.start_main_~k~0) unseeded)} is VALID [2020-07-29 03:25:19,120 INFO L280 TraceCheckUtils]: 4: Hoare triple {499#(and (= 0 ULTIMATE.start_main_~k~0) unseeded)} assume !!(main_~k~0 < main_~array_size~0);call write~int(main_#t~nondet10, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~k~0, 4);havoc main_#t~nondet10; {499#(and (= 0 ULTIMATE.start_main_~k~0) unseeded)} is VALID [2020-07-29 03:25:19,121 INFO L280 TraceCheckUtils]: 5: Hoare triple {499#(and (= 0 ULTIMATE.start_main_~k~0) unseeded)} main_#t~post9 := main_~k~0;main_~k~0 := 1 + main_#t~post9;havoc main_#t~post9; {506#(and (= 1 ULTIMATE.start_main_~k~0) unseeded)} is VALID [2020-07-29 03:25:19,122 INFO L280 TraceCheckUtils]: 6: Hoare triple {506#(and (= 1 ULTIMATE.start_main_~k~0) unseeded)} assume !(main_~k~0 < main_~array_size~0); {506#(and (= 1 ULTIMATE.start_main_~k~0) unseeded)} is VALID [2020-07-29 03:25:19,125 INFO L280 TraceCheckUtils]: 7: Hoare triple {506#(and (= 1 ULTIMATE.start_main_~k~0) unseeded)} 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; {513#(and (= 1 ULTIMATE.start_main_~k~0) (= ULTIMATE.start_main_~numbers~0.base ULTIMATE.start_test_fun_~a.base) (= 0 ULTIMATE.start_test_fun_~i~0) (= ULTIMATE.start_main_~numbers~0.offset ULTIMATE.start_test_fun_~a.offset) unseeded)} is VALID [2020-07-29 03:25:19,128 INFO L280 TraceCheckUtils]: 8: Hoare triple {513#(and (= 1 ULTIMATE.start_main_~k~0) (= ULTIMATE.start_main_~numbers~0.base ULTIMATE.start_test_fun_~a.base) (= 0 ULTIMATE.start_test_fun_~i~0) (= ULTIMATE.start_main_~numbers~0.offset ULTIMATE.start_test_fun_~a.offset) unseeded)} assume !!(test_fun_~i~0 < test_fun_~N); {481#(and (= (+ ULTIMATE.start_main_~numbers~0.offset (* ULTIMATE.start_main_~k~0 4) (- 4)) (+ ULTIMATE.start_test_fun_~a.offset (* ULTIMATE.start_test_fun_~i~0 4))) (= ULTIMATE.start_main_~numbers~0.base ULTIMATE.start_test_fun_~a.base) unseeded)} is VALID [2020-07-29 03:25:19,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:19,135 INFO L263 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 9 conjunts are in the unsatisfiable core [2020-07-29 03:25:19,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:19,142 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:25:19,184 INFO L280 TraceCheckUtils]: 0: Hoare triple {482#(and (>= oldRank0 (select (select |#memory_int| ULTIMATE.start_main_~numbers~0.base) (+ ULTIMATE.start_main_~numbers~0.offset (* ULTIMATE.start_main_~k~0 4) (- 4)))) (= (+ ULTIMATE.start_main_~numbers~0.offset (* ULTIMATE.start_main_~k~0 4) (- 4)) (+ ULTIMATE.start_test_fun_~a.offset (* ULTIMATE.start_test_fun_~i~0 4))) (= ULTIMATE.start_main_~numbers~0.base ULTIMATE.start_test_fun_~a.base))} call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); {517#(and (<= (select (select |#memory_int| ULTIMATE.start_main_~numbers~0.base) (+ ULTIMATE.start_main_~numbers~0.offset (* ULTIMATE.start_main_~k~0 4) (- 4))) oldRank0) (= ULTIMATE.start_main_~numbers~0.base ULTIMATE.start_test_fun_~a.base) (<= |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))) (= (+ ULTIMATE.start_main_~numbers~0.offset (* 4 ULTIMATE.start_main_~k~0)) (+ (* 4 ULTIMATE.start_test_fun_~i~0) ULTIMATE.start_test_fun_~a.offset 4)))} is VALID [2020-07-29 03:25:19,186 INFO L280 TraceCheckUtils]: 1: Hoare triple {517#(and (<= (select (select |#memory_int| ULTIMATE.start_main_~numbers~0.base) (+ ULTIMATE.start_main_~numbers~0.offset (* ULTIMATE.start_main_~k~0 4) (- 4))) oldRank0) (= ULTIMATE.start_main_~numbers~0.base ULTIMATE.start_test_fun_~a.base) (<= |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))) (= (+ ULTIMATE.start_main_~numbers~0.offset (* 4 ULTIMATE.start_main_~k~0)) (+ (* 4 ULTIMATE.start_test_fun_~i~0) ULTIMATE.start_test_fun_~a.offset 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; {484#(and (= (+ ULTIMATE.start_main_~numbers~0.offset (* ULTIMATE.start_main_~k~0 4) (- 4)) (+ ULTIMATE.start_test_fun_~a.offset (* ULTIMATE.start_test_fun_~i~0 4))) (= ULTIMATE.start_main_~numbers~0.base ULTIMATE.start_test_fun_~a.base) (or (and (> oldRank0 (select (select |#memory_int| ULTIMATE.start_main_~numbers~0.base) (+ ULTIMATE.start_main_~numbers~0.offset (* ULTIMATE.start_main_~k~0 4) (- 4)))) (>= oldRank0 0)) unseeded))} is VALID [2020-07-29 03:25:19,187 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 03:25:19,187 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-29 03:25:19,204 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 03:25:19,204 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 9 letters. Loop has 2 letters. [2020-07-29 03:25:19,205 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:19,205 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.4 stem predicates 2 loop predicates [2020-07-29 03:25:19,205 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 20 transitions. cyclomatic complexity: 8 Second operand 6 states. [2020-07-29 03:25:19,407 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states and 20 transitions. cyclomatic complexity: 8. Second operand 6 states. Result 32 states and 41 transitions. Complement of second has 11 states. [2020-07-29 03:25:19,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 4 stem states 2 non-accepting loop states 2 accepting loop states [2020-07-29 03:25:19,407 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:25:19,408 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 20 transitions. cyclomatic complexity: 8 [2020-07-29 03:25:19,408 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:25:19,408 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:25:19,408 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6 states. [2020-07-29 03:25:19,409 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 03:25:19,410 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:25:19,410 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:25:19,410 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 41 transitions. [2020-07-29 03:25:19,411 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 03:25:19,411 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:25:19,411 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:25:19,412 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 15 states and 20 transitions. cyclomatic complexity: 8 [2020-07-29 03:25:19,412 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 03:25:19,412 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 6 states. [2020-07-29 03:25:19,413 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 03:25:19,414 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 03:25:19,414 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 32 states and 41 transitions. cyclomatic complexity: 14 [2020-07-29 03:25:19,415 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 03:25:19,415 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 20 transitions. cyclomatic complexity: 8 Stem has 9 letters. Loop has 2 letters. [2020-07-29 03:25:19,415 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:19,415 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 9 letters. Loop has 2 letters. [2020-07-29 03:25:19,415 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:19,415 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 41 transitions. cyclomatic complexity: 14 Stem has 9 letters. Loop has 2 letters. [2020-07-29 03:25:19,416 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:19,416 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 20 transitions. cyclomatic complexity: 8 Stem has 4 letters. Loop has 2 letters. [2020-07-29 03:25:19,416 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:19,416 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 4 letters. Loop has 2 letters. [2020-07-29 03:25:19,416 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:19,416 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 41 transitions. cyclomatic complexity: 14 Stem has 4 letters. Loop has 2 letters. [2020-07-29 03:25:19,417 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:19,417 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 20 transitions. cyclomatic complexity: 8 Stem has 13 letters. Loop has 2 letters. [2020-07-29 03:25:19,417 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:19,417 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 13 letters. Loop has 2 letters. [2020-07-29 03:25:19,417 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:19,417 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 41 transitions. cyclomatic complexity: 14 Stem has 13 letters. Loop has 2 letters. [2020-07-29 03:25:19,418 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:19,418 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 20 transitions. cyclomatic complexity: 8 Stem has 32 letters. Loop has 32 letters. [2020-07-29 03:25:19,418 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:19,418 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 32 letters. Loop has 32 letters. [2020-07-29 03:25:19,418 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:19,418 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 41 transitions. cyclomatic complexity: 14 Stem has 32 letters. Loop has 32 letters. [2020-07-29 03:25:19,418 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:19,419 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 20 transitions. cyclomatic complexity: 8 Stem has 15 letters. Loop has 15 letters. [2020-07-29 03:25:19,419 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:19,419 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 15 letters. Loop has 15 letters. [2020-07-29 03:25:19,419 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:19,419 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 41 transitions. cyclomatic complexity: 14 Stem has 15 letters. Loop has 15 letters. [2020-07-29 03:25:19,419 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:19,420 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 20 transitions. cyclomatic complexity: 8 Stem has 8 letters. Loop has 8 letters. [2020-07-29 03:25:19,420 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:19,420 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 8 letters. Loop has 8 letters. [2020-07-29 03:25:19,420 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:19,420 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 41 transitions. cyclomatic complexity: 14 Stem has 8 letters. Loop has 8 letters. [2020-07-29 03:25:19,420 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:19,420 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 20 transitions. cyclomatic complexity: 8 Stem has 10 letters. Loop has 2 letters. [2020-07-29 03:25:19,421 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:19,421 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 10 letters. Loop has 2 letters. [2020-07-29 03:25:19,421 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:19,421 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 41 transitions. cyclomatic complexity: 14 Stem has 10 letters. Loop has 2 letters. [2020-07-29 03:25:19,421 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:19,421 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 20 transitions. cyclomatic complexity: 8 Stem has 9 letters. Loop has 2 letters. [2020-07-29 03:25:19,422 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:19,422 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 9 letters. Loop has 2 letters. [2020-07-29 03:25:19,422 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:19,422 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 41 transitions. cyclomatic complexity: 14 Stem has 9 letters. Loop has 2 letters. [2020-07-29 03:25:19,422 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:19,423 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 20 transitions. cyclomatic complexity: 8 Stem has 4 letters. Loop has 2 letters. [2020-07-29 03:25:19,423 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:19,423 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 4 letters. Loop has 2 letters. [2020-07-29 03:25:19,423 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:19,423 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 41 transitions. cyclomatic complexity: 14 Stem has 4 letters. Loop has 2 letters. [2020-07-29 03:25:19,423 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:19,423 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 20 transitions. cyclomatic complexity: 8 Stem has 13 letters. Loop has 2 letters. [2020-07-29 03:25:19,424 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:19,424 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 13 letters. Loop has 2 letters. [2020-07-29 03:25:19,424 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:19,424 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 41 transitions. cyclomatic complexity: 14 Stem has 13 letters. Loop has 2 letters. [2020-07-29 03:25:19,424 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:19,425 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 20 transitions. cyclomatic complexity: 8 Stem has 14 letters. Loop has 2 letters. [2020-07-29 03:25:19,425 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:19,425 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states. Stem has 14 letters. Loop has 2 letters. [2020-07-29 03:25:19,425 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:19,425 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 41 transitions. cyclomatic complexity: 14 Stem has 14 letters. Loop has 2 letters. [2020-07-29 03:25:19,425 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:19,426 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:25:19,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-29 03:25:19,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 20 transitions. [2020-07-29 03:25:19,428 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 20 transitions. Stem has 9 letters. Loop has 2 letters. [2020-07-29 03:25:19,428 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:19,428 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 20 transitions. Stem has 11 letters. Loop has 2 letters. [2020-07-29 03:25:19,428 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:19,429 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 20 transitions. Stem has 9 letters. Loop has 4 letters. [2020-07-29 03:25:19,429 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:19,429 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 41 transitions. cyclomatic complexity: 14 [2020-07-29 03:25:19,431 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 03:25:19,432 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 27 states and 34 transitions. [2020-07-29 03:25:19,433 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2020-07-29 03:25:19,433 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2020-07-29 03:25:19,433 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 34 transitions. [2020-07-29 03:25:19,433 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 03:25:19,433 INFO L688 BuchiCegarLoop]: Abstraction has 27 states and 34 transitions. [2020-07-29 03:25:19,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 34 transitions. [2020-07-29 03:25:19,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 22. [2020-07-29 03:25:19,435 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:25:19,436 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states and 34 transitions. Second operand 22 states. [2020-07-29 03:25:19,436 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states and 34 transitions. Second operand 22 states. [2020-07-29 03:25:19,436 INFO L87 Difference]: Start difference. First operand 27 states and 34 transitions. Second operand 22 states. [2020-07-29 03:25:19,437 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 03:25:19,439 INFO L93 Difference]: Finished difference Result 27 states and 34 transitions. [2020-07-29 03:25:19,439 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 34 transitions. [2020-07-29 03:25:19,440 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:25:19,440 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:25:19,440 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 27 states and 34 transitions. [2020-07-29 03:25:19,440 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 27 states and 34 transitions. [2020-07-29 03:25:19,441 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 03:25:19,443 INFO L93 Difference]: Finished difference Result 28 states and 36 transitions. [2020-07-29 03:25:19,444 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 36 transitions. [2020-07-29 03:25:19,444 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:25:19,444 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:25:19,444 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:25:19,444 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:25:19,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2020-07-29 03:25:19,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 29 transitions. [2020-07-29 03:25:19,446 INFO L711 BuchiCegarLoop]: Abstraction has 22 states and 29 transitions. [2020-07-29 03:25:19,446 INFO L591 BuchiCegarLoop]: Abstraction has 22 states and 29 transitions. [2020-07-29 03:25:19,446 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2020-07-29 03:25:19,446 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 29 transitions. [2020-07-29 03:25:19,447 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 03:25:19,447 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:25:19,447 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:25:19,448 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:25:19,448 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-29 03:25:19,448 INFO L794 eck$LassoCheckResult]: Stem: 582#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 575#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~nondet10, main_#t~post9, main_~k~0, main_#t~ret11, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet7;havoc main_#t~nondet7; 576#L526 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 581#L526-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;main_~k~0 := 0; 587#L531-3 assume !!(main_~k~0 < main_~array_size~0);call write~int(main_#t~nondet10, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~k~0, 4);havoc main_#t~nondet10; 588#L531-2 main_#t~post9 := main_~k~0;main_~k~0 := 1 + main_#t~post9;havoc main_#t~post9; 589#L531-3 assume !!(main_~k~0 < main_~array_size~0);call write~int(main_#t~nondet10, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~k~0, 4);havoc main_#t~nondet10; 591#L531-2 main_#t~post9 := main_~k~0;main_~k~0 := 1 + main_#t~post9;havoc main_#t~post9; 596#L531-3 assume !(main_~k~0 < main_~array_size~0); 594#L531-4 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; 593#L516-3 assume !!(test_fun_~i~0 < test_fun_~N); 578#L517-3 [2020-07-29 03:25:19,448 INFO L796 eck$LassoCheckResult]: Loop: 578#L517-3 call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 577#L517-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; 578#L517-3 [2020-07-29 03:25:19,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:19,449 INFO L82 PathProgramCache]: Analyzing trace with hash 1237095790, now seen corresponding path program 2 times [2020-07-29 03:25:19,449 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:25:19,449 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194717243] [2020-07-29 03:25:19,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:25:19,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:19,463 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:19,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:19,475 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:19,479 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:25:19,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:19,479 INFO L82 PathProgramCache]: Analyzing trace with hash 2118, now seen corresponding path program 2 times [2020-07-29 03:25:19,480 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:25:19,480 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606727054] [2020-07-29 03:25:19,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:25:19,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:19,485 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:19,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:19,488 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:19,490 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:25:19,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:19,491 INFO L82 PathProgramCache]: Analyzing trace with hash -856885645, now seen corresponding path program 2 times [2020-07-29 03:25:19,491 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:25:19,491 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401683289] [2020-07-29 03:25:19,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:25:19,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:19,511 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:19,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:19,525 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:19,530 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:25:19,827 WARN L193 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 84 [2020-07-29 03:25:19,953 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 03:25:19,953 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 03:25:19,953 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 03:25:19,953 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 03:25:19,953 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 03:25:19,953 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:19,954 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 03:25:19,954 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 03:25:19,954 INFO L133 ssoRankerPreferences]: Filename of dumped script: array01-alloca-2.i_Iteration5_Lasso [2020-07-29 03:25:19,954 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 03:25:19,954 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 03:25:19,982 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 03:25:19,987 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 03:25:19,991 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 03:25:19,995 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 03:25:19,999 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 03:25:20,156 WARN L193 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 48 [2020-07-29 03:25:20,202 WARN L257 bleTransFormulaUtils]: 2 quantified variables [2020-07-29 03:25:20,206 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 03:25:20,209 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 03:25:20,211 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 03:25:20,215 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 03:25:20,219 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 03:25:20,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 03:25:20,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 03:25:20,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 03:25:20,237 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 03:25:20,241 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 03:25:20,244 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 03:25:20,247 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 03:25:20,251 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 03:25:20,256 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 03:25:20,925 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 03:25:20,925 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:20,928 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 03:25:20,930 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:20,930 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:25:20,931 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:20,931 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:20,931 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:20,932 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:25:20,932 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:25:20,935 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 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:20,956 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 03:25:20,958 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:20,958 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:20,958 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:20,958 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:20,959 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:25:20,959 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:25:20,962 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 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:20,985 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 03:25:20,986 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:20,987 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:20,987 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:20,987 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:20,988 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:25:20,988 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:25:20,992 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 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:25:21,015 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false Waiting until toolchain timeout for monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:21,016 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:21,016 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:21,016 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:21,016 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:21,018 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:25:21,018 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:25:21,021 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 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:21,043 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:25:21,045 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:21,045 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:21,045 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:21,045 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:21,051 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:25:21,051 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:25:21,066 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 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:21,089 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 03:25:21,091 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:21,091 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:21,091 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:21,091 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:21,093 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:25:21,093 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:25:21,098 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 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:21,120 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 03:25:21,121 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:21,121 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:21,122 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:21,122 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:21,124 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:25:21,124 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:25:21,131 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 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:25:21,153 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false Waiting until toolchain timeout for monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:21,155 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:21,155 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:21,155 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:21,155 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:21,156 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:25:21,156 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:25:21,159 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 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:21,186 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:25:21,187 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:21,187 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:25:21,187 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:21,188 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:21,188 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:21,188 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:25:21,188 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:25:21,190 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 03:25:21,192 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2020-07-29 03:25:21,192 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 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:21,196 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 03:25:21,197 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-07-29 03:25:21,198 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 03:25:21,198 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)))_2) = 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)))_2 Supporting invariants [] [2020-07-29 03:25:21,234 INFO L297 tatePredicateManager]: 5 out of 5 supporting invariants were superfluous and have been removed [2020-07-29 03:25:21,236 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 03:25:21,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:21,241 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-29 03:25:21,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:21,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:21,273 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 03:25:21,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:21,281 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:25:21,286 INFO L280 TraceCheckUtils]: 0: Hoare triple {737#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {737#unseeded} is VALID [2020-07-29 03:25:21,287 INFO L280 TraceCheckUtils]: 1: Hoare triple {737#unseeded} havoc main_#res;havoc main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~nondet10, main_#t~post9, main_~k~0, main_#t~ret11, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet7;havoc main_#t~nondet7; {737#unseeded} is VALID [2020-07-29 03:25:21,288 INFO L280 TraceCheckUtils]: 2: Hoare triple {737#unseeded} assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); {737#unseeded} is VALID [2020-07-29 03:25:21,289 INFO L280 TraceCheckUtils]: 3: Hoare triple {737#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;main_~k~0 := 0; {737#unseeded} is VALID [2020-07-29 03:25:21,290 INFO L280 TraceCheckUtils]: 4: Hoare triple {737#unseeded} assume !!(main_~k~0 < main_~array_size~0);call write~int(main_#t~nondet10, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~k~0, 4);havoc main_#t~nondet10; {737#unseeded} is VALID [2020-07-29 03:25:21,290 INFO L280 TraceCheckUtils]: 5: Hoare triple {737#unseeded} main_#t~post9 := main_~k~0;main_~k~0 := 1 + main_#t~post9;havoc main_#t~post9; {737#unseeded} is VALID [2020-07-29 03:25:21,291 INFO L280 TraceCheckUtils]: 6: Hoare triple {737#unseeded} assume !!(main_~k~0 < main_~array_size~0);call write~int(main_#t~nondet10, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~k~0, 4);havoc main_#t~nondet10; {737#unseeded} is VALID [2020-07-29 03:25:21,291 INFO L280 TraceCheckUtils]: 7: Hoare triple {737#unseeded} main_#t~post9 := main_~k~0;main_~k~0 := 1 + main_#t~post9;havoc main_#t~post9; {737#unseeded} is VALID [2020-07-29 03:25:21,291 INFO L280 TraceCheckUtils]: 8: Hoare triple {737#unseeded} assume !(main_~k~0 < main_~array_size~0); {737#unseeded} is VALID [2020-07-29 03:25:21,292 INFO L280 TraceCheckUtils]: 9: Hoare triple {737#unseeded} 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; {737#unseeded} is VALID [2020-07-29 03:25:21,292 INFO L280 TraceCheckUtils]: 10: Hoare triple {737#unseeded} assume !!(test_fun_~i~0 < test_fun_~N); {737#unseeded} is VALID [2020-07-29 03:25:21,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:21,299 INFO L263 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-29 03:25:21,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:21,303 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:25:21,322 INFO L280 TraceCheckUtils]: 0: Hoare triple {740#(>= 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); {810#(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 03:25:21,324 INFO L280 TraceCheckUtils]: 1: Hoare triple {810#(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; {775#(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 03:25:21,324 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 03:25:21,324 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 03:25:21,335 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 03:25:21,335 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 11 letters. Loop has 2 letters. [2020-07-29 03:25:21,335 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:21,336 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 03:25:21,336 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 22 states and 29 transitions. cyclomatic complexity: 11 Second operand 3 states. [2020-07-29 03:25:21,381 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 22 states and 29 transitions. cyclomatic complexity: 11. Second operand 3 states. Result 33 states and 43 transitions. Complement of second has 7 states. [2020-07-29 03:25:21,382 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 03:25:21,382 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:25:21,382 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 29 transitions. cyclomatic complexity: 11 [2020-07-29 03:25:21,382 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:25:21,382 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:25:21,382 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. [2020-07-29 03:25:21,383 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 03:25:21,383 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:25:21,383 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:25:21,384 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 43 transitions. [2020-07-29 03:25:21,384 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 03:25:21,384 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:25:21,384 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:25:21,385 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 22 states and 29 transitions. cyclomatic complexity: 11 [2020-07-29 03:25:21,386 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 03:25:21,386 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 3 states. [2020-07-29 03:25:21,387 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 03:25:21,387 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 03:25:21,387 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 33 states and 43 transitions. cyclomatic complexity: 16 [2020-07-29 03:25:21,388 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 03:25:21,388 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 29 transitions. cyclomatic complexity: 11 Stem has 11 letters. Loop has 2 letters. [2020-07-29 03:25:21,388 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:21,388 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 11 letters. Loop has 2 letters. [2020-07-29 03:25:21,389 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:21,389 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 43 transitions. cyclomatic complexity: 16 Stem has 11 letters. Loop has 2 letters. [2020-07-29 03:25:21,389 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:21,389 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 29 transitions. cyclomatic complexity: 11 Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:25:21,389 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:21,390 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:25:21,390 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:21,390 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 43 transitions. cyclomatic complexity: 16 Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:25:21,390 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:21,390 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 29 transitions. cyclomatic complexity: 11 Stem has 13 letters. Loop has 2 letters. [2020-07-29 03:25:21,391 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:21,391 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 13 letters. Loop has 2 letters. [2020-07-29 03:25:21,391 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:21,391 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 43 transitions. cyclomatic complexity: 16 Stem has 13 letters. Loop has 2 letters. [2020-07-29 03:25:21,391 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:21,392 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 29 transitions. cyclomatic complexity: 11 Stem has 33 letters. Loop has 33 letters. [2020-07-29 03:25:21,392 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:21,392 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 33 letters. Loop has 33 letters. [2020-07-29 03:25:21,392 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:21,392 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 43 transitions. cyclomatic complexity: 16 Stem has 33 letters. Loop has 33 letters. [2020-07-29 03:25:21,393 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:21,393 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 29 transitions. cyclomatic complexity: 11 Stem has 22 letters. Loop has 22 letters. [2020-07-29 03:25:21,393 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:21,393 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 22 letters. Loop has 22 letters. [2020-07-29 03:25:21,393 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:21,393 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 43 transitions. cyclomatic complexity: 16 Stem has 22 letters. Loop has 22 letters. [2020-07-29 03:25:21,394 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:21,394 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 29 transitions. cyclomatic complexity: 11 Stem has 4 letters. Loop has 4 letters. [2020-07-29 03:25:21,394 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:21,394 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 03:25:21,394 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:21,394 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 43 transitions. cyclomatic complexity: 16 Stem has 4 letters. Loop has 4 letters. [2020-07-29 03:25:21,395 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:21,395 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 29 transitions. cyclomatic complexity: 11 Stem has 12 letters. Loop has 2 letters. [2020-07-29 03:25:21,395 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:21,395 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 12 letters. Loop has 2 letters. [2020-07-29 03:25:21,395 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:21,396 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 43 transitions. cyclomatic complexity: 16 Stem has 12 letters. Loop has 2 letters. [2020-07-29 03:25:21,396 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:21,396 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 29 transitions. cyclomatic complexity: 11 Stem has 11 letters. Loop has 2 letters. [2020-07-29 03:25:21,396 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:21,396 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 11 letters. Loop has 2 letters. [2020-07-29 03:25:21,397 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:21,397 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 43 transitions. cyclomatic complexity: 16 Stem has 11 letters. Loop has 2 letters. [2020-07-29 03:25:21,397 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:21,397 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 29 transitions. cyclomatic complexity: 11 Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:25:21,397 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:21,398 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:25:21,398 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:21,398 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 43 transitions. cyclomatic complexity: 16 Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:25:21,398 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:21,398 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 29 transitions. cyclomatic complexity: 11 Stem has 13 letters. Loop has 2 letters. [2020-07-29 03:25:21,399 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:21,399 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 13 letters. Loop has 2 letters. [2020-07-29 03:25:21,399 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:21,399 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 43 transitions. cyclomatic complexity: 16 Stem has 13 letters. Loop has 2 letters. [2020-07-29 03:25:21,399 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:21,400 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 29 transitions. cyclomatic complexity: 11 Stem has 14 letters. Loop has 2 letters. [2020-07-29 03:25:21,400 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:21,400 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 14 letters. Loop has 2 letters. [2020-07-29 03:25:21,400 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:21,400 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 43 transitions. cyclomatic complexity: 16 Stem has 14 letters. Loop has 2 letters. [2020-07-29 03:25:21,400 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:21,401 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:25:21,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 03:25:21,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 13 transitions. [2020-07-29 03:25:21,402 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 11 letters. Loop has 2 letters. [2020-07-29 03:25:21,402 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:21,402 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 13 letters. Loop has 2 letters. [2020-07-29 03:25:21,402 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:21,402 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 11 letters. Loop has 4 letters. [2020-07-29 03:25:21,403 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:21,403 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 43 transitions. cyclomatic complexity: 16 [2020-07-29 03:25:21,405 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 03:25:21,406 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 26 states and 33 transitions. [2020-07-29 03:25:21,406 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2020-07-29 03:25:21,406 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2020-07-29 03:25:21,406 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 33 transitions. [2020-07-29 03:25:21,407 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 03:25:21,407 INFO L688 BuchiCegarLoop]: Abstraction has 26 states and 33 transitions. [2020-07-29 03:25:21,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 33 transitions. [2020-07-29 03:25:21,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 18. [2020-07-29 03:25:21,409 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:25:21,409 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states and 33 transitions. Second operand 18 states. [2020-07-29 03:25:21,409 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states and 33 transitions. Second operand 18 states. [2020-07-29 03:25:21,409 INFO L87 Difference]: Start difference. First operand 26 states and 33 transitions. Second operand 18 states. [2020-07-29 03:25:21,410 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 03:25:21,412 INFO L93 Difference]: Finished difference Result 26 states and 33 transitions. [2020-07-29 03:25:21,412 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 33 transitions. [2020-07-29 03:25:21,413 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:25:21,413 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:25:21,413 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 26 states and 33 transitions. [2020-07-29 03:25:21,413 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 26 states and 33 transitions. [2020-07-29 03:25:21,414 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 03:25:21,416 INFO L93 Difference]: Finished difference Result 26 states and 33 transitions. [2020-07-29 03:25:21,416 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 33 transitions. [2020-07-29 03:25:21,416 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:25:21,417 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:25:21,417 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:25:21,417 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:25:21,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-07-29 03:25:21,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 23 transitions. [2020-07-29 03:25:21,418 INFO L711 BuchiCegarLoop]: Abstraction has 18 states and 23 transitions. [2020-07-29 03:25:21,418 INFO L591 BuchiCegarLoop]: Abstraction has 18 states and 23 transitions. [2020-07-29 03:25:21,418 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2020-07-29 03:25:21,419 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 23 transitions. [2020-07-29 03:25:21,419 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 03:25:21,419 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:25:21,419 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:25:21,420 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:25:21,420 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-29 03:25:21,420 INFO L794 eck$LassoCheckResult]: Stem: 864#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 861#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~nondet10, main_#t~post9, main_~k~0, main_#t~ret11, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet7;havoc main_#t~nondet7; 862#L526 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 863#L526-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;main_~k~0 := 0; 869#L531-3 assume !!(main_~k~0 < main_~array_size~0);call write~int(main_#t~nondet10, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~k~0, 4);havoc main_#t~nondet10; 871#L531-2 main_#t~post9 := main_~k~0;main_~k~0 := 1 + main_#t~post9;havoc main_#t~post9; 872#L531-3 assume !(main_~k~0 < main_~array_size~0); 873#L531-4 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; 870#L516-3 assume !!(test_fun_~i~0 < test_fun_~N); 860#L517-3 call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 874#L517-1 assume !(test_fun_#t~mem3 > 0);havoc test_fun_#t~mem3; 867#L516-2 test_fun_#t~post2 := test_fun_~i~0;test_fun_~i~0 := 1 + test_fun_#t~post2;havoc test_fun_#t~post2; 868#L516-3 assume !!(test_fun_~i~0 < test_fun_~N); 858#L517-3 [2020-07-29 03:25:21,421 INFO L796 eck$LassoCheckResult]: Loop: 858#L517-3 call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 857#L517-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; 858#L517-3 [2020-07-29 03:25:21,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:21,421 INFO L82 PathProgramCache]: Analyzing trace with hash 1792762469, now seen corresponding path program 2 times [2020-07-29 03:25:21,421 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:25:21,422 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999584596] [2020-07-29 03:25:21,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:25:21,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:21,493 INFO L280 TraceCheckUtils]: 0: Hoare triple {999#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {999#true} is VALID [2020-07-29 03:25:21,494 INFO L280 TraceCheckUtils]: 1: Hoare triple {999#true} havoc main_#res;havoc main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~nondet10, main_#t~post9, main_~k~0, main_#t~ret11, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet7;havoc main_#t~nondet7; {999#true} is VALID [2020-07-29 03:25:21,494 INFO L280 TraceCheckUtils]: 2: Hoare triple {999#true} assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); {999#true} is VALID [2020-07-29 03:25:21,495 INFO L280 TraceCheckUtils]: 3: Hoare triple {999#true} 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;main_~k~0 := 0; {1001#(= 0 ULTIMATE.start_main_~k~0)} is VALID [2020-07-29 03:25:21,498 INFO L280 TraceCheckUtils]: 4: Hoare triple {1001#(= 0 ULTIMATE.start_main_~k~0)} assume !!(main_~k~0 < main_~array_size~0);call write~int(main_#t~nondet10, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~k~0, 4);havoc main_#t~nondet10; {1001#(= 0 ULTIMATE.start_main_~k~0)} is VALID [2020-07-29 03:25:21,499 INFO L280 TraceCheckUtils]: 5: Hoare triple {1001#(= 0 ULTIMATE.start_main_~k~0)} main_#t~post9 := main_~k~0;main_~k~0 := 1 + main_#t~post9;havoc main_#t~post9; {1002#(<= ULTIMATE.start_main_~k~0 1)} is VALID [2020-07-29 03:25:21,500 INFO L280 TraceCheckUtils]: 6: Hoare triple {1002#(<= ULTIMATE.start_main_~k~0 1)} assume !(main_~k~0 < main_~array_size~0); {1003#(<= ULTIMATE.start_main_~array_size~0 1)} is VALID [2020-07-29 03:25:21,500 INFO L280 TraceCheckUtils]: 7: Hoare triple {1003#(<= ULTIMATE.start_main_~array_size~0 1)} 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; {1004#(and (<= ULTIMATE.start_test_fun_~N 1) (= 0 ULTIMATE.start_test_fun_~i~0))} is VALID [2020-07-29 03:25:21,501 INFO L280 TraceCheckUtils]: 8: Hoare triple {1004#(and (<= ULTIMATE.start_test_fun_~N 1) (= 0 ULTIMATE.start_test_fun_~i~0))} assume !!(test_fun_~i~0 < test_fun_~N); {1004#(and (<= ULTIMATE.start_test_fun_~N 1) (= 0 ULTIMATE.start_test_fun_~i~0))} is VALID [2020-07-29 03:25:21,502 INFO L280 TraceCheckUtils]: 9: Hoare triple {1004#(and (<= ULTIMATE.start_test_fun_~N 1) (= 0 ULTIMATE.start_test_fun_~i~0))} call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); {1004#(and (<= ULTIMATE.start_test_fun_~N 1) (= 0 ULTIMATE.start_test_fun_~i~0))} is VALID [2020-07-29 03:25:21,502 INFO L280 TraceCheckUtils]: 10: Hoare triple {1004#(and (<= ULTIMATE.start_test_fun_~N 1) (= 0 ULTIMATE.start_test_fun_~i~0))} assume !(test_fun_#t~mem3 > 0);havoc test_fun_#t~mem3; {1004#(and (<= ULTIMATE.start_test_fun_~N 1) (= 0 ULTIMATE.start_test_fun_~i~0))} is VALID [2020-07-29 03:25:21,503 INFO L280 TraceCheckUtils]: 11: Hoare triple {1004#(and (<= ULTIMATE.start_test_fun_~N 1) (= 0 ULTIMATE.start_test_fun_~i~0))} test_fun_#t~post2 := test_fun_~i~0;test_fun_~i~0 := 1 + test_fun_#t~post2;havoc test_fun_#t~post2; {1005#(<= ULTIMATE.start_test_fun_~N ULTIMATE.start_test_fun_~i~0)} is VALID [2020-07-29 03:25:21,503 INFO L280 TraceCheckUtils]: 12: Hoare triple {1005#(<= ULTIMATE.start_test_fun_~N ULTIMATE.start_test_fun_~i~0)} assume !!(test_fun_~i~0 < test_fun_~N); {1000#false} is VALID [2020-07-29 03:25:21,504 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 03:25:21,504 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999584596] [2020-07-29 03:25:21,504 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [125511358] [2020-07-29 03:25:21,504 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 03:25:21,540 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-29 03:25:21,540 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-29 03:25:21,541 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-29 03:25:21,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:21,555 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:25:21,711 INFO L280 TraceCheckUtils]: 0: Hoare triple {999#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {999#true} is VALID [2020-07-29 03:25:21,711 INFO L280 TraceCheckUtils]: 1: Hoare triple {999#true} havoc main_#res;havoc main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~nondet10, main_#t~post9, main_~k~0, main_#t~ret11, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet7;havoc main_#t~nondet7; {999#true} is VALID [2020-07-29 03:25:21,712 INFO L280 TraceCheckUtils]: 2: Hoare triple {999#true} assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); {999#true} is VALID [2020-07-29 03:25:21,713 INFO L280 TraceCheckUtils]: 3: Hoare triple {999#true} 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;main_~k~0 := 0; {1018#(<= ULTIMATE.start_main_~k~0 0)} is VALID [2020-07-29 03:25:21,714 INFO L280 TraceCheckUtils]: 4: Hoare triple {1018#(<= ULTIMATE.start_main_~k~0 0)} assume !!(main_~k~0 < main_~array_size~0);call write~int(main_#t~nondet10, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~k~0, 4);havoc main_#t~nondet10; {1018#(<= ULTIMATE.start_main_~k~0 0)} is VALID [2020-07-29 03:25:21,715 INFO L280 TraceCheckUtils]: 5: Hoare triple {1018#(<= ULTIMATE.start_main_~k~0 0)} main_#t~post9 := main_~k~0;main_~k~0 := 1 + main_#t~post9;havoc main_#t~post9; {1002#(<= ULTIMATE.start_main_~k~0 1)} is VALID [2020-07-29 03:25:21,716 INFO L280 TraceCheckUtils]: 6: Hoare triple {1002#(<= ULTIMATE.start_main_~k~0 1)} assume !(main_~k~0 < main_~array_size~0); {1003#(<= ULTIMATE.start_main_~array_size~0 1)} is VALID [2020-07-29 03:25:21,716 INFO L280 TraceCheckUtils]: 7: Hoare triple {1003#(<= ULTIMATE.start_main_~array_size~0 1)} 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; {1031#(and (<= ULTIMATE.start_test_fun_~N 1) (<= 0 ULTIMATE.start_test_fun_~i~0))} is VALID [2020-07-29 03:25:21,717 INFO L280 TraceCheckUtils]: 8: Hoare triple {1031#(and (<= ULTIMATE.start_test_fun_~N 1) (<= 0 ULTIMATE.start_test_fun_~i~0))} assume !!(test_fun_~i~0 < test_fun_~N); {1031#(and (<= ULTIMATE.start_test_fun_~N 1) (<= 0 ULTIMATE.start_test_fun_~i~0))} is VALID [2020-07-29 03:25:21,718 INFO L280 TraceCheckUtils]: 9: Hoare triple {1031#(and (<= ULTIMATE.start_test_fun_~N 1) (<= 0 ULTIMATE.start_test_fun_~i~0))} call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); {1031#(and (<= ULTIMATE.start_test_fun_~N 1) (<= 0 ULTIMATE.start_test_fun_~i~0))} is VALID [2020-07-29 03:25:21,722 INFO L280 TraceCheckUtils]: 10: Hoare triple {1031#(and (<= ULTIMATE.start_test_fun_~N 1) (<= 0 ULTIMATE.start_test_fun_~i~0))} assume !(test_fun_#t~mem3 > 0);havoc test_fun_#t~mem3; {1031#(and (<= ULTIMATE.start_test_fun_~N 1) (<= 0 ULTIMATE.start_test_fun_~i~0))} is VALID [2020-07-29 03:25:21,723 INFO L280 TraceCheckUtils]: 11: Hoare triple {1031#(and (<= ULTIMATE.start_test_fun_~N 1) (<= 0 ULTIMATE.start_test_fun_~i~0))} test_fun_#t~post2 := test_fun_~i~0;test_fun_~i~0 := 1 + test_fun_#t~post2;havoc test_fun_#t~post2; {1044#(and (<= ULTIMATE.start_test_fun_~N 1) (<= 1 ULTIMATE.start_test_fun_~i~0))} is VALID [2020-07-29 03:25:21,723 INFO L280 TraceCheckUtils]: 12: Hoare triple {1044#(and (<= ULTIMATE.start_test_fun_~N 1) (<= 1 ULTIMATE.start_test_fun_~i~0))} assume !!(test_fun_~i~0 < test_fun_~N); {1000#false} is VALID [2020-07-29 03:25:21,724 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 03:25:21,724 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-29 03:25:21,724 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2020-07-29 03:25:21,725 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894986155] [2020-07-29 03:25:21,725 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-29 03:25:21,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:21,725 INFO L82 PathProgramCache]: Analyzing trace with hash 2118, now seen corresponding path program 3 times [2020-07-29 03:25:21,726 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:25:21,726 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278452406] [2020-07-29 03:25:21,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:25:21,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:21,730 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:21,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:21,733 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:21,741 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:25:21,786 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 03:25:21,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-29 03:25:21,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2020-07-29 03:25:21,787 INFO L87 Difference]: Start difference. First operand 18 states and 23 transitions. cyclomatic complexity: 9 Second operand 10 states. [2020-07-29 03:25:22,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:25:22,069 INFO L93 Difference]: Finished difference Result 33 states and 40 transitions. [2020-07-29 03:25:22,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-29 03:25:22,069 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2020-07-29 03:25:22,102 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:25:22,102 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 40 transitions. [2020-07-29 03:25:22,105 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 03:25:22,106 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 21 states and 25 transitions. [2020-07-29 03:25:22,106 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2020-07-29 03:25:22,106 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2020-07-29 03:25:22,106 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 25 transitions. [2020-07-29 03:25:22,106 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 03:25:22,106 INFO L688 BuchiCegarLoop]: Abstraction has 21 states and 25 transitions. [2020-07-29 03:25:22,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 25 transitions. [2020-07-29 03:25:22,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2020-07-29 03:25:22,108 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:25:22,108 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states and 25 transitions. Second operand 20 states. [2020-07-29 03:25:22,108 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states and 25 transitions. Second operand 20 states. [2020-07-29 03:25:22,108 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 20 states. [2020-07-29 03:25:22,109 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 03:25:22,110 INFO L93 Difference]: Finished difference Result 21 states and 25 transitions. [2020-07-29 03:25:22,111 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2020-07-29 03:25:22,111 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:25:22,111 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:25:22,111 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 21 states and 25 transitions. [2020-07-29 03:25:22,111 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 21 states and 25 transitions. [2020-07-29 03:25:22,112 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 03:25:22,113 INFO L93 Difference]: Finished difference Result 21 states and 25 transitions. [2020-07-29 03:25:22,113 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2020-07-29 03:25:22,114 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:25:22,114 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:25:22,114 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:25:22,114 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:25:22,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-07-29 03:25:22,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2020-07-29 03:25:22,115 INFO L711 BuchiCegarLoop]: Abstraction has 20 states and 24 transitions. [2020-07-29 03:25:22,115 INFO L591 BuchiCegarLoop]: Abstraction has 20 states and 24 transitions. [2020-07-29 03:25:22,115 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2020-07-29 03:25:22,115 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 24 transitions. [2020-07-29 03:25:22,116 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 03:25:22,116 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:25:22,116 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:25:22,116 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:25:22,116 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-29 03:25:22,116 INFO L794 eck$LassoCheckResult]: Stem: 1097#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1094#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~nondet10, main_#t~post9, main_~k~0, main_#t~ret11, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet7;havoc main_#t~nondet7; 1095#L526 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 1096#L526-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;main_~k~0 := 0; 1102#L531-3 assume !!(main_~k~0 < main_~array_size~0);call write~int(main_#t~nondet10, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~k~0, 4);havoc main_#t~nondet10; 1106#L531-2 main_#t~post9 := main_~k~0;main_~k~0 := 1 + main_#t~post9;havoc main_#t~post9; 1107#L531-3 assume !!(main_~k~0 < main_~array_size~0);call write~int(main_#t~nondet10, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~k~0, 4);havoc main_#t~nondet10; 1103#L531-2 main_#t~post9 := main_~k~0;main_~k~0 := 1 + main_#t~post9;havoc main_#t~post9; 1104#L531-3 assume !(main_~k~0 < main_~array_size~0); 1108#L531-4 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; 1105#L516-3 assume !!(test_fun_~i~0 < test_fun_~N); 1093#L517-3 call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 1109#L517-1 assume !(test_fun_#t~mem3 > 0);havoc test_fun_#t~mem3; 1100#L516-2 test_fun_#t~post2 := test_fun_~i~0;test_fun_~i~0 := 1 + test_fun_#t~post2;havoc test_fun_#t~post2; 1101#L516-3 assume !!(test_fun_~i~0 < test_fun_~N); 1091#L517-3 [2020-07-29 03:25:22,117 INFO L796 eck$LassoCheckResult]: Loop: 1091#L517-3 call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 1090#L517-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; 1091#L517-3 [2020-07-29 03:25:22,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:22,117 INFO L82 PathProgramCache]: Analyzing trace with hash 1166615491, now seen corresponding path program 3 times [2020-07-29 03:25:22,117 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:25:22,117 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894479538] [2020-07-29 03:25:22,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:25:22,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:22,184 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:22,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:22,209 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:22,215 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:25:22,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:22,215 INFO L82 PathProgramCache]: Analyzing trace with hash 2118, now seen corresponding path program 4 times [2020-07-29 03:25:22,215 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:25:22,215 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780884989] [2020-07-29 03:25:22,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:25:22,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:22,226 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:22,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:22,233 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:22,235 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:25:22,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:22,235 INFO L82 PathProgramCache]: Analyzing trace with hash 131023752, now seen corresponding path program 1 times [2020-07-29 03:25:22,236 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:25:22,236 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198254281] [2020-07-29 03:25:22,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:25:22,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:22,267 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:22,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:22,289 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:22,293 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:25:22,630 WARN L193 SmtUtils]: Spent 281.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 92 [2020-07-29 03:25:22,755 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 03:25:22,755 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 03:25:22,755 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 03:25:22,755 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 03:25:22,755 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 03:25:22,756 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:22,756 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 03:25:22,756 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 03:25:22,756 INFO L133 ssoRankerPreferences]: Filename of dumped script: array01-alloca-2.i_Iteration7_Lasso [2020-07-29 03:25:22,756 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 03:25:22,756 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 03:25:22,777 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 03:25:22,779 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 03:25:22,783 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 03:25:22,786 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 03:25:22,792 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 03:25:22,796 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 03:25:22,799 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 03:25:22,802 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 03:25:22,806 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 03:25:22,809 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 03:25:22,812 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 03:25:22,815 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 03:25:22,819 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 03:25:22,822 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 03:25:22,831 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 03:25:22,834 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 03:25:22,838 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 03:25:22,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 03:25:22,985 WARN L193 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 49 [2020-07-29 03:25:23,008 WARN L257 bleTransFormulaUtils]: 2 quantified variables [2020-07-29 03:25:23,620 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 03:25:23,620 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:23,624 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 03:25:23,626 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:23,626 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:25:23,626 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:23,627 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:23,627 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:23,627 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:25:23,627 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:25:23,633 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 43 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:23,656 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 03:25:23,657 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:23,657 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:23,657 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:23,658 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:23,659 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:25:23,659 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:25:23,661 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 44 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:23,684 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 03:25:23,685 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:23,685 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:25:23,685 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:23,685 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:23,685 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:23,686 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:25:23,686 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:25:23,687 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 45 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:23,710 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:25:23,711 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:23,711 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:23,711 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:23,711 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:23,712 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:25:23,713 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:25:23,716 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 46 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:23,738 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 03:25:23,739 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:23,739 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:23,739 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:23,739 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:23,740 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:25:23,740 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:25:23,743 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 47 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:23,766 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 03:25:23,767 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:23,767 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:25:23,767 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:23,767 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:23,767 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:23,768 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:25:23,768 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:25:23,769 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 48 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:25:23,792 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 03:25:23,793 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:23,793 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:25:23,794 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:23,794 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:23,794 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:23,794 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:25:23,794 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 48 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:23,796 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 49 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:23,818 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 03:25:23,819 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:23,819 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:25:23,819 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:23,819 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:23,819 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:23,820 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:25:23,820 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:25:23,821 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 50 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:23,845 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 03:25:23,846 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:23,846 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:25:23,846 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:23,847 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:23,847 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:23,847 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:25:23,847 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:25:23,848 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 51 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:23,870 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:25:23,872 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:23,872 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:25:23,872 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:23,872 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:23,872 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:23,872 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:25:23,872 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:25:23,873 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 52 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:25:23,897 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 03:25:23,899 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:23,899 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:23,899 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:23,899 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 52 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:23,900 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:25:23,900 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:25:23,903 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 53 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 53 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:23,925 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:25:23,926 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:23,926 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:25:23,926 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:23,926 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:23,927 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:23,927 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:25:23,927 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:25:23,928 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 54 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 54 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:23,950 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 03:25:23,952 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:23,952 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:25:23,952 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:23,952 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:23,952 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:23,953 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:25:23,953 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:25:23,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 55 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 55 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:23,975 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:25:23,977 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:23,977 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:25:23,977 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:23,977 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:23,977 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:23,977 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:25:23,977 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:25:23,978 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 56 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 56 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:24,001 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 03:25:24,002 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:24,002 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:24,002 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:24,002 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:24,003 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:25:24,003 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:25:24,007 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 57 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:25:24,039 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 03:25:24,040 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:24,040 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:25:24,040 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:24,040 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:24,041 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:24,041 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:25:24,041 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 57 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:24,043 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 58 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 58 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:24,074 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:25:24,075 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:24,076 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:24,076 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:24,076 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:24,077 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:25:24,077 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:25:24,082 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 59 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 59 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:24,103 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 03:25:24,104 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:24,104 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:24,104 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:24,105 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:24,106 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:25:24,106 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:25:24,113 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 60 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 60 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:24,136 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:25:24,137 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:24,137 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:24,137 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:24,138 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:24,147 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:25:24,148 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:25:24,163 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 61 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 61 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:24,189 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 03:25:24,191 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:24,191 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:24,191 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:24,191 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:24,194 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:25:24,194 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:25:24,201 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 62 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 62 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:24,223 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 03:25:24,224 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:24,224 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:24,224 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:24,224 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:24,225 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:25:24,225 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:25:24,229 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 63 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:25:24,251 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false Waiting until toolchain timeout for monitored process 63 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:24,252 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:24,253 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:24,253 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:24,253 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:24,254 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:25:24,254 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:25:24,257 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 64 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 64 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:24,280 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 03:25:24,282 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:24,282 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:25:24,283 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:24,283 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:24,283 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:24,283 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:25:24,283 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:25:24,285 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 03:25:24,287 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-07-29 03:25:24,287 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 65 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 65 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:24,289 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 03:25:24,289 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-07-29 03:25:24,289 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 03:25:24,290 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)))_3) = 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)))_3 Supporting invariants [] [2020-07-29 03:25:24,324 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2020-07-29 03:25:24,327 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 03:25:24,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:24,331 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-29 03:25:24,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:24,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:24,359 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 03:25:24,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:24,364 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:25:24,372 INFO L280 TraceCheckUtils]: 0: Hoare triple {1226#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1226#unseeded} is VALID [2020-07-29 03:25:24,372 INFO L280 TraceCheckUtils]: 1: Hoare triple {1226#unseeded} havoc main_#res;havoc main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~nondet10, main_#t~post9, main_~k~0, main_#t~ret11, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet7;havoc main_#t~nondet7; {1226#unseeded} is VALID [2020-07-29 03:25:24,373 INFO L280 TraceCheckUtils]: 2: Hoare triple {1226#unseeded} assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); {1226#unseeded} is VALID [2020-07-29 03:25:24,374 INFO L280 TraceCheckUtils]: 3: Hoare triple {1226#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;main_~k~0 := 0; {1226#unseeded} is VALID [2020-07-29 03:25:24,375 INFO L280 TraceCheckUtils]: 4: Hoare triple {1226#unseeded} assume !!(main_~k~0 < main_~array_size~0);call write~int(main_#t~nondet10, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~k~0, 4);havoc main_#t~nondet10; {1226#unseeded} is VALID [2020-07-29 03:25:24,375 INFO L280 TraceCheckUtils]: 5: Hoare triple {1226#unseeded} main_#t~post9 := main_~k~0;main_~k~0 := 1 + main_#t~post9;havoc main_#t~post9; {1226#unseeded} is VALID [2020-07-29 03:25:24,375 INFO L280 TraceCheckUtils]: 6: Hoare triple {1226#unseeded} assume !!(main_~k~0 < main_~array_size~0);call write~int(main_#t~nondet10, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~k~0, 4);havoc main_#t~nondet10; {1226#unseeded} is VALID [2020-07-29 03:25:24,376 INFO L280 TraceCheckUtils]: 7: Hoare triple {1226#unseeded} main_#t~post9 := main_~k~0;main_~k~0 := 1 + main_#t~post9;havoc main_#t~post9; {1226#unseeded} is VALID [2020-07-29 03:25:24,376 INFO L280 TraceCheckUtils]: 8: Hoare triple {1226#unseeded} assume !(main_~k~0 < main_~array_size~0); {1226#unseeded} is VALID [2020-07-29 03:25:24,377 INFO L280 TraceCheckUtils]: 9: Hoare triple {1226#unseeded} 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; {1226#unseeded} is VALID [2020-07-29 03:25:24,377 INFO L280 TraceCheckUtils]: 10: Hoare triple {1226#unseeded} assume !!(test_fun_~i~0 < test_fun_~N); {1226#unseeded} is VALID [2020-07-29 03:25:24,377 INFO L280 TraceCheckUtils]: 11: Hoare triple {1226#unseeded} call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); {1226#unseeded} is VALID [2020-07-29 03:25:24,378 INFO L280 TraceCheckUtils]: 12: Hoare triple {1226#unseeded} assume !(test_fun_#t~mem3 > 0);havoc test_fun_#t~mem3; {1226#unseeded} is VALID [2020-07-29 03:25:24,378 INFO L280 TraceCheckUtils]: 13: Hoare triple {1226#unseeded} test_fun_#t~post2 := test_fun_~i~0;test_fun_~i~0 := 1 + test_fun_#t~post2;havoc test_fun_#t~post2; {1226#unseeded} is VALID [2020-07-29 03:25:24,379 INFO L280 TraceCheckUtils]: 14: Hoare triple {1226#unseeded} assume !!(test_fun_~i~0 < test_fun_~N); {1226#unseeded} is VALID [2020-07-29 03:25:24,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:24,384 INFO L263 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-29 03:25:24,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:24,394 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:25:24,413 INFO L280 TraceCheckUtils]: 0: Hoare triple {1229#(>= 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); {1306#(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 03:25:24,414 INFO L280 TraceCheckUtils]: 1: Hoare triple {1306#(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; {1259#(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 03:25:24,415 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 03:25:24,415 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 03:25:24,427 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:25:24,427 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 15 letters. Loop has 2 letters. [2020-07-29 03:25:24,427 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:24,427 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 03:25:24,427 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states and 24 transitions. cyclomatic complexity: 8 Second operand 3 states. [2020-07-29 03:25:24,472 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20 states and 24 transitions. cyclomatic complexity: 8. Second operand 3 states. Result 24 states and 28 transitions. Complement of second has 7 states. [2020-07-29 03:25:24,472 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 03:25:24,472 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:25:24,472 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 24 transitions. cyclomatic complexity: 8 [2020-07-29 03:25:24,473 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:25:24,473 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:25:24,473 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. [2020-07-29 03:25:24,473 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 03:25:24,474 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:25:24,474 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:25:24,474 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 28 transitions. [2020-07-29 03:25:24,474 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 03:25:24,474 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:25:24,474 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:25:24,475 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 20 states and 24 transitions. cyclomatic complexity: 8 [2020-07-29 03:25:24,475 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 03:25:24,475 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 3 states. [2020-07-29 03:25:24,476 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 03:25:24,476 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 03:25:24,476 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 24 states and 28 transitions. cyclomatic complexity: 8 [2020-07-29 03:25:24,477 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 03:25:24,477 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 24 transitions. cyclomatic complexity: 8 Stem has 15 letters. Loop has 2 letters. [2020-07-29 03:25:24,477 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:24,477 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 15 letters. Loop has 2 letters. [2020-07-29 03:25:24,477 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:24,477 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 28 transitions. cyclomatic complexity: 8 Stem has 15 letters. Loop has 2 letters. [2020-07-29 03:25:24,478 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:24,478 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 24 transitions. cyclomatic complexity: 8 Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:25:24,478 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:24,478 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:25:24,478 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:24,478 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 28 transitions. cyclomatic complexity: 8 Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:25:24,478 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:24,478 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 24 transitions. cyclomatic complexity: 8 Stem has 15 letters. Loop has 2 letters. [2020-07-29 03:25:24,479 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:24,479 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 15 letters. Loop has 2 letters. [2020-07-29 03:25:24,479 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:24,479 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 28 transitions. cyclomatic complexity: 8 Stem has 15 letters. Loop has 2 letters. [2020-07-29 03:25:24,479 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:24,479 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 24 transitions. cyclomatic complexity: 8 Stem has 24 letters. Loop has 24 letters. [2020-07-29 03:25:24,479 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:24,479 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 24 letters. Loop has 24 letters. [2020-07-29 03:25:24,480 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:24,480 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 28 transitions. cyclomatic complexity: 8 Stem has 24 letters. Loop has 24 letters. [2020-07-29 03:25:24,480 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:24,480 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 24 transitions. cyclomatic complexity: 8 Stem has 20 letters. Loop has 20 letters. [2020-07-29 03:25:24,480 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:24,480 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 20 letters. Loop has 20 letters. [2020-07-29 03:25:24,480 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:24,480 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 28 transitions. cyclomatic complexity: 8 Stem has 20 letters. Loop has 20 letters. [2020-07-29 03:25:24,480 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:24,481 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 24 transitions. cyclomatic complexity: 8 Stem has 4 letters. Loop has 4 letters. [2020-07-29 03:25:24,481 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:24,481 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 03:25:24,481 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:24,481 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 28 transitions. cyclomatic complexity: 8 Stem has 4 letters. Loop has 4 letters. [2020-07-29 03:25:24,481 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:24,481 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 24 transitions. cyclomatic complexity: 8 Stem has 16 letters. Loop has 2 letters. [2020-07-29 03:25:24,481 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:24,481 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 16 letters. Loop has 2 letters. [2020-07-29 03:25:24,482 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:24,482 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 28 transitions. cyclomatic complexity: 8 Stem has 16 letters. Loop has 2 letters. [2020-07-29 03:25:24,482 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:24,482 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 24 transitions. cyclomatic complexity: 8 Stem has 15 letters. Loop has 2 letters. [2020-07-29 03:25:24,482 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:24,482 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 15 letters. Loop has 2 letters. [2020-07-29 03:25:24,482 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:24,482 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 28 transitions. cyclomatic complexity: 8 Stem has 15 letters. Loop has 2 letters. [2020-07-29 03:25:24,483 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:24,483 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 24 transitions. cyclomatic complexity: 8 Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:25:24,483 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:24,483 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:25:24,483 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:24,483 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 28 transitions. cyclomatic complexity: 8 Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:25:24,483 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:24,483 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 24 transitions. cyclomatic complexity: 8 Stem has 15 letters. Loop has 2 letters. [2020-07-29 03:25:24,483 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:24,483 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 15 letters. Loop has 2 letters. [2020-07-29 03:25:24,484 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:24,484 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 28 transitions. cyclomatic complexity: 8 Stem has 15 letters. Loop has 2 letters. [2020-07-29 03:25:24,484 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:24,484 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 24 transitions. cyclomatic complexity: 8 Stem has 16 letters. Loop has 2 letters. [2020-07-29 03:25:24,484 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:24,484 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 16 letters. Loop has 2 letters. [2020-07-29 03:25:24,484 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:24,484 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 28 transitions. cyclomatic complexity: 8 Stem has 16 letters. Loop has 2 letters. [2020-07-29 03:25:24,485 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:24,485 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:25:24,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 03:25:24,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2020-07-29 03:25:24,485 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 15 letters. Loop has 2 letters. [2020-07-29 03:25:24,486 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:24,486 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-07-29 03:25:24,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:24,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:24,517 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 03:25:24,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:24,523 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:25:24,530 INFO L280 TraceCheckUtils]: 0: Hoare triple {1226#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1226#unseeded} is VALID [2020-07-29 03:25:24,531 INFO L280 TraceCheckUtils]: 1: Hoare triple {1226#unseeded} havoc main_#res;havoc main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~nondet10, main_#t~post9, main_~k~0, main_#t~ret11, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet7;havoc main_#t~nondet7; {1226#unseeded} is VALID [2020-07-29 03:25:24,531 INFO L280 TraceCheckUtils]: 2: Hoare triple {1226#unseeded} assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); {1226#unseeded} is VALID [2020-07-29 03:25:24,532 INFO L280 TraceCheckUtils]: 3: Hoare triple {1226#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;main_~k~0 := 0; {1226#unseeded} is VALID [2020-07-29 03:25:24,533 INFO L280 TraceCheckUtils]: 4: Hoare triple {1226#unseeded} assume !!(main_~k~0 < main_~array_size~0);call write~int(main_#t~nondet10, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~k~0, 4);havoc main_#t~nondet10; {1226#unseeded} is VALID [2020-07-29 03:25:24,536 INFO L280 TraceCheckUtils]: 5: Hoare triple {1226#unseeded} main_#t~post9 := main_~k~0;main_~k~0 := 1 + main_#t~post9;havoc main_#t~post9; {1226#unseeded} is VALID [2020-07-29 03:25:24,536 INFO L280 TraceCheckUtils]: 6: Hoare triple {1226#unseeded} assume !!(main_~k~0 < main_~array_size~0);call write~int(main_#t~nondet10, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~k~0, 4);havoc main_#t~nondet10; {1226#unseeded} is VALID [2020-07-29 03:25:24,537 INFO L280 TraceCheckUtils]: 7: Hoare triple {1226#unseeded} main_#t~post9 := main_~k~0;main_~k~0 := 1 + main_#t~post9;havoc main_#t~post9; {1226#unseeded} is VALID [2020-07-29 03:25:24,537 INFO L280 TraceCheckUtils]: 8: Hoare triple {1226#unseeded} assume !(main_~k~0 < main_~array_size~0); {1226#unseeded} is VALID [2020-07-29 03:25:24,538 INFO L280 TraceCheckUtils]: 9: Hoare triple {1226#unseeded} 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; {1226#unseeded} is VALID [2020-07-29 03:25:24,538 INFO L280 TraceCheckUtils]: 10: Hoare triple {1226#unseeded} assume !!(test_fun_~i~0 < test_fun_~N); {1226#unseeded} is VALID [2020-07-29 03:25:24,539 INFO L280 TraceCheckUtils]: 11: Hoare triple {1226#unseeded} call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); {1226#unseeded} is VALID [2020-07-29 03:25:24,540 INFO L280 TraceCheckUtils]: 12: Hoare triple {1226#unseeded} assume !(test_fun_#t~mem3 > 0);havoc test_fun_#t~mem3; {1226#unseeded} is VALID [2020-07-29 03:25:24,540 INFO L280 TraceCheckUtils]: 13: Hoare triple {1226#unseeded} test_fun_#t~post2 := test_fun_~i~0;test_fun_~i~0 := 1 + test_fun_#t~post2;havoc test_fun_#t~post2; {1226#unseeded} is VALID [2020-07-29 03:25:24,540 INFO L280 TraceCheckUtils]: 14: Hoare triple {1226#unseeded} assume !!(test_fun_~i~0 < test_fun_~N); {1226#unseeded} is VALID [2020-07-29 03:25:24,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:24,547 INFO L263 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-29 03:25:24,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:24,551 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:25:24,571 INFO L280 TraceCheckUtils]: 0: Hoare triple {1229#(>= 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); {1390#(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 03:25:24,576 INFO L280 TraceCheckUtils]: 1: Hoare triple {1390#(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; {1259#(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 03:25:24,576 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 03:25:24,576 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 03:25:24,586 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:25:24,586 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 15 letters. Loop has 2 letters. [2020-07-29 03:25:24,586 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:24,587 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 03:25:24,587 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states and 24 transitions. cyclomatic complexity: 8 Second operand 3 states. [2020-07-29 03:25:24,621 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20 states and 24 transitions. cyclomatic complexity: 8. Second operand 3 states. Result 24 states and 28 transitions. Complement of second has 7 states. [2020-07-29 03:25:24,621 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 03:25:24,621 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:25:24,622 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 24 transitions. cyclomatic complexity: 8 [2020-07-29 03:25:24,622 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:25:24,622 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:25:24,622 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. [2020-07-29 03:25:24,623 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 03:25:24,623 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:25:24,623 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:25:24,623 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 28 transitions. [2020-07-29 03:25:24,624 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 03:25:24,624 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:25:24,624 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:25:24,625 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 20 states and 24 transitions. cyclomatic complexity: 8 [2020-07-29 03:25:24,625 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 03:25:24,625 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 3 states. [2020-07-29 03:25:24,625 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 03:25:24,626 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 03:25:24,626 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 24 states and 28 transitions. cyclomatic complexity: 8 [2020-07-29 03:25:24,626 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 03:25:24,626 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 24 transitions. cyclomatic complexity: 8 Stem has 15 letters. Loop has 2 letters. [2020-07-29 03:25:24,626 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:24,627 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 15 letters. Loop has 2 letters. [2020-07-29 03:25:24,627 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:24,627 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 28 transitions. cyclomatic complexity: 8 Stem has 15 letters. Loop has 2 letters. [2020-07-29 03:25:24,627 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:24,627 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 24 transitions. cyclomatic complexity: 8 Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:25:24,627 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:24,628 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:25:24,628 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:24,628 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 28 transitions. cyclomatic complexity: 8 Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:25:24,628 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:24,628 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 24 transitions. cyclomatic complexity: 8 Stem has 15 letters. Loop has 2 letters. [2020-07-29 03:25:24,628 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:24,628 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 15 letters. Loop has 2 letters. [2020-07-29 03:25:24,629 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:24,629 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 28 transitions. cyclomatic complexity: 8 Stem has 15 letters. Loop has 2 letters. [2020-07-29 03:25:24,629 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:24,629 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 24 transitions. cyclomatic complexity: 8 Stem has 24 letters. Loop has 24 letters. [2020-07-29 03:25:24,629 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:24,629 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 24 letters. Loop has 24 letters. [2020-07-29 03:25:24,629 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:24,630 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 28 transitions. cyclomatic complexity: 8 Stem has 24 letters. Loop has 24 letters. [2020-07-29 03:25:24,630 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:24,630 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 24 transitions. cyclomatic complexity: 8 Stem has 20 letters. Loop has 20 letters. [2020-07-29 03:25:24,630 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:24,630 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 20 letters. Loop has 20 letters. [2020-07-29 03:25:24,630 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:24,630 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 28 transitions. cyclomatic complexity: 8 Stem has 20 letters. Loop has 20 letters. [2020-07-29 03:25:24,631 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:24,631 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 24 transitions. cyclomatic complexity: 8 Stem has 4 letters. Loop has 4 letters. [2020-07-29 03:25:24,631 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:24,631 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 03:25:24,631 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:24,631 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 28 transitions. cyclomatic complexity: 8 Stem has 4 letters. Loop has 4 letters. [2020-07-29 03:25:24,631 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:24,631 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 24 transitions. cyclomatic complexity: 8 Stem has 16 letters. Loop has 2 letters. [2020-07-29 03:25:24,632 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:24,632 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 16 letters. Loop has 2 letters. [2020-07-29 03:25:24,632 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:24,632 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 28 transitions. cyclomatic complexity: 8 Stem has 16 letters. Loop has 2 letters. [2020-07-29 03:25:24,632 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:24,632 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 24 transitions. cyclomatic complexity: 8 Stem has 15 letters. Loop has 2 letters. [2020-07-29 03:25:24,633 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:24,633 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 15 letters. Loop has 2 letters. [2020-07-29 03:25:24,633 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:24,633 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 28 transitions. cyclomatic complexity: 8 Stem has 15 letters. Loop has 2 letters. [2020-07-29 03:25:24,633 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:24,634 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 24 transitions. cyclomatic complexity: 8 Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:25:24,634 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:24,634 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:25:24,634 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:24,634 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 28 transitions. cyclomatic complexity: 8 Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:25:24,634 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:24,634 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 24 transitions. cyclomatic complexity: 8 Stem has 16 letters. Loop has 2 letters. [2020-07-29 03:25:24,635 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:24,635 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 16 letters. Loop has 2 letters. [2020-07-29 03:25:24,635 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:24,635 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 28 transitions. cyclomatic complexity: 8 Stem has 16 letters. Loop has 2 letters. [2020-07-29 03:25:24,635 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:24,635 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 24 transitions. cyclomatic complexity: 8 Stem has 15 letters. Loop has 2 letters. [2020-07-29 03:25:24,636 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:24,636 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 15 letters. Loop has 2 letters. [2020-07-29 03:25:24,636 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:24,636 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 28 transitions. cyclomatic complexity: 8 Stem has 15 letters. Loop has 2 letters. [2020-07-29 03:25:24,636 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:24,636 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:25:24,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 03:25:24,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2020-07-29 03:25:24,637 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 15 letters. Loop has 2 letters. [2020-07-29 03:25:24,638 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:24,638 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-07-29 03:25:24,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:24,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:24,672 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 03:25:24,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:24,680 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:25:24,689 INFO L280 TraceCheckUtils]: 0: Hoare triple {1226#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1226#unseeded} is VALID [2020-07-29 03:25:24,690 INFO L280 TraceCheckUtils]: 1: Hoare triple {1226#unseeded} havoc main_#res;havoc main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~nondet10, main_#t~post9, main_~k~0, main_#t~ret11, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet7;havoc main_#t~nondet7; {1226#unseeded} is VALID [2020-07-29 03:25:24,691 INFO L280 TraceCheckUtils]: 2: Hoare triple {1226#unseeded} assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); {1226#unseeded} is VALID [2020-07-29 03:25:24,692 INFO L280 TraceCheckUtils]: 3: Hoare triple {1226#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;main_~k~0 := 0; {1226#unseeded} is VALID [2020-07-29 03:25:24,693 INFO L280 TraceCheckUtils]: 4: Hoare triple {1226#unseeded} assume !!(main_~k~0 < main_~array_size~0);call write~int(main_#t~nondet10, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~k~0, 4);havoc main_#t~nondet10; {1226#unseeded} is VALID [2020-07-29 03:25:24,693 INFO L280 TraceCheckUtils]: 5: Hoare triple {1226#unseeded} main_#t~post9 := main_~k~0;main_~k~0 := 1 + main_#t~post9;havoc main_#t~post9; {1226#unseeded} is VALID [2020-07-29 03:25:24,694 INFO L280 TraceCheckUtils]: 6: Hoare triple {1226#unseeded} assume !!(main_~k~0 < main_~array_size~0);call write~int(main_#t~nondet10, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~k~0, 4);havoc main_#t~nondet10; {1226#unseeded} is VALID [2020-07-29 03:25:24,694 INFO L280 TraceCheckUtils]: 7: Hoare triple {1226#unseeded} main_#t~post9 := main_~k~0;main_~k~0 := 1 + main_#t~post9;havoc main_#t~post9; {1226#unseeded} is VALID [2020-07-29 03:25:24,695 INFO L280 TraceCheckUtils]: 8: Hoare triple {1226#unseeded} assume !(main_~k~0 < main_~array_size~0); {1226#unseeded} is VALID [2020-07-29 03:25:24,695 INFO L280 TraceCheckUtils]: 9: Hoare triple {1226#unseeded} 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; {1226#unseeded} is VALID [2020-07-29 03:25:24,696 INFO L280 TraceCheckUtils]: 10: Hoare triple {1226#unseeded} assume !!(test_fun_~i~0 < test_fun_~N); {1226#unseeded} is VALID [2020-07-29 03:25:24,697 INFO L280 TraceCheckUtils]: 11: Hoare triple {1226#unseeded} call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); {1226#unseeded} is VALID [2020-07-29 03:25:24,703 INFO L280 TraceCheckUtils]: 12: Hoare triple {1226#unseeded} assume !(test_fun_#t~mem3 > 0);havoc test_fun_#t~mem3; {1226#unseeded} is VALID [2020-07-29 03:25:24,703 INFO L280 TraceCheckUtils]: 13: Hoare triple {1226#unseeded} test_fun_#t~post2 := test_fun_~i~0;test_fun_~i~0 := 1 + test_fun_#t~post2;havoc test_fun_#t~post2; {1226#unseeded} is VALID [2020-07-29 03:25:24,704 INFO L280 TraceCheckUtils]: 14: Hoare triple {1226#unseeded} assume !!(test_fun_~i~0 < test_fun_~N); {1226#unseeded} is VALID [2020-07-29 03:25:24,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:24,711 INFO L263 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-29 03:25:24,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:24,715 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:25:24,752 INFO L280 TraceCheckUtils]: 0: Hoare triple {1229#(>= 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); {1474#(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 03:25:24,754 INFO L280 TraceCheckUtils]: 1: Hoare triple {1474#(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; {1259#(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 03:25:24,754 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 03:25:24,754 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 03:25:24,762 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:25:24,763 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 15 letters. Loop has 2 letters. [2020-07-29 03:25:24,763 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:24,763 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 03:25:24,763 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states and 24 transitions. cyclomatic complexity: 8 Second operand 3 states. [2020-07-29 03:25:24,806 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20 states and 24 transitions. cyclomatic complexity: 8. Second operand 3 states. Result 26 states and 32 transitions. Complement of second has 6 states. [2020-07-29 03:25:24,807 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 03:25:24,807 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:25:24,807 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 24 transitions. cyclomatic complexity: 8 [2020-07-29 03:25:24,807 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:25:24,807 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:25:24,807 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. [2020-07-29 03:25:24,808 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 03:25:24,808 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:25:24,808 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:25:24,808 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 32 transitions. [2020-07-29 03:25:24,808 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 03:25:24,809 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 03:25:24,809 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 20 states and 24 transitions. cyclomatic complexity: 8 [2020-07-29 03:25:24,809 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 03:25:24,809 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 3 states. [2020-07-29 03:25:24,810 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 03:25:24,810 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 03:25:24,810 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 26 states and 32 transitions. cyclomatic complexity: 10 [2020-07-29 03:25:24,810 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 32 transitions. cyclomatic complexity: 10 [2020-07-29 03:25:24,810 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 03:25:24,810 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2020-07-29 03:25:24,810 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 24 transitions. cyclomatic complexity: 8 Stem has 15 letters. Loop has 2 letters. [2020-07-29 03:25:24,811 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:24,811 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 15 letters. Loop has 2 letters. [2020-07-29 03:25:24,811 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:24,811 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 32 transitions. cyclomatic complexity: 10 Stem has 15 letters. Loop has 2 letters. [2020-07-29 03:25:24,811 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:24,811 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 24 transitions. cyclomatic complexity: 8 Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:25:24,812 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:24,812 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:25:24,812 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:24,812 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 32 transitions. cyclomatic complexity: 10 Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:25:24,812 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:24,812 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 24 transitions. cyclomatic complexity: 8 Stem has 26 letters. Loop has 26 letters. [2020-07-29 03:25:24,812 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:24,813 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 26 letters. Loop has 26 letters. [2020-07-29 03:25:24,813 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:24,813 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 32 transitions. cyclomatic complexity: 10 Stem has 26 letters. Loop has 26 letters. [2020-07-29 03:25:24,813 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:24,813 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 24 transitions. cyclomatic complexity: 8 Stem has 20 letters. Loop has 20 letters. [2020-07-29 03:25:24,813 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:24,814 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 20 letters. Loop has 20 letters. [2020-07-29 03:25:24,814 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:24,814 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 32 transitions. cyclomatic complexity: 10 Stem has 20 letters. Loop has 20 letters. [2020-07-29 03:25:24,814 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:24,814 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 24 transitions. cyclomatic complexity: 8 Stem has 4 letters. Loop has 4 letters. [2020-07-29 03:25:24,814 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:24,814 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 03:25:24,815 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:24,815 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 32 transitions. cyclomatic complexity: 10 Stem has 4 letters. Loop has 4 letters. [2020-07-29 03:25:24,815 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:24,815 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 24 transitions. cyclomatic complexity: 8 Stem has 16 letters. Loop has 2 letters. [2020-07-29 03:25:24,815 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:24,815 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 16 letters. Loop has 2 letters. [2020-07-29 03:25:24,816 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:24,816 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 32 transitions. cyclomatic complexity: 10 Stem has 16 letters. Loop has 2 letters. [2020-07-29 03:25:24,816 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:24,816 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 24 transitions. cyclomatic complexity: 8 Stem has 15 letters. Loop has 2 letters. [2020-07-29 03:25:24,816 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:24,816 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 15 letters. Loop has 2 letters. [2020-07-29 03:25:24,817 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:24,817 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 32 transitions. cyclomatic complexity: 10 Stem has 15 letters. Loop has 2 letters. [2020-07-29 03:25:24,817 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:24,817 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 24 transitions. cyclomatic complexity: 8 Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:25:24,817 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:24,818 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:25:24,818 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:24,818 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 32 transitions. cyclomatic complexity: 10 Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:25:24,818 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:24,818 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:25:24,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 03:25:24,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 17 transitions. [2020-07-29 03:25:24,819 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 15 letters. Loop has 2 letters. [2020-07-29 03:25:24,819 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:24,819 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 17 letters. Loop has 2 letters. [2020-07-29 03:25:24,819 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:24,819 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 15 letters. Loop has 4 letters. [2020-07-29 03:25:24,820 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:24,820 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 32 transitions. cyclomatic complexity: 10 [2020-07-29 03:25:24,820 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 03:25:24,821 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 0 states and 0 transitions. [2020-07-29 03:25:24,821 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-07-29 03:25:24,821 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-07-29 03:25:24,821 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-07-29 03:25:24,821 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 03:25:24,821 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 03:25:24,821 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 03:25:24,821 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 03:25:24,821 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2020-07-29 03:25:24,822 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-07-29 03:25:24,822 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 03:25:24,822 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 03:25:24,827 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 29.07 03:25:24 BoogieIcfgContainer [2020-07-29 03:25:24,827 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-07-29 03:25:24,828 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-07-29 03:25:24,828 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-07-29 03:25:24,828 INFO L275 PluginConnector]: Witness Printer initialized [2020-07-29 03:25:24,828 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 03:25:12" (3/4) ... [2020-07-29 03:25:24,831 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-07-29 03:25:24,831 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-07-29 03:25:24,832 INFO L168 Benchmark]: Toolchain (without parser) took 13731.51 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 380.6 MB). Free memory was 961.6 MB in the beginning and 853.7 MB in the end (delta: 107.9 MB). Peak memory consumption was 488.5 MB. Max. memory is 11.5 GB. [2020-07-29 03:25:24,833 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 03:25:24,833 INFO L168 Benchmark]: CACSL2BoogieTranslator took 565.86 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.6 MB). Free memory was 956.2 MB in the beginning and 1.1 GB in the end (delta: -166.8 MB). Peak memory consumption was 20.6 MB. Max. memory is 11.5 GB. [2020-07-29 03:25:24,834 INFO L168 Benchmark]: Boogie Procedure Inliner took 52.76 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2020-07-29 03:25:24,834 INFO L168 Benchmark]: Boogie Preprocessor took 28.63 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 03:25:24,834 INFO L168 Benchmark]: RCFGBuilder took 422.19 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.0 MB). Peak memory consumption was 25.0 MB. Max. memory is 11.5 GB. [2020-07-29 03:25:24,835 INFO L168 Benchmark]: BuchiAutomizer took 12651.51 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 239.1 MB). Free memory was 1.1 GB in the beginning and 853.7 MB in the end (delta: 237.7 MB). Peak memory consumption was 476.8 MB. Max. memory is 11.5 GB. [2020-07-29 03:25:24,835 INFO L168 Benchmark]: Witness Printer took 3.49 ms. Allocated memory is still 1.4 GB. Free memory is still 853.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 03:25:24,838 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 565.86 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.6 MB). Free memory was 956.2 MB in the beginning and 1.1 GB in the end (delta: -166.8 MB). Peak memory consumption was 20.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 52.76 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 28.63 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 422.19 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.0 MB). Peak memory consumption was 25.0 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 12651.51 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 239.1 MB). Free memory was 1.1 GB in the beginning and 853.7 MB in the end (delta: 237.7 MB). Peak memory consumption was 476.8 MB. Max. memory is 11.5 GB. * Witness Printer took 3.49 ms. Allocated memory is still 1.4 GB. Free memory is still 853.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 #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 7 terminating modules (2 trivial, 4 deterministic, 1 nondeterministic). One deterministic module has affine ranking function -2 * k + unknown-#length-unknown[__builtin_alloca (array_size * sizeof(int))] and consists of 6 locations. 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[numbers][numbers + k * 4 + -4] and consists of 8 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[a][a + i * 4] 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. 2 modules have a trivial ranking function, the largest among these consists of 10 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 12.6s and 8 iterations. TraceHistogramMax:2. Analysis of lassos took 10.2s. Construction of modules took 0.3s. Büchi inclusion checks took 1.7s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 4. Automata minimization 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 16 StatesRemovedByMinimization, 5 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 22 states and ocurred in iteration 4. Nontrivial modules had stage [4, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 80 SDtfs, 118 SDslu, 64 SDs, 0 SdLazy, 175 SolverSat, 44 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU2 SILI0 SILT0 lasso5 LassoPreprocessingBenchmarks: Lassos: inital156 mio100 ax112 hnf98 lsp82 ukn82 mio100 lsp61 div100 bol100 ite100 ukn100 eq172 hnf91 smp92 dnf100 smp100 tf100 neg100 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 31ms 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...