./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-memory-alloca/java_AG313-alloca.i --full-output -ea --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 8bd4bc60 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/termination-memory-alloca/java_AG313-alloca.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash b64613d278f1b2a5aec6d84cb3470147257700f5 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-8bd4bc6 [2020-07-29 01:35:54,729 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-29 01:35:54,731 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-29 01:35:54,745 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-29 01:35:54,746 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-29 01:35:54,748 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-29 01:35:54,750 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-29 01:35:54,760 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-29 01:35:54,764 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-29 01:35:54,765 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-29 01:35:54,767 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-29 01:35:54,769 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-29 01:35:54,769 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-29 01:35:54,772 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-29 01:35:54,774 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-29 01:35:54,775 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-29 01:35:54,777 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-29 01:35:54,781 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-29 01:35:54,782 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-29 01:35:54,786 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-29 01:35:54,789 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-29 01:35:54,792 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-29 01:35:54,795 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-29 01:35:54,797 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-29 01:35:54,801 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-29 01:35:54,801 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-29 01:35:54,801 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-29 01:35:54,803 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-29 01:35:54,804 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-29 01:35:54,805 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-29 01:35:54,805 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-29 01:35:54,807 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-29 01:35:54,808 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-29 01:35:54,809 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-29 01:35:54,811 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-29 01:35:54,811 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-29 01:35:54,812 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-29 01:35:54,813 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-29 01:35:54,813 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-29 01:35:54,814 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-29 01:35:54,815 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-29 01:35:54,816 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2020-07-29 01:35:54,855 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-29 01:35:54,856 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-29 01:35:54,857 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-29 01:35:54,860 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-29 01:35:54,861 INFO L138 SettingsManager]: * Use SBE=true [2020-07-29 01:35:54,861 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-07-29 01:35:54,861 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-07-29 01:35:54,861 INFO L138 SettingsManager]: * Use old map elimination=false [2020-07-29 01:35:54,862 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-07-29 01:35:54,862 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-07-29 01:35:54,862 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-07-29 01:35:54,863 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-29 01:35:54,864 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-29 01:35:54,864 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-29 01:35:54,864 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-29 01:35:54,865 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-07-29 01:35:54,865 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-07-29 01:35:54,865 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-07-29 01:35:54,865 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-29 01:35:54,866 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-07-29 01:35:54,866 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-29 01:35:54,866 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-07-29 01:35:54,866 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-29 01:35:54,867 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-29 01:35:54,867 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-07-29 01:35:54,868 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-29 01:35:54,868 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-29 01:35:54,868 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-29 01:35:54,869 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-07-29 01:35:54,870 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-07-29 01:35:54,871 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b64613d278f1b2a5aec6d84cb3470147257700f5 [2020-07-29 01:35:55,169 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-29 01:35:55,187 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-29 01:35:55,190 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-29 01:35:55,193 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-29 01:35:55,194 INFO L275 PluginConnector]: CDTParser initialized [2020-07-29 01:35:55,194 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-memory-alloca/java_AG313-alloca.i [2020-07-29 01:35:55,255 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/551167bf1/28b5d8881654485bb218dab93a528537/FLAG6032470c8 [2020-07-29 01:35:55,681 INFO L306 CDTParser]: Found 1 translation units. [2020-07-29 01:35:55,682 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/java_AG313-alloca.i [2020-07-29 01:35:55,694 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/551167bf1/28b5d8881654485bb218dab93a528537/FLAG6032470c8 [2020-07-29 01:35:56,001 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/551167bf1/28b5d8881654485bb218dab93a528537 [2020-07-29 01:35:56,005 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-29 01:35:56,009 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-29 01:35:56,010 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-29 01:35:56,010 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-29 01:35:56,014 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-29 01:35:56,015 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:35:56" (1/1) ... [2020-07-29 01:35:56,018 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c9580f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:35:56, skipping insertion in model container [2020-07-29 01:35:56,018 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:35:56" (1/1) ... [2020-07-29 01:35:56,026 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-29 01:35:56,081 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-29 01:35:56,417 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:35:56,432 INFO L203 MainTranslator]: Completed pre-run [2020-07-29 01:35:56,582 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:35:56,638 INFO L208 MainTranslator]: Completed translation [2020-07-29 01:35:56,638 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:35:56 WrapperNode [2020-07-29 01:35:56,638 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-29 01:35:56,639 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-29 01:35:56,639 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-29 01:35:56,640 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-29 01:35:56,648 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:35:56" (1/1) ... [2020-07-29 01:35:56,664 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:35:56" (1/1) ... [2020-07-29 01:35:56,690 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-29 01:35:56,691 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-29 01:35:56,691 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-29 01:35:56,691 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-29 01:35:56,700 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:35:56" (1/1) ... [2020-07-29 01:35:56,701 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:35:56" (1/1) ... [2020-07-29 01:35:56,704 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:35:56" (1/1) ... [2020-07-29 01:35:56,705 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:35:56" (1/1) ... [2020-07-29 01:35:56,711 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:35:56" (1/1) ... [2020-07-29 01:35:56,716 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:35:56" (1/1) ... [2020-07-29 01:35:56,718 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:35:56" (1/1) ... [2020-07-29 01:35:56,720 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-29 01:35:56,721 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-29 01:35:56,721 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-29 01:35:56,721 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-29 01:35:56,722 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:35:56" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:56,794 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-29 01:35:56,795 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-29 01:35:56,795 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-29 01:35:56,795 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-29 01:35:56,796 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-29 01:35:56,796 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-29 01:35:57,206 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-29 01:35:57,206 INFO L295 CfgBuilder]: Removed 7 assume(true) statements. [2020-07-29 01:35:57,208 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:35:57 BoogieIcfgContainer [2020-07-29 01:35:57,209 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-29 01:35:57,209 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-07-29 01:35:57,209 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-07-29 01:35:57,213 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-07-29 01:35:57,214 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:35:57,214 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 29.07 01:35:56" (1/3) ... [2020-07-29 01:35:57,215 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7b52aaff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 01:35:57, skipping insertion in model container [2020-07-29 01:35:57,215 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:35:57,215 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:35:56" (2/3) ... [2020-07-29 01:35:57,216 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7b52aaff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 01:35:57, skipping insertion in model container [2020-07-29 01:35:57,216 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:35:57,216 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:35:57" (3/3) ... [2020-07-29 01:35:57,217 INFO L371 chiAutomizerObserver]: Analyzing ICFG java_AG313-alloca.i [2020-07-29 01:35:57,265 INFO L356 BuchiCegarLoop]: Interprodecural is true [2020-07-29 01:35:57,265 INFO L357 BuchiCegarLoop]: Hoare is false [2020-07-29 01:35:57,265 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-29 01:35:57,266 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-29 01:35:57,269 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-29 01:35:57,269 INFO L361 BuchiCegarLoop]: Difference is false [2020-07-29 01:35:57,270 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-29 01:35:57,270 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-07-29 01:35:57,282 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states. [2020-07-29 01:35:57,306 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:35:57,306 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:35:57,306 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:35:57,311 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2020-07-29 01:35:57,311 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-29 01:35:57,311 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2020-07-29 01:35:57,312 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states. [2020-07-29 01:35:57,314 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:35:57,314 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:35:57,314 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:35:57,315 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2020-07-29 01:35:57,315 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-29 01:35:57,321 INFO L794 eck$LassoCheckResult]: Stem: 5#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 3#L-1true havoc main_#res;havoc main_#t~nondet13, main_#t~nondet14, main_#t~ret15;quot_#in~x, quot_#in~y := main_#t~nondet13, main_#t~nondet14;havoc quot_#res;havoc quot_#t~malloc2.base, quot_#t~malloc2.offset, quot_#t~malloc3.base, quot_#t~malloc3.offset, quot_#t~malloc4.base, quot_#t~malloc4.offset, quot_#t~mem5, quot_#t~mem9, quot_#t~mem10, quot_#t~mem11, quot_#t~mem6, quot_#t~mem7, quot_#t~short8, quot_#t~mem12, quot_~x, quot_~y, quot_~x_ref~0.base, quot_~x_ref~0.offset, quot_~y_ref~0.base, quot_~y_ref~0.offset, quot_~i~0.base, quot_~i~0.offset;quot_~x := quot_#in~x;quot_~y := quot_#in~y;call quot_#t~malloc2.base, quot_#t~malloc2.offset := #Ultimate.allocOnStack(4);quot_~x_ref~0.base, quot_~x_ref~0.offset := quot_#t~malloc2.base, quot_#t~malloc2.offset;call quot_#t~malloc3.base, quot_#t~malloc3.offset := #Ultimate.allocOnStack(4);quot_~y_ref~0.base, quot_~y_ref~0.offset := quot_#t~malloc3.base, quot_#t~malloc3.offset;call quot_#t~malloc4.base, quot_#t~malloc4.offset := #Ultimate.allocOnStack(4);quot_~i~0.base, quot_~i~0.offset := quot_#t~malloc4.base, quot_#t~malloc4.offset;call write~int(quot_~x, quot_~x_ref~0.base, quot_~x_ref~0.offset, 4);call write~int(quot_~y, quot_~y_ref~0.base, quot_~y_ref~0.offset, 4);call write~int(0, quot_~i~0.base, quot_~i~0.offset, 4);call quot_#t~mem5 := read~int(quot_~x_ref~0.base, quot_~x_ref~0.offset, 4); 10#L555true assume !(0 == quot_#t~mem5);havoc quot_#t~mem5; 7#L556-5true [2020-07-29 01:35:57,322 INFO L796 eck$LassoCheckResult]: Loop: 7#L556-5true call quot_#t~mem6 := read~int(quot_~x_ref~0.base, quot_~x_ref~0.offset, 4);quot_#t~short8 := quot_#t~mem6 > 0; 11#L556-1true assume !quot_#t~short8; 4#L556-3true assume !!quot_#t~short8;havoc quot_#t~mem7;havoc quot_#t~mem6;havoc quot_#t~short8;call quot_#t~mem9 := read~int(quot_~i~0.base, quot_~i~0.offset, 4);call write~int(1 + quot_#t~mem9, quot_~i~0.base, quot_~i~0.offset, 4);havoc quot_#t~mem9;call quot_#t~mem10 := read~int(quot_~x_ref~0.base, quot_~x_ref~0.offset, 4);call quot_#t~mem11 := read~int(quot_~y_ref~0.base, quot_~y_ref~0.offset, 4);call write~int(quot_#t~mem10 - 1 - (quot_#t~mem11 - 1), quot_~x_ref~0.base, quot_~x_ref~0.offset, 4);havoc quot_#t~mem11;havoc quot_#t~mem10; 7#L556-5true [2020-07-29 01:35:57,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:35:57,328 INFO L82 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 1 times [2020-07-29 01:35:57,337 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:35:57,338 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800496632] [2020-07-29 01:35:57,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:35:57,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:35:57,466 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:35:57,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:35:57,503 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:35:57,525 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:35:57,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:35:57,527 INFO L82 PathProgramCache]: Analyzing trace with hash 41873, now seen corresponding path program 1 times [2020-07-29 01:35:57,527 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:35:57,527 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634421451] [2020-07-29 01:35:57,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:35:57,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:35:57,603 INFO L280 TraceCheckUtils]: 0: Hoare triple {17#true} call quot_#t~mem6 := read~int(quot_~x_ref~0.base, quot_~x_ref~0.offset, 4);quot_#t~short8 := quot_#t~mem6 > 0; {17#true} is VALID [2020-07-29 01:35:57,604 INFO L280 TraceCheckUtils]: 1: Hoare triple {17#true} assume !quot_#t~short8; {19#(not |ULTIMATE.start_quot_#t~short8|)} is VALID [2020-07-29 01:35:57,605 INFO L280 TraceCheckUtils]: 2: Hoare triple {19#(not |ULTIMATE.start_quot_#t~short8|)} assume !!quot_#t~short8;havoc quot_#t~mem7;havoc quot_#t~mem6;havoc quot_#t~short8;call quot_#t~mem9 := read~int(quot_~i~0.base, quot_~i~0.offset, 4);call write~int(1 + quot_#t~mem9, quot_~i~0.base, quot_~i~0.offset, 4);havoc quot_#t~mem9;call quot_#t~mem10 := read~int(quot_~x_ref~0.base, quot_~x_ref~0.offset, 4);call quot_#t~mem11 := read~int(quot_~y_ref~0.base, quot_~y_ref~0.offset, 4);call write~int(quot_#t~mem10 - 1 - (quot_#t~mem11 - 1), quot_~x_ref~0.base, quot_~x_ref~0.offset, 4);havoc quot_#t~mem11;havoc quot_#t~mem10; {18#false} is VALID [2020-07-29 01:35:57,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:35:57,608 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634421451] [2020-07-29 01:35:57,608 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:35:57,609 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-29 01:35:57,609 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387692347] [2020-07-29 01:35:57,615 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-07-29 01:35:57,616 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:35:57,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-29 01:35:57,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-29 01:35:57,632 INFO L87 Difference]: Start difference. First operand 11 states. Second operand 3 states. [2020-07-29 01:35:57,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:35:57,693 INFO L93 Difference]: Finished difference Result 12 states and 14 transitions. [2020-07-29 01:35:57,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-29 01:35:57,694 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 01:35:57,703 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 3 edges. 3 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:35:57,705 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 14 transitions. [2020-07-29 01:35:57,708 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:35:57,712 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 6 states and 6 transitions. [2020-07-29 01:35:57,714 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2020-07-29 01:35:57,714 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2020-07-29 01:35:57,715 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 6 transitions. [2020-07-29 01:35:57,716 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 01:35:57,716 INFO L688 BuchiCegarLoop]: Abstraction has 6 states and 6 transitions. [2020-07-29 01:35:57,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states and 6 transitions. [2020-07-29 01:35:57,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2020-07-29 01:35:57,746 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:35:57,746 INFO L82 GeneralOperation]: Start isEquivalent. First operand 6 states and 6 transitions. Second operand 6 states. [2020-07-29 01:35:57,747 INFO L74 IsIncluded]: Start isIncluded. First operand 6 states and 6 transitions. Second operand 6 states. [2020-07-29 01:35:57,749 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 6 states. [2020-07-29 01:35:57,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:35:57,750 INFO L93 Difference]: Finished difference Result 6 states and 6 transitions. [2020-07-29 01:35:57,751 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2020-07-29 01:35:57,752 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:35:57,752 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:35:57,753 INFO L74 IsIncluded]: Start isIncluded. First operand 6 states. Second operand 6 states and 6 transitions. [2020-07-29 01:35:57,753 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 6 states and 6 transitions. [2020-07-29 01:35:57,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:35:57,754 INFO L93 Difference]: Finished difference Result 6 states and 6 transitions. [2020-07-29 01:35:57,754 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2020-07-29 01:35:57,755 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:35:57,755 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:35:57,756 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:35:57,756 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:35:57,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-29 01:35:57,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2020-07-29 01:35:57,759 INFO L711 BuchiCegarLoop]: Abstraction has 6 states and 6 transitions. [2020-07-29 01:35:57,759 INFO L591 BuchiCegarLoop]: Abstraction has 6 states and 6 transitions. [2020-07-29 01:35:57,759 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2020-07-29 01:35:57,759 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6 states and 6 transitions. [2020-07-29 01:35:57,760 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:35:57,760 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:35:57,761 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:35:57,761 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2020-07-29 01:35:57,761 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-29 01:35:57,762 INFO L794 eck$LassoCheckResult]: Stem: 36#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 32#L-1 havoc main_#res;havoc main_#t~nondet13, main_#t~nondet14, main_#t~ret15;quot_#in~x, quot_#in~y := main_#t~nondet13, main_#t~nondet14;havoc quot_#res;havoc quot_#t~malloc2.base, quot_#t~malloc2.offset, quot_#t~malloc3.base, quot_#t~malloc3.offset, quot_#t~malloc4.base, quot_#t~malloc4.offset, quot_#t~mem5, quot_#t~mem9, quot_#t~mem10, quot_#t~mem11, quot_#t~mem6, quot_#t~mem7, quot_#t~short8, quot_#t~mem12, quot_~x, quot_~y, quot_~x_ref~0.base, quot_~x_ref~0.offset, quot_~y_ref~0.base, quot_~y_ref~0.offset, quot_~i~0.base, quot_~i~0.offset;quot_~x := quot_#in~x;quot_~y := quot_#in~y;call quot_#t~malloc2.base, quot_#t~malloc2.offset := #Ultimate.allocOnStack(4);quot_~x_ref~0.base, quot_~x_ref~0.offset := quot_#t~malloc2.base, quot_#t~malloc2.offset;call quot_#t~malloc3.base, quot_#t~malloc3.offset := #Ultimate.allocOnStack(4);quot_~y_ref~0.base, quot_~y_ref~0.offset := quot_#t~malloc3.base, quot_#t~malloc3.offset;call quot_#t~malloc4.base, quot_#t~malloc4.offset := #Ultimate.allocOnStack(4);quot_~i~0.base, quot_~i~0.offset := quot_#t~malloc4.base, quot_#t~malloc4.offset;call write~int(quot_~x, quot_~x_ref~0.base, quot_~x_ref~0.offset, 4);call write~int(quot_~y, quot_~y_ref~0.base, quot_~y_ref~0.offset, 4);call write~int(0, quot_~i~0.base, quot_~i~0.offset, 4);call quot_#t~mem5 := read~int(quot_~x_ref~0.base, quot_~x_ref~0.offset, 4); 33#L555 assume !(0 == quot_#t~mem5);havoc quot_#t~mem5; 35#L556-5 [2020-07-29 01:35:57,762 INFO L796 eck$LassoCheckResult]: Loop: 35#L556-5 call quot_#t~mem6 := read~int(quot_~x_ref~0.base, quot_~x_ref~0.offset, 4);quot_#t~short8 := quot_#t~mem6 > 0; 37#L556-1 assume quot_#t~short8;call quot_#t~mem7 := read~int(quot_~y_ref~0.base, quot_~y_ref~0.offset, 4);quot_#t~short8 := quot_#t~mem7 > 0; 34#L556-3 assume !!quot_#t~short8;havoc quot_#t~mem7;havoc quot_#t~mem6;havoc quot_#t~short8;call quot_#t~mem9 := read~int(quot_~i~0.base, quot_~i~0.offset, 4);call write~int(1 + quot_#t~mem9, quot_~i~0.base, quot_~i~0.offset, 4);havoc quot_#t~mem9;call quot_#t~mem10 := read~int(quot_~x_ref~0.base, quot_~x_ref~0.offset, 4);call quot_#t~mem11 := read~int(quot_~y_ref~0.base, quot_~y_ref~0.offset, 4);call write~int(quot_#t~mem10 - 1 - (quot_#t~mem11 - 1), quot_~x_ref~0.base, quot_~x_ref~0.offset, 4);havoc quot_#t~mem11;havoc quot_#t~mem10; 35#L556-5 [2020-07-29 01:35:57,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:35:57,762 INFO L82 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 2 times [2020-07-29 01:35:57,763 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:35:57,763 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610403072] [2020-07-29 01:35:57,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:35:57,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:35:57,791 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:35:57,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:35:57,815 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:35:57,821 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:35:57,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:35:57,822 INFO L82 PathProgramCache]: Analyzing trace with hash 41811, now seen corresponding path program 1 times [2020-07-29 01:35:57,823 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:35:57,823 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618623635] [2020-07-29 01:35:57,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:35:57,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:35:57,845 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:35:57,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:35:57,871 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:35:57,879 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:35:57,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:35:57,882 INFO L82 PathProgramCache]: Analyzing trace with hash 889571280, now seen corresponding path program 1 times [2020-07-29 01:35:57,882 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:35:57,883 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771951708] [2020-07-29 01:35:57,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:35:57,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:35:57,952 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:35:58,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:35:58,003 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:35:58,018 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:35:58,216 WARN L193 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 59 [2020-07-29 01:35:58,725 WARN L193 SmtUtils]: Spent 388.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 86 [2020-07-29 01:35:58,908 WARN L193 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2020-07-29 01:35:58,924 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:35:58,926 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:35:58,926 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:35:58,926 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:35:58,927 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:35:58,927 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:35:58,927 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:35:58,927 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:35:58,927 INFO L133 ssoRankerPreferences]: Filename of dumped script: java_AG313-alloca.i_Iteration2_Lasso [2020-07-29 01:35:58,927 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:35:58,928 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:35:58,996 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:35:59,005 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:35:59,010 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:35:59,017 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:35:59,022 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:35:59,027 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:35:59,453 WARN L193 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 74 [2020-07-29 01:35:59,639 WARN L193 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 59 [2020-07-29 01:35:59,651 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:35:59,661 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:35:59,665 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:35:59,669 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:35:59,675 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:35:59,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 01:35:59,684 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:35:59,689 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:35:59,693 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:35:59,697 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:35:59,702 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:35:59,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 01:36:00,792 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:36:00,798 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) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:36:00,806 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:36:00,809 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:36:00,809 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:36:00,810 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:36:00,810 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:36:00,810 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:36:00,812 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:36:00,812 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:36:00,815 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:36:00,843 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:36:00,844 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:36:00,845 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:36:00,845 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:36:00,845 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:36:00,845 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:36:00,849 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:36:00,849 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:36:00,851 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:36:00,876 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:36:00,878 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:36:00,878 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:36:00,878 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:36:00,878 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:36:00,883 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:36:00,883 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:36:00,886 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:36:00,908 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:36:00,910 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:36:00,910 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:36:00,911 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:36:00,911 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:36:00,911 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:36:00,912 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:36:00,912 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:36:00,915 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) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:36:00,941 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:36:00,942 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:36:00,942 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:36:00,942 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:36:00,943 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:36:00,943 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:36:00,943 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:36:00,943 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:36:00,950 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:36:00,973 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:36:00,974 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:36:00,974 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:36:00,975 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:36:00,975 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:36:00,986 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:36:00,986 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:36:00,993 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 01:36:01,031 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:36:01,033 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:36:01,033 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:36:01,033 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:36:01,034 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:36:01,038 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:36:01,038 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 01:36:01,045 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:36:01,075 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:36:01,077 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:36:01,077 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:36:01,078 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:36:01,078 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:36:01,087 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:36:01,087 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:36:01,097 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:36:01,137 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:36:01,139 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:36:01,139 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:36:01,139 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:36:01,139 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:36:01,141 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:36:01,141 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:36:01,147 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 01:36:01,174 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:36:01,176 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:36:01,176 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:36:01,176 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:36:01,176 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:36:01,178 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:36:01,178 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:36:01,182 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 01:36:01,207 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:36:01,209 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:36:01,209 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:36:01,209 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:36:01,209 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:36:01,211 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:36:01,211 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:36:01,216 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) [2020-07-29 01:36:01,252 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 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:36:01,254 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:36:01,255 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:36:01,255 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:36:01,255 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:36:01,264 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:36:01,264 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:36:01,279 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:36:01,302 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:36:01,304 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:36:01,304 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:36:01,304 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:36:01,304 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:36:01,313 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:36:01,314 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:36:01,320 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:36:01,347 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:36:01,349 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:36:01,349 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2020-07-29 01:36:01,349 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:36:01,349 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:36:01,362 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2020-07-29 01:36:01,362 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:36:01,381 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:36:01,533 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2020-07-29 01:36:01,533 INFO L444 ModelExtractionUtils]: 9 out of 28 variables were initially zero. Simplification set additionally 17 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:36:01,541 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 01:36:01,548 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-07-29 01:36:01,549 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:36:01,549 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_quot_~x_ref~0.base) ULTIMATE.start_quot_~x_ref~0.offset)_1) = 1*v_rep(select (select #memory_int ULTIMATE.start_quot_~x_ref~0.base) ULTIMATE.start_quot_~x_ref~0.offset)_1 Supporting invariants [] [2020-07-29 01:36:01,703 INFO L297 tatePredicateManager]: 22 out of 24 supporting invariants were superfluous and have been removed [2020-07-29 01:36:01,712 INFO L393 LassoCheck]: Loop: "call quot_#t~mem6 := read~int(quot_~x_ref~0.base, quot_~x_ref~0.offset, 4);quot_#t~short8 := quot_#t~mem6 > 0;" "assume quot_#t~short8;call quot_#t~mem7 := read~int(quot_~y_ref~0.base, quot_~y_ref~0.offset, 4);quot_#t~short8 := quot_#t~mem7 > 0;" "assume !!quot_#t~short8;havoc quot_#t~mem7;havoc quot_#t~mem6;havoc quot_#t~short8;call quot_#t~mem9 := read~int(quot_~i~0.base, quot_~i~0.offset, 4);call write~int(1 + quot_#t~mem9, quot_~i~0.base, quot_~i~0.offset, 4);havoc quot_#t~mem9;call quot_#t~mem10 := read~int(quot_~x_ref~0.base, quot_~x_ref~0.offset, 4);call quot_#t~mem11 := read~int(quot_~y_ref~0.base, quot_~y_ref~0.offset, 4);call write~int(quot_#t~mem10 - 1 - (quot_#t~mem11 - 1), quot_~x_ref~0.base, quot_~x_ref~0.offset, 4);havoc quot_#t~mem11;havoc quot_#t~mem10;" [2020-07-29 01:36:01,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:36:01,728 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-29 01:36:01,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:36:01,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:36:01,786 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 14 conjunts are in the unsatisfiable core [2020-07-29 01:36:01,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:36:01,798 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:36:14,061 WARN L193 SmtUtils]: Spent 12.12 s on a formula simplification that was a NOOP. DAG size: 44 [2020-07-29 01:36:14,229 INFO L173 IndexEqualityManager]: detected equality via solver [2020-07-29 01:36:14,232 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-29 01:36:14,256 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:36:14,260 INFO L173 IndexEqualityManager]: detected equality via solver [2020-07-29 01:36:14,265 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2020-07-29 01:36:14,316 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:36:14,370 INFO L544 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-29 01:36:14,370 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 10 variables, input treesize:93, output treesize:17 [2020-07-29 01:36:14,380 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-29 01:36:14,380 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_50|, ULTIMATE.start_quot_~x_ref~0.offset, ULTIMATE.start_quot_~x, ULTIMATE.start_quot_~y_ref~0.base, ULTIMATE.start_quot_~y_ref~0.offset, ULTIMATE.start_quot_~y, ULTIMATE.start_quot_~i~0.offset, |v_#length_50|, |ULTIMATE.start_quot_#t~malloc2.base|, |ULTIMATE.start_quot_#t~malloc3.base|]. (and (<= 0 ULTIMATE.start_quot_~i~0.offset) (= |ULTIMATE.start_quot_#t~malloc4.base| ULTIMATE.start_quot_~i~0.base) (<= ULTIMATE.start_quot_~x_ref~0.offset 0) (<= (+ ULTIMATE.start_quot_~i~0.offset 4) (select (store (store (store |v_#length_50| |ULTIMATE.start_quot_#t~malloc2.base| 4) |ULTIMATE.start_quot_#t~malloc3.base| 4) |ULTIMATE.start_quot_#t~malloc4.base| 4) ULTIMATE.start_quot_~i~0.base)) (= |ULTIMATE.start_quot_#t~mem5| (select (select (let ((.cse0 (let ((.cse1 (store |v_#memory_int_50| ULTIMATE.start_quot_~x_ref~0.base (store (select |v_#memory_int_50| ULTIMATE.start_quot_~x_ref~0.base) ULTIMATE.start_quot_~x_ref~0.offset ULTIMATE.start_quot_~x)))) (store .cse1 ULTIMATE.start_quot_~y_ref~0.base (store (select .cse1 ULTIMATE.start_quot_~y_ref~0.base) ULTIMATE.start_quot_~y_ref~0.offset ULTIMATE.start_quot_~y))))) (store .cse0 ULTIMATE.start_quot_~i~0.base (store (select .cse0 ULTIMATE.start_quot_~i~0.base) ULTIMATE.start_quot_~i~0.offset 0))) ULTIMATE.start_quot_~x_ref~0.base) ULTIMATE.start_quot_~x_ref~0.offset)) (<= 0 ULTIMATE.start_quot_~x_ref~0.offset) unseeded) [2020-07-29 01:36:14,381 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= |ULTIMATE.start_quot_#t~malloc4.base| ULTIMATE.start_quot_~i~0.base) (let ((.cse0 (= ULTIMATE.start_quot_~x_ref~0.base ULTIMATE.start_quot_~i~0.base))) (or (and (= 0 |ULTIMATE.start_quot_#t~mem5|) .cse0) (not .cse0))) unseeded) [2020-07-29 01:36:14,419 INFO L280 TraceCheckUtils]: 0: Hoare triple {59#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {59#unseeded} is VALID [2020-07-29 01:36:14,422 INFO L280 TraceCheckUtils]: 1: Hoare triple {59#unseeded} havoc main_#res;havoc main_#t~nondet13, main_#t~nondet14, main_#t~ret15;quot_#in~x, quot_#in~y := main_#t~nondet13, main_#t~nondet14;havoc quot_#res;havoc quot_#t~malloc2.base, quot_#t~malloc2.offset, quot_#t~malloc3.base, quot_#t~malloc3.offset, quot_#t~malloc4.base, quot_#t~malloc4.offset, quot_#t~mem5, quot_#t~mem9, quot_#t~mem10, quot_#t~mem11, quot_#t~mem6, quot_#t~mem7, quot_#t~short8, quot_#t~mem12, quot_~x, quot_~y, quot_~x_ref~0.base, quot_~x_ref~0.offset, quot_~y_ref~0.base, quot_~y_ref~0.offset, quot_~i~0.base, quot_~i~0.offset;quot_~x := quot_#in~x;quot_~y := quot_#in~y;call quot_#t~malloc2.base, quot_#t~malloc2.offset := #Ultimate.allocOnStack(4);quot_~x_ref~0.base, quot_~x_ref~0.offset := quot_#t~malloc2.base, quot_#t~malloc2.offset;call quot_#t~malloc3.base, quot_#t~malloc3.offset := #Ultimate.allocOnStack(4);quot_~y_ref~0.base, quot_~y_ref~0.offset := quot_#t~malloc3.base, quot_#t~malloc3.offset;call quot_#t~malloc4.base, quot_#t~malloc4.offset := #Ultimate.allocOnStack(4);quot_~i~0.base, quot_~i~0.offset := quot_#t~malloc4.base, quot_#t~malloc4.offset;call write~int(quot_~x, quot_~x_ref~0.base, quot_~x_ref~0.offset, 4);call write~int(quot_~y, quot_~y_ref~0.base, quot_~y_ref~0.offset, 4);call write~int(0, quot_~i~0.base, quot_~i~0.offset, 4);call quot_#t~mem5 := read~int(quot_~x_ref~0.base, quot_~x_ref~0.offset, 4); {206#(and (= |ULTIMATE.start_quot_#t~malloc4.base| ULTIMATE.start_quot_~i~0.base) (or (= 0 |ULTIMATE.start_quot_#t~mem5|) (not (= ULTIMATE.start_quot_~x_ref~0.base ULTIMATE.start_quot_~i~0.base))) unseeded)} is VALID [2020-07-29 01:36:14,423 INFO L280 TraceCheckUtils]: 2: Hoare triple {206#(and (= |ULTIMATE.start_quot_#t~malloc4.base| ULTIMATE.start_quot_~i~0.base) (or (= 0 |ULTIMATE.start_quot_#t~mem5|) (not (= ULTIMATE.start_quot_~x_ref~0.base ULTIMATE.start_quot_~i~0.base))) unseeded)} assume !(0 == quot_#t~mem5);havoc quot_#t~mem5; {194#(and (= |ULTIMATE.start_quot_#t~malloc4.base| ULTIMATE.start_quot_~i~0.base) (not (= ULTIMATE.start_quot_~x_ref~0.base |ULTIMATE.start_quot_#t~malloc4.base|)) unseeded)} is VALID [2020-07-29 01:36:14,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:36:14,437 INFO L263 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 12 conjunts are in the unsatisfiable core [2020-07-29 01:36:14,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:36:14,475 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:36:14,504 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 01:36:14,587 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 01:36:14,659 INFO L280 TraceCheckUtils]: 0: Hoare triple {195#(and (= |ULTIMATE.start_quot_#t~malloc4.base| ULTIMATE.start_quot_~i~0.base) (>= oldRank0 (select (select |#memory_int| ULTIMATE.start_quot_~x_ref~0.base) ULTIMATE.start_quot_~x_ref~0.offset)) (not (= ULTIMATE.start_quot_~x_ref~0.base |ULTIMATE.start_quot_#t~malloc4.base|)))} call quot_#t~mem6 := read~int(quot_~x_ref~0.base, quot_~x_ref~0.offset, 4);quot_#t~short8 := quot_#t~mem6 > 0; {210#(and (or (<= 1 (select (select |#memory_int| ULTIMATE.start_quot_~x_ref~0.base) ULTIMATE.start_quot_~x_ref~0.offset)) (not |ULTIMATE.start_quot_#t~short8|)) (= |ULTIMATE.start_quot_#t~malloc4.base| ULTIMATE.start_quot_~i~0.base) (not (= ULTIMATE.start_quot_~x_ref~0.base |ULTIMATE.start_quot_#t~malloc4.base|)) (<= (select (select |#memory_int| ULTIMATE.start_quot_~x_ref~0.base) ULTIMATE.start_quot_~x_ref~0.offset) oldRank0))} is VALID [2020-07-29 01:36:14,661 INFO L280 TraceCheckUtils]: 1: Hoare triple {210#(and (or (<= 1 (select (select |#memory_int| ULTIMATE.start_quot_~x_ref~0.base) ULTIMATE.start_quot_~x_ref~0.offset)) (not |ULTIMATE.start_quot_#t~short8|)) (= |ULTIMATE.start_quot_#t~malloc4.base| ULTIMATE.start_quot_~i~0.base) (not (= ULTIMATE.start_quot_~x_ref~0.base |ULTIMATE.start_quot_#t~malloc4.base|)) (<= (select (select |#memory_int| ULTIMATE.start_quot_~x_ref~0.base) ULTIMATE.start_quot_~x_ref~0.offset) oldRank0))} assume quot_#t~short8;call quot_#t~mem7 := read~int(quot_~y_ref~0.base, quot_~y_ref~0.offset, 4);quot_#t~short8 := quot_#t~mem7 > 0; {214#(and (= |ULTIMATE.start_quot_#t~malloc4.base| ULTIMATE.start_quot_~i~0.base) (or (<= 1 (select (select |#memory_int| ULTIMATE.start_quot_~y_ref~0.base) ULTIMATE.start_quot_~y_ref~0.offset)) (not |ULTIMATE.start_quot_#t~short8|)) (<= 1 (select (select |#memory_int| ULTIMATE.start_quot_~x_ref~0.base) ULTIMATE.start_quot_~x_ref~0.offset)) (not (= ULTIMATE.start_quot_~x_ref~0.base |ULTIMATE.start_quot_#t~malloc4.base|)) (<= (select (select |#memory_int| ULTIMATE.start_quot_~x_ref~0.base) ULTIMATE.start_quot_~x_ref~0.offset) oldRank0))} is VALID [2020-07-29 01:36:14,664 INFO L280 TraceCheckUtils]: 2: Hoare triple {214#(and (= |ULTIMATE.start_quot_#t~malloc4.base| ULTIMATE.start_quot_~i~0.base) (or (<= 1 (select (select |#memory_int| ULTIMATE.start_quot_~y_ref~0.base) ULTIMATE.start_quot_~y_ref~0.offset)) (not |ULTIMATE.start_quot_#t~short8|)) (<= 1 (select (select |#memory_int| ULTIMATE.start_quot_~x_ref~0.base) ULTIMATE.start_quot_~x_ref~0.offset)) (not (= ULTIMATE.start_quot_~x_ref~0.base |ULTIMATE.start_quot_#t~malloc4.base|)) (<= (select (select |#memory_int| ULTIMATE.start_quot_~x_ref~0.base) ULTIMATE.start_quot_~x_ref~0.offset) oldRank0))} assume !!quot_#t~short8;havoc quot_#t~mem7;havoc quot_#t~mem6;havoc quot_#t~short8;call quot_#t~mem9 := read~int(quot_~i~0.base, quot_~i~0.offset, 4);call write~int(1 + quot_#t~mem9, quot_~i~0.base, quot_~i~0.offset, 4);havoc quot_#t~mem9;call quot_#t~mem10 := read~int(quot_~x_ref~0.base, quot_~x_ref~0.offset, 4);call quot_#t~mem11 := read~int(quot_~y_ref~0.base, quot_~y_ref~0.offset, 4);call write~int(quot_#t~mem10 - 1 - (quot_#t~mem11 - 1), quot_~x_ref~0.base, quot_~x_ref~0.offset, 4);havoc quot_#t~mem11;havoc quot_#t~mem10; {197#(and (= |ULTIMATE.start_quot_#t~malloc4.base| ULTIMATE.start_quot_~i~0.base) (or unseeded (and (> oldRank0 (select (select |#memory_int| ULTIMATE.start_quot_~x_ref~0.base) ULTIMATE.start_quot_~x_ref~0.offset)) (>= oldRank0 0))) (not (= ULTIMATE.start_quot_~x_ref~0.base |ULTIMATE.start_quot_#t~malloc4.base|)))} is VALID [2020-07-29 01:36:14,665 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:36:14,666 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-29 01:36:14,688 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 01:36:14,690 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:36:14,691 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:14,694 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2020-07-29 01:36:14,695 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 6 states and 6 transitions. cyclomatic complexity: 1 Second operand 5 states. [2020-07-29 01:36:14,812 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 6 states and 6 transitions. cyclomatic complexity: 1. Second operand 5 states. Result 9 states and 10 transitions. Complement of second has 7 states. [2020-07-29 01:36:14,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2020-07-29 01:36:14,814 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:36:14,815 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6 states and 6 transitions. cyclomatic complexity: 1 [2020-07-29 01:36:14,815 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:36:14,815 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:36:14,815 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5 states. [2020-07-29 01:36:14,816 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:36:14,816 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:36:14,816 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:36:14,816 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 10 transitions. [2020-07-29 01:36:14,817 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:36:14,817 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 01:36:14,820 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 6 states and 6 transitions. cyclomatic complexity: 1 [2020-07-29 01:36:14,820 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2020-07-29 01:36:14,820 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 5 states. [2020-07-29 01:36:14,821 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:36:14,821 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:36:14,822 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 9 states and 10 transitions. cyclomatic complexity: 2 [2020-07-29 01:36:14,822 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 10 transitions. cyclomatic complexity: 2 [2020-07-29 01:36:14,822 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 01:36:14,822 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2020-07-29 01:36:14,822 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 6 transitions. cyclomatic complexity: 1 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:36:14,823 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:14,823 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:36:14,823 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:14,823 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 10 transitions. cyclomatic complexity: 2 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:36:14,824 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:14,824 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 6 transitions. cyclomatic complexity: 1 Stem has 2 letters. Loop has 3 letters. [2020-07-29 01:36:14,824 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:14,824 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 2 letters. Loop has 3 letters. [2020-07-29 01:36:14,825 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:14,825 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 10 transitions. cyclomatic complexity: 2 Stem has 2 letters. Loop has 3 letters. [2020-07-29 01:36:14,825 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:14,825 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 6 transitions. cyclomatic complexity: 1 Stem has 9 letters. Loop has 9 letters. [2020-07-29 01:36:14,825 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:14,826 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 9 letters. Loop has 9 letters. [2020-07-29 01:36:14,826 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:14,826 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 10 transitions. cyclomatic complexity: 2 Stem has 9 letters. Loop has 9 letters. [2020-07-29 01:36:14,826 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:14,826 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 6 transitions. cyclomatic complexity: 1 Stem has 6 letters. Loop has 6 letters. [2020-07-29 01:36:14,826 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:14,826 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 6 letters. Loop has 6 letters. [2020-07-29 01:36:14,826 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:14,829 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 10 transitions. cyclomatic complexity: 2 Stem has 6 letters. Loop has 6 letters. [2020-07-29 01:36:14,830 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:14,830 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 6 transitions. cyclomatic complexity: 1 Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:36:14,830 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:14,830 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:36:14,830 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:14,830 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 10 transitions. cyclomatic complexity: 2 Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:36:14,831 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:14,831 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 6 transitions. cyclomatic complexity: 1 Stem has 5 letters. Loop has 3 letters. [2020-07-29 01:36:14,831 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:14,831 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 5 letters. Loop has 3 letters. [2020-07-29 01:36:14,832 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:14,832 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 10 transitions. cyclomatic complexity: 2 Stem has 5 letters. Loop has 3 letters. [2020-07-29 01:36:14,834 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:14,834 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 6 transitions. cyclomatic complexity: 1 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:36:14,834 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:14,834 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:36:14,834 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:14,834 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 10 transitions. cyclomatic complexity: 2 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:36:14,835 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:14,835 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 6 transitions. cyclomatic complexity: 1 Stem has 4 letters. Loop has 3 letters. [2020-07-29 01:36:14,835 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:14,835 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 4 letters. Loop has 3 letters. [2020-07-29 01:36:14,835 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:14,835 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 10 transitions. cyclomatic complexity: 2 Stem has 4 letters. Loop has 3 letters. [2020-07-29 01:36:14,836 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:14,836 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 6 transitions. cyclomatic complexity: 1 Stem has 2 letters. Loop has 3 letters. [2020-07-29 01:36:14,836 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:14,836 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 2 letters. Loop has 3 letters. [2020-07-29 01:36:14,836 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:14,837 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 10 transitions. cyclomatic complexity: 2 Stem has 2 letters. Loop has 3 letters. [2020-07-29 01:36:14,837 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:14,837 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:36:14,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-29 01:36:14,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 6 transitions. [2020-07-29 01:36:14,839 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 6 transitions. Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:36:14,840 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:14,840 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 6 transitions. Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:36:14,841 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:14,841 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 6 transitions. Stem has 3 letters. Loop has 6 letters. [2020-07-29 01:36:14,841 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:36:14,842 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 9 states and 10 transitions. cyclomatic complexity: 2 [2020-07-29 01:36:14,845 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:36:14,845 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 9 states to 0 states and 0 transitions. [2020-07-29 01:36:14,845 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-07-29 01:36:14,845 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-07-29 01:36:14,845 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-07-29 01:36:14,845 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 01:36:14,845 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 01:36:14,846 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 01:36:14,846 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 01:36:14,846 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2020-07-29 01:36:14,846 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-07-29 01:36:14,846 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:36:14,846 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 01:36:14,852 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 29.07 01:36:14 BoogieIcfgContainer [2020-07-29 01:36:14,852 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-07-29 01:36:14,853 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-07-29 01:36:14,853 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-07-29 01:36:14,853 INFO L275 PluginConnector]: Witness Printer initialized [2020-07-29 01:36:14,854 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:35:57" (3/4) ... [2020-07-29 01:36:14,857 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-07-29 01:36:14,857 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-07-29 01:36:14,860 INFO L168 Benchmark]: Toolchain (without parser) took 18851.94 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 302.0 MB). Free memory was 960.2 MB in the beginning and 1.2 GB in the end (delta: -280.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. [2020-07-29 01:36:14,861 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:36:14,862 INFO L168 Benchmark]: CACSL2BoogieTranslator took 629.03 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 116.9 MB). Free memory was 954.8 MB in the beginning and 1.1 GB in the end (delta: -143.8 MB). Peak memory consumption was 21.1 MB. Max. memory is 11.5 GB. [2020-07-29 01:36:14,867 INFO L168 Benchmark]: Boogie Procedure Inliner took 51.36 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2020-07-29 01:36:14,868 INFO L168 Benchmark]: Boogie Preprocessor took 29.53 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2020-07-29 01:36:14,868 INFO L168 Benchmark]: RCFGBuilder took 488.05 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 26.0 MB). Peak memory consumption was 26.0 MB. Max. memory is 11.5 GB. [2020-07-29 01:36:14,869 INFO L168 Benchmark]: BuchiAutomizer took 17643.05 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 185.1 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -181.8 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. [2020-07-29 01:36:14,870 INFO L168 Benchmark]: Witness Printer took 4.31 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:36:14,883 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.19 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 629.03 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 116.9 MB). Free memory was 954.8 MB in the beginning and 1.1 GB in the end (delta: -143.8 MB). Peak memory consumption was 21.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 51.36 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 29.53 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 488.05 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 26.0 MB). Peak memory consumption was 26.0 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 17643.05 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 185.1 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -181.8 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. * Witness Printer took 4.31 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 2 terminating modules (1 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function unknown-#memory_int-unknown[x_ref][x_ref] and consists of 5 locations. 1 modules have a trivial ranking function, the largest among these consists of 3 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 17.5s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 4.2s. Construction of modules took 0.0s. Büchi inclusion checks took 13.1s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 6 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 14 SDtfs, 1 SDslu, 8 SDs, 0 SdLazy, 13 SolverSat, 6 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital331 mio100 ax105 hnf100 lsp92 ukn57 mio100 lsp37 div100 bol100 ite100 ukn100 eq179 hnf88 smp97 dnf100 smp100 tf100 neg100 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 203ms VariablesStem: 8 VariablesLoop: 4 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...