./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-memory-alloca/mult_array-alloca-2.i --full-output -ea --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.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/mult_array-alloca-2.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 5744db56abf24224cf1693e3e46d5bede5dd8c74199d1ade21d96d1156922237 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-21 03:32:50,697 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-21 03:32:50,699 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-21 03:32:50,736 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-21 03:32:50,736 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-21 03:32:50,737 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-21 03:32:50,739 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-21 03:32:50,740 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-21 03:32:50,742 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-21 03:32:50,743 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-21 03:32:50,744 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-21 03:32:50,745 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-21 03:32:50,746 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-21 03:32:50,747 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-21 03:32:50,748 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-21 03:32:50,749 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-21 03:32:50,750 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-21 03:32:50,750 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-21 03:32:50,755 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-21 03:32:50,758 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-21 03:32:50,765 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-21 03:32:50,766 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-21 03:32:50,767 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-21 03:32:50,767 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-21 03:32:50,770 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-21 03:32:50,770 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-21 03:32:50,770 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-21 03:32:50,771 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-21 03:32:50,772 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-21 03:32:50,772 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-21 03:32:50,773 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-21 03:32:50,773 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-21 03:32:50,774 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-21 03:32:50,775 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-21 03:32:50,776 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-21 03:32:50,776 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-21 03:32:50,777 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-21 03:32:50,777 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-21 03:32:50,777 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-21 03:32:50,778 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-21 03:32:50,779 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-21 03:32:50,780 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2022-02-21 03:32:50,803 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-21 03:32:50,805 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-21 03:32:50,806 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-21 03:32:50,806 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-21 03:32:50,807 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-21 03:32:50,807 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-21 03:32:50,807 INFO L138 SettingsManager]: * Use SBE=true [2022-02-21 03:32:50,808 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-02-21 03:32:50,808 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-02-21 03:32:50,808 INFO L138 SettingsManager]: * Use old map elimination=false [2022-02-21 03:32:50,809 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-02-21 03:32:50,809 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-02-21 03:32:50,809 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-02-21 03:32:50,809 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-21 03:32:50,809 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-21 03:32:50,810 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-21 03:32:50,810 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-21 03:32:50,810 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-02-21 03:32:50,810 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-02-21 03:32:50,810 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-02-21 03:32:50,811 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-21 03:32:50,811 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-02-21 03:32:50,811 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-21 03:32:50,811 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-02-21 03:32:50,811 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-21 03:32:50,812 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-21 03:32:50,812 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-21 03:32:50,812 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-21 03:32:50,813 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-02-21 03:32:50,813 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 -> 5744db56abf24224cf1693e3e46d5bede5dd8c74199d1ade21d96d1156922237 [2022-02-21 03:32:51,043 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-21 03:32:51,064 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-21 03:32:51,067 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-21 03:32:51,069 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-21 03:32:51,069 INFO L275 PluginConnector]: CDTParser initialized [2022-02-21 03:32:51,070 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-memory-alloca/mult_array-alloca-2.i [2022-02-21 03:32:51,133 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba0e4d4bd/b8ab3df536584328ab94b3d6c1cd2fb1/FLAG4e7cc327b [2022-02-21 03:32:51,629 INFO L306 CDTParser]: Found 1 translation units. [2022-02-21 03:32:51,631 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/mult_array-alloca-2.i [2022-02-21 03:32:51,642 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba0e4d4bd/b8ab3df536584328ab94b3d6c1cd2fb1/FLAG4e7cc327b [2022-02-21 03:32:52,132 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba0e4d4bd/b8ab3df536584328ab94b3d6c1cd2fb1 [2022-02-21 03:32:52,134 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-21 03:32:52,135 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-21 03:32:52,144 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-21 03:32:52,144 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-21 03:32:52,146 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-21 03:32:52,147 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:32:52" (1/1) ... [2022-02-21 03:32:52,148 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@70e9dac7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:32:52, skipping insertion in model container [2022-02-21 03:32:52,148 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:32:52" (1/1) ... [2022-02-21 03:32:52,159 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-21 03:32:52,194 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 03:32:52,476 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:32:52,485 INFO L203 MainTranslator]: Completed pre-run [2022-02-21 03:32:52,537 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:32:52,574 INFO L208 MainTranslator]: Completed translation [2022-02-21 03:32:52,575 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:32:52 WrapperNode [2022-02-21 03:32:52,575 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-21 03:32:52,577 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-21 03:32:52,577 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-21 03:32:52,577 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-21 03:32:52,582 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:32:52" (1/1) ... [2022-02-21 03:32:52,606 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:32:52" (1/1) ... [2022-02-21 03:32:52,634 INFO L137 Inliner]: procedures = 110, calls = 13, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 57 [2022-02-21 03:32:52,634 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-21 03:32:52,635 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-21 03:32:52,636 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-21 03:32:52,636 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-21 03:32:52,642 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:32:52" (1/1) ... [2022-02-21 03:32:52,642 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:32:52" (1/1) ... [2022-02-21 03:32:52,655 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:32:52" (1/1) ... [2022-02-21 03:32:52,655 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:32:52" (1/1) ... [2022-02-21 03:32:52,665 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:32:52" (1/1) ... [2022-02-21 03:32:52,670 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:32:52" (1/1) ... [2022-02-21 03:32:52,674 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:32:52" (1/1) ... [2022-02-21 03:32:52,678 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-21 03:32:52,681 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-21 03:32:52,681 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-21 03:32:52,681 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-21 03:32:52,683 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:32:52" (1/1) ... [2022-02-21 03:32:52,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:52,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:52,717 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:32:52,743 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2022-02-21 03:32:52,758 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-21 03:32:52,759 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-21 03:32:52,759 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-21 03:32:52,759 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-21 03:32:52,760 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-21 03:32:52,760 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-21 03:32:52,898 INFO L234 CfgBuilder]: Building ICFG [2022-02-21 03:32:52,899 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-21 03:32:53,077 INFO L275 CfgBuilder]: Performing block encoding [2022-02-21 03:32:53,082 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-21 03:32:53,083 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-02-21 03:32:53,084 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:32:53 BoogieIcfgContainer [2022-02-21 03:32:53,084 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-21 03:32:53,085 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-02-21 03:32:53,085 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-02-21 03:32:53,088 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-02-21 03:32:53,089 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:32:53,089 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 21.02 03:32:52" (1/3) ... [2022-02-21 03:32:53,090 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@705a698d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 03:32:53, skipping insertion in model container [2022-02-21 03:32:53,090 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:32:53,090 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:32:52" (2/3) ... [2022-02-21 03:32:53,091 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@705a698d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 03:32:53, skipping insertion in model container [2022-02-21 03:32:53,091 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:32:53,091 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:32:53" (3/3) ... [2022-02-21 03:32:53,092 INFO L388 chiAutomizerObserver]: Analyzing ICFG mult_array-alloca-2.i [2022-02-21 03:32:53,136 INFO L359 BuchiCegarLoop]: Interprodecural is true [2022-02-21 03:32:53,136 INFO L360 BuchiCegarLoop]: Hoare is false [2022-02-21 03:32:53,137 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-02-21 03:32:53,137 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-02-21 03:32:53,137 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-02-21 03:32:53,137 INFO L364 BuchiCegarLoop]: Difference is false [2022-02-21 03:32:53,137 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-02-21 03:32:53,138 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2022-02-21 03:32:53,158 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 16 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:32:53,182 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2022-02-21 03:32:53,182 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:32:53,183 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:32:53,187 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:32:53,187 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 03:32:53,187 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2022-02-21 03:32:53,188 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 16 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:32:53,194 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2022-02-21 03:32:53,194 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:32:53,194 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:32:53,195 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:32:53,195 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 03:32:53,201 INFO L791 eck$LassoCheckResult]: Stem: 4#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 7#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~nondet3#1, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~malloc5#1.base, main_#t~malloc5#1.offset, main_#t~nondet7#1, main_#t~post6#1, main_#t~mem9#1, main_#t~post8#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~fac~0#1, main_~arr~0#1.base, main_~arr~0#1.offset, main_~arr2~0#1.base, main_~arr2~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; 16#L550true assume !(main_~length~0#1 < 1); 17#L550-2true main_~fac~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1; 9#L552true assume !(main_~fac~0#1 < 1); 10#L552-2true call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;call main_#t~malloc5#1.base, main_#t~malloc5#1.offset := #Ultimate.allocOnStack(4 * (main_~fac~0#1 * main_~length~0#1));main_~arr2~0#1.base, main_~arr2~0#1.offset := main_#t~malloc5#1.base, main_#t~malloc5#1.offset; 12#L555true assume !((main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0) || (main_~arr2~0#1.base == 0 && main_~arr2~0#1.offset == 0));main_~i~0#1 := 0; 13#L556-3true [2022-02-21 03:32:53,202 INFO L793 eck$LassoCheckResult]: Loop: 13#L556-3true assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet7#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet7#1; 6#L556-2true main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 13#L556-3true [2022-02-21 03:32:53,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:32:53,206 INFO L85 PathProgramCache]: Analyzing trace with hash 1806815374, now seen corresponding path program 1 times [2022-02-21 03:32:53,214 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:32:53,214 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914008648] [2022-02-21 03:32:53,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:32:53,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:32:53,309 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-21 03:32:53,310 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1409773288] [2022-02-21 03:32:53,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:32:53,311 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:32:53,311 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:53,319 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:32:53,370 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-02-21 03:32:53,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:32:53,427 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:32:53,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:32:53,465 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:32:53,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:32:53,470 INFO L85 PathProgramCache]: Analyzing trace with hash 1891, now seen corresponding path program 1 times [2022-02-21 03:32:53,474 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:32:53,475 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563771741] [2022-02-21 03:32:53,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:32:53,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:32:53,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:32:53,495 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:32:53,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:32:53,522 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:32:53,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:32:53,525 INFO L85 PathProgramCache]: Analyzing trace with hash 1182787760, now seen corresponding path program 1 times [2022-02-21 03:32:53,525 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:32:53,526 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764387068] [2022-02-21 03:32:53,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:32:53,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:32:53,551 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-21 03:32:53,551 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1251268725] [2022-02-21 03:32:53,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:32:53,552 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:32:53,552 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:53,554 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:32:53,556 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-02-21 03:32:53,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:32:53,621 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:32:53,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:32:53,661 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:32:54,091 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:32:54,092 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:32:54,092 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:32:54,092 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:32:54,092 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:32:54,092 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:54,092 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:32:54,092 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:32:54,092 INFO L133 ssoRankerPreferences]: Filename of dumped script: mult_array-alloca-2.i_Iteration1_Lasso [2022-02-21 03:32:54,093 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:32:54,093 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:32:54,109 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:54,114 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:54,116 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:54,329 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:54,354 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:54,357 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:54,361 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:54,367 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:54,370 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:54,372 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:54,376 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:54,400 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:54,403 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:54,407 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:54,807 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:32:54,811 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:32:54,812 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:54,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:54,852 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:32:54,853 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2022-02-21 03:32:54,854 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:32:54,861 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:54,861 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:32:54,861 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:54,862 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:54,862 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:54,865 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:32:54,865 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:32:54,887 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:32:54,911 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2022-02-21 03:32:54,912 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:54,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:54,914 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:32:54,923 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:32:54,931 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:54,932 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:32:54,932 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:54,932 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:54,932 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:54,933 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:32:54,933 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:32:54,935 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2022-02-21 03:32:54,948 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:32:54,975 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2022-02-21 03:32:54,975 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:54,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:54,977 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:32:54,979 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2022-02-21 03:32:54,980 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:32:54,987 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:54,988 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:32:54,988 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:54,988 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:54,988 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:54,988 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:32:54,988 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:32:54,993 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:32:55,009 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2022-02-21 03:32:55,009 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:55,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:55,010 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:32:55,012 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2022-02-21 03:32:55,013 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:32:55,022 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:32:55,022 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:32:55,023 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:32:55,023 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:32:55,034 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:32:55,035 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:32:55,047 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:32:55,065 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2022-02-21 03:32:55,066 INFO L444 ModelExtractionUtils]: 15 out of 28 variables were initially zero. Simplification set additionally 10 variables to zero. [2022-02-21 03:32:55,067 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:55,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:55,094 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:32:55,142 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:32:55,150 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2022-02-21 03:32:55,163 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-02-21 03:32:55,164 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:32:55,164 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1, ULTIMATE.start_main_~length~0#1) = -1*ULTIMATE.start_main_~i~0#1 + 1*ULTIMATE.start_main_~length~0#1 Supporting invariants [] [2022-02-21 03:32:55,207 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2022-02-21 03:32:55,233 INFO L297 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2022-02-21 03:32:55,238 INFO L390 LassoCheck]: Loop: "assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet7#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet7#1;" "main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1;" [2022-02-21 03:32:55,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:32:55,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:32:55,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:32:55,275 INFO L263 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:32:55,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:32:55,283 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:32:55,302 INFO L290 TraceCheckUtils]: 0: Hoare triple {26#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {26#unseeded} is VALID [2022-02-21 03:32:55,303 INFO L290 TraceCheckUtils]: 1: Hoare triple {26#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~nondet3#1, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~malloc5#1.base, main_#t~malloc5#1.offset, main_#t~nondet7#1, main_#t~post6#1, main_#t~mem9#1, main_#t~post8#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~fac~0#1, main_~arr~0#1.base, main_~arr~0#1.offset, main_~arr2~0#1.base, main_~arr2~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; {26#unseeded} is VALID [2022-02-21 03:32:55,303 INFO L290 TraceCheckUtils]: 2: Hoare triple {26#unseeded} assume !(main_~length~0#1 < 1); {26#unseeded} is VALID [2022-02-21 03:32:55,304 INFO L290 TraceCheckUtils]: 3: Hoare triple {26#unseeded} main_~fac~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1; {26#unseeded} is VALID [2022-02-21 03:32:55,304 INFO L290 TraceCheckUtils]: 4: Hoare triple {26#unseeded} assume !(main_~fac~0#1 < 1); {26#unseeded} is VALID [2022-02-21 03:32:55,305 INFO L290 TraceCheckUtils]: 5: Hoare triple {26#unseeded} call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;call main_#t~malloc5#1.base, main_#t~malloc5#1.offset := #Ultimate.allocOnStack(4 * (main_~fac~0#1 * main_~length~0#1));main_~arr2~0#1.base, main_~arr2~0#1.offset := main_#t~malloc5#1.base, main_#t~malloc5#1.offset; {26#unseeded} is VALID [2022-02-21 03:32:55,305 INFO L290 TraceCheckUtils]: 6: Hoare triple {26#unseeded} assume !((main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0) || (main_~arr2~0#1.base == 0 && main_~arr2~0#1.offset == 0));main_~i~0#1 := 0; {26#unseeded} is VALID [2022-02-21 03:32:55,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:32:55,313 INFO L263 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 03:32:55,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:32:55,317 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:32:55,336 INFO L290 TraceCheckUtils]: 0: Hoare triple {29#(>= oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~length~0#1|))} assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet7#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet7#1; {92#(and (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~length~0#1|)) (< |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~length~0#1|))} is VALID [2022-02-21 03:32:55,337 INFO L290 TraceCheckUtils]: 1: Hoare triple {92#(and (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~length~0#1|)) (< |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~length~0#1|))} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {69#(or (and (>= oldRank0 0) (> oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~length~0#1|))) unseeded)} is VALID [2022-02-21 03:32:55,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:32:55,361 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:32:55,369 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:32:55,370 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:32:55,372 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:55,375 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2022-02-21 03:32:55,377 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 16 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:32:55,502 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 16 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0). Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 35 states and 46 transitions. Complement of second has 7 states. [2022-02-21 03:32:55,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2022-02-21 03:32:55,505 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:32:55,505 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 16 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:32:55,508 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2022-02-21 03:32:55,508 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:32:55,508 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:32:55,509 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:32:55,517 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2022-02-21 03:32:55,518 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2022-02-21 03:32:55,519 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:32:55,519 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:32:55,520 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 46 transitions. [2022-02-21 03:32:55,522 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:32:55,522 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:32:55,522 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:32:55,524 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 16 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:32:55,525 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2022-02-21 03:32:55,526 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 4 examples of accepted words. [2022-02-21 03:32:55,526 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:32:55,528 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2022-02-21 03:32:55,528 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 03:32:55,528 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 35 states and 46 transitions. cyclomatic complexity: 15 [2022-02-21 03:32:55,529 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 03:32:55,529 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 16 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:32:55,529 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:55,529 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:32:55,530 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:55,530 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 46 transitions. cyclomatic complexity: 15 Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:32:55,530 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:55,530 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 16 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:32:55,530 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:55,531 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:32:55,531 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:55,531 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 46 transitions. cyclomatic complexity: 15 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:32:55,531 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:55,531 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 16 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 9 letters. Loop has 2 letters. [2022-02-21 03:32:55,532 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:55,532 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 9 letters. Loop has 2 letters. [2022-02-21 03:32:55,532 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:55,532 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 46 transitions. cyclomatic complexity: 15 Stem has 9 letters. Loop has 2 letters. [2022-02-21 03:32:55,532 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:55,533 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 16 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 35 letters. Loop has 35 letters. [2022-02-21 03:32:55,533 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:55,533 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 35 letters. Loop has 35 letters. [2022-02-21 03:32:55,533 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:55,533 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 46 transitions. cyclomatic complexity: 15 Stem has 35 letters. Loop has 35 letters. [2022-02-21 03:32:55,534 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:55,534 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 16 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 16 letters. Loop has 16 letters. [2022-02-21 03:32:55,534 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:55,534 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 16 letters. Loop has 16 letters. [2022-02-21 03:32:55,534 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:55,535 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 46 transitions. cyclomatic complexity: 15 Stem has 16 letters. Loop has 16 letters. [2022-02-21 03:32:55,535 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:55,535 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 16 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:32:55,535 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:55,535 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:32:55,536 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:55,536 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 46 transitions. cyclomatic complexity: 15 Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:32:55,536 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:55,536 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 16 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 9 letters. Loop has 2 letters. [2022-02-21 03:32:55,536 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:55,536 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 9 letters. Loop has 2 letters. [2022-02-21 03:32:55,537 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:55,537 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 46 transitions. cyclomatic complexity: 15 Stem has 9 letters. Loop has 2 letters. [2022-02-21 03:32:55,537 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:55,537 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 16 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 10 letters. Loop has 2 letters. [2022-02-21 03:32:55,538 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:55,538 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 10 letters. Loop has 2 letters. [2022-02-21 03:32:55,538 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:55,538 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 46 transitions. cyclomatic complexity: 15 Stem has 10 letters. Loop has 2 letters. [2022-02-21 03:32:55,538 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:55,539 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 16 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 2 letters. [2022-02-21 03:32:55,539 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:55,539 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 2 letters. [2022-02-21 03:32:55,539 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:55,539 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 46 transitions. cyclomatic complexity: 15 Stem has 8 letters. Loop has 2 letters. [2022-02-21 03:32:55,540 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:55,540 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 16 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:32:55,540 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:55,540 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:32:55,540 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:55,541 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 46 transitions. cyclomatic complexity: 15 Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:32:55,541 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:55,541 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 16 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 2 letters. Loop has 1 letters. [2022-02-21 03:32:55,541 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:55,541 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 2 letters. Loop has 1 letters. [2022-02-21 03:32:55,542 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:55,542 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 46 transitions. cyclomatic complexity: 15 Stem has 2 letters. Loop has 1 letters. [2022-02-21 03:32:55,542 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:55,542 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 16 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:32:55,542 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:55,543 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:32:55,543 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:55,543 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 46 transitions. cyclomatic complexity: 15 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:32:55,543 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:55,543 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 16 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 10 letters. Loop has 2 letters. [2022-02-21 03:32:55,543 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:55,544 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 10 letters. Loop has 2 letters. [2022-02-21 03:32:55,544 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:55,544 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 46 transitions. cyclomatic complexity: 15 Stem has 10 letters. Loop has 2 letters. [2022-02-21 03:32:55,544 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:55,544 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 16 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 9 letters. Loop has 2 letters. [2022-02-21 03:32:55,545 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:55,545 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 9 letters. Loop has 2 letters. [2022-02-21 03:32:55,545 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:55,545 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 46 transitions. cyclomatic complexity: 15 Stem has 9 letters. Loop has 2 letters. [2022-02-21 03:32:55,545 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:55,546 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:32:55,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:32:55,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2022-02-21 03:32:55,551 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 32 transitions. Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:32:55,551 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:55,551 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 32 transitions. Stem has 9 letters. Loop has 2 letters. [2022-02-21 03:32:55,551 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:55,552 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 32 transitions. Stem has 7 letters. Loop has 4 letters. [2022-02-21 03:32:55,552 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:32:55,552 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 46 transitions. cyclomatic complexity: 15 [2022-02-21 03:32:55,555 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:32:55,557 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 13 states and 17 transitions. [2022-02-21 03:32:55,558 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2022-02-21 03:32:55,558 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2022-02-21 03:32:55,559 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 17 transitions. [2022-02-21 03:32:55,559 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:32:55,559 INFO L681 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2022-02-21 03:32:55,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 17 transitions. [2022-02-21 03:32:55,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2022-02-21 03:32:55,579 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:32:55,580 INFO L82 GeneralOperation]: Start isEquivalent. First operand 13 states and 17 transitions. Second operand has 13 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 12 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:32:55,581 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states and 17 transitions. Second operand has 13 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 12 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:32:55,583 INFO L87 Difference]: Start difference. First operand 13 states and 17 transitions. Second operand has 13 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 12 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:32:55,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:32:55,585 INFO L93 Difference]: Finished difference Result 13 states and 17 transitions. [2022-02-21 03:32:55,586 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 17 transitions. [2022-02-21 03:32:55,586 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:32:55,586 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:32:55,587 INFO L74 IsIncluded]: Start isIncluded. First operand has 13 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 12 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 13 states and 17 transitions. [2022-02-21 03:32:55,587 INFO L87 Difference]: Start difference. First operand has 13 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 12 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 13 states and 17 transitions. [2022-02-21 03:32:55,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:32:55,588 INFO L93 Difference]: Finished difference Result 13 states and 17 transitions. [2022-02-21 03:32:55,588 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 17 transitions. [2022-02-21 03:32:55,588 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:32:55,588 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:32:55,588 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:32:55,589 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:32:55,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 12 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:32:55,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 17 transitions. [2022-02-21 03:32:55,590 INFO L704 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2022-02-21 03:32:55,590 INFO L587 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2022-02-21 03:32:55,591 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2022-02-21 03:32:55,591 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 17 transitions. [2022-02-21 03:32:55,591 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:32:55,591 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:32:55,591 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:32:55,592 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:32:55,592 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 03:32:55,592 INFO L791 eck$LassoCheckResult]: Stem: 146#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 147#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~nondet3#1, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~malloc5#1.base, main_#t~malloc5#1.offset, main_#t~nondet7#1, main_#t~post6#1, main_#t~mem9#1, main_#t~post8#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~fac~0#1, main_~arr~0#1.base, main_~arr~0#1.offset, main_~arr2~0#1.base, main_~arr2~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; 151#L550 assume !(main_~length~0#1 < 1); 152#L550-2 main_~fac~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1; 153#L552 assume !(main_~fac~0#1 < 1); 141#L552-2 call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;call main_#t~malloc5#1.base, main_#t~malloc5#1.offset := #Ultimate.allocOnStack(4 * (main_~fac~0#1 * main_~length~0#1));main_~arr2~0#1.base, main_~arr2~0#1.offset := main_#t~malloc5#1.base, main_#t~malloc5#1.offset; 142#L555 assume !((main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0) || (main_~arr2~0#1.base == 0 && main_~arr2~0#1.offset == 0));main_~i~0#1 := 0; 145#L556-3 assume !(main_~i~0#1 < main_~length~0#1); 143#L556-4 main_~j~0#1 := 0; 144#L559-3 [2022-02-21 03:32:55,596 INFO L793 eck$LassoCheckResult]: Loop: 144#L559-3 assume !!(main_~j~0#1 < main_~length~0#1 * main_~fac~0#1);call main_#t~mem9#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (if main_~i~0#1 < 0 && 0 != main_~i~0#1 % main_~length~0#1 then (if main_~length~0#1 < 0 then main_~i~0#1 % main_~length~0#1 + main_~length~0#1 else main_~i~0#1 % main_~length~0#1 - main_~length~0#1) else main_~i~0#1 % main_~length~0#1), 4);call write~int(main_#t~mem9#1, main_~arr2~0#1.base, main_~arr2~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem9#1; 148#L559-2 main_#t~post8#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 144#L559-3 [2022-02-21 03:32:55,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:32:55,597 INFO L85 PathProgramCache]: Analyzing trace with hash 1182787702, now seen corresponding path program 1 times [2022-02-21 03:32:55,597 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:32:55,597 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528880620] [2022-02-21 03:32:55,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:32:55,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:32:55,617 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-21 03:32:55,617 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [522187953] [2022-02-21 03:32:55,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:32:55,618 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:32:55,618 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:55,620 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:32:55,643 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-02-21 03:32:55,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:32:55,663 INFO L263 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-21 03:32:55,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:32:55,669 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:32:55,731 INFO L290 TraceCheckUtils]: 0: Hoare triple {183#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {183#true} is VALID [2022-02-21 03:32:55,731 INFO L290 TraceCheckUtils]: 1: Hoare triple {183#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~nondet3#1, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~malloc5#1.base, main_#t~malloc5#1.offset, main_#t~nondet7#1, main_#t~post6#1, main_#t~mem9#1, main_#t~post8#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~fac~0#1, main_~arr~0#1.base, main_~arr~0#1.offset, main_~arr2~0#1.base, main_~arr2~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; {183#true} is VALID [2022-02-21 03:32:55,732 INFO L290 TraceCheckUtils]: 2: Hoare triple {183#true} assume !(main_~length~0#1 < 1); {194#(not (< |ULTIMATE.start_main_~length~0#1| 1))} is VALID [2022-02-21 03:32:55,732 INFO L290 TraceCheckUtils]: 3: Hoare triple {194#(not (< |ULTIMATE.start_main_~length~0#1| 1))} main_~fac~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1; {194#(not (< |ULTIMATE.start_main_~length~0#1| 1))} is VALID [2022-02-21 03:32:55,732 INFO L290 TraceCheckUtils]: 4: Hoare triple {194#(not (< |ULTIMATE.start_main_~length~0#1| 1))} assume !(main_~fac~0#1 < 1); {194#(not (< |ULTIMATE.start_main_~length~0#1| 1))} is VALID [2022-02-21 03:32:55,733 INFO L290 TraceCheckUtils]: 5: Hoare triple {194#(not (< |ULTIMATE.start_main_~length~0#1| 1))} call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;call main_#t~malloc5#1.base, main_#t~malloc5#1.offset := #Ultimate.allocOnStack(4 * (main_~fac~0#1 * main_~length~0#1));main_~arr2~0#1.base, main_~arr2~0#1.offset := main_#t~malloc5#1.base, main_#t~malloc5#1.offset; {194#(not (< |ULTIMATE.start_main_~length~0#1| 1))} is VALID [2022-02-21 03:32:55,734 INFO L290 TraceCheckUtils]: 6: Hoare triple {194#(not (< |ULTIMATE.start_main_~length~0#1| 1))} assume !((main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0) || (main_~arr2~0#1.base == 0 && main_~arr2~0#1.offset == 0));main_~i~0#1 := 0; {207#(and (<= |ULTIMATE.start_main_~i~0#1| 0) (not (< |ULTIMATE.start_main_~length~0#1| 1)))} is VALID [2022-02-21 03:32:55,734 INFO L290 TraceCheckUtils]: 7: Hoare triple {207#(and (<= |ULTIMATE.start_main_~i~0#1| 0) (not (< |ULTIMATE.start_main_~length~0#1| 1)))} assume !(main_~i~0#1 < main_~length~0#1); {184#false} is VALID [2022-02-21 03:32:55,734 INFO L290 TraceCheckUtils]: 8: Hoare triple {184#false} main_~j~0#1 := 0; {184#false} is VALID [2022-02-21 03:32:55,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:32:55,735 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-21 03:32:55,735 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:32:55,735 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528880620] [2022-02-21 03:32:55,736 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-21 03:32:55,736 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [522187953] [2022-02-21 03:32:55,736 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [522187953] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:32:55,736 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:32:55,736 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-21 03:32:55,737 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419942943] [2022-02-21 03:32:55,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:32:55,739 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 03:32:55,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:32:55,739 INFO L85 PathProgramCache]: Analyzing trace with hash 2339, now seen corresponding path program 1 times [2022-02-21 03:32:55,739 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:32:55,739 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495873563] [2022-02-21 03:32:55,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:32:55,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:32:55,747 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-21 03:32:55,747 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [60517221] [2022-02-21 03:32:55,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:32:55,747 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:32:55,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:55,748 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:32:55,777 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-02-21 03:32:55,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:32:55,795 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:32:55,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:32:55,805 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:32:56,266 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:32:56,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-21 03:32:56,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-02-21 03:32:56,269 INFO L87 Difference]: Start difference. First operand 13 states and 17 transitions. cyclomatic complexity: 6 Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:32:56,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:32:56,315 INFO L93 Difference]: Finished difference Result 14 states and 17 transitions. [2022-02-21 03:32:56,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-21 03:32:56,316 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:32:56,326 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:32:56,326 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 17 transitions. [2022-02-21 03:32:56,327 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:32:56,328 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 14 states and 17 transitions. [2022-02-21 03:32:56,328 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2022-02-21 03:32:56,328 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2022-02-21 03:32:56,328 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 17 transitions. [2022-02-21 03:32:56,328 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:32:56,328 INFO L681 BuchiCegarLoop]: Abstraction has 14 states and 17 transitions. [2022-02-21 03:32:56,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 17 transitions. [2022-02-21 03:32:56,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2022-02-21 03:32:56,329 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:32:56,329 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states and 17 transitions. Second operand has 13 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 12 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:32:56,329 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states and 17 transitions. Second operand has 13 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 12 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:32:56,329 INFO L87 Difference]: Start difference. First operand 14 states and 17 transitions. Second operand has 13 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 12 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:32:56,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:32:56,333 INFO L93 Difference]: Finished difference Result 14 states and 17 transitions. [2022-02-21 03:32:56,333 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 17 transitions. [2022-02-21 03:32:56,334 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:32:56,334 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:32:56,334 INFO L74 IsIncluded]: Start isIncluded. First operand has 13 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 12 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 14 states and 17 transitions. [2022-02-21 03:32:56,335 INFO L87 Difference]: Start difference. First operand has 13 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 12 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 14 states and 17 transitions. [2022-02-21 03:32:56,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:32:56,336 INFO L93 Difference]: Finished difference Result 14 states and 17 transitions. [2022-02-21 03:32:56,336 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 17 transitions. [2022-02-21 03:32:56,336 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:32:56,336 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:32:56,336 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:32:56,337 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:32:56,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 12 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:32:56,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 16 transitions. [2022-02-21 03:32:56,338 INFO L704 BuchiCegarLoop]: Abstraction has 13 states and 16 transitions. [2022-02-21 03:32:56,338 INFO L587 BuchiCegarLoop]: Abstraction has 13 states and 16 transitions. [2022-02-21 03:32:56,341 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2022-02-21 03:32:56,341 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 16 transitions. [2022-02-21 03:32:56,341 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:32:56,342 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:32:56,343 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:32:56,343 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:32:56,343 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 03:32:56,343 INFO L791 eck$LassoCheckResult]: Stem: 232#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 233#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~nondet3#1, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~malloc5#1.base, main_#t~malloc5#1.offset, main_#t~nondet7#1, main_#t~post6#1, main_#t~mem9#1, main_#t~post8#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~fac~0#1, main_~arr~0#1.base, main_~arr~0#1.offset, main_~arr2~0#1.base, main_~arr2~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; 237#L550 assume !(main_~length~0#1 < 1); 238#L550-2 main_~fac~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1; 239#L552 assume !(main_~fac~0#1 < 1); 227#L552-2 call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;call main_#t~malloc5#1.base, main_#t~malloc5#1.offset := #Ultimate.allocOnStack(4 * (main_~fac~0#1 * main_~length~0#1));main_~arr2~0#1.base, main_~arr2~0#1.offset := main_#t~malloc5#1.base, main_#t~malloc5#1.offset; 228#L555 assume !((main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0) || (main_~arr2~0#1.base == 0 && main_~arr2~0#1.offset == 0));main_~i~0#1 := 0; 231#L556-3 assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet7#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet7#1; 235#L556-2 main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 236#L556-3 assume !(main_~i~0#1 < main_~length~0#1); 229#L556-4 main_~j~0#1 := 0; 230#L559-3 [2022-02-21 03:32:56,343 INFO L793 eck$LassoCheckResult]: Loop: 230#L559-3 assume !!(main_~j~0#1 < main_~length~0#1 * main_~fac~0#1);call main_#t~mem9#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (if main_~i~0#1 < 0 && 0 != main_~i~0#1 % main_~length~0#1 then (if main_~length~0#1 < 0 then main_~i~0#1 % main_~length~0#1 + main_~length~0#1 else main_~i~0#1 % main_~length~0#1 - main_~length~0#1) else main_~i~0#1 % main_~length~0#1), 4);call write~int(main_#t~mem9#1, main_~arr2~0#1.base, main_~arr2~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem9#1; 234#L559-2 main_#t~post8#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 230#L559-3 [2022-02-21 03:32:56,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:32:56,344 INFO L85 PathProgramCache]: Analyzing trace with hash -1507295208, now seen corresponding path program 1 times [2022-02-21 03:32:56,344 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:32:56,344 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740686036] [2022-02-21 03:32:56,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:32:56,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:32:56,365 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-21 03:32:56,367 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1524113953] [2022-02-21 03:32:56,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:32:56,368 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:32:56,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:56,375 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:32:56,403 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-02-21 03:32:56,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:32:56,429 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:32:56,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:32:56,442 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:32:56,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:32:56,443 INFO L85 PathProgramCache]: Analyzing trace with hash 2339, now seen corresponding path program 2 times [2022-02-21 03:32:56,443 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:32:56,443 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945319309] [2022-02-21 03:32:56,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:32:56,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:32:56,451 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-21 03:32:56,451 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1067293557] [2022-02-21 03:32:56,451 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-21 03:32:56,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:32:56,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:56,453 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:32:56,454 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-02-21 03:32:56,490 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-02-21 03:32:56,490 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-02-21 03:32:56,490 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:32:56,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:32:56,496 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:32:56,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:32:56,497 INFO L85 PathProgramCache]: Analyzing trace with hash -1106714758, now seen corresponding path program 1 times [2022-02-21 03:32:56,497 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:32:56,497 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840374741] [2022-02-21 03:32:56,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:32:56,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:32:56,514 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-21 03:32:56,514 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1133489565] [2022-02-21 03:32:56,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:32:56,515 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:32:56,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:32:56,516 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:32:56,518 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-02-21 03:32:56,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:32:56,569 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:32:56,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:32:56,585 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:32:57,395 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:32:57,395 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:32:57,396 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:32:57,396 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:32:57,396 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:32:57,396 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:32:57,396 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:32:57,396 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:32:57,396 INFO L133 ssoRankerPreferences]: Filename of dumped script: mult_array-alloca-2.i_Iteration3_Lasso [2022-02-21 03:32:57,396 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:32:57,396 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:32:57,401 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:57,404 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:57,406 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:57,409 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:57,412 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:57,414 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:57,416 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:57,419 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:57,421 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:57,910 WARN L259 bleTransFormulaUtils]: 1 quantified variables [2022-02-21 03:32:57,912 WARN L259 bleTransFormulaUtils]: 1 quantified variables [2022-02-21 03:32:57,922 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:57,924 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:57,927 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:57,928 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:32:57,931 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:33:10,739 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:33:10,739 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:33:10,740 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:33:10,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:33:10,742 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:33:10,746 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2022-02-21 03:33:10,748 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:33:10,753 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:33:10,753 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:33:10,753 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:33:10,753 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:33:10,754 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:33:10,754 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:33:10,754 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:33:10,755 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:33:10,773 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2022-02-21 03:33:10,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:33:10,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:33:10,775 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:33:10,776 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2022-02-21 03:33:10,779 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:33:10,787 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:33:10,787 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:33:10,787 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:33:10,787 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:33:10,790 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:33:10,791 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:33:10,807 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:33:10,832 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2022-02-21 03:33:10,832 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:33:10,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:33:10,834 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:33:10,835 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2022-02-21 03:33:10,836 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:33:10,843 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:33:10,844 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:33:10,844 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:33:10,844 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:33:10,846 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:33:10,846 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:33:10,863 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:33:10,889 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2022-02-21 03:33:10,889 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:33:10,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:33:10,891 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:33:10,896 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:33:10,896 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2022-02-21 03:33:10,902 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:33:10,902 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:33:10,902 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:33:10,902 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:33:10,904 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:33:10,904 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:33:10,919 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:33:10,942 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2022-02-21 03:33:10,943 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:33:10,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:33:10,944 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:33:10,945 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2022-02-21 03:33:10,946 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:33:10,951 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:33:10,952 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:33:10,952 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:33:10,952 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:33:10,952 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:33:10,952 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:33:10,952 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:33:10,953 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:33:10,968 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2022-02-21 03:33:10,969 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:33:10,969 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:33:10,971 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:33:10,971 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2022-02-21 03:33:10,973 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:33:10,978 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:33:10,978 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:33:10,978 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:33:10,978 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:33:10,978 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:33:10,979 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:33:10,979 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:33:10,982 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:33:11,000 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2022-02-21 03:33:11,000 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:33:11,001 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:33:11,002 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:33:11,004 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2022-02-21 03:33:11,005 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:33:11,010 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:33:11,011 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:33:11,011 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:33:11,011 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:33:11,012 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:33:11,012 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:33:11,014 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:33:11,031 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2022-02-21 03:33:11,031 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:33:11,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:33:11,037 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:33:11,042 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2022-02-21 03:33:11,043 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:33:11,048 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:33:11,049 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:33:11,049 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:33:11,049 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:33:11,049 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:33:11,049 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:33:11,049 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:33:11,050 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:33:11,065 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2022-02-21 03:33:11,066 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:33:11,066 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:33:11,067 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:33:11,068 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2022-02-21 03:33:11,070 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:33:11,076 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:33:11,076 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:33:11,076 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:33:11,076 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:33:11,079 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:33:11,079 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:33:11,082 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:33:11,097 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2022-02-21 03:33:11,097 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:33:11,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:33:11,099 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:33:11,099 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2022-02-21 03:33:11,101 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:33:11,107 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:33:11,107 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:33:11,107 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2022-02-21 03:33:11,107 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:33:11,130 INFO L401 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2022-02-21 03:33:11,130 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2022-02-21 03:33:11,177 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:33:11,246 INFO L443 ModelExtractionUtils]: Simplification made 13 calls to the SMT solver. [2022-02-21 03:33:11,246 INFO L444 ModelExtractionUtils]: 15 out of 61 variables were initially zero. Simplification set additionally 42 variables to zero. [2022-02-21 03:33:11,246 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:33:11,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:33:11,251 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:33:11,256 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2022-02-21 03:33:11,257 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:33:11,277 INFO L438 nArgumentSynthesizer]: Removed 4 redundant supporting invariants from a total of 4. [2022-02-21 03:33:11,277 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:33:11,277 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0#1, v_rep(select #length ULTIMATE.start_main_#t~malloc5#1.base)_2, ULTIMATE.start_main_~arr2~0#1.offset) = -4*ULTIMATE.start_main_~j~0#1 + 2*v_rep(select #length ULTIMATE.start_main_#t~malloc5#1.base)_2 - 1*ULTIMATE.start_main_~arr2~0#1.offset Supporting invariants [] [2022-02-21 03:33:11,304 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2022-02-21 03:33:11,420 INFO L297 tatePredicateManager]: 15 out of 16 supporting invariants were superfluous and have been removed [2022-02-21 03:33:11,429 INFO L390 LassoCheck]: Loop: "assume !!(main_~j~0#1 < main_~length~0#1 * main_~fac~0#1);call main_#t~mem9#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (if main_~i~0#1 < 0 && 0 != main_~i~0#1 % main_~length~0#1 then (if main_~length~0#1 < 0 then main_~i~0#1 % main_~length~0#1 + main_~length~0#1 else main_~i~0#1 % main_~length~0#1 - main_~length~0#1) else main_~i~0#1 % main_~length~0#1), 4);call write~int(main_#t~mem9#1, main_~arr2~0#1.base, main_~arr2~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem9#1;" "main_#t~post8#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1;" [2022-02-21 03:33:11,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:33:11,476 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2022-02-21 03:33:11,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:33:11,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:33:11,496 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 03:33:11,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:33:11,502 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:33:11,535 INFO L290 TraceCheckUtils]: 0: Hoare triple {277#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; {277#unseeded} is VALID [2022-02-21 03:33:11,536 INFO L290 TraceCheckUtils]: 1: Hoare triple {277#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~nondet3#1, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~malloc5#1.base, main_#t~malloc5#1.offset, main_#t~nondet7#1, main_#t~post6#1, main_#t~mem9#1, main_#t~post8#1, main_~i~0#1, main_~j~0#1, main_~length~0#1, main_~fac~0#1, main_~arr~0#1.base, main_~arr~0#1.offset, main_~arr2~0#1.base, main_~arr2~0#1.offset;havoc main_~i~0#1;havoc main_~j~0#1;main_~length~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; {277#unseeded} is VALID [2022-02-21 03:33:11,536 INFO L290 TraceCheckUtils]: 2: Hoare triple {277#unseeded} assume !(main_~length~0#1 < 1); {277#unseeded} is VALID [2022-02-21 03:33:11,537 INFO L290 TraceCheckUtils]: 3: Hoare triple {277#unseeded} main_~fac~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1; {277#unseeded} is VALID [2022-02-21 03:33:11,537 INFO L290 TraceCheckUtils]: 4: Hoare triple {277#unseeded} assume !(main_~fac~0#1 < 1); {277#unseeded} is VALID [2022-02-21 03:33:11,538 INFO L290 TraceCheckUtils]: 5: Hoare triple {277#unseeded} call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnStack(4 * main_~length~0#1);main_~arr~0#1.base, main_~arr~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;call main_#t~malloc5#1.base, main_#t~malloc5#1.offset := #Ultimate.allocOnStack(4 * (main_~fac~0#1 * main_~length~0#1));main_~arr2~0#1.base, main_~arr2~0#1.offset := main_#t~malloc5#1.base, main_#t~malloc5#1.offset; {371#(and unseeded (= |ULTIMATE.start_main_#t~malloc5#1.base| |ULTIMATE.start_main_~arr2~0#1.base|))} is VALID [2022-02-21 03:33:11,539 INFO L290 TraceCheckUtils]: 6: Hoare triple {371#(and unseeded (= |ULTIMATE.start_main_#t~malloc5#1.base| |ULTIMATE.start_main_~arr2~0#1.base|))} assume !((main_~arr~0#1.base == 0 && main_~arr~0#1.offset == 0) || (main_~arr2~0#1.base == 0 && main_~arr2~0#1.offset == 0));main_~i~0#1 := 0; {371#(and unseeded (= |ULTIMATE.start_main_#t~malloc5#1.base| |ULTIMATE.start_main_~arr2~0#1.base|))} is VALID [2022-02-21 03:33:11,539 INFO L290 TraceCheckUtils]: 7: Hoare triple {371#(and unseeded (= |ULTIMATE.start_main_#t~malloc5#1.base| |ULTIMATE.start_main_~arr2~0#1.base|))} assume !!(main_~i~0#1 < main_~length~0#1);call write~int(main_#t~nondet7#1, main_~arr~0#1.base, main_~arr~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet7#1; {371#(and unseeded (= |ULTIMATE.start_main_#t~malloc5#1.base| |ULTIMATE.start_main_~arr2~0#1.base|))} is VALID [2022-02-21 03:33:11,540 INFO L290 TraceCheckUtils]: 8: Hoare triple {371#(and unseeded (= |ULTIMATE.start_main_#t~malloc5#1.base| |ULTIMATE.start_main_~arr2~0#1.base|))} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {371#(and unseeded (= |ULTIMATE.start_main_#t~malloc5#1.base| |ULTIMATE.start_main_~arr2~0#1.base|))} is VALID [2022-02-21 03:33:11,540 INFO L290 TraceCheckUtils]: 9: Hoare triple {371#(and unseeded (= |ULTIMATE.start_main_#t~malloc5#1.base| |ULTIMATE.start_main_~arr2~0#1.base|))} assume !(main_~i~0#1 < main_~length~0#1); {371#(and unseeded (= |ULTIMATE.start_main_#t~malloc5#1.base| |ULTIMATE.start_main_~arr2~0#1.base|))} is VALID [2022-02-21 03:33:11,541 INFO L290 TraceCheckUtils]: 10: Hoare triple {371#(and unseeded (= |ULTIMATE.start_main_#t~malloc5#1.base| |ULTIMATE.start_main_~arr2~0#1.base|))} main_~j~0#1 := 0; {371#(and unseeded (= |ULTIMATE.start_main_#t~malloc5#1.base| |ULTIMATE.start_main_~arr2~0#1.base|))} is VALID [2022-02-21 03:33:11,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:33:11,549 INFO L263 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-21 03:33:11,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:33:11,554 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:33:11,589 INFO L290 TraceCheckUtils]: 0: Hoare triple {372#(and (>= oldRank0 (+ (* 2 (select |#length| |ULTIMATE.start_main_#t~malloc5#1.base|)) (* (- 4) |ULTIMATE.start_main_~j~0#1|) (* (- 1) |ULTIMATE.start_main_~arr2~0#1.offset|))) (= |ULTIMATE.start_main_#t~malloc5#1.base| |ULTIMATE.start_main_~arr2~0#1.base|))} assume !!(main_~j~0#1 < main_~length~0#1 * main_~fac~0#1);call main_#t~mem9#1 := read~int(main_~arr~0#1.base, main_~arr~0#1.offset + 4 * (if main_~i~0#1 < 0 && 0 != main_~i~0#1 % main_~length~0#1 then (if main_~length~0#1 < 0 then main_~i~0#1 % main_~length~0#1 + main_~length~0#1 else main_~i~0#1 % main_~length~0#1 - main_~length~0#1) else main_~i~0#1 % main_~length~0#1), 4);call write~int(main_#t~mem9#1, main_~arr2~0#1.base, main_~arr2~0#1.offset + 4 * main_~j~0#1, 4);havoc main_#t~mem9#1; {410#(and (<= (+ |ULTIMATE.start_main_~arr2~0#1.offset| 4 (* |ULTIMATE.start_main_~j~0#1| 4)) (select |#length| |ULTIMATE.start_main_~arr2~0#1.base|)) (>= oldRank0 (+ (* (select |#length| |ULTIMATE.start_main_#t~malloc5#1.base|) 2) (* |ULTIMATE.start_main_~j~0#1| (- 4)) (* (- 1) |ULTIMATE.start_main_~arr2~0#1.offset|))) (<= 0 (+ |ULTIMATE.start_main_~arr2~0#1.offset| (* |ULTIMATE.start_main_~j~0#1| 4))) (= |ULTIMATE.start_main_#t~malloc5#1.base| |ULTIMATE.start_main_~arr2~0#1.base|))} is VALID [2022-02-21 03:33:11,590 INFO L290 TraceCheckUtils]: 1: Hoare triple {410#(and (<= (+ |ULTIMATE.start_main_~arr2~0#1.offset| 4 (* |ULTIMATE.start_main_~j~0#1| 4)) (select |#length| |ULTIMATE.start_main_~arr2~0#1.base|)) (>= oldRank0 (+ (* (select |#length| |ULTIMATE.start_main_#t~malloc5#1.base|) 2) (* |ULTIMATE.start_main_~j~0#1| (- 4)) (* (- 1) |ULTIMATE.start_main_~arr2~0#1.offset|))) (<= 0 (+ |ULTIMATE.start_main_~arr2~0#1.offset| (* |ULTIMATE.start_main_~j~0#1| 4))) (= |ULTIMATE.start_main_#t~malloc5#1.base| |ULTIMATE.start_main_~arr2~0#1.base|))} main_#t~post8#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; {374#(and (or unseeded (and (>= oldRank0 0) (> oldRank0 (+ (* 2 (select |#length| |ULTIMATE.start_main_#t~malloc5#1.base|)) (* (- 4) |ULTIMATE.start_main_~j~0#1|) (* (- 1) |ULTIMATE.start_main_~arr2~0#1.offset|))))) (= |ULTIMATE.start_main_#t~malloc5#1.base| |ULTIMATE.start_main_~arr2~0#1.base|))} is VALID [2022-02-21 03:33:11,591 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:33:11,591 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:33:11,600 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:33:11,601 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 11 letters. Loop has 2 letters. [2022-02-21 03:33:11,601 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:11,601 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2022-02-21 03:33:11,601 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 16 transitions. cyclomatic complexity: 5 Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:33:11,692 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states and 16 transitions. cyclomatic complexity: 5. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 15 states and 19 transitions. Complement of second has 5 states. [2022-02-21 03:33:11,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2022-02-21 03:33:11,692 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:33:11,693 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 16 transitions. cyclomatic complexity: 5 [2022-02-21 03:33:11,693 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:33:11,693 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:33:11,693 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:33:11,693 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:33:11,694 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:33:11,694 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:33:11,694 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 19 transitions. [2022-02-21 03:33:11,694 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:33:11,694 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:33:11,694 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 13 states and 16 transitions. cyclomatic complexity: 5 [2022-02-21 03:33:11,695 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 03:33:11,695 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:33:11,695 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:33:11,695 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:33:11,696 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 15 states and 19 transitions. cyclomatic complexity: 6 [2022-02-21 03:33:11,696 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 19 transitions. cyclomatic complexity: 6 [2022-02-21 03:33:11,696 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:33:11,696 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2022-02-21 03:33:11,696 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 16 transitions. cyclomatic complexity: 5 Stem has 11 letters. Loop has 2 letters. [2022-02-21 03:33:11,696 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:11,696 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 11 letters. Loop has 2 letters. [2022-02-21 03:33:11,697 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:11,697 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 19 transitions. cyclomatic complexity: 6 Stem has 11 letters. Loop has 2 letters. [2022-02-21 03:33:11,697 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:11,697 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 16 transitions. cyclomatic complexity: 5 Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:33:11,697 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:11,697 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:33:11,698 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:11,698 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 19 transitions. cyclomatic complexity: 6 Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:33:11,698 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:11,698 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 16 transitions. cyclomatic complexity: 5 Stem has 15 letters. Loop has 15 letters. [2022-02-21 03:33:11,698 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:11,698 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 15 letters. [2022-02-21 03:33:11,698 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:11,699 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 19 transitions. cyclomatic complexity: 6 Stem has 15 letters. Loop has 15 letters. [2022-02-21 03:33:11,699 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:11,699 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 16 transitions. cyclomatic complexity: 5 Stem has 13 letters. Loop has 13 letters. [2022-02-21 03:33:11,699 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:11,699 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 13 letters. Loop has 13 letters. [2022-02-21 03:33:11,699 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:11,699 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 19 transitions. cyclomatic complexity: 6 Stem has 13 letters. Loop has 13 letters. [2022-02-21 03:33:11,700 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:11,700 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 16 transitions. cyclomatic complexity: 5 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:33:11,700 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:11,700 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:33:11,700 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:11,700 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 19 transitions. cyclomatic complexity: 6 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:33:11,700 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:11,700 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 16 transitions. cyclomatic complexity: 5 Stem has 11 letters. Loop has 2 letters. [2022-02-21 03:33:11,701 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:11,701 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 11 letters. Loop has 2 letters. [2022-02-21 03:33:11,701 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:11,701 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 19 transitions. cyclomatic complexity: 6 Stem has 11 letters. Loop has 2 letters. [2022-02-21 03:33:11,701 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:11,701 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 16 transitions. cyclomatic complexity: 5 Stem has 12 letters. Loop has 2 letters. [2022-02-21 03:33:11,702 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:11,702 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 2 letters. [2022-02-21 03:33:11,702 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:11,702 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 19 transitions. cyclomatic complexity: 6 Stem has 12 letters. Loop has 2 letters. [2022-02-21 03:33:11,702 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:11,702 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 16 transitions. cyclomatic complexity: 5 Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:33:11,702 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:11,703 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:33:11,703 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:11,703 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 19 transitions. cyclomatic complexity: 6 Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:33:11,703 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:11,703 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:33:11,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:33:11,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2022-02-21 03:33:11,705 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 11 letters. Loop has 2 letters. [2022-02-21 03:33:11,705 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:11,705 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 13 letters. Loop has 2 letters. [2022-02-21 03:33:11,705 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:11,705 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 11 letters. Loop has 4 letters. [2022-02-21 03:33:11,705 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:33:11,706 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 19 transitions. cyclomatic complexity: 6 [2022-02-21 03:33:11,706 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:33:11,706 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 0 states and 0 transitions. [2022-02-21 03:33:11,707 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2022-02-21 03:33:11,707 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2022-02-21 03:33:11,707 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2022-02-21 03:33:11,707 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:33:11,707 INFO L681 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 03:33:11,707 INFO L704 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 03:33:11,707 INFO L587 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 03:33:11,707 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2022-02-21 03:33:11,708 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2022-02-21 03:33:11,708 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:33:11,708 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:33:11,714 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 21.02 03:33:11 BoogieIcfgContainer [2022-02-21 03:33:11,714 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-02-21 03:33:11,714 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-21 03:33:11,715 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-21 03:33:11,715 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-21 03:33:11,715 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:32:53" (3/4) ... [2022-02-21 03:33:11,717 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-02-21 03:33:11,717 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-21 03:33:11,719 INFO L158 Benchmark]: Toolchain (without parser) took 19582.88ms. Allocated memory was 94.4MB in the beginning and 142.6MB in the end (delta: 48.2MB). Free memory was 60.8MB in the beginning and 89.3MB in the end (delta: -28.5MB). Peak memory consumption was 20.6MB. Max. memory is 16.1GB. [2022-02-21 03:33:11,724 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 94.4MB. Free memory was 49.5MB in the beginning and 49.5MB in the end (delta: 45.5kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:33:11,725 INFO L158 Benchmark]: CACSL2BoogieTranslator took 431.97ms. Allocated memory is still 94.4MB. Free memory was 60.7MB in the beginning and 63.6MB in the end (delta: -2.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-02-21 03:33:11,726 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.89ms. Allocated memory is still 94.4MB. Free memory was 63.6MB in the beginning and 61.8MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 03:33:11,726 INFO L158 Benchmark]: Boogie Preprocessor took 44.53ms. Allocated memory is still 94.4MB. Free memory was 61.8MB in the beginning and 60.1MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 03:33:11,727 INFO L158 Benchmark]: RCFGBuilder took 403.92ms. Allocated memory is still 94.4MB. Free memory was 60.1MB in the beginning and 47.9MB in the end (delta: 12.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-02-21 03:33:11,727 INFO L158 Benchmark]: BuchiAutomizer took 18628.68ms. Allocated memory was 94.4MB in the beginning and 142.6MB in the end (delta: 48.2MB). Free memory was 47.9MB in the beginning and 90.4MB in the end (delta: -42.5MB). Peak memory consumption was 6.6MB. Max. memory is 16.1GB. [2022-02-21 03:33:11,727 INFO L158 Benchmark]: Witness Printer took 3.00ms. Allocated memory is still 142.6MB. Free memory was 90.4MB in the beginning and 89.3MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 03:33:11,729 INFO L339 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.17ms. Allocated memory is still 94.4MB. Free memory was 49.5MB in the beginning and 49.5MB in the end (delta: 45.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 431.97ms. Allocated memory is still 94.4MB. Free memory was 60.7MB in the beginning and 63.6MB in the end (delta: -2.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 57.89ms. Allocated memory is still 94.4MB. Free memory was 63.6MB in the beginning and 61.8MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 44.53ms. Allocated memory is still 94.4MB. Free memory was 61.8MB in the beginning and 60.1MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 403.92ms. Allocated memory is still 94.4MB. Free memory was 60.1MB in the beginning and 47.9MB in the end (delta: 12.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * BuchiAutomizer took 18628.68ms. Allocated memory was 94.4MB in the beginning and 142.6MB in the end (delta: 48.2MB). Free memory was 47.9MB in the beginning and 90.4MB in the end (delta: -42.5MB). Peak memory consumption was 6.6MB. Max. memory is 16.1GB. * Witness Printer took 3.00ms. Allocated memory is still 142.6MB. Free memory was 90.4MB in the beginning and 89.3MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 3 terminating modules (1 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * i + length and consists of 5 locations. One deterministic module has affine ranking function 2 * unknown-#length-unknown[__builtin_alloca (fac*length*sizeof(int))] + -4 * j + -1 * arr2 and consists of 4 locations. 1 modules have a trivial ranking function, the largest among these consists of 4 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 18.5s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 17.8s. Construction of modules took 0.1s. Büchi inclusion checks took 0.5s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 13 states and ocurred in iteration 1. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 42 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 42 mSDsluCounter, 61 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 22 mSDsCounter, 9 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 30 IncrementalHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 9 mSolverCounterUnsat, 39 mSDtfsCounter, 30 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU1 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital248 mio100 ax109 hnf100 lsp142 ukn52 mio100 lsp60 div115 bol100 ite100 ukn100 eq163 hnf92 smp90 dnf119 smp100 tf100 neg100 sie101 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 179ms VariablesStem: 11 VariablesLoop: 10 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 16 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! [2022-02-21 03:33:11,763 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-02-21 03:33:11,976 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-02-21 03:33:12,177 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-02-21 03:33:12,375 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-02-21 03:33:12,576 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-02-21 03:33:12,776 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-02-21 03:33:12,976 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-02-21 03:33:13,169 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE