./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/loop-invgen/heapsort.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version f4b24e32 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/loop-invgen/heapsort.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8e7c8e5dc2a9e8f11b25d1bb9948f05f37b9553e3dc9f8bd8213088dea43cb37 --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-14 15:40:56,405 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-14 15:40:56,410 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-14 15:40:56,440 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-14 15:40:56,441 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-14 15:40:56,443 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-14 15:40:56,446 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-14 15:40:56,450 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-14 15:40:56,451 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-14 15:40:56,454 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-14 15:40:56,455 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-14 15:40:56,457 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-14 15:40:56,457 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-14 15:40:56,458 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-14 15:40:56,460 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-14 15:40:56,461 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-14 15:40:56,462 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-14 15:40:56,463 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-14 15:40:56,465 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-14 15:40:56,466 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-14 15:40:56,469 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-14 15:40:56,470 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-14 15:40:56,470 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-14 15:40:56,471 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-14 15:40:56,472 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-14 15:40:56,476 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-14 15:40:56,478 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-14 15:40:56,479 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-14 15:40:56,480 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-14 15:40:56,480 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-14 15:40:56,481 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-14 15:40:56,481 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-14 15:40:56,482 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-14 15:40:56,483 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-14 15:40:56,484 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-14 15:40:56,485 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-14 15:40:56,485 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-14 15:40:56,485 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-14 15:40:56,485 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-14 15:40:56,486 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-14 15:40:56,486 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-14 15:40:56,488 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-14 15:40:56,489 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2022-07-14 15:40:56,512 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-14 15:40:56,513 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-14 15:40:56,513 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-14 15:40:56,513 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-14 15:40:56,514 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-14 15:40:56,514 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-14 15:40:56,514 INFO L138 SettingsManager]: * Use SBE=true [2022-07-14 15:40:56,515 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-07-14 15:40:56,515 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-07-14 15:40:56,515 INFO L138 SettingsManager]: * Use old map elimination=false [2022-07-14 15:40:56,516 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-07-14 15:40:56,516 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-07-14 15:40:56,516 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-07-14 15:40:56,516 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-14 15:40:56,516 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-14 15:40:56,516 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-14 15:40:56,516 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-14 15:40:56,517 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-14 15:40:56,517 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-14 15:40:56,517 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-07-14 15:40:56,517 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-07-14 15:40:56,517 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-07-14 15:40:56,517 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-14 15:40:56,517 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-14 15:40:56,518 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-07-14 15:40:56,518 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-14 15:40:56,518 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-07-14 15:40:56,518 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-14 15:40:56,518 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-14 15:40:56,519 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-14 15:40:56,519 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-14 15:40:56,520 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-07-14 15:40:56,520 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8e7c8e5dc2a9e8f11b25d1bb9948f05f37b9553e3dc9f8bd8213088dea43cb37 [2022-07-14 15:40:56,727 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-14 15:40:56,751 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-14 15:40:56,753 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-14 15:40:56,754 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-14 15:40:56,754 INFO L275 PluginConnector]: CDTParser initialized [2022-07-14 15:40:56,755 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-invgen/heapsort.i [2022-07-14 15:40:56,799 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/98d6a0ec4/2083fef7e78645039e9b94c88fb19272/FLAG553528288 [2022-07-14 15:40:57,164 INFO L306 CDTParser]: Found 1 translation units. [2022-07-14 15:40:57,165 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/heapsort.i [2022-07-14 15:40:57,176 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/98d6a0ec4/2083fef7e78645039e9b94c88fb19272/FLAG553528288 [2022-07-14 15:40:57,187 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/98d6a0ec4/2083fef7e78645039e9b94c88fb19272 [2022-07-14 15:40:57,189 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-14 15:40:57,190 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-14 15:40:57,193 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-14 15:40:57,193 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-14 15:40:57,195 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-14 15:40:57,196 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 03:40:57" (1/1) ... [2022-07-14 15:40:57,196 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c8e49b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:40:57, skipping insertion in model container [2022-07-14 15:40:57,196 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 03:40:57" (1/1) ... [2022-07-14 15:40:57,201 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-14 15:40:57,215 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-14 15:40:57,354 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/heapsort.i[893,906] [2022-07-14 15:40:57,372 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 15:40:57,377 INFO L203 MainTranslator]: Completed pre-run [2022-07-14 15:40:57,385 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/heapsort.i[893,906] [2022-07-14 15:40:57,390 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 15:40:57,400 INFO L208 MainTranslator]: Completed translation [2022-07-14 15:40:57,401 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:40:57 WrapperNode [2022-07-14 15:40:57,401 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-14 15:40:57,402 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-14 15:40:57,402 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-14 15:40:57,402 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-14 15:40:57,407 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:40:57" (1/1) ... [2022-07-14 15:40:57,411 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:40:57" (1/1) ... [2022-07-14 15:40:57,425 INFO L137 Inliner]: procedures = 16, calls = 20, calls flagged for inlining = 16, calls inlined = 16, statements flattened = 158 [2022-07-14 15:40:57,425 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-14 15:40:57,426 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-14 15:40:57,426 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-14 15:40:57,426 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-14 15:40:57,431 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:40:57" (1/1) ... [2022-07-14 15:40:57,431 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:40:57" (1/1) ... [2022-07-14 15:40:57,432 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:40:57" (1/1) ... [2022-07-14 15:40:57,433 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:40:57" (1/1) ... [2022-07-14 15:40:57,435 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:40:57" (1/1) ... [2022-07-14 15:40:57,438 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:40:57" (1/1) ... [2022-07-14 15:40:57,438 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:40:57" (1/1) ... [2022-07-14 15:40:57,440 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-14 15:40:57,441 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-14 15:40:57,441 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-14 15:40:57,441 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-14 15:40:57,442 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:40:57" (1/1) ... [2022-07-14 15:40:57,461 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:40:57,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:40:57,478 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-14 15:40:57,494 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-14 15:40:57,520 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-14 15:40:57,520 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-14 15:40:57,520 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-14 15:40:57,521 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-14 15:40:57,563 INFO L234 CfgBuilder]: Building ICFG [2022-07-14 15:40:57,564 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-14 15:40:57,766 INFO L275 CfgBuilder]: Performing block encoding [2022-07-14 15:40:57,774 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-14 15:40:57,775 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-07-14 15:40:57,776 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 03:40:57 BoogieIcfgContainer [2022-07-14 15:40:57,776 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-14 15:40:57,777 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-07-14 15:40:57,777 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-07-14 15:40:57,785 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-07-14 15:40:57,786 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-14 15:40:57,786 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.07 03:40:57" (1/3) ... [2022-07-14 15:40:57,787 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3fd47f11 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.07 03:40:57, skipping insertion in model container [2022-07-14 15:40:57,787 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-14 15:40:57,787 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:40:57" (2/3) ... [2022-07-14 15:40:57,787 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3fd47f11 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.07 03:40:57, skipping insertion in model container [2022-07-14 15:40:57,787 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-14 15:40:57,787 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 03:40:57" (3/3) ... [2022-07-14 15:40:57,788 INFO L354 chiAutomizerObserver]: Analyzing ICFG heapsort.i [2022-07-14 15:40:57,839 INFO L255 stractBuchiCegarLoop]: Interprodecural is true [2022-07-14 15:40:57,839 INFO L256 stractBuchiCegarLoop]: Hoare is false [2022-07-14 15:40:57,839 INFO L257 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-07-14 15:40:57,839 INFO L258 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-07-14 15:40:57,840 INFO L259 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-07-14 15:40:57,840 INFO L260 stractBuchiCegarLoop]: Difference is false [2022-07-14 15:40:57,840 INFO L261 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-07-14 15:40:57,841 INFO L265 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-07-14 15:40:57,845 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 57 states, 56 states have (on average 1.4285714285714286) internal successors, (80), 56 states have internal predecessors, (80), 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-14 15:40:57,871 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 49 [2022-07-14 15:40:57,871 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 15:40:57,871 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 15:40:57,877 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2022-07-14 15:40:57,877 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-14 15:40:57,877 INFO L287 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-07-14 15:40:57,877 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 57 states, 56 states have (on average 1.4285714285714286) internal successors, (80), 56 states have internal predecessors, (80), 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-14 15:40:57,883 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 49 [2022-07-14 15:40:57,884 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 15:40:57,884 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 15:40:57,884 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2022-07-14 15:40:57,885 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-14 15:40:57,889 INFO L752 eck$LassoCheckResult]: Stem: 49#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); 37#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;main_#in~argc#1, main_#in~argv#1.base, main_#in~argv#1.offset := #in~argc#1, #in~argv#1.base, #in~argv#1.offset;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~post2#1, main_#t~post3#1, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~post6#1, main_#t~post7#1, main_~argc#1, main_~argv#1.base, main_~argv#1.offset, main_~n~0#1, main_~l~0#1, main_~r~0#1, main_~i~0#1, main_~j~0#1;main_~argc#1 := main_#in~argc#1;main_~argv#1.base, main_~argv#1.offset := main_#in~argv#1.base, main_#in~argv#1.offset;havoc main_~n~0#1;havoc main_~l~0#1;havoc main_~r~0#1;havoc main_~i~0#1;havoc main_~j~0#1;main_~n~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1; 18#L27true assume !!(1 <= main_~n~0#1 && main_~n~0#1 <= 1000000);main_~l~0#1 := 1 + (if main_~n~0#1 < 0 && 0 != main_~n~0#1 % 2 then 1 + main_~n~0#1 / 2 else main_~n~0#1 / 2);main_~r~0#1 := main_~n~0#1; 3#L30true assume !(main_~l~0#1 > 1);main_#t~post3#1 := main_~r~0#1;main_~r~0#1 := main_#t~post3#1 - 1;havoc main_#t~post3#1; 15#L59-1true [2022-07-14 15:40:57,890 INFO L754 eck$LassoCheckResult]: Loop: 15#L59-1true assume !!(main_~r~0#1 > 1);main_~i~0#1 := main_~l~0#1;main_~j~0#1 := 2 * main_~l~0#1; 50#L38-2true assume !true; 34#L38-3true assume main_~l~0#1 > 1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 1 <= main_~l~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 14#L18-30true assume !(0 == __VERIFIER_assert_~cond#1); 19#L18-32true assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~l~0#1 <= main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 32#L18-33true assume !(0 == __VERIFIER_assert_~cond#1); 13#L18-35true assume { :end_inline___VERIFIER_assert } true;main_#t~post6#1 := main_~l~0#1;main_~l~0#1 := main_#t~post6#1 - 1;havoc main_#t~post6#1; 15#L59-1true [2022-07-14 15:40:57,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:40:57,898 INFO L85 PathProgramCache]: Analyzing trace with hash 925672, now seen corresponding path program 1 times [2022-07-14 15:40:57,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:40:57,905 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423136701] [2022-07-14 15:40:57,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:40:57,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:40:57,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:40:57,993 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:40:58,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:40:58,032 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:40:58,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:40:58,035 INFO L85 PathProgramCache]: Analyzing trace with hash -947861826, now seen corresponding path program 1 times [2022-07-14 15:40:58,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:40:58,036 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492653343] [2022-07-14 15:40:58,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:40:58,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:40:58,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:40:58,067 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-14 15:40:58,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 15:40:58,068 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492653343] [2022-07-14 15:40:58,068 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1492653343] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 15:40:58,068 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 15:40:58,068 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-14 15:40:58,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703230271] [2022-07-14 15:40:58,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 15:40:58,072 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-14 15:40:58,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 15:40:58,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-14 15:40:58,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-14 15:40:58,100 INFO L87 Difference]: Start difference. First operand has 57 states, 56 states have (on average 1.4285714285714286) internal successors, (80), 56 states have internal predecessors, (80), 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 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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-14 15:40:58,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 15:40:58,111 INFO L93 Difference]: Finished difference Result 57 states and 64 transitions. [2022-07-14 15:40:58,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-14 15:40:58,117 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 57 states and 64 transitions. [2022-07-14 15:40:58,122 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 35 [2022-07-14 15:40:58,127 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 57 states to 39 states and 45 transitions. [2022-07-14 15:40:58,128 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 39 [2022-07-14 15:40:58,129 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 39 [2022-07-14 15:40:58,129 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 45 transitions. [2022-07-14 15:40:58,130 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-14 15:40:58,130 INFO L369 hiAutomatonCegarLoop]: Abstraction has 39 states and 45 transitions. [2022-07-14 15:40:58,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 45 transitions. [2022-07-14 15:40:58,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2022-07-14 15:40:58,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 39 states have (on average 1.1538461538461537) internal successors, (45), 38 states have internal predecessors, (45), 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-14 15:40:58,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 45 transitions. [2022-07-14 15:40:58,152 INFO L392 hiAutomatonCegarLoop]: Abstraction has 39 states and 45 transitions. [2022-07-14 15:40:58,153 INFO L374 stractBuchiCegarLoop]: Abstraction has 39 states and 45 transitions. [2022-07-14 15:40:58,153 INFO L287 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-07-14 15:40:58,153 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 45 transitions. [2022-07-14 15:40:58,154 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 35 [2022-07-14 15:40:58,155 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 15:40:58,155 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 15:40:58,155 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2022-07-14 15:40:58,155 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-14 15:40:58,156 INFO L752 eck$LassoCheckResult]: Stem: 155#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); 135#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;main_#in~argc#1, main_#in~argv#1.base, main_#in~argv#1.offset := #in~argc#1, #in~argv#1.base, #in~argv#1.offset;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~post2#1, main_#t~post3#1, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~post6#1, main_#t~post7#1, main_~argc#1, main_~argv#1.base, main_~argv#1.offset, main_~n~0#1, main_~l~0#1, main_~r~0#1, main_~i~0#1, main_~j~0#1;main_~argc#1 := main_#in~argc#1;main_~argv#1.base, main_~argv#1.offset := main_#in~argv#1.base, main_#in~argv#1.offset;havoc main_~n~0#1;havoc main_~l~0#1;havoc main_~r~0#1;havoc main_~i~0#1;havoc main_~j~0#1;main_~n~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1; 136#L27 assume !!(1 <= main_~n~0#1 && main_~n~0#1 <= 1000000);main_~l~0#1 := 1 + (if main_~n~0#1 < 0 && 0 != main_~n~0#1 % 2 then 1 + main_~n~0#1 / 2 else main_~n~0#1 / 2);main_~r~0#1 := main_~n~0#1; 124#L30 assume !(main_~l~0#1 > 1);main_#t~post3#1 := main_~r~0#1;main_~r~0#1 := main_#t~post3#1 - 1;havoc main_#t~post3#1; 125#L59-1 [2022-07-14 15:40:58,156 INFO L754 eck$LassoCheckResult]: Loop: 125#L59-1 assume !!(main_~r~0#1 > 1);main_~i~0#1 := main_~l~0#1;main_~j~0#1 := 2 * main_~l~0#1; 145#L38-2 assume !(main_~j~0#1 <= main_~r~0#1); 126#L38-3 assume main_~l~0#1 > 1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 1 <= main_~l~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 128#L18-30 assume !(0 == __VERIFIER_assert_~cond#1); 142#L18-32 assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~l~0#1 <= main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 122#L18-33 assume !(0 == __VERIFIER_assert_~cond#1); 123#L18-35 assume { :end_inline___VERIFIER_assert } true;main_#t~post6#1 := main_~l~0#1;main_~l~0#1 := main_#t~post6#1 - 1;havoc main_#t~post6#1; 125#L59-1 [2022-07-14 15:40:58,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:40:58,158 INFO L85 PathProgramCache]: Analyzing trace with hash 925672, now seen corresponding path program 2 times [2022-07-14 15:40:58,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:40:58,159 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906384858] [2022-07-14 15:40:58,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:40:58,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:40:58,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:40:58,172 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:40:58,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:40:58,188 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:40:58,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:40:58,189 INFO L85 PathProgramCache]: Analyzing trace with hash -145650952, now seen corresponding path program 1 times [2022-07-14 15:40:58,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:40:58,190 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487699835] [2022-07-14 15:40:58,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:40:58,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:40:58,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:40:58,205 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:40:58,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:40:58,221 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:40:58,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:40:58,221 INFO L85 PathProgramCache]: Analyzing trace with hash 1814169905, now seen corresponding path program 1 times [2022-07-14 15:40:58,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:40:58,222 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777738467] [2022-07-14 15:40:58,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:40:58,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:40:58,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:40:58,272 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-14 15:40:58,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 15:40:58,273 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777738467] [2022-07-14 15:40:58,273 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1777738467] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 15:40:58,273 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 15:40:58,274 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 15:40:58,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652184218] [2022-07-14 15:40:58,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 15:40:58,431 INFO L210 LassoAnalysis]: Preferences: [2022-07-14 15:40:58,432 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-14 15:40:58,432 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-14 15:40:58,432 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-14 15:40:58,432 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-07-14 15:40:58,432 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:40:58,432 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-14 15:40:58,432 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-14 15:40:58,432 INFO L133 ssoRankerPreferences]: Filename of dumped script: heapsort.i_Iteration2_Loop [2022-07-14 15:40:58,433 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-14 15:40:58,433 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-14 15:40:58,460 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-14 15:40:58,476 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-14 15:40:58,479 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-14 15:40:58,532 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-14 15:40:58,532 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-07-14 15:40:58,534 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:40:58,535 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:40:58,552 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-14 15:40:58,553 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-14 15:40:58,555 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-14 15:40:58,555 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-14 15:40:58,598 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-14 15:40:58,598 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:40:58,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:40:58,599 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-14 15:40:58,614 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-07-14 15:40:58,614 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-14 15:40:58,631 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-14 15:40:58,808 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-07-14 15:40:58,814 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-14 15:40:58,815 INFO L210 LassoAnalysis]: Preferences: [2022-07-14 15:40:58,815 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-14 15:40:58,815 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-14 15:40:58,815 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-14 15:40:58,815 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-14 15:40:58,815 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:40:58,815 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-14 15:40:58,815 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-14 15:40:58,815 INFO L133 ssoRankerPreferences]: Filename of dumped script: heapsort.i_Iteration2_Loop [2022-07-14 15:40:58,815 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-14 15:40:58,815 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-14 15:40:58,816 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-14 15:40:58,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-14 15:40:58,836 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-14 15:40:58,884 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-14 15:40:58,888 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-14 15:40:58,889 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:40:58,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:40:58,890 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-14 15:40:58,902 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-14 15:40:58,908 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:40:58,908 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:40:58,909 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:40:58,909 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:40:58,909 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:40:58,912 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 15:40:58,912 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:40:58,916 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-14 15:40:58,931 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:40:58,949 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-14 15:40:58,949 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:40:58,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:40:58,951 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-14 15:40:58,966 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-14 15:40:58,972 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:40:58,972 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:40:58,972 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:40:58,972 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:40:58,972 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:40:58,976 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 15:40:58,976 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:40:58,981 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-14 15:40:58,989 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-14 15:40:58,995 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-07-14 15:40:58,995 INFO L444 ModelExtractionUtils]: 4 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. [2022-07-14 15:40:58,996 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:40:58,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:40:58,997 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-14 15:40:59,013 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-14 15:40:59,013 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-07-14 15:40:59,013 INFO L513 LassoAnalysis]: Proved termination. [2022-07-14 15:40:59,013 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~l~0#1) = 1*ULTIMATE.start_main_~l~0#1 Supporting invariants [] [2022-07-14 15:40:59,028 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-14 15:40:59,030 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-14 15:40:59,031 INFO L293 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-07-14 15:40:59,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:40:59,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:40:59,061 INFO L263 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-14 15:40:59,062 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 15:40:59,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:40:59,077 INFO L263 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-14 15:40:59,079 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 15:40:59,098 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-14 15:40:59,100 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2022-07-14 15:40:59,101 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 39 states and 45 transitions. cyclomatic complexity: 7 Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 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-14 15:40:59,132 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 39 states and 45 transitions. cyclomatic complexity: 7. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 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) Result 112 states and 130 transitions. Complement of second has 6 states. [2022-07-14 15:40:59,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2022-07-14 15:40:59,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 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-14 15:40:59,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 86 transitions. [2022-07-14 15:40:59,136 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 86 transitions. Stem has 4 letters. Loop has 7 letters. [2022-07-14 15:40:59,136 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 15:40:59,136 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 86 transitions. Stem has 11 letters. Loop has 7 letters. [2022-07-14 15:40:59,137 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 15:40:59,137 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 86 transitions. Stem has 4 letters. Loop has 14 letters. [2022-07-14 15:40:59,137 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 15:40:59,137 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 112 states and 130 transitions. [2022-07-14 15:40:59,138 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 66 [2022-07-14 15:40:59,139 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 112 states to 108 states and 126 transitions. [2022-07-14 15:40:59,139 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 71 [2022-07-14 15:40:59,140 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 72 [2022-07-14 15:40:59,140 INFO L73 IsDeterministic]: Start isDeterministic. Operand 108 states and 126 transitions. [2022-07-14 15:40:59,140 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-14 15:40:59,140 INFO L369 hiAutomatonCegarLoop]: Abstraction has 108 states and 126 transitions. [2022-07-14 15:40:59,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states and 126 transitions. [2022-07-14 15:40:59,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 107. [2022-07-14 15:40:59,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 107 states have (on average 1.158878504672897) internal successors, (124), 106 states have internal predecessors, (124), 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-14 15:40:59,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 124 transitions. [2022-07-14 15:40:59,144 INFO L392 hiAutomatonCegarLoop]: Abstraction has 107 states and 124 transitions. [2022-07-14 15:40:59,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 15:40:59,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 15:40:59,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 15:40:59,145 INFO L87 Difference]: Start difference. First operand 107 states and 124 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 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-14 15:40:59,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 15:40:59,157 INFO L93 Difference]: Finished difference Result 129 states and 148 transitions. [2022-07-14 15:40:59,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 15:40:59,158 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 129 states and 148 transitions. [2022-07-14 15:40:59,159 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 93 [2022-07-14 15:40:59,160 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 129 states to 98 states and 112 transitions. [2022-07-14 15:40:59,160 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 98 [2022-07-14 15:40:59,160 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 98 [2022-07-14 15:40:59,160 INFO L73 IsDeterministic]: Start isDeterministic. Operand 98 states and 112 transitions. [2022-07-14 15:40:59,161 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-14 15:40:59,161 INFO L369 hiAutomatonCegarLoop]: Abstraction has 98 states and 112 transitions. [2022-07-14 15:40:59,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states and 112 transitions. [2022-07-14 15:40:59,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 66. [2022-07-14 15:40:59,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 66 states have (on average 1.1515151515151516) internal successors, (76), 65 states have internal predecessors, (76), 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-14 15:40:59,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 76 transitions. [2022-07-14 15:40:59,164 INFO L392 hiAutomatonCegarLoop]: Abstraction has 66 states and 76 transitions. [2022-07-14 15:40:59,164 INFO L374 stractBuchiCegarLoop]: Abstraction has 66 states and 76 transitions. [2022-07-14 15:40:59,164 INFO L287 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-07-14 15:40:59,164 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 66 states and 76 transitions. [2022-07-14 15:40:59,165 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 62 [2022-07-14 15:40:59,165 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 15:40:59,165 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 15:40:59,165 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2022-07-14 15:40:59,165 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-14 15:40:59,165 INFO L752 eck$LassoCheckResult]: Stem: 600#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); 579#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;main_#in~argc#1, main_#in~argv#1.base, main_#in~argv#1.offset := #in~argc#1, #in~argv#1.base, #in~argv#1.offset;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~post2#1, main_#t~post3#1, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~post6#1, main_#t~post7#1, main_~argc#1, main_~argv#1.base, main_~argv#1.offset, main_~n~0#1, main_~l~0#1, main_~r~0#1, main_~i~0#1, main_~j~0#1;main_~argc#1 := main_#in~argc#1;main_~argv#1.base, main_~argv#1.offset := main_#in~argv#1.base, main_#in~argv#1.offset;havoc main_~n~0#1;havoc main_~l~0#1;havoc main_~r~0#1;havoc main_~i~0#1;havoc main_~j~0#1;main_~n~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1; 580#L27 assume !!(1 <= main_~n~0#1 && main_~n~0#1 <= 1000000);main_~l~0#1 := 1 + (if main_~n~0#1 < 0 && 0 != main_~n~0#1 % 2 then 1 + main_~n~0#1 / 2 else main_~n~0#1 / 2);main_~r~0#1 := main_~n~0#1; 568#L30 assume main_~l~0#1 > 1;main_#t~post2#1 := main_~l~0#1;main_~l~0#1 := main_#t~post2#1 - 1;havoc main_#t~post2#1; 569#L59-1 [2022-07-14 15:40:59,166 INFO L754 eck$LassoCheckResult]: Loop: 569#L59-1 assume !!(main_~r~0#1 > 1);main_~i~0#1 := main_~l~0#1;main_~j~0#1 := 2 * main_~l~0#1; 609#L38-2 assume !(main_~j~0#1 <= main_~r~0#1); 606#L38-3 assume main_~l~0#1 > 1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 1 <= main_~l~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 586#L18-30 assume !(0 == __VERIFIER_assert_~cond#1); 587#L18-32 assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~l~0#1 <= main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 566#L18-33 assume !(0 == __VERIFIER_assert_~cond#1); 567#L18-35 assume { :end_inline___VERIFIER_assert } true;main_#t~post6#1 := main_~l~0#1;main_~l~0#1 := main_#t~post6#1 - 1;havoc main_#t~post6#1; 569#L59-1 [2022-07-14 15:40:59,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:40:59,166 INFO L85 PathProgramCache]: Analyzing trace with hash 925670, now seen corresponding path program 1 times [2022-07-14 15:40:59,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:40:59,166 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830038789] [2022-07-14 15:40:59,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:40:59,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:40:59,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:40:59,173 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:40:59,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:40:59,179 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:40:59,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:40:59,179 INFO L85 PathProgramCache]: Analyzing trace with hash -145650952, now seen corresponding path program 2 times [2022-07-14 15:40:59,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:40:59,180 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279723548] [2022-07-14 15:40:59,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:40:59,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:40:59,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:40:59,184 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:40:59,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:40:59,189 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:40:59,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:40:59,190 INFO L85 PathProgramCache]: Analyzing trace with hash -1671450765, now seen corresponding path program 1 times [2022-07-14 15:40:59,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:40:59,190 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051666249] [2022-07-14 15:40:59,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:40:59,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:40:59,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:40:59,217 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-14 15:40:59,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 15:40:59,217 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051666249] [2022-07-14 15:40:59,217 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051666249] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 15:40:59,218 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 15:40:59,218 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-14 15:40:59,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140332019] [2022-07-14 15:40:59,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 15:40:59,282 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-14 15:40:59,325 INFO L210 LassoAnalysis]: Preferences: [2022-07-14 15:40:59,325 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-14 15:40:59,325 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-14 15:40:59,325 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-14 15:40:59,325 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-07-14 15:40:59,325 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:40:59,325 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-14 15:40:59,326 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-14 15:40:59,326 INFO L133 ssoRankerPreferences]: Filename of dumped script: heapsort.i_Iteration3_Loop [2022-07-14 15:40:59,326 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-14 15:40:59,326 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-14 15:40:59,327 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-14 15:40:59,328 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-14 15:40:59,331 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-14 15:40:59,378 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-14 15:40:59,379 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-07-14 15:40:59,379 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:40:59,379 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:40:59,380 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-14 15:40:59,396 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-14 15:40:59,396 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-14 15:40:59,396 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-14 15:40:59,418 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-14 15:40:59,418 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post6#1=0} Honda state: {ULTIMATE.start_main_#t~post6#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-14 15:40:59,435 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-14 15:40:59,436 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:40:59,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:40:59,437 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-14 15:40:59,452 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-14 15:40:59,467 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-14 15:40:59,467 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-14 15:40:59,480 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-14 15:40:59,480 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start___VERIFIER_assert_~cond#1=1, ULTIMATE.start___VERIFIER_assert_#in~cond#1=1} Honda state: {ULTIMATE.start___VERIFIER_assert_~cond#1=1, ULTIMATE.start___VERIFIER_assert_#in~cond#1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-14 15:40:59,498 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-14 15:40:59,498 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:40:59,499 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:40:59,500 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-14 15:40:59,502 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-14 15:40:59,502 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-14 15:40:59,503 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-14 15:40:59,532 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-14 15:40:59,533 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:40:59,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:40:59,534 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-14 15:40:59,535 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-14 15:40:59,536 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-07-14 15:40:59,536 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-14 15:40:59,726 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-07-14 15:40:59,730 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-14 15:40:59,730 INFO L210 LassoAnalysis]: Preferences: [2022-07-14 15:40:59,731 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-14 15:40:59,731 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-14 15:40:59,731 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-14 15:40:59,731 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-14 15:40:59,731 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:40:59,731 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-14 15:40:59,731 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-14 15:40:59,731 INFO L133 ssoRankerPreferences]: Filename of dumped script: heapsort.i_Iteration3_Loop [2022-07-14 15:40:59,731 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-14 15:40:59,731 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-14 15:40:59,732 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-14 15:40:59,734 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-14 15:40:59,743 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-14 15:40:59,785 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-14 15:40:59,785 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-14 15:40:59,786 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:40:59,786 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:40:59,820 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-14 15:40:59,822 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-14 15:40:59,823 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-14 15:40:59,829 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:40:59,829 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:40:59,829 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:40:59,829 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:40:59,829 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:40:59,830 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 15:40:59,830 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:40:59,847 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:40:59,863 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-14 15:40:59,863 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:40:59,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:40:59,865 INFO L229 MonitoredProcess]: Starting monitored process 12 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-14 15:40:59,879 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2022-07-14 15:40:59,880 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-14 15:40:59,886 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:40:59,886 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:40:59,886 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:40:59,887 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:40:59,887 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:40:59,888 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 15:40:59,888 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:40:59,898 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-14 15:40:59,906 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-07-14 15:40:59,906 INFO L444 ModelExtractionUtils]: 4 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. [2022-07-14 15:40:59,906 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:40:59,906 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:40:59,908 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-14 15:40:59,909 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-14 15:40:59,947 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-14 15:40:59,948 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-07-14 15:40:59,948 INFO L513 LassoAnalysis]: Proved termination. [2022-07-14 15:40:59,948 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~l~0#1) = 1*ULTIMATE.start_main_~l~0#1 Supporting invariants [] [2022-07-14 15:40:59,966 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2022-07-14 15:40:59,967 INFO L293 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-07-14 15:40:59,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:40:59,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:40:59,996 INFO L263 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-14 15:40:59,997 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 15:41:00,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:41:00,014 INFO L263 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-14 15:41:00,014 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 15:41:00,034 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-14 15:41:00,035 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2022-07-14 15:41:00,035 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 66 states and 76 transitions. cyclomatic complexity: 12 Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 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-14 15:41:00,061 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 66 states and 76 transitions. cyclomatic complexity: 12. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 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) Result 160 states and 185 transitions. Complement of second has 6 states. [2022-07-14 15:41:00,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2022-07-14 15:41:00,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 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-14 15:41:00,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 81 transitions. [2022-07-14 15:41:00,063 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 81 transitions. Stem has 4 letters. Loop has 7 letters. [2022-07-14 15:41:00,063 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 15:41:00,063 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 81 transitions. Stem has 11 letters. Loop has 7 letters. [2022-07-14 15:41:00,063 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 15:41:00,063 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 81 transitions. Stem has 4 letters. Loop has 14 letters. [2022-07-14 15:41:00,063 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 15:41:00,063 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 160 states and 185 transitions. [2022-07-14 15:41:00,065 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 87 [2022-07-14 15:41:00,065 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 160 states to 125 states and 145 transitions. [2022-07-14 15:41:00,065 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 93 [2022-07-14 15:41:00,066 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 94 [2022-07-14 15:41:00,066 INFO L73 IsDeterministic]: Start isDeterministic. Operand 125 states and 145 transitions. [2022-07-14 15:41:00,066 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-14 15:41:00,066 INFO L369 hiAutomatonCegarLoop]: Abstraction has 125 states and 145 transitions. [2022-07-14 15:41:00,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states and 145 transitions. [2022-07-14 15:41:00,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 67. [2022-07-14 15:41:00,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 67 states have (on average 1.164179104477612) internal successors, (78), 66 states have internal predecessors, (78), 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-14 15:41:00,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 78 transitions. [2022-07-14 15:41:00,069 INFO L392 hiAutomatonCegarLoop]: Abstraction has 67 states and 78 transitions. [2022-07-14 15:41:00,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 15:41:00,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 15:41:00,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-14 15:41:00,070 INFO L87 Difference]: Start difference. First operand 67 states and 78 transitions. 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-14 15:41:00,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 15:41:00,155 INFO L93 Difference]: Finished difference Result 207 states and 231 transitions. [2022-07-14 15:41:00,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 15:41:00,155 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 207 states and 231 transitions. [2022-07-14 15:41:00,156 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 128 [2022-07-14 15:41:00,157 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 207 states to 207 states and 231 transitions. [2022-07-14 15:41:00,158 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 155 [2022-07-14 15:41:00,159 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 155 [2022-07-14 15:41:00,159 INFO L73 IsDeterministic]: Start isDeterministic. Operand 207 states and 231 transitions. [2022-07-14 15:41:00,162 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-14 15:41:00,162 INFO L369 hiAutomatonCegarLoop]: Abstraction has 207 states and 231 transitions. [2022-07-14 15:41:00,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states and 231 transitions. [2022-07-14 15:41:00,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 69. [2022-07-14 15:41:00,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 69 states have (on average 1.1594202898550725) internal successors, (80), 68 states have internal predecessors, (80), 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-14 15:41:00,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 80 transitions. [2022-07-14 15:41:00,173 INFO L392 hiAutomatonCegarLoop]: Abstraction has 69 states and 80 transitions. [2022-07-14 15:41:00,173 INFO L374 stractBuchiCegarLoop]: Abstraction has 69 states and 80 transitions. [2022-07-14 15:41:00,173 INFO L287 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-07-14 15:41:00,173 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 69 states and 80 transitions. [2022-07-14 15:41:00,173 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 31 [2022-07-14 15:41:00,174 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 15:41:00,174 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 15:41:00,174 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2022-07-14 15:41:00,174 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-14 15:41:00,174 INFO L752 eck$LassoCheckResult]: Stem: 1186#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); 1149#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;main_#in~argc#1, main_#in~argv#1.base, main_#in~argv#1.offset := #in~argc#1, #in~argv#1.base, #in~argv#1.offset;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~post2#1, main_#t~post3#1, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~post6#1, main_#t~post7#1, main_~argc#1, main_~argv#1.base, main_~argv#1.offset, main_~n~0#1, main_~l~0#1, main_~r~0#1, main_~i~0#1, main_~j~0#1;main_~argc#1 := main_#in~argc#1;main_~argv#1.base, main_~argv#1.offset := main_#in~argv#1.base, main_#in~argv#1.offset;havoc main_~n~0#1;havoc main_~l~0#1;havoc main_~r~0#1;havoc main_~i~0#1;havoc main_~j~0#1;main_~n~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1; 1150#L27 assume !!(1 <= main_~n~0#1 && main_~n~0#1 <= 1000000);main_~l~0#1 := 1 + (if main_~n~0#1 < 0 && 0 != main_~n~0#1 % 2 then 1 + main_~n~0#1 / 2 else main_~n~0#1 / 2);main_~r~0#1 := main_~n~0#1; 1131#L30 assume !(main_~l~0#1 > 1);main_#t~post3#1 := main_~r~0#1;main_~r~0#1 := main_#t~post3#1 - 1;havoc main_#t~post3#1; 1133#L59-1 [2022-07-14 15:41:00,174 INFO L754 eck$LassoCheckResult]: Loop: 1133#L59-1 assume !!(main_~r~0#1 > 1);main_~i~0#1 := main_~l~0#1;main_~j~0#1 := 2 * main_~l~0#1; 1169#L38-2 assume !(main_~j~0#1 <= main_~r~0#1); 1134#L38-3 assume !(main_~l~0#1 > 1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 1 <= main_~r~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1135#L18-36 assume !(0 == __VERIFIER_assert_~cond#1); 1146#L18-38 assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~r~0#1 <= main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1147#L18-39 assume !(0 == __VERIFIER_assert_~cond#1); 1148#L18-41 assume { :end_inline___VERIFIER_assert } true;main_#t~post7#1 := main_~r~0#1;main_~r~0#1 := main_#t~post7#1 - 1;havoc main_#t~post7#1; 1133#L59-1 [2022-07-14 15:41:00,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:41:00,177 INFO L85 PathProgramCache]: Analyzing trace with hash 925672, now seen corresponding path program 3 times [2022-07-14 15:41:00,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:41:00,177 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182724543] [2022-07-14 15:41:00,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:41:00,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:41:00,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:41:00,192 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:41:00,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:41:00,202 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:41:00,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:41:00,206 INFO L85 PathProgramCache]: Analyzing trace with hash -124656242, now seen corresponding path program 1 times [2022-07-14 15:41:00,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:41:00,206 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837596514] [2022-07-14 15:41:00,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:41:00,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:41:00,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:41:00,231 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-14 15:41:00,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 15:41:00,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837596514] [2022-07-14 15:41:00,232 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [837596514] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 15:41:00,232 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 15:41:00,232 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 15:41:00,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222872307] [2022-07-14 15:41:00,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 15:41:00,233 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-14 15:41:00,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 15:41:00,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 15:41:00,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-14 15:41:00,234 INFO L87 Difference]: Start difference. First operand 69 states and 80 transitions. cyclomatic complexity: 13 Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 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-14 15:41:00,265 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2022-07-14 15:41:00,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 15:41:00,311 INFO L93 Difference]: Finished difference Result 129 states and 146 transitions. [2022-07-14 15:41:00,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-14 15:41:00,311 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 129 states and 146 transitions. [2022-07-14 15:41:00,312 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 61 [2022-07-14 15:41:00,313 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 129 states to 128 states and 145 transitions. [2022-07-14 15:41:00,313 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 67 [2022-07-14 15:41:00,313 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 67 [2022-07-14 15:41:00,313 INFO L73 IsDeterministic]: Start isDeterministic. Operand 128 states and 145 transitions. [2022-07-14 15:41:00,313 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-14 15:41:00,313 INFO L369 hiAutomatonCegarLoop]: Abstraction has 128 states and 145 transitions. [2022-07-14 15:41:00,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states and 145 transitions. [2022-07-14 15:41:00,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 69. [2022-07-14 15:41:00,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 69 states have (on average 1.1594202898550725) internal successors, (80), 68 states have internal predecessors, (80), 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-14 15:41:00,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 80 transitions. [2022-07-14 15:41:00,315 INFO L392 hiAutomatonCegarLoop]: Abstraction has 69 states and 80 transitions. [2022-07-14 15:41:00,315 INFO L374 stractBuchiCegarLoop]: Abstraction has 69 states and 80 transitions. [2022-07-14 15:41:00,315 INFO L287 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2022-07-14 15:41:00,316 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 69 states and 80 transitions. [2022-07-14 15:41:00,316 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 32 [2022-07-14 15:41:00,316 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 15:41:00,316 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 15:41:00,316 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2022-07-14 15:41:00,316 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 15:41:00,317 INFO L752 eck$LassoCheckResult]: Stem: 1392#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); 1356#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;main_#in~argc#1, main_#in~argv#1.base, main_#in~argv#1.offset := #in~argc#1, #in~argv#1.base, #in~argv#1.offset;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~post2#1, main_#t~post3#1, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~post6#1, main_#t~post7#1, main_~argc#1, main_~argv#1.base, main_~argv#1.offset, main_~n~0#1, main_~l~0#1, main_~r~0#1, main_~i~0#1, main_~j~0#1;main_~argc#1 := main_#in~argc#1;main_~argv#1.base, main_~argv#1.offset := main_#in~argv#1.base, main_#in~argv#1.offset;havoc main_~n~0#1;havoc main_~l~0#1;havoc main_~r~0#1;havoc main_~i~0#1;havoc main_~j~0#1;main_~n~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1; 1357#L27 assume !!(1 <= main_~n~0#1 && main_~n~0#1 <= 1000000);main_~l~0#1 := 1 + (if main_~n~0#1 < 0 && 0 != main_~n~0#1 % 2 then 1 + main_~n~0#1 / 2 else main_~n~0#1 / 2);main_~r~0#1 := main_~n~0#1; 1338#L30 assume !(main_~l~0#1 > 1);main_#t~post3#1 := main_~r~0#1;main_~r~0#1 := main_#t~post3#1 - 1;havoc main_#t~post3#1; 1340#L59-1 [2022-07-14 15:41:00,317 INFO L754 eck$LassoCheckResult]: Loop: 1340#L59-1 assume !!(main_~r~0#1 > 1);main_~i~0#1 := main_~l~0#1;main_~j~0#1 := 2 * main_~l~0#1; 1376#L38-2 assume !!(main_~j~0#1 <= main_~r~0#1); 1380#L39 assume !(main_~j~0#1 < main_~r~0#1); 1350#L39-1 assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 1 <= main_~j~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1358#L18-12 assume !(0 == __VERIFIER_assert_~cond#1); 1359#L18-14 assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1393#L18-15 assume !(0 == __VERIFIER_assert_~cond#1); 1394#L18-17 assume { :end_inline___VERIFIER_assert } true; 1378#L49 assume 0 != main_#t~nondet5#1;havoc main_#t~nondet5#1; 1341#L38-3 assume !(main_~l~0#1 > 1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 1 <= main_~r~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1342#L18-36 assume !(0 == __VERIFIER_assert_~cond#1); 1353#L18-38 assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~r~0#1 <= main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1354#L18-39 assume !(0 == __VERIFIER_assert_~cond#1); 1355#L18-41 assume { :end_inline___VERIFIER_assert } true;main_#t~post7#1 := main_~r~0#1;main_~r~0#1 := main_#t~post7#1 - 1;havoc main_#t~post7#1; 1340#L59-1 [2022-07-14 15:41:00,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:41:00,317 INFO L85 PathProgramCache]: Analyzing trace with hash 925672, now seen corresponding path program 4 times [2022-07-14 15:41:00,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:41:00,318 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469881371] [2022-07-14 15:41:00,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:41:00,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:41:00,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:41:00,322 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:41:00,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:41:00,326 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:41:00,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:41:00,327 INFO L85 PathProgramCache]: Analyzing trace with hash -470789538, now seen corresponding path program 1 times [2022-07-14 15:41:00,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:41:00,327 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612526304] [2022-07-14 15:41:00,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:41:00,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:41:00,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:41:00,333 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:41:00,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:41:00,338 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:41:00,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:41:00,339 INFO L85 PathProgramCache]: Analyzing trace with hash 1515786757, now seen corresponding path program 1 times [2022-07-14 15:41:00,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:41:00,350 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645882477] [2022-07-14 15:41:00,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:41:00,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:41:00,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:41:00,385 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-14 15:41:00,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 15:41:00,385 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645882477] [2022-07-14 15:41:00,385 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1645882477] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 15:41:00,385 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 15:41:00,385 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-14 15:41:00,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099970310] [2022-07-14 15:41:00,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 15:41:00,535 INFO L210 LassoAnalysis]: Preferences: [2022-07-14 15:41:00,535 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-14 15:41:00,536 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-14 15:41:00,536 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-14 15:41:00,536 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-07-14 15:41:00,536 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:41:00,536 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-14 15:41:00,536 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-14 15:41:00,536 INFO L133 ssoRankerPreferences]: Filename of dumped script: heapsort.i_Iteration5_Loop [2022-07-14 15:41:00,536 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-14 15:41:00,536 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-14 15:41:00,537 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-14 15:41:00,540 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-14 15:41:00,542 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-14 15:41:00,553 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-14 15:41:00,605 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-14 15:41:00,605 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-07-14 15:41:00,605 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:41:00,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:41:00,606 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-14 15:41:00,612 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-14 15:41:00,612 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-14 15:41:00,623 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-14 15:41:00,624 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-14 15:41:00,624 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start___VERIFIER_assert_~cond#1=1, ULTIMATE.start___VERIFIER_assert_#in~cond#1=1} Honda state: {ULTIMATE.start___VERIFIER_assert_~cond#1=1, ULTIMATE.start___VERIFIER_assert_#in~cond#1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-14 15:41:00,640 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-14 15:41:00,640 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:41:00,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:41:00,642 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-14 15:41:00,643 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-14 15:41:00,644 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-14 15:41:00,644 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-14 15:41:00,656 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-14 15:41:00,656 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet5#1=4} Honda state: {ULTIMATE.start_main_#t~nondet5#1=4} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-14 15:41:00,672 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-14 15:41:00,672 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:41:00,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:41:00,673 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-14 15:41:00,674 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-14 15:41:00,676 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-14 15:41:00,676 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-14 15:41:00,707 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2022-07-14 15:41:00,708 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:41:00,708 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:41:00,709 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-14 15:41:00,723 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-14 15:41:00,724 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-07-14 15:41:00,724 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-14 15:41:01,030 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-07-14 15:41:01,035 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2022-07-14 15:41:01,036 INFO L210 LassoAnalysis]: Preferences: [2022-07-14 15:41:01,036 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-14 15:41:01,036 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-14 15:41:01,036 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-14 15:41:01,036 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-14 15:41:01,036 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:41:01,036 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-14 15:41:01,036 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-14 15:41:01,036 INFO L133 ssoRankerPreferences]: Filename of dumped script: heapsort.i_Iteration5_Loop [2022-07-14 15:41:01,036 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-14 15:41:01,036 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-14 15:41:01,037 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-14 15:41:01,048 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-14 15:41:01,050 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-14 15:41:01,053 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-14 15:41:01,101 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-14 15:41:01,101 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-14 15:41:01,101 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:41:01,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:41:01,102 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-14 15:41:01,103 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-14 15:41:01,105 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-14 15:41:01,111 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:41:01,111 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:41:01,111 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:41:01,111 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:41:01,111 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:41:01,113 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 15:41:01,113 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:41:01,128 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-14 15:41:01,131 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2022-07-14 15:41:01,131 INFO L444 ModelExtractionUtils]: 5 out of 7 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-07-14 15:41:01,131 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:41:01,131 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:41:01,148 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-14 15:41:01,149 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-14 15:41:01,150 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-14 15:41:01,151 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-07-14 15:41:01,151 INFO L513 LassoAnalysis]: Proved termination. [2022-07-14 15:41:01,151 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~r~0#1) = 1*ULTIMATE.start_main_~r~0#1 Supporting invariants [] [2022-07-14 15:41:01,168 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-14 15:41:01,169 INFO L293 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-07-14 15:41:01,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:41:01,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:41:01,185 INFO L263 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-14 15:41:01,185 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 15:41:01,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:41:01,196 INFO L263 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-14 15:41:01,196 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 15:41:01,233 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-14 15:41:01,298 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-14 15:41:01,298 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2022-07-14 15:41:01,298 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 69 states and 80 transitions. cyclomatic complexity: 13 Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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-14 15:41:01,323 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 69 states and 80 transitions. cyclomatic complexity: 13. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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 133 states and 153 transitions. Complement of second has 4 states. [2022-07-14 15:41:01,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2022-07-14 15:41:01,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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-14 15:41:01,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 80 transitions. [2022-07-14 15:41:01,326 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 80 transitions. Stem has 4 letters. Loop has 14 letters. [2022-07-14 15:41:01,326 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 15:41:01,326 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 80 transitions. Stem has 18 letters. Loop has 14 letters. [2022-07-14 15:41:01,328 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 15:41:01,328 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 80 transitions. Stem has 4 letters. Loop has 28 letters. [2022-07-14 15:41:01,330 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 15:41:01,330 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 133 states and 153 transitions. [2022-07-14 15:41:01,332 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 57 [2022-07-14 15:41:01,333 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 133 states to 128 states and 147 transitions. [2022-07-14 15:41:01,333 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 63 [2022-07-14 15:41:01,334 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 64 [2022-07-14 15:41:01,334 INFO L73 IsDeterministic]: Start isDeterministic. Operand 128 states and 147 transitions. [2022-07-14 15:41:01,335 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-14 15:41:01,335 INFO L369 hiAutomatonCegarLoop]: Abstraction has 128 states and 147 transitions. [2022-07-14 15:41:01,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states and 147 transitions. [2022-07-14 15:41:01,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 127. [2022-07-14 15:41:01,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 127 states have (on average 1.1496062992125984) internal successors, (146), 126 states have internal predecessors, (146), 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-14 15:41:01,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 146 transitions. [2022-07-14 15:41:01,341 INFO L392 hiAutomatonCegarLoop]: Abstraction has 127 states and 146 transitions. [2022-07-14 15:41:01,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 15:41:01,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 15:41:01,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-14 15:41:01,342 INFO L87 Difference]: Start difference. First operand 127 states and 146 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 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-14 15:41:01,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 15:41:01,368 INFO L93 Difference]: Finished difference Result 70 states and 80 transitions. [2022-07-14 15:41:01,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-14 15:41:01,368 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 70 states and 80 transitions. [2022-07-14 15:41:01,369 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 32 [2022-07-14 15:41:01,369 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 70 states to 69 states and 79 transitions. [2022-07-14 15:41:01,369 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 37 [2022-07-14 15:41:01,369 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 37 [2022-07-14 15:41:01,369 INFO L73 IsDeterministic]: Start isDeterministic. Operand 69 states and 79 transitions. [2022-07-14 15:41:01,369 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-14 15:41:01,369 INFO L369 hiAutomatonCegarLoop]: Abstraction has 69 states and 79 transitions. [2022-07-14 15:41:01,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states and 79 transitions. [2022-07-14 15:41:01,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2022-07-14 15:41:01,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 69 states have (on average 1.144927536231884) internal successors, (79), 68 states have internal predecessors, (79), 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-14 15:41:01,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 79 transitions. [2022-07-14 15:41:01,371 INFO L392 hiAutomatonCegarLoop]: Abstraction has 69 states and 79 transitions. [2022-07-14 15:41:01,371 INFO L374 stractBuchiCegarLoop]: Abstraction has 69 states and 79 transitions. [2022-07-14 15:41:01,371 INFO L287 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2022-07-14 15:41:01,371 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 69 states and 79 transitions. [2022-07-14 15:41:01,371 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 32 [2022-07-14 15:41:01,371 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 15:41:01,371 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 15:41:01,371 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-07-14 15:41:01,371 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 15:41:01,372 INFO L752 eck$LassoCheckResult]: Stem: 1869#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); 1832#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;main_#in~argc#1, main_#in~argv#1.base, main_#in~argv#1.offset := #in~argc#1, #in~argv#1.base, #in~argv#1.offset;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~post2#1, main_#t~post3#1, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~post6#1, main_#t~post7#1, main_~argc#1, main_~argv#1.base, main_~argv#1.offset, main_~n~0#1, main_~l~0#1, main_~r~0#1, main_~i~0#1, main_~j~0#1;main_~argc#1 := main_#in~argc#1;main_~argv#1.base, main_~argv#1.offset := main_#in~argv#1.base, main_#in~argv#1.offset;havoc main_~n~0#1;havoc main_~l~0#1;havoc main_~r~0#1;havoc main_~i~0#1;havoc main_~j~0#1;main_~n~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1; 1833#L27 assume !!(1 <= main_~n~0#1 && main_~n~0#1 <= 1000000);main_~l~0#1 := 1 + (if main_~n~0#1 < 0 && 0 != main_~n~0#1 % 2 then 1 + main_~n~0#1 / 2 else main_~n~0#1 / 2);main_~r~0#1 := main_~n~0#1; 1815#L30 assume main_~l~0#1 > 1;main_#t~post2#1 := main_~l~0#1;main_~l~0#1 := main_#t~post2#1 - 1;havoc main_#t~post2#1; 1816#L59-1 assume !!(main_~r~0#1 > 1);main_~i~0#1 := main_~l~0#1;main_~j~0#1 := 2 * main_~l~0#1; 1849#L38-2 [2022-07-14 15:41:01,372 INFO L754 eck$LassoCheckResult]: Loop: 1849#L38-2 assume !!(main_~j~0#1 <= main_~r~0#1); 1865#L39 assume !(main_~j~0#1 < main_~r~0#1); 1818#L39-1 assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 1 <= main_~j~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1834#L18-12 assume !(0 == __VERIFIER_assert_~cond#1); 1835#L18-14 assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1870#L18-15 assume !(0 == __VERIFIER_assert_~cond#1); 1871#L18-17 assume { :end_inline___VERIFIER_assert } true; 1855#L49 assume 0 != main_#t~nondet5#1;havoc main_#t~nondet5#1; 1825#L38-3 assume !(main_~l~0#1 > 1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 1 <= main_~r~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1826#L18-36 assume !(0 == __VERIFIER_assert_~cond#1); 1829#L18-38 assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~r~0#1 <= main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 1830#L18-39 assume !(0 == __VERIFIER_assert_~cond#1); 1831#L18-41 assume { :end_inline___VERIFIER_assert } true;main_#t~post7#1 := main_~r~0#1;main_~r~0#1 := main_#t~post7#1 - 1;havoc main_#t~post7#1; 1843#L59-1 assume !!(main_~r~0#1 > 1);main_~i~0#1 := main_~l~0#1;main_~j~0#1 := 2 * main_~l~0#1; 1849#L38-2 [2022-07-14 15:41:01,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:41:01,372 INFO L85 PathProgramCache]: Analyzing trace with hash 28695791, now seen corresponding path program 1 times [2022-07-14 15:41:01,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:41:01,372 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112075898] [2022-07-14 15:41:01,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:41:01,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:41:01,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:41:01,377 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:41:01,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:41:01,382 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:41:01,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:41:01,382 INFO L85 PathProgramCache]: Analyzing trace with hash -1285304700, now seen corresponding path program 2 times [2022-07-14 15:41:01,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:41:01,382 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074650507] [2022-07-14 15:41:01,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:41:01,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:41:01,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:41:01,387 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:41:01,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:41:01,391 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:41:01,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:41:01,392 INFO L85 PathProgramCache]: Analyzing trace with hash 765817586, now seen corresponding path program 1 times [2022-07-14 15:41:01,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:41:01,392 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105789820] [2022-07-14 15:41:01,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:41:01,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:41:01,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:41:01,417 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-14 15:41:01,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 15:41:01,418 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105789820] [2022-07-14 15:41:01,418 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1105789820] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 15:41:01,418 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 15:41:01,418 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-14 15:41:01,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433104545] [2022-07-14 15:41:01,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 15:41:01,529 INFO L210 LassoAnalysis]: Preferences: [2022-07-14 15:41:01,529 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-14 15:41:01,529 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-14 15:41:01,529 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-14 15:41:01,530 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-07-14 15:41:01,530 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:41:01,530 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-14 15:41:01,530 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-14 15:41:01,530 INFO L133 ssoRankerPreferences]: Filename of dumped script: heapsort.i_Iteration6_Loop [2022-07-14 15:41:01,530 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-14 15:41:01,530 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-14 15:41:01,530 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-14 15:41:01,533 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-14 15:41:01,536 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-14 15:41:01,547 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-14 15:41:01,593 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-14 15:41:01,593 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-07-14 15:41:01,593 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:41:01,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:41:01,595 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:41:01,600 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-14 15:41:01,600 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-14 15:41:01,610 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2022-07-14 15:41:01,627 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-14 15:41:01,628 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet5#1=4} Honda state: {ULTIMATE.start_main_#t~nondet5#1=4} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-14 15:41:01,643 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2022-07-14 15:41:01,644 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:41:01,644 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:41:01,645 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:41:01,668 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2022-07-14 15:41:01,668 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-14 15:41:01,668 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-14 15:41:01,684 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-14 15:41:01,684 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start___VERIFIER_assert_~cond#1=1, ULTIMATE.start___VERIFIER_assert_#in~cond#1=1} Honda state: {ULTIMATE.start___VERIFIER_assert_~cond#1=1, ULTIMATE.start___VERIFIER_assert_#in~cond#1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-14 15:41:01,701 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2022-07-14 15:41:01,702 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:41:01,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:41:01,703 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:41:01,705 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2022-07-14 15:41:01,706 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-14 15:41:01,706 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-14 15:41:01,748 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2022-07-14 15:41:01,749 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:41:01,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:41:01,750 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:41:01,751 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2022-07-14 15:41:01,752 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-07-14 15:41:01,752 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-14 15:41:02,000 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-07-14 15:41:02,007 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2022-07-14 15:41:02,007 INFO L210 LassoAnalysis]: Preferences: [2022-07-14 15:41:02,007 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-14 15:41:02,007 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-14 15:41:02,007 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-14 15:41:02,007 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-14 15:41:02,007 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:41:02,007 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-14 15:41:02,007 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-14 15:41:02,007 INFO L133 ssoRankerPreferences]: Filename of dumped script: heapsort.i_Iteration6_Loop [2022-07-14 15:41:02,007 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-14 15:41:02,007 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-14 15:41:02,008 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-14 15:41:02,011 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-14 15:41:02,021 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-14 15:41:02,023 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-14 15:41:02,070 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-14 15:41:02,070 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-14 15:41:02,071 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:41:02,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:41:02,072 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:41:02,082 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2022-07-14 15:41:02,098 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-14 15:41:02,104 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:41:02,104 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:41:02,104 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:41:02,104 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2022-07-14 15:41:02,104 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:41:02,105 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-07-14 15:41:02,105 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:41:02,106 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:41:02,125 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2022-07-14 15:41:02,126 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:41:02,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:41:02,127 INFO L229 MonitoredProcess]: Starting monitored process 25 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-14 15:41:02,128 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2022-07-14 15:41:02,129 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-14 15:41:02,135 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:41:02,135 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:41:02,135 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:41:02,135 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:41:02,135 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:41:02,160 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 15:41:02,160 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:41:02,163 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-14 15:41:02,166 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-07-14 15:41:02,166 INFO L444 ModelExtractionUtils]: 4 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. [2022-07-14 15:41:02,166 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:41:02,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:41:02,168 INFO L229 MonitoredProcess]: Starting monitored process 26 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-14 15:41:02,176 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2022-07-14 15:41:02,176 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-14 15:41:02,176 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-07-14 15:41:02,177 INFO L513 LassoAnalysis]: Proved termination. [2022-07-14 15:41:02,177 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~r~0#1) = 1*ULTIMATE.start_main_~r~0#1 Supporting invariants [] [2022-07-14 15:41:02,193 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2022-07-14 15:41:02,194 INFO L293 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-07-14 15:41:02,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:41:02,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:41:02,230 INFO L263 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-14 15:41:02,230 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 15:41:02,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:41:02,243 INFO L263 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-14 15:41:02,244 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 15:41:02,265 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-14 15:41:02,266 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2022-07-14 15:41:02,266 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 69 states and 79 transitions. cyclomatic complexity: 12 Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 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-14 15:41:02,292 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 69 states and 79 transitions. cyclomatic complexity: 12. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 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 137 states and 159 transitions. Complement of second has 6 states. [2022-07-14 15:41:02,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2022-07-14 15:41:02,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 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-14 15:41:02,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 47 transitions. [2022-07-14 15:41:02,293 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 47 transitions. Stem has 5 letters. Loop has 14 letters. [2022-07-14 15:41:02,293 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 15:41:02,294 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 47 transitions. Stem has 19 letters. Loop has 14 letters. [2022-07-14 15:41:02,294 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 15:41:02,294 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 47 transitions. Stem has 5 letters. Loop has 28 letters. [2022-07-14 15:41:02,294 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 15:41:02,294 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 137 states and 159 transitions. [2022-07-14 15:41:02,295 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2022-07-14 15:41:02,295 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 137 states to 131 states and 152 transitions. [2022-07-14 15:41:02,295 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33 [2022-07-14 15:41:02,295 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 34 [2022-07-14 15:41:02,296 INFO L73 IsDeterministic]: Start isDeterministic. Operand 131 states and 152 transitions. [2022-07-14 15:41:02,296 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-14 15:41:02,296 INFO L369 hiAutomatonCegarLoop]: Abstraction has 131 states and 152 transitions. [2022-07-14 15:41:02,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states and 152 transitions. [2022-07-14 15:41:02,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 129. [2022-07-14 15:41:02,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 129 states have (on average 1.1550387596899225) internal successors, (149), 128 states have internal predecessors, (149), 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-14 15:41:02,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 149 transitions. [2022-07-14 15:41:02,298 INFO L392 hiAutomatonCegarLoop]: Abstraction has 129 states and 149 transitions. [2022-07-14 15:41:02,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 15:41:02,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 15:41:02,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-14 15:41:02,298 INFO L87 Difference]: Start difference. First operand 129 states and 149 transitions. Second operand has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 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-14 15:41:02,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 15:41:02,449 INFO L93 Difference]: Finished difference Result 430 states and 476 transitions. [2022-07-14 15:41:02,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-14 15:41:02,450 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 430 states and 476 transitions. [2022-07-14 15:41:02,452 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 64 [2022-07-14 15:41:02,453 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 430 states to 379 states and 421 transitions. [2022-07-14 15:41:02,453 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 96 [2022-07-14 15:41:02,453 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 96 [2022-07-14 15:41:02,453 INFO L73 IsDeterministic]: Start isDeterministic. Operand 379 states and 421 transitions. [2022-07-14 15:41:02,454 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-14 15:41:02,454 INFO L369 hiAutomatonCegarLoop]: Abstraction has 379 states and 421 transitions. [2022-07-14 15:41:02,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states and 421 transitions. [2022-07-14 15:41:02,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 130. [2022-07-14 15:41:02,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 130 states have (on average 1.1538461538461537) internal successors, (150), 129 states have internal predecessors, (150), 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-14 15:41:02,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 150 transitions. [2022-07-14 15:41:02,456 INFO L392 hiAutomatonCegarLoop]: Abstraction has 130 states and 150 transitions. [2022-07-14 15:41:02,456 INFO L374 stractBuchiCegarLoop]: Abstraction has 130 states and 150 transitions. [2022-07-14 15:41:02,456 INFO L287 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2022-07-14 15:41:02,456 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 130 states and 150 transitions. [2022-07-14 15:41:02,457 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2022-07-14 15:41:02,457 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 15:41:02,457 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 15:41:02,457 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2022-07-14 15:41:02,457 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 15:41:02,457 INFO L752 eck$LassoCheckResult]: Stem: 2730#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); 2688#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;main_#in~argc#1, main_#in~argv#1.base, main_#in~argv#1.offset := #in~argc#1, #in~argv#1.base, #in~argv#1.offset;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~post2#1, main_#t~post3#1, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~post6#1, main_#t~post7#1, main_~argc#1, main_~argv#1.base, main_~argv#1.offset, main_~n~0#1, main_~l~0#1, main_~r~0#1, main_~i~0#1, main_~j~0#1;main_~argc#1 := main_#in~argc#1;main_~argv#1.base, main_~argv#1.offset := main_#in~argv#1.base, main_#in~argv#1.offset;havoc main_~n~0#1;havoc main_~l~0#1;havoc main_~r~0#1;havoc main_~i~0#1;havoc main_~j~0#1;main_~n~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1; 2689#L27 assume !!(1 <= main_~n~0#1 && main_~n~0#1 <= 1000000);main_~l~0#1 := 1 + (if main_~n~0#1 < 0 && 0 != main_~n~0#1 % 2 then 1 + main_~n~0#1 / 2 else main_~n~0#1 / 2);main_~r~0#1 := main_~n~0#1; 2674#L30 assume main_~l~0#1 > 1;main_#t~post2#1 := main_~l~0#1;main_~l~0#1 := main_#t~post2#1 - 1;havoc main_#t~post2#1; 2675#L59-1 assume !!(main_~r~0#1 > 1);main_~i~0#1 := main_~l~0#1;main_~j~0#1 := 2 * main_~l~0#1; 2711#L38-2 assume !!(main_~j~0#1 <= main_~r~0#1); 2718#L39 [2022-07-14 15:41:02,458 INFO L754 eck$LassoCheckResult]: Loop: 2718#L39 assume !(main_~j~0#1 < main_~r~0#1); 2677#L39-1 assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 1 <= main_~j~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 2691#L18-12 assume !(0 == __VERIFIER_assert_~cond#1); 2692#L18-14 assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 2731#L18-15 assume !(0 == __VERIFIER_assert_~cond#1); 2732#L18-17 assume { :end_inline___VERIFIER_assert } true; 2715#L49 assume !(0 != main_#t~nondet5#1);havoc main_#t~nondet5#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 1 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 2703#L18-18 assume !(0 == __VERIFIER_assert_~cond#1); 2704#L18-20 assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 2722#L18-21 assume !(0 == __VERIFIER_assert_~cond#1); 2723#L18-23 assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 1 <= main_~j~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 2726#L18-24 assume !(0 == __VERIFIER_assert_~cond#1); 2727#L18-26 assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 2743#L18-27 assume !(0 == __VERIFIER_assert_~cond#1); 2738#L18-29 assume { :end_inline___VERIFIER_assert } true;main_~i~0#1 := main_~j~0#1;main_~j~0#1 := 2 * main_~j~0#1; 2713#L38-2 assume !!(main_~j~0#1 <= main_~r~0#1); 2718#L39 [2022-07-14 15:41:02,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:41:02,458 INFO L85 PathProgramCache]: Analyzing trace with hash 889569551, now seen corresponding path program 1 times [2022-07-14 15:41:02,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:41:02,458 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109876480] [2022-07-14 15:41:02,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:41:02,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:41:02,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:41:02,490 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:41:02,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:41:02,494 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:41:02,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:41:02,494 INFO L85 PathProgramCache]: Analyzing trace with hash 184163919, now seen corresponding path program 1 times [2022-07-14 15:41:02,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:41:02,494 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150630877] [2022-07-14 15:41:02,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:41:02,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:41:02,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:41:02,536 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-14 15:41:02,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 15:41:02,537 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150630877] [2022-07-14 15:41:02,537 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [150630877] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 15:41:02,537 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 15:41:02,537 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-14 15:41:02,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029517394] [2022-07-14 15:41:02,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 15:41:02,538 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-14 15:41:02,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 15:41:02,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 15:41:02,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-14 15:41:02,539 INFO L87 Difference]: Start difference. First operand 130 states and 150 transitions. cyclomatic complexity: 24 Second operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 15:41:02,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 15:41:02,637 INFO L93 Difference]: Finished difference Result 225 states and 251 transitions. [2022-07-14 15:41:02,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-14 15:41:02,637 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 225 states and 251 transitions. [2022-07-14 15:41:02,638 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2022-07-14 15:41:02,639 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 225 states to 210 states and 236 transitions. [2022-07-14 15:41:02,639 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 32 [2022-07-14 15:41:02,639 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 32 [2022-07-14 15:41:02,639 INFO L73 IsDeterministic]: Start isDeterministic. Operand 210 states and 236 transitions. [2022-07-14 15:41:02,640 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-14 15:41:02,640 INFO L369 hiAutomatonCegarLoop]: Abstraction has 210 states and 236 transitions. [2022-07-14 15:41:02,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states and 236 transitions. [2022-07-14 15:41:02,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 175. [2022-07-14 15:41:02,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 175 states have (on average 1.1257142857142857) internal successors, (197), 174 states have internal predecessors, (197), 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-14 15:41:02,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 197 transitions. [2022-07-14 15:41:02,642 INFO L392 hiAutomatonCegarLoop]: Abstraction has 175 states and 197 transitions. [2022-07-14 15:41:02,642 INFO L374 stractBuchiCegarLoop]: Abstraction has 175 states and 197 transitions. [2022-07-14 15:41:02,643 INFO L287 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2022-07-14 15:41:02,643 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 175 states and 197 transitions. [2022-07-14 15:41:02,643 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2022-07-14 15:41:02,643 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 15:41:02,643 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 15:41:02,644 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2022-07-14 15:41:02,644 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 15:41:02,644 INFO L752 eck$LassoCheckResult]: Stem: 3103#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); 3060#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;main_#in~argc#1, main_#in~argv#1.base, main_#in~argv#1.offset := #in~argc#1, #in~argv#1.base, #in~argv#1.offset;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~post2#1, main_#t~post3#1, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~post6#1, main_#t~post7#1, main_~argc#1, main_~argv#1.base, main_~argv#1.offset, main_~n~0#1, main_~l~0#1, main_~r~0#1, main_~i~0#1, main_~j~0#1;main_~argc#1 := main_#in~argc#1;main_~argv#1.base, main_~argv#1.offset := main_#in~argv#1.base, main_#in~argv#1.offset;havoc main_~n~0#1;havoc main_~l~0#1;havoc main_~r~0#1;havoc main_~i~0#1;havoc main_~j~0#1;main_~n~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1; 3061#L27 assume !!(1 <= main_~n~0#1 && main_~n~0#1 <= 1000000);main_~l~0#1 := 1 + (if main_~n~0#1 < 0 && 0 != main_~n~0#1 % 2 then 1 + main_~n~0#1 / 2 else main_~n~0#1 / 2);main_~r~0#1 := main_~n~0#1; 3046#L30 assume main_~l~0#1 > 1;main_#t~post2#1 := main_~l~0#1;main_~l~0#1 := main_#t~post2#1 - 1;havoc main_#t~post2#1; 3047#L59-1 assume !!(main_~r~0#1 > 1);main_~i~0#1 := main_~l~0#1;main_~j~0#1 := 2 * main_~l~0#1; 3079#L38-2 assume !!(main_~j~0#1 <= main_~r~0#1); 3090#L39 [2022-07-14 15:41:02,644 INFO L754 eck$LassoCheckResult]: Loop: 3090#L39 assume main_~j~0#1 < main_~r~0#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 1 <= main_~j~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 3091#L18 assume !(0 == __VERIFIER_assert_~cond#1); 3082#L18-2 assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 3083#L18-3 assume !(0 == __VERIFIER_assert_~cond#1); 3048#L18-5 assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 1 <= 1 + main_~j~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 3049#L18-6 assume !(0 == __VERIFIER_assert_~cond#1); 3067#L18-8 assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 1 + main_~j~0#1 <= main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 3068#L18-9 assume !(0 == __VERIFIER_assert_~cond#1); 3113#L18-11 assume { :end_inline___VERIFIER_assert } true; 3054#L44 assume 0 != main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~j~0#1 := 1 + main_~j~0#1; 3055#L39-1 assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 1 <= main_~j~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 3063#L18-12 assume !(0 == __VERIFIER_assert_~cond#1); 3064#L18-14 assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 3104#L18-15 assume !(0 == __VERIFIER_assert_~cond#1); 3105#L18-17 assume { :end_inline___VERIFIER_assert } true; 3086#L49 assume !(0 != main_#t~nondet5#1);havoc main_#t~nondet5#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 1 <= main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 3075#L18-18 assume !(0 == __VERIFIER_assert_~cond#1); 3076#L18-20 assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~i~0#1 <= main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 3095#L18-21 assume !(0 == __VERIFIER_assert_~cond#1); 3096#L18-23 assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 1 <= main_~j~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 3099#L18-24 assume !(0 == __VERIFIER_assert_~cond#1); 3100#L18-26 assume { :end_inline___VERIFIER_assert } true;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~j~0#1 <= main_~n~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 3124#L18-27 assume !(0 == __VERIFIER_assert_~cond#1); 3115#L18-29 assume { :end_inline___VERIFIER_assert } true;main_~i~0#1 := main_~j~0#1;main_~j~0#1 := 2 * main_~j~0#1; 3116#L38-2 assume !!(main_~j~0#1 <= main_~r~0#1); 3090#L39 [2022-07-14 15:41:02,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:41:02,645 INFO L85 PathProgramCache]: Analyzing trace with hash 889569551, now seen corresponding path program 2 times [2022-07-14 15:41:02,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:41:02,645 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518194950] [2022-07-14 15:41:02,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:41:02,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:41:02,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:41:02,649 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:41:02,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:41:02,653 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:41:02,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:41:02,653 INFO L85 PathProgramCache]: Analyzing trace with hash -1105792449, now seen corresponding path program 1 times [2022-07-14 15:41:02,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:41:02,654 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633026451] [2022-07-14 15:41:02,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:41:02,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:41:02,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:41:02,662 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:41:02,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:41:02,670 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:41:02,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:41:02,671 INFO L85 PathProgramCache]: Analyzing trace with hash -1170285327, now seen corresponding path program 1 times [2022-07-14 15:41:02,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:41:02,671 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119179162] [2022-07-14 15:41:02,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:41:02,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:41:02,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:41:02,707 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 15:41:02,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 15:41:02,708 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119179162] [2022-07-14 15:41:02,708 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [119179162] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 15:41:02,708 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [833691368] [2022-07-14 15:41:02,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:41:02,709 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 15:41:02,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:41:02,710 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 15:41:02,730 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-07-14 15:41:02,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:41:02,746 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-14 15:41:02,747 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 15:41:02,820 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2022-07-14 15:41:02,967 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-14 15:41:02,967 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 15:41:02,967 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [833691368] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 15:41:02,967 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-14 15:41:02,967 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 11 [2022-07-14 15:41:02,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898934599] [2022-07-14 15:41:02,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 15:41:03,168 INFO L210 LassoAnalysis]: Preferences: [2022-07-14 15:41:03,169 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-14 15:41:03,169 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-14 15:41:03,169 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-14 15:41:03,169 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-07-14 15:41:03,169 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:41:03,169 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-14 15:41:03,169 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-14 15:41:03,169 INFO L133 ssoRankerPreferences]: Filename of dumped script: heapsort.i_Iteration8_Loop [2022-07-14 15:41:03,169 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-14 15:41:03,169 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-14 15:41:03,170 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-14 15:41:03,172 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-14 15:41:03,181 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-14 15:41:03,183 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-14 15:41:03,228 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-14 15:41:03,228 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-07-14 15:41:03,228 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:41:03,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:41:03,229 INFO L229 MonitoredProcess]: Starting monitored process 28 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-14 15:41:03,235 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-14 15:41:03,236 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-14 15:41:03,246 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2022-07-14 15:41:03,246 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-14 15:41:03,246 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet4#1=4} Honda state: {ULTIMATE.start_main_#t~nondet4#1=4} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-14 15:41:03,264 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2022-07-14 15:41:03,264 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:41:03,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:41:03,265 INFO L229 MonitoredProcess]: Starting monitored process 29 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-14 15:41:03,268 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2022-07-14 15:41:03,269 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-14 15:41:03,269 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-14 15:41:03,297 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Ended with exit code 0 [2022-07-14 15:41:03,297 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:41:03,297 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:41:03,298 INFO L229 MonitoredProcess]: Starting monitored process 30 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-14 15:41:03,309 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2022-07-14 15:41:03,310 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-07-14 15:41:03,310 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-14 15:41:03,399 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-07-14 15:41:03,402 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0 [2022-07-14 15:41:03,403 INFO L210 LassoAnalysis]: Preferences: [2022-07-14 15:41:03,403 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-14 15:41:03,403 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-14 15:41:03,403 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-14 15:41:03,403 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-14 15:41:03,403 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:41:03,403 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-14 15:41:03,403 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-14 15:41:03,403 INFO L133 ssoRankerPreferences]: Filename of dumped script: heapsort.i_Iteration8_Loop [2022-07-14 15:41:03,403 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-14 15:41:03,403 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-14 15:41:03,404 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:41:03,422 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-14 15:41:03,431 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-14 15:41:03,434 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-14 15:41:03,491 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-14 15:41:03,491 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-14 15:41:03,491 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:41:03,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:41:03,496 INFO L229 MonitoredProcess]: Starting monitored process 31 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-14 15:41:03,521 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-14 15:41:03,526 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:41:03,526 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:41:03,527 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:41:03,527 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2022-07-14 15:41:03,527 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:41:03,527 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-07-14 15:41:03,527 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:41:03,531 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2022-07-14 15:41:03,539 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:41:03,569 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Forceful destruction successful, exit code 0 [2022-07-14 15:41:03,570 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:41:03,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:41:03,576 INFO L229 MonitoredProcess]: Starting monitored process 32 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-14 15:41:03,577 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2022-07-14 15:41:03,578 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-14 15:41:03,584 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:41:03,584 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:41:03,584 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:41:03,584 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:41:03,584 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:41:03,585 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 15:41:03,586 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:41:03,588 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-14 15:41:03,590 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-07-14 15:41:03,591 INFO L444 ModelExtractionUtils]: 2 out of 6 variables were initially zero. Simplification set additionally 1 variables to zero. [2022-07-14 15:41:03,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:41:03,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:41:03,592 INFO L229 MonitoredProcess]: Starting monitored process 33 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-14 15:41:03,593 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2022-07-14 15:41:03,594 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-14 15:41:03,594 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-07-14 15:41:03,594 INFO L513 LassoAnalysis]: Proved termination. [2022-07-14 15:41:03,594 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~n~0#1, ULTIMATE.start_main_~j~0#1) = 1*ULTIMATE.start_main_~n~0#1 - 1*ULTIMATE.start_main_~j~0#1 Supporting invariants [] [2022-07-14 15:41:03,611 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Forceful destruction successful, exit code 0 [2022-07-14 15:41:03,612 INFO L293 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-07-14 15:41:03,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:41:03,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:41:03,636 INFO L263 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-14 15:41:03,636 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 15:41:03,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:41:03,652 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 14 conjunts are in the unsatisfiable core [2022-07-14 15:41:03,653 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 15:41:03,779 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-14 15:41:03,779 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 7 loop predicates [2022-07-14 15:41:03,779 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 175 states and 197 transitions. cyclomatic complexity: 26 Second operand has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 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-14 15:41:03,857 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 175 states and 197 transitions. cyclomatic complexity: 26. Second operand has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 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 483 states and 524 transitions. Complement of second has 11 states. [2022-07-14 15:41:03,858 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-14 15:41:03,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 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-14 15:41:03,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 47 transitions. [2022-07-14 15:41:03,859 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 47 transitions. Stem has 6 letters. Loop has 25 letters. [2022-07-14 15:41:03,859 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 15:41:03,859 INFO L577 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-07-14 15:41:03,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:41:03,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:41:03,878 INFO L263 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-14 15:41:03,878 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 15:41:03,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:41:03,892 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 14 conjunts are in the unsatisfiable core [2022-07-14 15:41:03,893 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 15:41:04,020 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-14 15:41:04,020 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 7 loop predicates [2022-07-14 15:41:04,020 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 175 states and 197 transitions. cyclomatic complexity: 26 Second operand has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 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-14 15:41:04,162 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 175 states and 197 transitions. cyclomatic complexity: 26. Second operand has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 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 483 states and 524 transitions. Complement of second has 11 states. [2022-07-14 15:41:04,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 5 non-accepting loop states 1 accepting loop states [2022-07-14 15:41:04,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 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-14 15:41:04,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 47 transitions. [2022-07-14 15:41:04,165 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 47 transitions. Stem has 6 letters. Loop has 25 letters. [2022-07-14 15:41:04,165 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Forceful destruction successful, exit code 0 [2022-07-14 15:41:04,165 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 15:41:04,165 INFO L577 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-07-14 15:41:04,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:41:04,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:41:04,187 INFO L263 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-14 15:41:04,188 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 15:41:04,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:41:04,226 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 14 conjunts are in the unsatisfiable core [2022-07-14 15:41:04,227 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 15:41:04,375 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-14 15:41:04,375 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 7 loop predicates [2022-07-14 15:41:04,375 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 175 states and 197 transitions. cyclomatic complexity: 26 Second operand has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 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-14 15:41:04,442 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 175 states and 197 transitions. cyclomatic complexity: 26. Second operand has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 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 373 states and 405 transitions. Complement of second has 10 states. [2022-07-14 15:41:04,442 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-14 15:41:04,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 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-14 15:41:04,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 86 transitions. [2022-07-14 15:41:04,443 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 86 transitions. Stem has 6 letters. Loop has 25 letters. [2022-07-14 15:41:04,443 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 15:41:04,443 INFO L577 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-07-14 15:41:04,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:41:04,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:41:04,458 INFO L263 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-14 15:41:04,458 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 15:41:04,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:41:04,472 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 14 conjunts are in the unsatisfiable core [2022-07-14 15:41:04,473 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 15:41:04,608 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-14 15:41:04,609 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and with honda bouncer for loop.1 stem predicates 7 loop predicates [2022-07-14 15:41:04,609 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 175 states and 197 transitions. cyclomatic complexity: 26 Second operand has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 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-14 15:41:04,704 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 175 states and 197 transitions. cyclomatic complexity: 26. Second operand has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 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 373 states and 405 transitions. Complement of second has 10 states. [2022-07-14 15:41:04,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 5 non-accepting loop states 1 accepting loop states [2022-07-14 15:41:04,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 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-14 15:41:04,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 86 transitions. [2022-07-14 15:41:04,705 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 86 transitions. Stem has 6 letters. Loop has 25 letters. [2022-07-14 15:41:04,705 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 15:41:04,705 INFO L577 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-07-14 15:41:04,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:41:04,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:41:04,720 INFO L263 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-14 15:41:04,720 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 15:41:04,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:41:04,745 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 14 conjunts are in the unsatisfiable core [2022-07-14 15:41:04,746 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 15:41:04,885 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-14 15:41:04,886 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemin loopwithout honda bouncer for stem and without honda bouncer for loop.1 stem predicates 7 loop predicates [2022-07-14 15:41:04,887 INFO L104 BuchiDifferenceFKV]: Start buchiDifferenceFKV. First operand 175 states and 197 transitions. cyclomatic complexity: 26 Second operand has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 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-14 15:41:05,057 INFO L108 BuchiDifferenceFKV]: Finished buchiDifferenceFKV. First operand 175 states and 197 transitions. cyclomatic complexity: 26 Second operand has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 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 2225 states and 2838 transitions. Complement of second has 60 states 8 powerset states52 rank states. The highest rank that occured is 5 [2022-07-14 15:41:05,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 5 non-accepting loop states 1 accepting loop states [2022-07-14 15:41:05,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 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-14 15:41:05,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 196 transitions. [2022-07-14 15:41:05,058 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 196 transitions. Stem has 6 letters. Loop has 25 letters. [2022-07-14 15:41:05,059 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 15:41:05,059 INFO L577 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-07-14 15:41:05,060 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.AssertionError: no settings was sufficient at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.cegar.BuchiAutomatonCegarLoop.refineBuchi(BuchiAutomatonCegarLoop.java:325) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.cegar.BuchiAutomatonCegarLoop.refineBuchi(BuchiAutomatonCegarLoop.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.cegar.AbstractBuchiCegarLoop.refineBuchiAndReportRankingFunction(AbstractBuchiCegarLoop.java:401) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.cegar.AbstractBuchiCegarLoop.runCegarLoop(AbstractBuchiCegarLoop.java:352) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:146) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:363) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-07-14 15:41:05,063 INFO L158 Benchmark]: Toolchain (without parser) took 7871.98ms. Allocated memory was 88.1MB in the beginning and 157.3MB in the end (delta: 69.2MB). Free memory was 56.0MB in the beginning and 74.5MB in the end (delta: -18.5MB). Peak memory consumption was 49.8MB. Max. memory is 16.1GB. [2022-07-14 15:41:05,063 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 88.1MB. Free memory is still 44.1MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-14 15:41:05,063 INFO L158 Benchmark]: CACSL2BoogieTranslator took 208.52ms. Allocated memory was 88.1MB in the beginning and 107.0MB in the end (delta: 18.9MB). Free memory was 55.7MB in the beginning and 82.7MB in the end (delta: -26.9MB). Peak memory consumption was 9.5MB. Max. memory is 16.1GB. [2022-07-14 15:41:05,063 INFO L158 Benchmark]: Boogie Procedure Inliner took 23.84ms. Allocated memory is still 107.0MB. Free memory was 82.7MB in the beginning and 80.7MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-14 15:41:05,063 INFO L158 Benchmark]: Boogie Preprocessor took 14.16ms. Allocated memory is still 107.0MB. Free memory was 80.7MB in the beginning and 79.6MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-14 15:41:05,063 INFO L158 Benchmark]: RCFGBuilder took 335.86ms. Allocated memory is still 107.0MB. Free memory was 79.6MB in the beginning and 66.6MB in the end (delta: 13.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-07-14 15:41:05,064 INFO L158 Benchmark]: BuchiAutomizer took 7284.62ms. Allocated memory was 107.0MB in the beginning and 157.3MB in the end (delta: 50.3MB). Free memory was 66.0MB in the beginning and 74.5MB in the end (delta: -8.5MB). Peak memory consumption was 40.3MB. Max. memory is 16.1GB. [2022-07-14 15:41:05,065 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.14ms. Allocated memory is still 88.1MB. Free memory is still 44.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 208.52ms. Allocated memory was 88.1MB in the beginning and 107.0MB in the end (delta: 18.9MB). Free memory was 55.7MB in the beginning and 82.7MB in the end (delta: -26.9MB). Peak memory consumption was 9.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 23.84ms. Allocated memory is still 107.0MB. Free memory was 82.7MB in the beginning and 80.7MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 14.16ms. Allocated memory is still 107.0MB. Free memory was 80.7MB in the beginning and 79.6MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 335.86ms. Allocated memory is still 107.0MB. Free memory was 79.6MB in the beginning and 66.6MB in the end (delta: 13.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * BuchiAutomizer took 7284.62ms. Allocated memory was 107.0MB in the beginning and 157.3MB in the end (delta: 50.3MB). Free memory was 66.0MB in the beginning and 74.5MB in the end (delta: -8.5MB). Peak memory consumption was 40.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: AssertionError: no settings was sufficient de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: AssertionError: no settings was sufficient: de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.cegar.BuchiAutomatonCegarLoop.refineBuchi(BuchiAutomatonCegarLoop.java:325) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-07-14 15:41:05,085 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2022-07-14 15:41:05,303 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 Using bit-precise analysis No suitable file found in config dir /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config using search string *Termination*32bit*_Bitvector*.epf No suitable settings file found using Termination*32bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: no settings was sufficient