./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-memory-alloca/insertionsort-alloca-2.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 35987657 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -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/insertionsort-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 de7da20d4eaaa585438f85709f7fd309a77ec10ab7307dad72c7fb2392cc347c --- Real Ultimate output --- This is Ultimate 0.2.2-?-3598765 [2022-07-22 01:39:25,253 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-22 01:39:25,255 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-22 01:39:25,302 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-22 01:39:25,302 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-22 01:39:25,303 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-22 01:39:25,307 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-22 01:39:25,310 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-22 01:39:25,312 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-22 01:39:25,317 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-22 01:39:25,319 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-22 01:39:25,323 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-22 01:39:25,324 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-22 01:39:25,326 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-22 01:39:25,327 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-22 01:39:25,331 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-22 01:39:25,331 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-22 01:39:25,332 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-22 01:39:25,333 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-22 01:39:25,335 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-22 01:39:25,336 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-22 01:39:25,337 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-22 01:39:25,339 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-22 01:39:25,340 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-22 01:39:25,341 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-22 01:39:25,348 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-22 01:39:25,348 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-22 01:39:25,349 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-22 01:39:25,349 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-22 01:39:25,350 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-22 01:39:25,350 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-22 01:39:25,351 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-22 01:39:25,352 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-22 01:39:25,353 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-22 01:39:25,354 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-22 01:39:25,355 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-22 01:39:25,355 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-22 01:39:25,358 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-22 01:39:25,358 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-22 01:39:25,358 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-22 01:39:25,359 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-22 01:39:25,365 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-22 01:39:25,368 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2022-07-22 01:39:25,398 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-22 01:39:25,399 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-22 01:39:25,399 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-22 01:39:25,399 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-22 01:39:25,400 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-22 01:39:25,401 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-22 01:39:25,401 INFO L138 SettingsManager]: * Use SBE=true [2022-07-22 01:39:25,401 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-07-22 01:39:25,401 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-07-22 01:39:25,402 INFO L138 SettingsManager]: * Use old map elimination=false [2022-07-22 01:39:25,402 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-07-22 01:39:25,403 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-07-22 01:39:25,403 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-07-22 01:39:25,403 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-22 01:39:25,403 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-22 01:39:25,403 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-22 01:39:25,404 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-22 01:39:25,404 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-07-22 01:39:25,404 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-07-22 01:39:25,404 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-07-22 01:39:25,404 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-22 01:39:25,405 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-07-22 01:39:25,405 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-22 01:39:25,405 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-07-22 01:39:25,405 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-22 01:39:25,405 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-22 01:39:25,406 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-22 01:39:25,406 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-22 01:39:25,408 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-07-22 01:39:25,408 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 -> de7da20d4eaaa585438f85709f7fd309a77ec10ab7307dad72c7fb2392cc347c [2022-07-22 01:39:25,711 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-22 01:39:25,731 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-22 01:39:25,734 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-22 01:39:25,735 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-22 01:39:25,736 INFO L275 PluginConnector]: CDTParser initialized [2022-07-22 01:39:25,738 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-memory-alloca/insertionsort-alloca-2.i [2022-07-22 01:39:25,794 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6805cdb6a/17dc020d0e4844daae7aedf06c015f2f/FLAG58bd0b6e0 [2022-07-22 01:39:26,313 INFO L306 CDTParser]: Found 1 translation units. [2022-07-22 01:39:26,314 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/insertionsort-alloca-2.i [2022-07-22 01:39:26,327 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6805cdb6a/17dc020d0e4844daae7aedf06c015f2f/FLAG58bd0b6e0 [2022-07-22 01:39:26,796 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6805cdb6a/17dc020d0e4844daae7aedf06c015f2f [2022-07-22 01:39:26,800 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-22 01:39:26,801 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-22 01:39:26,804 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-22 01:39:26,804 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-22 01:39:26,807 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-22 01:39:26,808 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 01:39:26" (1/1) ... [2022-07-22 01:39:26,809 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@15810f6b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:39:26, skipping insertion in model container [2022-07-22 01:39:26,810 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 01:39:26" (1/1) ... [2022-07-22 01:39:26,816 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-22 01:39:26,846 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-22 01:39:27,120 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 01:39:27,127 INFO L203 MainTranslator]: Completed pre-run [2022-07-22 01:39:27,163 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 01:39:27,182 INFO L208 MainTranslator]: Completed translation [2022-07-22 01:39:27,182 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:39:27 WrapperNode [2022-07-22 01:39:27,183 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-22 01:39:27,184 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-22 01:39:27,184 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-22 01:39:27,184 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-22 01:39:27,190 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:39:27" (1/1) ... [2022-07-22 01:39:27,207 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:39:27" (1/1) ... [2022-07-22 01:39:27,227 INFO L137 Inliner]: procedures = 111, calls = 11, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 54 [2022-07-22 01:39:27,228 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-22 01:39:27,229 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-22 01:39:27,229 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-22 01:39:27,230 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-22 01:39:27,236 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:39:27" (1/1) ... [2022-07-22 01:39:27,236 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:39:27" (1/1) ... [2022-07-22 01:39:27,249 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:39:27" (1/1) ... [2022-07-22 01:39:27,249 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:39:27" (1/1) ... [2022-07-22 01:39:27,255 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:39:27" (1/1) ... [2022-07-22 01:39:27,264 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:39:27" (1/1) ... [2022-07-22 01:39:27,266 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:39:27" (1/1) ... [2022-07-22 01:39:27,270 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-22 01:39:27,273 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-22 01:39:27,274 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-22 01:39:27,274 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-22 01:39:27,275 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:39:27" (1/1) ... [2022-07-22 01:39:27,281 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:39:27,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:39:27,309 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-07-22 01:39:27,335 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-07-22 01:39:27,350 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-22 01:39:27,350 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-22 01:39:27,350 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-22 01:39:27,352 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-22 01:39:27,352 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-22 01:39:27,352 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-22 01:39:27,458 INFO L234 CfgBuilder]: Building ICFG [2022-07-22 01:39:27,460 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-22 01:39:27,555 INFO L275 CfgBuilder]: Performing block encoding [2022-07-22 01:39:27,559 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-22 01:39:27,560 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-07-22 01:39:27,561 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 01:39:27 BoogieIcfgContainer [2022-07-22 01:39:27,561 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-22 01:39:27,562 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-07-22 01:39:27,562 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-07-22 01:39:27,565 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-07-22 01:39:27,565 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 01:39:27,566 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.07 01:39:26" (1/3) ... [2022-07-22 01:39:27,566 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@63fd8e63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.07 01:39:27, skipping insertion in model container [2022-07-22 01:39:27,566 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 01:39:27,567 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:39:27" (2/3) ... [2022-07-22 01:39:27,567 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@63fd8e63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.07 01:39:27, skipping insertion in model container [2022-07-22 01:39:27,567 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 01:39:27,567 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 01:39:27" (3/3) ... [2022-07-22 01:39:27,568 INFO L354 chiAutomizerObserver]: Analyzing ICFG insertionsort-alloca-2.i [2022-07-22 01:39:27,621 INFO L255 stractBuchiCegarLoop]: Interprodecural is true [2022-07-22 01:39:27,621 INFO L256 stractBuchiCegarLoop]: Hoare is false [2022-07-22 01:39:27,621 INFO L257 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-07-22 01:39:27,622 INFO L258 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-07-22 01:39:27,622 INFO L259 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-07-22 01:39:27,622 INFO L260 stractBuchiCegarLoop]: Difference is false [2022-07-22 01:39:27,622 INFO L261 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-07-22 01:39:27,622 INFO L265 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-07-22 01:39:27,632 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 15 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 states have internal predecessors, (20), 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-07-22 01:39:27,647 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2022-07-22 01:39:27,647 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 01:39:27,647 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 01:39:27,652 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2022-07-22 01:39:27,652 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2022-07-22 01:39:27,653 INFO L287 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-07-22 01:39:27,653 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 15 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 states have internal predecessors, (20), 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-07-22 01:39:27,655 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2022-07-22 01:39:27,655 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 01:39:27,655 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 01:39:27,656 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2022-07-22 01:39:27,656 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2022-07-22 01:39:27,661 INFO L752 eck$LassoCheckResult]: Stem: 5#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 10#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_~array_size~0#1, main_~a~0#1.base, main_~a~0#1.offset;main_~array_size~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; 8#L560true assume !(main_~array_size~0#1 < 1); 14#L560-2true call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;assume { :begin_inline_insertionSort } true;insertionSort_#in~a#1.base, insertionSort_#in~a#1.offset, insertionSort_#in~array_size#1 := main_~a~0#1.base, main_~a~0#1.offset, main_~array_size~0#1;havoc insertionSort_#t~mem3#1, insertionSort_#t~mem7#1, insertionSort_#t~post4#1, insertionSort_#t~mem5#1, insertionSort_#t~short6#1, insertionSort_#t~pre2#1, insertionSort_~a#1.base, insertionSort_~a#1.offset, insertionSort_~array_size#1, insertionSort_~i~0#1, insertionSort_~j~0#1, insertionSort_~index~0#1;insertionSort_~a#1.base, insertionSort_~a#1.offset := insertionSort_#in~a#1.base, insertionSort_#in~a#1.offset;insertionSort_~array_size#1 := insertionSort_#in~array_size#1;havoc insertionSort_~i~0#1;havoc insertionSort_~j~0#1;havoc insertionSort_~index~0#1;insertionSort_~i~0#1 := 1; 9#L550-3true [2022-07-22 01:39:27,662 INFO L754 eck$LassoCheckResult]: Loop: 9#L550-3true assume !!(insertionSort_~i~0#1 < insertionSort_~array_size#1);call insertionSort_#t~mem3#1 := read~int(insertionSort_~a#1.base, insertionSort_~a#1.offset + 4 * insertionSort_~i~0#1, 4);insertionSort_~index~0#1 := insertionSort_#t~mem3#1;havoc insertionSort_#t~mem3#1;insertionSort_~j~0#1 := insertionSort_~i~0#1; 2#L553-6true assume !true; 13#L553-7true call write~int(insertionSort_~index~0#1, insertionSort_~a#1.base, insertionSort_~a#1.offset + 4 * insertionSort_~j~0#1, 4); 15#L550-2true insertionSort_#t~pre2#1 := 1 + insertionSort_~i~0#1;insertionSort_~i~0#1 := 1 + insertionSort_~i~0#1;havoc insertionSort_#t~pre2#1; 9#L550-3true [2022-07-22 01:39:27,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:39:27,671 INFO L85 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2022-07-22 01:39:27,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:39:27,680 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086602080] [2022-07-22 01:39:27,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:39:27,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:39:27,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:39:27,782 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:39:27,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:39:27,837 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:39:27,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:39:27,840 INFO L85 PathProgramCache]: Analyzing trace with hash 1465782, now seen corresponding path program 1 times [2022-07-22 01:39:27,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:39:27,841 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849272882] [2022-07-22 01:39:27,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:39:27,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:39:27,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:39:27,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 01:39:27,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 01:39:27,893 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849272882] [2022-07-22 01:39:27,893 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [849272882] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 01:39:27,894 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 01:39:27,894 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-22 01:39:27,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344686770] [2022-07-22 01:39:27,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 01:39:27,898 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-22 01:39:27,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 01:39:27,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-22 01:39:27,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-22 01:39:27,931 INFO L87 Difference]: Start difference. First operand has 15 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 states have internal predecessors, (20), 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 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 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-07-22 01:39:27,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 01:39:27,937 INFO L93 Difference]: Finished difference Result 15 states and 18 transitions. [2022-07-22 01:39:27,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-22 01:39:27,941 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 18 transitions. [2022-07-22 01:39:27,942 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2022-07-22 01:39:27,945 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 11 states and 14 transitions. [2022-07-22 01:39:27,946 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2022-07-22 01:39:27,946 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2022-07-22 01:39:27,947 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 14 transitions. [2022-07-22 01:39:27,948 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 01:39:27,948 INFO L369 hiAutomatonCegarLoop]: Abstraction has 11 states and 14 transitions. [2022-07-22 01:39:27,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 14 transitions. [2022-07-22 01:39:27,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2022-07-22 01:39:27,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 10 states have internal predecessors, (14), 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-07-22 01:39:27,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 14 transitions. [2022-07-22 01:39:27,970 INFO L392 hiAutomatonCegarLoop]: Abstraction has 11 states and 14 transitions. [2022-07-22 01:39:27,970 INFO L374 stractBuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2022-07-22 01:39:27,970 INFO L287 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-07-22 01:39:27,970 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 14 transitions. [2022-07-22 01:39:27,971 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2022-07-22 01:39:27,971 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 01:39:27,971 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 01:39:27,972 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2022-07-22 01:39:27,972 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2022-07-22 01:39:27,972 INFO L752 eck$LassoCheckResult]: Stem: 42#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 43#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_~array_size~0#1, main_~a~0#1.base, main_~a~0#1.offset;main_~array_size~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; 46#L560 assume !(main_~array_size~0#1 < 1); 47#L560-2 call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;assume { :begin_inline_insertionSort } true;insertionSort_#in~a#1.base, insertionSort_#in~a#1.offset, insertionSort_#in~array_size#1 := main_~a~0#1.base, main_~a~0#1.offset, main_~array_size~0#1;havoc insertionSort_#t~mem3#1, insertionSort_#t~mem7#1, insertionSort_#t~post4#1, insertionSort_#t~mem5#1, insertionSort_#t~short6#1, insertionSort_#t~pre2#1, insertionSort_~a#1.base, insertionSort_~a#1.offset, insertionSort_~array_size#1, insertionSort_~i~0#1, insertionSort_~j~0#1, insertionSort_~index~0#1;insertionSort_~a#1.base, insertionSort_~a#1.offset := insertionSort_#in~a#1.base, insertionSort_#in~a#1.offset;insertionSort_~array_size#1 := insertionSort_#in~array_size#1;havoc insertionSort_~i~0#1;havoc insertionSort_~j~0#1;havoc insertionSort_~index~0#1;insertionSort_~i~0#1 := 1; 48#L550-3 [2022-07-22 01:39:27,972 INFO L754 eck$LassoCheckResult]: Loop: 48#L550-3 assume !!(insertionSort_~i~0#1 < insertionSort_~array_size#1);call insertionSort_#t~mem3#1 := read~int(insertionSort_~a#1.base, insertionSort_~a#1.offset + 4 * insertionSort_~i~0#1, 4);insertionSort_~index~0#1 := insertionSort_#t~mem3#1;havoc insertionSort_#t~mem3#1;insertionSort_~j~0#1 := insertionSort_~i~0#1; 38#L553-6 insertionSort_#t~short6#1 := insertionSort_~j~0#1 > 0; 39#L553-1 assume insertionSort_#t~short6#1;call insertionSort_#t~mem5#1 := read~int(insertionSort_~a#1.base, insertionSort_~a#1.offset + 4 * (insertionSort_~j~0#1 - 1), 4);insertionSort_#t~short6#1 := insertionSort_#t~mem5#1 > insertionSort_~index~0#1; 44#L553-3 assume !insertionSort_#t~short6#1;havoc insertionSort_#t~mem5#1;havoc insertionSort_#t~short6#1; 40#L553-7 call write~int(insertionSort_~index~0#1, insertionSort_~a#1.base, insertionSort_~a#1.offset + 4 * insertionSort_~j~0#1, 4); 41#L550-2 insertionSort_#t~pre2#1 := 1 + insertionSort_~i~0#1;insertionSort_~i~0#1 := 1 + insertionSort_~i~0#1;havoc insertionSort_#t~pre2#1; 48#L550-3 [2022-07-22 01:39:27,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:39:27,973 INFO L85 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 2 times [2022-07-22 01:39:27,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:39:27,974 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317655600] [2022-07-22 01:39:27,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:39:27,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:39:28,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:39:28,006 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:39:28,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:39:28,018 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:39:28,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:39:28,020 INFO L85 PathProgramCache]: Analyzing trace with hash 1394338221, now seen corresponding path program 1 times [2022-07-22 01:39:28,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:39:28,021 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537507090] [2022-07-22 01:39:28,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:39:28,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:39:28,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:39:28,057 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:39:28,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:39:28,069 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:39:28,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:39:28,069 INFO L85 PathProgramCache]: Analyzing trace with hash -1897689455, now seen corresponding path program 1 times [2022-07-22 01:39:28,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:39:28,070 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715908067] [2022-07-22 01:39:28,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:39:28,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:39:28,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:39:28,106 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:39:28,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:39:28,135 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:39:28,524 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 01:39:28,525 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 01:39:28,525 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 01:39:28,525 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 01:39:28,525 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 01:39:28,525 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:39:28,525 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 01:39:28,525 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 01:39:28,526 INFO L133 ssoRankerPreferences]: Filename of dumped script: insertionsort-alloca-2.i_Iteration2_Lasso [2022-07-22 01:39:28,526 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 01:39:28,526 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 01:39:28,552 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:39:28,561 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:39:28,565 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:39:28,569 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:39:28,571 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:39:28,575 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:39:28,809 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:39:28,811 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:39:28,814 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:39:28,817 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:39:28,820 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:39:28,822 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:39:28,825 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:39:28,827 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:39:29,114 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 01:39:29,118 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-22 01:39:29,120 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:39:29,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:39:29,121 INFO L229 MonitoredProcess]: Starting monitored process 2 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-07-22 01:39:29,126 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2022-07-22 01:39:29,127 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-07-22 01:39:29,135 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:39:29,136 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:39:29,136 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:39:29,136 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:39:29,136 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:39:29,138 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:39:29,138 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:39:29,147 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:39:29,173 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2022-07-22 01:39:29,173 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:39:29,174 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:39:29,175 INFO L229 MonitoredProcess]: Starting monitored process 3 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-07-22 01:39:29,182 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-07-22 01:39:29,190 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:39:29,190 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:39:29,190 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:39:29,190 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:39:29,193 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 01:39:29,193 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 01:39:29,196 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2022-07-22 01:39:29,211 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:39:29,236 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2022-07-22 01:39:29,236 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:39:29,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:39:29,238 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-07-22 01:39:29,243 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-07-22 01:39:29,246 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-07-22 01:39:29,252 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:39:29,252 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:39:29,252 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:39:29,252 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:39:29,255 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 01:39:29,255 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 01:39:29,267 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:39:29,292 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2022-07-22 01:39:29,292 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:39:29,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:39:29,294 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-07-22 01:39:29,301 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-07-22 01:39:29,302 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-07-22 01:39:29,309 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:39:29,310 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:39:29,310 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:39:29,310 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:39:29,310 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:39:29,311 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:39:29,311 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:39:29,321 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:39:29,337 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-07-22 01:39:29,338 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:39:29,338 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:39:29,339 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-07-22 01:39:29,340 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-07-22 01:39:29,387 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-07-22 01:39:29,396 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:39:29,396 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:39:29,396 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:39:29,396 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:39:29,399 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 01:39:29,399 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 01:39:29,409 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:39:29,434 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-07-22 01:39:29,435 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:39:29,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:39:29,436 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-07-22 01:39:29,437 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-07-22 01:39:29,439 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-07-22 01:39:29,447 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:39:29,447 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:39:29,447 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:39:29,447 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:39:29,452 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 01:39:29,452 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 01:39:29,479 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:39:29,519 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-07-22 01:39:29,520 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:39:29,520 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:39:29,521 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-07-22 01:39:29,522 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-07-22 01:39:29,523 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-07-22 01:39:29,530 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:39:29,530 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:39:29,530 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:39:29,530 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:39:29,534 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 01:39:29,534 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 01:39:29,549 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:39:29,572 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-07-22 01:39:29,573 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:39:29,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:39:29,574 INFO L229 MonitoredProcess]: Starting monitored process 9 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-07-22 01:39:29,586 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-07-22 01:39:29,593 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:39:29,594 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:39:29,594 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:39:29,594 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:39:29,594 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:39:29,595 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:39:29,595 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:39:29,597 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2022-07-22 01:39:29,611 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:39:29,636 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2022-07-22 01:39:29,637 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:39:29,637 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:39:29,638 INFO L229 MonitoredProcess]: Starting monitored process 10 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-07-22 01:39:29,644 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-07-22 01:39:29,652 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:39:29,653 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:39:29,653 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:39:29,653 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:39:29,663 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 01:39:29,663 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 01:39:29,670 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2022-07-22 01:39:29,683 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-22 01:39:29,727 INFO L443 ModelExtractionUtils]: Simplification made 18 calls to the SMT solver. [2022-07-22 01:39:29,727 INFO L444 ModelExtractionUtils]: 24 out of 37 variables were initially zero. Simplification set additionally 9 variables to zero. [2022-07-22 01:39:29,728 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:39:29,728 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:39:29,730 INFO L229 MonitoredProcess]: Starting monitored process 11 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-07-22 01:39:29,738 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-22 01:39:29,746 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2022-07-22 01:39:29,760 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2022-07-22 01:39:29,761 INFO L513 LassoAnalysis]: Proved termination. [2022-07-22 01:39:29,761 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_insertionSort_~i~0#1, v_rep(select #length ULTIMATE.start_insertionSort_~a#1.base)_1) = -2*ULTIMATE.start_insertionSort_~i~0#1 + 1*v_rep(select #length ULTIMATE.start_insertionSort_~a#1.base)_1 Supporting invariants [1*ULTIMATE.start_insertionSort_~a#1.offset >= 0] [2022-07-22 01:39:29,786 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2022-07-22 01:39:29,802 INFO L293 tatePredicateManager]: 4 out of 5 supporting invariants were superfluous and have been removed [2022-07-22 01:39:29,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:39:29,875 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2022-07-22 01:39:29,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:39:29,887 INFO L263 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-22 01:39:29,889 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 01:39:29,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:39:29,916 INFO L263 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-22 01:39:29,917 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 01:39:30,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 01:39:30,060 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2022-07-22 01:39:30,061 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 14 transitions. cyclomatic complexity: 4 Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 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-07-22 01:39:30,200 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states and 14 transitions. cyclomatic complexity: 4. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 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 31 states and 41 transitions. Complement of second has 10 states. [2022-07-22 01:39:30,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2022-07-22 01:39:30,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 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-07-22 01:39:30,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 22 transitions. [2022-07-22 01:39:30,213 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 22 transitions. Stem has 4 letters. Loop has 6 letters. [2022-07-22 01:39:30,214 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 01:39:30,214 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 22 transitions. Stem has 10 letters. Loop has 6 letters. [2022-07-22 01:39:30,215 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 01:39:30,215 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 22 transitions. Stem has 4 letters. Loop has 12 letters. [2022-07-22 01:39:30,215 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 01:39:30,215 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 41 transitions. [2022-07-22 01:39:30,219 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2022-07-22 01:39:30,221 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 29 states and 39 transitions. [2022-07-22 01:39:30,221 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2022-07-22 01:39:30,222 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2022-07-22 01:39:30,222 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 39 transitions. [2022-07-22 01:39:30,222 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-22 01:39:30,222 INFO L369 hiAutomatonCegarLoop]: Abstraction has 29 states and 39 transitions. [2022-07-22 01:39:30,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 39 transitions. [2022-07-22 01:39:30,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2022-07-22 01:39:30,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 1.3571428571428572) internal successors, (38), 27 states have internal predecessors, (38), 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-07-22 01:39:30,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 38 transitions. [2022-07-22 01:39:30,229 INFO L392 hiAutomatonCegarLoop]: Abstraction has 28 states and 38 transitions. [2022-07-22 01:39:30,229 INFO L374 stractBuchiCegarLoop]: Abstraction has 28 states and 38 transitions. [2022-07-22 01:39:30,229 INFO L287 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-07-22 01:39:30,229 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 38 transitions. [2022-07-22 01:39:30,231 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2022-07-22 01:39:30,231 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 01:39:30,231 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 01:39:30,231 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-07-22 01:39:30,232 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2022-07-22 01:39:30,232 INFO L752 eck$LassoCheckResult]: Stem: 176#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 177#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_~array_size~0#1, main_~a~0#1.base, main_~a~0#1.offset;main_~array_size~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; 182#L560 assume !(main_~array_size~0#1 < 1); 183#L560-2 call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;assume { :begin_inline_insertionSort } true;insertionSort_#in~a#1.base, insertionSort_#in~a#1.offset, insertionSort_#in~array_size#1 := main_~a~0#1.base, main_~a~0#1.offset, main_~array_size~0#1;havoc insertionSort_#t~mem3#1, insertionSort_#t~mem7#1, insertionSort_#t~post4#1, insertionSort_#t~mem5#1, insertionSort_#t~short6#1, insertionSort_#t~pre2#1, insertionSort_~a#1.base, insertionSort_~a#1.offset, insertionSort_~array_size#1, insertionSort_~i~0#1, insertionSort_~j~0#1, insertionSort_~index~0#1;insertionSort_~a#1.base, insertionSort_~a#1.offset := insertionSort_#in~a#1.base, insertionSort_#in~a#1.offset;insertionSort_~array_size#1 := insertionSort_#in~array_size#1;havoc insertionSort_~i~0#1;havoc insertionSort_~j~0#1;havoc insertionSort_~index~0#1;insertionSort_~i~0#1 := 1; 184#L550-3 assume !!(insertionSort_~i~0#1 < insertionSort_~array_size#1);call insertionSort_#t~mem3#1 := read~int(insertionSort_~a#1.base, insertionSort_~a#1.offset + 4 * insertionSort_~i~0#1, 4);insertionSort_~index~0#1 := insertionSort_#t~mem3#1;havoc insertionSort_#t~mem3#1;insertionSort_~j~0#1 := insertionSort_~i~0#1; 186#L553-6 [2022-07-22 01:39:30,232 INFO L754 eck$LassoCheckResult]: Loop: 186#L553-6 insertionSort_#t~short6#1 := insertionSort_~j~0#1 > 0; 191#L553-1 assume !insertionSort_#t~short6#1; 190#L553-3 assume !insertionSort_#t~short6#1;havoc insertionSort_#t~mem5#1;havoc insertionSort_#t~short6#1; 172#L553-7 call write~int(insertionSort_~index~0#1, insertionSort_~a#1.base, insertionSort_~a#1.offset + 4 * insertionSort_~j~0#1, 4); 173#L550-2 insertionSort_#t~pre2#1 := 1 + insertionSort_~i~0#1;insertionSort_~i~0#1 := 1 + insertionSort_~i~0#1;havoc insertionSort_#t~pre2#1; 185#L550-3 assume !!(insertionSort_~i~0#1 < insertionSort_~array_size#1);call insertionSort_#t~mem3#1 := read~int(insertionSort_~a#1.base, insertionSort_~a#1.offset + 4 * insertionSort_~i~0#1, 4);insertionSort_~index~0#1 := insertionSort_#t~mem3#1;havoc insertionSort_#t~mem3#1;insertionSort_~j~0#1 := insertionSort_~i~0#1; 186#L553-6 [2022-07-22 01:39:30,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:39:30,233 INFO L85 PathProgramCache]: Analyzing trace with hash 28695756, now seen corresponding path program 1 times [2022-07-22 01:39:30,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:39:30,233 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702186305] [2022-07-22 01:39:30,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:39:30,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:39:30,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:39:30,260 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:39:30,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:39:30,273 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:39:30,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:39:30,274 INFO L85 PathProgramCache]: Analyzing trace with hash 1513658903, now seen corresponding path program 1 times [2022-07-22 01:39:30,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:39:30,274 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531450700] [2022-07-22 01:39:30,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:39:30,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:39:30,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:39:30,288 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:39:30,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:39:30,298 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:39:30,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:39:30,300 INFO L85 PathProgramCache]: Analyzing trace with hash 1303016098, now seen corresponding path program 1 times [2022-07-22 01:39:30,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:39:30,301 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285719994] [2022-07-22 01:39:30,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:39:30,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:39:30,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:39:30,351 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 01:39:30,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 01:39:30,352 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285719994] [2022-07-22 01:39:30,352 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [285719994] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 01:39:30,352 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 01:39:30,352 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-22 01:39:30,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599340965] [2022-07-22 01:39:30,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 01:39:30,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 01:39:30,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-22 01:39:30,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-22 01:39:30,458 INFO L87 Difference]: Start difference. First operand 28 states and 38 transitions. cyclomatic complexity: 13 Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 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-07-22 01:39:30,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 01:39:30,498 INFO L93 Difference]: Finished difference Result 27 states and 35 transitions. [2022-07-22 01:39:30,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-22 01:39:30,500 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 35 transitions. [2022-07-22 01:39:30,500 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-07-22 01:39:30,501 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 27 states and 35 transitions. [2022-07-22 01:39:30,501 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2022-07-22 01:39:30,501 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2022-07-22 01:39:30,501 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 35 transitions. [2022-07-22 01:39:30,501 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-22 01:39:30,501 INFO L369 hiAutomatonCegarLoop]: Abstraction has 27 states and 35 transitions. [2022-07-22 01:39:30,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 35 transitions. [2022-07-22 01:39:30,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 20. [2022-07-22 01:39:30,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.3) internal successors, (26), 19 states have internal predecessors, (26), 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-07-22 01:39:30,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 26 transitions. [2022-07-22 01:39:30,503 INFO L392 hiAutomatonCegarLoop]: Abstraction has 20 states and 26 transitions. [2022-07-22 01:39:30,503 INFO L374 stractBuchiCegarLoop]: Abstraction has 20 states and 26 transitions. [2022-07-22 01:39:30,503 INFO L287 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-07-22 01:39:30,503 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 26 transitions. [2022-07-22 01:39:30,504 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-07-22 01:39:30,504 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 01:39:30,504 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 01:39:30,504 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-22 01:39:30,504 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2022-07-22 01:39:30,504 INFO L752 eck$LassoCheckResult]: Stem: 241#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 242#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_~array_size~0#1, main_~a~0#1.base, main_~a~0#1.offset;main_~array_size~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; 249#L560 assume !(main_~array_size~0#1 < 1); 250#L560-2 call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;assume { :begin_inline_insertionSort } true;insertionSort_#in~a#1.base, insertionSort_#in~a#1.offset, insertionSort_#in~array_size#1 := main_~a~0#1.base, main_~a~0#1.offset, main_~array_size~0#1;havoc insertionSort_#t~mem3#1, insertionSort_#t~mem7#1, insertionSort_#t~post4#1, insertionSort_#t~mem5#1, insertionSort_#t~short6#1, insertionSort_#t~pre2#1, insertionSort_~a#1.base, insertionSort_~a#1.offset, insertionSort_~array_size#1, insertionSort_~i~0#1, insertionSort_~j~0#1, insertionSort_~index~0#1;insertionSort_~a#1.base, insertionSort_~a#1.offset := insertionSort_#in~a#1.base, insertionSort_#in~a#1.offset;insertionSort_~array_size#1 := insertionSort_#in~array_size#1;havoc insertionSort_~i~0#1;havoc insertionSort_~j~0#1;havoc insertionSort_~index~0#1;insertionSort_~i~0#1 := 1; 251#L550-3 assume !!(insertionSort_~i~0#1 < insertionSort_~array_size#1);call insertionSort_#t~mem3#1 := read~int(insertionSort_~a#1.base, insertionSort_~a#1.offset + 4 * insertionSort_~i~0#1, 4);insertionSort_~index~0#1 := insertionSort_#t~mem3#1;havoc insertionSort_#t~mem3#1;insertionSort_~j~0#1 := insertionSort_~i~0#1; 252#L553-6 insertionSort_#t~short6#1 := insertionSort_~j~0#1 > 0; 254#L553-1 assume insertionSort_#t~short6#1;call insertionSort_#t~mem5#1 := read~int(insertionSort_~a#1.base, insertionSort_~a#1.offset + 4 * (insertionSort_~j~0#1 - 1), 4);insertionSort_#t~short6#1 := insertionSort_#t~mem5#1 > insertionSort_~index~0#1; 245#L553-3 [2022-07-22 01:39:30,504 INFO L754 eck$LassoCheckResult]: Loop: 245#L553-3 assume !!insertionSort_#t~short6#1;havoc insertionSort_#t~mem5#1;havoc insertionSort_#t~short6#1;call insertionSort_#t~mem7#1 := read~int(insertionSort_~a#1.base, insertionSort_~a#1.offset + 4 * (insertionSort_~j~0#1 - 1), 4);call write~int(insertionSort_#t~mem7#1, insertionSort_~a#1.base, insertionSort_~a#1.offset + 4 * insertionSort_~j~0#1, 4);havoc insertionSort_#t~mem7#1; 246#L553-5 insertionSort_#t~post4#1 := insertionSort_~j~0#1;insertionSort_~j~0#1 := insertionSort_#t~post4#1 - 1;havoc insertionSort_#t~post4#1; 237#L553-6 insertionSort_#t~short6#1 := insertionSort_~j~0#1 > 0; 238#L553-1 assume insertionSort_#t~short6#1;call insertionSort_#t~mem5#1 := read~int(insertionSort_~a#1.base, insertionSort_~a#1.offset + 4 * (insertionSort_~j~0#1 - 1), 4);insertionSort_#t~short6#1 := insertionSort_#t~mem5#1 > insertionSort_~index~0#1; 245#L553-3 [2022-07-22 01:39:30,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:39:30,505 INFO L85 PathProgramCache]: Analyzing trace with hash 1806818415, now seen corresponding path program 1 times [2022-07-22 01:39:30,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:39:30,505 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721756987] [2022-07-22 01:39:30,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:39:30,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:39:30,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:39:30,515 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:39:30,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:39:30,524 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:39:30,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:39:30,524 INFO L85 PathProgramCache]: Analyzing trace with hash 1910182, now seen corresponding path program 1 times [2022-07-22 01:39:30,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:39:30,525 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142396250] [2022-07-22 01:39:30,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:39:30,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:39:30,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:39:30,531 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:39:30,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:39:30,536 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:39:30,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:39:30,536 INFO L85 PathProgramCache]: Analyzing trace with hash 1301224212, now seen corresponding path program 1 times [2022-07-22 01:39:30,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:39:30,536 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868753829] [2022-07-22 01:39:30,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:39:30,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:39:30,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:39:30,571 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 01:39:30,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 01:39:30,572 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868753829] [2022-07-22 01:39:30,572 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868753829] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 01:39:30,572 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1243269370] [2022-07-22 01:39:30,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:39:30,572 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 01:39:30,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:39:30,574 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-07-22 01:39:30,594 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-07-22 01:39:30,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:39:30,625 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-22 01:39:30,626 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 01:39:30,638 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 01:39:30,638 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 01:39:30,658 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 01:39:30,658 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1243269370] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 01:39:30,658 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 01:39:30,658 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 5 [2022-07-22 01:39:30,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393759547] [2022-07-22 01:39:30,659 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 01:39:30,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 01:39:30,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-22 01:39:30,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-22 01:39:30,828 INFO L87 Difference]: Start difference. First operand 20 states and 26 transitions. cyclomatic complexity: 8 Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 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-07-22 01:39:30,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 01:39:30,897 INFO L93 Difference]: Finished difference Result 42 states and 49 transitions. [2022-07-22 01:39:30,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-22 01:39:30,898 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 49 transitions. [2022-07-22 01:39:30,899 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-07-22 01:39:30,899 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 34 states and 41 transitions. [2022-07-22 01:39:30,899 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2022-07-22 01:39:30,899 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2022-07-22 01:39:30,899 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 41 transitions. [2022-07-22 01:39:30,900 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-22 01:39:30,900 INFO L369 hiAutomatonCegarLoop]: Abstraction has 34 states and 41 transitions. [2022-07-22 01:39:30,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 41 transitions. [2022-07-22 01:39:30,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 25. [2022-07-22 01:39:30,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.2) internal successors, (30), 24 states have internal predecessors, (30), 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-07-22 01:39:30,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 30 transitions. [2022-07-22 01:39:30,902 INFO L392 hiAutomatonCegarLoop]: Abstraction has 25 states and 30 transitions. [2022-07-22 01:39:30,902 INFO L374 stractBuchiCegarLoop]: Abstraction has 25 states and 30 transitions. [2022-07-22 01:39:30,902 INFO L287 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2022-07-22 01:39:30,902 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 30 transitions. [2022-07-22 01:39:30,903 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-07-22 01:39:30,903 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 01:39:30,903 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 01:39:30,903 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 01:39:30,903 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2022-07-22 01:39:30,904 INFO L752 eck$LassoCheckResult]: Stem: 380#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 381#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet8#1, main_#t~malloc9#1.base, main_#t~malloc9#1.offset, main_~array_size~0#1, main_~a~0#1.base, main_~a~0#1.offset;main_~array_size~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1; 387#L560 assume !(main_~array_size~0#1 < 1); 388#L560-2 call main_#t~malloc9#1.base, main_#t~malloc9#1.offset := #Ultimate.allocOnStack(4 * main_~array_size~0#1);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc9#1.base, main_#t~malloc9#1.offset;assume { :begin_inline_insertionSort } true;insertionSort_#in~a#1.base, insertionSort_#in~a#1.offset, insertionSort_#in~array_size#1 := main_~a~0#1.base, main_~a~0#1.offset, main_~array_size~0#1;havoc insertionSort_#t~mem3#1, insertionSort_#t~mem7#1, insertionSort_#t~post4#1, insertionSort_#t~mem5#1, insertionSort_#t~short6#1, insertionSort_#t~pre2#1, insertionSort_~a#1.base, insertionSort_~a#1.offset, insertionSort_~array_size#1, insertionSort_~i~0#1, insertionSort_~j~0#1, insertionSort_~index~0#1;insertionSort_~a#1.base, insertionSort_~a#1.offset := insertionSort_#in~a#1.base, insertionSort_#in~a#1.offset;insertionSort_~array_size#1 := insertionSort_#in~array_size#1;havoc insertionSort_~i~0#1;havoc insertionSort_~j~0#1;havoc insertionSort_~index~0#1;insertionSort_~i~0#1 := 1; 389#L550-3 assume !!(insertionSort_~i~0#1 < insertionSort_~array_size#1);call insertionSort_#t~mem3#1 := read~int(insertionSort_~a#1.base, insertionSort_~a#1.offset + 4 * insertionSort_~i~0#1, 4);insertionSort_~index~0#1 := insertionSort_#t~mem3#1;havoc insertionSort_#t~mem3#1;insertionSort_~j~0#1 := insertionSort_~i~0#1; 378#L553-6 insertionSort_#t~short6#1 := insertionSort_~j~0#1 > 0; 379#L553-1 assume insertionSort_#t~short6#1;call insertionSort_#t~mem5#1 := read~int(insertionSort_~a#1.base, insertionSort_~a#1.offset + 4 * (insertionSort_~j~0#1 - 1), 4);insertionSort_#t~short6#1 := insertionSort_#t~mem5#1 > insertionSort_~index~0#1; 400#L553-3 assume !insertionSort_#t~short6#1;havoc insertionSort_#t~mem5#1;havoc insertionSort_#t~short6#1; 382#L553-7 call write~int(insertionSort_~index~0#1, insertionSort_~a#1.base, insertionSort_~a#1.offset + 4 * insertionSort_~j~0#1, 4); 383#L550-2 insertionSort_#t~pre2#1 := 1 + insertionSort_~i~0#1;insertionSort_~i~0#1 := 1 + insertionSort_~i~0#1;havoc insertionSort_#t~pre2#1; 390#L550-3 assume !!(insertionSort_~i~0#1 < insertionSort_~array_size#1);call insertionSort_#t~mem3#1 := read~int(insertionSort_~a#1.base, insertionSort_~a#1.offset + 4 * insertionSort_~i~0#1, 4);insertionSort_~index~0#1 := insertionSort_#t~mem3#1;havoc insertionSort_#t~mem3#1;insertionSort_~j~0#1 := insertionSort_~i~0#1; 376#L553-6 [2022-07-22 01:39:30,904 INFO L754 eck$LassoCheckResult]: Loop: 376#L553-6 insertionSort_#t~short6#1 := insertionSort_~j~0#1 > 0; 377#L553-1 assume insertionSort_#t~short6#1;call insertionSort_#t~mem5#1 := read~int(insertionSort_~a#1.base, insertionSort_~a#1.offset + 4 * (insertionSort_~j~0#1 - 1), 4);insertionSort_#t~short6#1 := insertionSort_#t~mem5#1 > insertionSort_~index~0#1; 384#L553-3 assume !!insertionSort_#t~short6#1;havoc insertionSort_#t~mem5#1;havoc insertionSort_#t~short6#1;call insertionSort_#t~mem7#1 := read~int(insertionSort_~a#1.base, insertionSort_~a#1.offset + 4 * (insertionSort_~j~0#1 - 1), 4);call write~int(insertionSort_#t~mem7#1, insertionSort_~a#1.base, insertionSort_~a#1.offset + 4 * insertionSort_~j~0#1, 4);havoc insertionSort_#t~mem7#1; 385#L553-5 insertionSort_#t~post4#1 := insertionSort_~j~0#1;insertionSort_~j~0#1 := insertionSort_#t~post4#1 - 1;havoc insertionSort_#t~post4#1; 376#L553-6 [2022-07-22 01:39:30,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:39:30,904 INFO L85 PathProgramCache]: Analyzing trace with hash 1301169056, now seen corresponding path program 2 times [2022-07-22 01:39:30,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:39:30,904 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701245226] [2022-07-22 01:39:30,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:39:30,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:39:30,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:39:30,916 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:39:30,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:39:30,936 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:39:30,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:39:30,937 INFO L85 PathProgramCache]: Analyzing trace with hash 1573222, now seen corresponding path program 2 times [2022-07-22 01:39:30,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:39:30,937 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539838600] [2022-07-22 01:39:30,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:39:30,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:39:30,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:39:30,942 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:39:30,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:39:30,946 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:39:30,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:39:30,947 INFO L85 PathProgramCache]: Analyzing trace with hash -1886560891, now seen corresponding path program 1 times [2022-07-22 01:39:30,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:39:30,947 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034715503] [2022-07-22 01:39:30,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:39:30,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:39:30,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:39:30,964 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:39:30,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:39:30,991 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:39:31,427 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 01:39:31,427 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 01:39:31,427 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 01:39:31,427 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 01:39:31,427 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 01:39:31,427 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:39:31,427 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 01:39:31,427 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 01:39:31,427 INFO L133 ssoRankerPreferences]: Filename of dumped script: insertionsort-alloca-2.i_Iteration5_Lasso [2022-07-22 01:39:31,427 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 01:39:31,427 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 01:39:31,430 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:39:31,676 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:39:31,679 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:39:31,682 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:39:31,684 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:39:31,686 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:39:31,688 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:39:31,690 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:39:31,705 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:39:31,707 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:39:31,709 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:39:31,711 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:39:31,713 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:39:31,715 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:39:31,941 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 01:39:31,941 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-22 01:39:31,941 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:39:31,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:39:31,946 INFO L229 MonitoredProcess]: Starting monitored process 13 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-07-22 01:39:31,954 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2022-07-22 01:39:31,954 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-07-22 01:39:31,961 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:39:31,961 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:39:31,961 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:39:31,962 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:39:31,964 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 01:39:31,964 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 01:39:31,979 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:39:32,004 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2022-07-22 01:39:32,004 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:39:32,004 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:39:32,005 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-07-22 01:39:32,015 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-07-22 01:39:32,016 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-07-22 01:39:32,024 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:39:32,024 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:39:32,024 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:39:32,024 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:39:32,024 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:39:32,025 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:39:32,025 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:39:32,039 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:39:32,065 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2022-07-22 01:39:32,066 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:39:32,066 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:39:32,067 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-07-22 01:39:32,067 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-07-22 01:39:32,069 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-07-22 01:39:32,075 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:39:32,075 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:39:32,075 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:39:32,075 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:39:32,078 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 01:39:32,079 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 01:39:32,091 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:39:32,114 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-07-22 01:39:32,115 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:39:32,115 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:39:32,116 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-07-22 01:39:32,122 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-07-22 01:39:32,130 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:39:32,130 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:39:32,130 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:39:32,130 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:39:32,134 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-07-22 01:39:32,135 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 01:39:32,135 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 01:39:32,149 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:39:32,173 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2022-07-22 01:39:32,173 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:39:32,174 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:39:32,175 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-07-22 01:39:32,182 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-07-22 01:39:32,190 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:39:32,190 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:39:32,190 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:39:32,190 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:39:32,194 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 01:39:32,194 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 01:39:32,199 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-07-22 01:39:32,201 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:39:32,217 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2022-07-22 01:39:32,218 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:39:32,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:39:32,219 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-07-22 01:39:32,219 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-07-22 01:39:32,221 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-07-22 01:39:32,228 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:39:32,228 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:39:32,228 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:39:32,228 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:39:32,239 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 01:39:32,239 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 01:39:32,271 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-22 01:39:32,294 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2022-07-22 01:39:32,294 INFO L444 ModelExtractionUtils]: 21 out of 37 variables were initially zero. Simplification set additionally 14 variables to zero. [2022-07-22 01:39:32,294 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:39:32,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:39:32,315 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-07-22 01:39:32,366 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-22 01:39:32,375 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-07-22 01:39:32,382 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-07-22 01:39:32,383 INFO L513 LassoAnalysis]: Proved termination. [2022-07-22 01:39:32,383 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_insertionSort_~j~0#1) = 1*ULTIMATE.start_insertionSort_~j~0#1 Supporting invariants [] [2022-07-22 01:39:32,403 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-07-22 01:39:32,439 INFO L293 tatePredicateManager]: 7 out of 7 supporting invariants were superfluous and have been removed [2022-07-22 01:39:32,445 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-07-22 01:39:32,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:39:32,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:39:32,472 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 01:39:32,473 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 01:39:32,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:39:32,493 INFO L263 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-22 01:39:32,493 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 01:39:32,529 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 01:39:32,530 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2022-07-22 01:39:32,530 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 30 transitions. cyclomatic complexity: 7 Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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-07-22 01:39:32,559 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 30 transitions. cyclomatic complexity: 7. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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 43 states and 50 transitions. Complement of second has 9 states. [2022-07-22 01:39:32,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2022-07-22 01:39:32,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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-07-22 01:39:32,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 17 transitions. [2022-07-22 01:39:32,561 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 17 transitions. Stem has 11 letters. Loop has 4 letters. [2022-07-22 01:39:32,561 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 01:39:32,561 INFO L577 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-07-22 01:39:32,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:39:32,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:39:32,587 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 01:39:32,588 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 01:39:32,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:39:32,605 INFO L263 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-22 01:39:32,606 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 01:39:32,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 01:39:32,646 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 3 loop predicates [2022-07-22 01:39:32,646 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 30 transitions. cyclomatic complexity: 7 Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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-07-22 01:39:32,678 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 30 transitions. cyclomatic complexity: 7. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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 43 states and 50 transitions. Complement of second has 9 states. [2022-07-22 01:39:32,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2022-07-22 01:39:32,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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-07-22 01:39:32,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 17 transitions. [2022-07-22 01:39:32,680 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 17 transitions. Stem has 11 letters. Loop has 4 letters. [2022-07-22 01:39:32,681 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 01:39:32,681 INFO L577 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-07-22 01:39:32,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:39:32,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:39:32,704 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 01:39:32,706 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 01:39:32,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:39:32,733 INFO L263 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-22 01:39:32,734 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 01:39:32,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 01:39:32,774 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2022-07-22 01:39:32,774 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 30 transitions. cyclomatic complexity: 7 Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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-07-22 01:39:32,800 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 30 transitions. cyclomatic complexity: 7. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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 47 states and 57 transitions. Complement of second has 8 states. [2022-07-22 01:39:32,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2022-07-22 01:39:32,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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-07-22 01:39:32,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 26 transitions. [2022-07-22 01:39:32,802 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 26 transitions. Stem has 11 letters. Loop has 4 letters. [2022-07-22 01:39:32,802 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 01:39:32,803 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 26 transitions. Stem has 15 letters. Loop has 4 letters. [2022-07-22 01:39:32,803 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 01:39:32,803 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 26 transitions. Stem has 11 letters. Loop has 8 letters. [2022-07-22 01:39:32,803 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 01:39:32,803 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 47 states and 57 transitions. [2022-07-22 01:39:32,804 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-07-22 01:39:32,804 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 47 states to 0 states and 0 transitions. [2022-07-22 01:39:32,804 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2022-07-22 01:39:32,805 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2022-07-22 01:39:32,805 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2022-07-22 01:39:32,805 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 01:39:32,805 INFO L369 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-22 01:39:32,805 INFO L392 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-22 01:39:32,805 INFO L374 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-22 01:39:32,805 INFO L287 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2022-07-22 01:39:32,805 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2022-07-22 01:39:32,805 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-07-22 01:39:32,805 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-07-22 01:39:32,811 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.07 01:39:32 BoogieIcfgContainer [2022-07-22 01:39:32,811 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-07-22 01:39:32,812 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-22 01:39:32,812 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-22 01:39:32,812 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-22 01:39:32,812 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 01:39:27" (3/4) ... [2022-07-22 01:39:32,814 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-07-22 01:39:32,814 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-22 01:39:32,815 INFO L158 Benchmark]: Toolchain (without parser) took 6013.29ms. Allocated memory was 56.6MB in the beginning and 100.7MB in the end (delta: 44.0MB). Free memory was 39.6MB in the beginning and 46.3MB in the end (delta: -6.7MB). Peak memory consumption was 35.4MB. Max. memory is 16.1GB. [2022-07-22 01:39:32,815 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 46.1MB. Free memory was 27.8MB in the beginning and 27.8MB in the end (delta: 32.8kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-22 01:39:32,816 INFO L158 Benchmark]: CACSL2BoogieTranslator took 379.16ms. Allocated memory is still 56.6MB. Free memory was 39.3MB in the beginning and 34.3MB in the end (delta: 5.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-22 01:39:32,816 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.60ms. Allocated memory is still 56.6MB. Free memory was 34.1MB in the beginning and 32.4MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-22 01:39:32,816 INFO L158 Benchmark]: Boogie Preprocessor took 42.98ms. Allocated memory is still 56.6MB. Free memory was 32.4MB in the beginning and 31.1MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-22 01:39:32,817 INFO L158 Benchmark]: RCFGBuilder took 288.56ms. Allocated memory is still 56.6MB. Free memory was 31.1MB in the beginning and 34.5MB in the end (delta: -3.4MB). Peak memory consumption was 9.8MB. Max. memory is 16.1GB. [2022-07-22 01:39:32,817 INFO L158 Benchmark]: BuchiAutomizer took 5249.02ms. Allocated memory was 56.6MB in the beginning and 100.7MB in the end (delta: 44.0MB). Free memory was 34.2MB in the beginning and 46.3MB in the end (delta: -12.0MB). Peak memory consumption was 30.9MB. Max. memory is 16.1GB. [2022-07-22 01:39:32,817 INFO L158 Benchmark]: Witness Printer took 2.64ms. Allocated memory is still 100.7MB. Free memory is still 46.3MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-22 01:39:32,819 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21ms. Allocated memory is still 46.1MB. Free memory was 27.8MB in the beginning and 27.8MB in the end (delta: 32.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 379.16ms. Allocated memory is still 56.6MB. Free memory was 39.3MB in the beginning and 34.3MB in the end (delta: 5.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 44.60ms. Allocated memory is still 56.6MB. Free memory was 34.1MB in the beginning and 32.4MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 42.98ms. Allocated memory is still 56.6MB. Free memory was 32.4MB in the beginning and 31.1MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 288.56ms. Allocated memory is still 56.6MB. Free memory was 31.1MB in the beginning and 34.5MB in the end (delta: -3.4MB). Peak memory consumption was 9.8MB. Max. memory is 16.1GB. * BuchiAutomizer took 5249.02ms. Allocated memory was 56.6MB in the beginning and 100.7MB in the end (delta: 44.0MB). Free memory was 34.2MB in the beginning and 46.3MB in the end (delta: -12.0MB). Peak memory consumption was 30.9MB. Max. memory is 16.1GB. * Witness Printer took 2.64ms. Allocated memory is still 100.7MB. Free memory is still 46.3MB. There was no memory consumed. 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 5 terminating modules (3 trivial, 1 deterministic, 1 nondeterministic). One deterministic module has affine ranking function unknown-#length-unknown[a] + -2 * i and consists of 6 locations. One nondeterministic module has affine ranking function j and consists of 5 locations. 3 modules have a trivial ranking function, the largest among these consists of 6 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 5.2s and 6 iterations. TraceHistogramMax:2. Analysis of lassos took 4.1s. Construction of modules took 0.1s. Büchi inclusion checks took 0.7s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 17 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [1, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 102 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 99 mSDsluCounter, 126 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 51 mSDsCounter, 40 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 169 IncrementalHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 40 mSolverCounterUnsat, 75 mSDtfsCounter, 169 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc2 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital176 mio100 ax110 hnf100 lsp87 ukn69 mio100 lsp61 div100 bol100 ite100 ukn100 eq179 hnf90 smp100 dnf100 smp100 tf100 neg100 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 37ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2022-07-22 01:39:32,852 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-07-22 01:39:33,066 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