./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 6c24879c 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-?-6c24879 [2022-07-13 04:00:30,751 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 04:00:30,753 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 04:00:30,780 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 04:00:30,783 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 04:00:30,784 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 04:00:30,788 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 04:00:30,792 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 04:00:30,793 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 04:00:30,794 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 04:00:30,795 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 04:00:30,795 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 04:00:30,795 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 04:00:30,796 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 04:00:30,797 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 04:00:30,797 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 04:00:30,798 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 04:00:30,798 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 04:00:30,799 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 04:00:30,800 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 04:00:30,801 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 04:00:30,802 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 04:00:30,802 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 04:00:30,803 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 04:00:30,804 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 04:00:30,805 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 04:00:30,806 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 04:00:30,806 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 04:00:30,806 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 04:00:30,807 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 04:00:30,807 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 04:00:30,807 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 04:00:30,808 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 04:00:30,808 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 04:00:30,809 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 04:00:30,809 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 04:00:30,809 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 04:00:30,810 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 04:00:30,810 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 04:00:30,810 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 04:00:30,811 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 04:00:30,811 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 04:00:30,812 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2022-07-13 04:00:30,825 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 04:00:30,826 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 04:00:30,826 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 04:00:30,826 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 04:00:30,827 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 04:00:30,827 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 04:00:30,827 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 04:00:30,828 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-07-13 04:00:30,828 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-07-13 04:00:30,828 INFO L138 SettingsManager]: * Use old map elimination=false [2022-07-13 04:00:30,828 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-07-13 04:00:30,829 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-07-13 04:00:30,829 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-07-13 04:00:30,829 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 04:00:30,829 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-13 04:00:30,829 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-13 04:00:30,829 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-13 04:00:30,829 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-13 04:00:30,830 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 04:00:30,830 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-07-13 04:00:30,830 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-07-13 04:00:30,830 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-07-13 04:00:30,830 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-13 04:00:30,830 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-13 04:00:30,830 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-07-13 04:00:30,831 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 04:00:30,831 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-07-13 04:00:30,831 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 04:00:30,831 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 04:00:30,831 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 04:00:30,832 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-13 04:00:30,832 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-07-13 04:00:30,833 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-13 04:00:31,024 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 04:00:31,054 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 04:00:31,056 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 04:00:31,057 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 04:00:31,057 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 04:00:31,058 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-13 04:00:31,109 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0e200f3c7/24f0204f616c4037a54b905e148d738b/FLAGbbbca1993 [2022-07-13 04:00:31,443 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 04:00:31,444 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/heapsort.i [2022-07-13 04:00:31,448 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0e200f3c7/24f0204f616c4037a54b905e148d738b/FLAGbbbca1993 [2022-07-13 04:00:31,857 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0e200f3c7/24f0204f616c4037a54b905e148d738b [2022-07-13 04:00:31,859 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 04:00:31,861 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 04:00:31,862 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 04:00:31,862 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 04:00:31,864 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 04:00:31,865 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 04:00:31" (1/1) ... [2022-07-13 04:00:31,866 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4adad649 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:00:31, skipping insertion in model container [2022-07-13 04:00:31,866 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 04:00:31" (1/1) ... [2022-07-13 04:00:31,870 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 04:00:31,883 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 04:00:32,037 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-13 04:00:32,064 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 04:00:32,075 INFO L203 MainTranslator]: Completed pre-run [2022-07-13 04:00:32,089 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-13 04:00:32,109 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 04:00:32,130 INFO L208 MainTranslator]: Completed translation [2022-07-13 04:00:32,131 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:00:32 WrapperNode [2022-07-13 04:00:32,131 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 04:00:32,131 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-13 04:00:32,132 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-13 04:00:32,132 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-13 04:00:32,136 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:00:32" (1/1) ... [2022-07-13 04:00:32,141 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:00:32" (1/1) ... [2022-07-13 04:00:32,157 INFO L137 Inliner]: procedures = 16, calls = 20, calls flagged for inlining = 16, calls inlined = 16, statements flattened = 158 [2022-07-13 04:00:32,157 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-13 04:00:32,158 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-13 04:00:32,158 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-13 04:00:32,158 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-13 04:00:32,165 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:00:32" (1/1) ... [2022-07-13 04:00:32,165 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:00:32" (1/1) ... [2022-07-13 04:00:32,166 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:00:32" (1/1) ... [2022-07-13 04:00:32,167 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:00:32" (1/1) ... [2022-07-13 04:00:32,169 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:00:32" (1/1) ... [2022-07-13 04:00:32,173 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:00:32" (1/1) ... [2022-07-13 04:00:32,174 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:00:32" (1/1) ... [2022-07-13 04:00:32,175 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-13 04:00:32,180 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-13 04:00:32,182 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-13 04:00:32,183 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-13 04:00:32,184 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:00:32" (1/1) ... [2022-07-13 04:00:32,189 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:00:32,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:00:32,267 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-13 04:00:32,268 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-13 04:00:32,297 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-13 04:00:32,298 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-13 04:00:32,298 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-13 04:00:32,298 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-13 04:00:32,343 INFO L234 CfgBuilder]: Building ICFG [2022-07-13 04:00:32,344 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-13 04:00:32,483 INFO L275 CfgBuilder]: Performing block encoding [2022-07-13 04:00:32,488 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-13 04:00:32,489 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-07-13 04:00:32,490 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 04:00:32 BoogieIcfgContainer [2022-07-13 04:00:32,490 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-13 04:00:32,491 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-07-13 04:00:32,491 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-07-13 04:00:32,494 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-07-13 04:00:32,494 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-13 04:00:32,494 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 13.07 04:00:31" (1/3) ... [2022-07-13 04:00:32,495 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5fdb0a74 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 13.07 04:00:32, skipping insertion in model container [2022-07-13 04:00:32,495 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-13 04:00:32,496 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:00:32" (2/3) ... [2022-07-13 04:00:32,496 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5fdb0a74 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 13.07 04:00:32, skipping insertion in model container [2022-07-13 04:00:32,496 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-13 04:00:32,496 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 04:00:32" (3/3) ... [2022-07-13 04:00:32,497 INFO L354 chiAutomizerObserver]: Analyzing ICFG heapsort.i [2022-07-13 04:00:32,575 INFO L255 stractBuchiCegarLoop]: Interprodecural is true [2022-07-13 04:00:32,576 INFO L256 stractBuchiCegarLoop]: Hoare is false [2022-07-13 04:00:32,576 INFO L257 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-07-13 04:00:32,576 INFO L258 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-07-13 04:00:32,576 INFO L259 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-07-13 04:00:32,576 INFO L260 stractBuchiCegarLoop]: Difference is false [2022-07-13 04:00:32,576 INFO L261 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-07-13 04:00:32,577 INFO L265 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-07-13 04:00:32,579 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-13 04:00:32,598 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 49 [2022-07-13 04:00:32,599 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 04:00:32,599 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 04:00:32,603 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2022-07-13 04:00:32,603 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-13 04:00:32,603 INFO L287 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-07-13 04:00:32,604 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-13 04:00:32,606 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 49 [2022-07-13 04:00:32,607 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 04:00:32,607 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 04:00:32,607 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2022-07-13 04:00:32,607 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-13 04:00:32,616 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-13 04:00:32,616 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-13 04:00:32,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:00:32,627 INFO L85 PathProgramCache]: Analyzing trace with hash 925672, now seen corresponding path program 1 times [2022-07-13 04:00:32,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:00:32,635 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870103797] [2022-07-13 04:00:32,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:00:32,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:00:32,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:00:32,701 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 04:00:32,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:00:32,723 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 04:00:32,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:00:32,726 INFO L85 PathProgramCache]: Analyzing trace with hash -947861826, now seen corresponding path program 1 times [2022-07-13 04:00:32,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:00:32,726 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327491181] [2022-07-13 04:00:32,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:00:32,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:00:32,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 04:00:32,751 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-13 04:00:32,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 04:00:32,752 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327491181] [2022-07-13 04:00:32,752 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1327491181] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 04:00:32,752 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 04:00:32,752 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-13 04:00:32,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515094403] [2022-07-13 04:00:32,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 04:00:32,756 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-13 04:00:32,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 04:00:32,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-13 04:00:32,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-13 04:00:32,779 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-13 04:00:32,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 04:00:32,785 INFO L93 Difference]: Finished difference Result 57 states and 64 transitions. [2022-07-13 04:00:32,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-13 04:00:32,790 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 57 states and 64 transitions. [2022-07-13 04:00:32,792 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 35 [2022-07-13 04:00:32,795 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 57 states to 39 states and 45 transitions. [2022-07-13 04:00:32,796 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 39 [2022-07-13 04:00:32,796 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 39 [2022-07-13 04:00:32,796 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 45 transitions. [2022-07-13 04:00:32,797 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 04:00:32,797 INFO L369 hiAutomatonCegarLoop]: Abstraction has 39 states and 45 transitions. [2022-07-13 04:00:32,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 45 transitions. [2022-07-13 04:00:32,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2022-07-13 04:00:32,813 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-13 04:00:32,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 45 transitions. [2022-07-13 04:00:32,815 INFO L392 hiAutomatonCegarLoop]: Abstraction has 39 states and 45 transitions. [2022-07-13 04:00:32,815 INFO L374 stractBuchiCegarLoop]: Abstraction has 39 states and 45 transitions. [2022-07-13 04:00:32,815 INFO L287 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-07-13 04:00:32,815 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 45 transitions. [2022-07-13 04:00:32,816 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 35 [2022-07-13 04:00:32,816 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 04:00:32,816 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 04:00:32,818 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2022-07-13 04:00:32,818 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-13 04:00:32,818 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-13 04:00:32,818 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-13 04:00:32,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:00:32,819 INFO L85 PathProgramCache]: Analyzing trace with hash 925672, now seen corresponding path program 2 times [2022-07-13 04:00:32,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:00:32,819 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104072719] [2022-07-13 04:00:32,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:00:32,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:00:32,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:00:32,830 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 04:00:32,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:00:32,840 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 04:00:32,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:00:32,840 INFO L85 PathProgramCache]: Analyzing trace with hash -145650952, now seen corresponding path program 1 times [2022-07-13 04:00:32,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:00:32,841 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624293145] [2022-07-13 04:00:32,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:00:32,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:00:32,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:00:32,848 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 04:00:32,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:00:32,858 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 04:00:32,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:00:32,859 INFO L85 PathProgramCache]: Analyzing trace with hash 1814169905, now seen corresponding path program 1 times [2022-07-13 04:00:32,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:00:32,859 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12927899] [2022-07-13 04:00:32,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:00:32,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:00:32,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 04:00:32,897 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-13 04:00:32,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 04:00:32,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12927899] [2022-07-13 04:00:32,899 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [12927899] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 04:00:32,899 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 04:00:32,899 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 04:00:32,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449815534] [2022-07-13 04:00:32,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 04:00:33,042 INFO L210 LassoAnalysis]: Preferences: [2022-07-13 04:00:33,043 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-13 04:00:33,043 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-13 04:00:33,043 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-13 04:00:33,043 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-07-13 04:00:33,043 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:00:33,043 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-13 04:00:33,043 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-13 04:00:33,043 INFO L133 ssoRankerPreferences]: Filename of dumped script: heapsort.i_Iteration2_Loop [2022-07-13 04:00:33,043 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-13 04:00:33,044 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-13 04:00:33,068 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-13 04:00:33,083 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-13 04:00:33,087 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-13 04:00:33,141 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-13 04:00:33,141 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-07-13 04:00:33,144 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:00:33,144 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:00:33,151 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-13 04:00:33,152 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-13 04:00:33,154 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-13 04:00:33,154 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-13 04:00:33,192 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2022-07-13 04:00:33,193 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:00:33,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:00:33,197 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-13 04:00:33,198 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-13 04:00:33,199 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-07-13 04:00:33,199 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-13 04:00:33,419 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-07-13 04:00:33,431 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-13 04:00:33,431 INFO L210 LassoAnalysis]: Preferences: [2022-07-13 04:00:33,431 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-13 04:00:33,431 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-13 04:00:33,431 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-13 04:00:33,432 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-13 04:00:33,432 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:00:33,432 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-13 04:00:33,432 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-13 04:00:33,432 INFO L133 ssoRankerPreferences]: Filename of dumped script: heapsort.i_Iteration2_Loop [2022-07-13 04:00:33,432 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-13 04:00:33,432 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-13 04:00:33,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-13 04:00:33,442 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-13 04:00:33,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-13 04:00:33,511 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-13 04:00:33,515 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-13 04:00:33,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:00:33,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:00:33,518 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-13 04:00:33,519 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-13 04:00:33,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-13 04:00:33,526 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:00:33,527 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 04:00:33,527 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:00:33,527 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:00:33,527 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:00:33,530 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 04:00:33,530 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 04:00:33,551 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:00:33,567 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2022-07-13 04:00:33,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:00:33,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:00:33,568 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-13 04:00:33,573 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-13 04:00:33,574 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-13 04:00:33,582 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:00:33,582 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 04:00:33,582 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:00:33,582 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:00:33,582 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:00:33,585 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 04:00:33,585 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 04:00:33,589 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-13 04:00:33,614 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-07-13 04:00:33,614 INFO L444 ModelExtractionUtils]: 4 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. [2022-07-13 04:00:33,615 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:00:33,615 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:00:33,616 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-13 04:00:33,619 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-13 04:00:33,621 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-13 04:00:33,621 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-07-13 04:00:33,622 INFO L513 LassoAnalysis]: Proved termination. [2022-07-13 04:00:33,622 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-13 04:00:33,639 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-13 04:00:33,642 INFO L293 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-07-13 04:00:33,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:00:33,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 04:00:33,685 INFO L263 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-13 04:00:33,687 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 04:00:33,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 04:00:33,707 INFO L263 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-13 04:00:33,709 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 04:00:33,751 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-13 04:00:33,753 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-13 04:00:33,754 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-13 04:00:33,811 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-13 04:00:33,813 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-13 04:00:33,814 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-13 04:00:33,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 86 transitions. [2022-07-13 04:00:33,816 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 86 transitions. Stem has 4 letters. Loop has 7 letters. [2022-07-13 04:00:33,816 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-13 04:00:33,816 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 86 transitions. Stem has 11 letters. Loop has 7 letters. [2022-07-13 04:00:33,817 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-13 04:00:33,817 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 86 transitions. Stem has 4 letters. Loop has 14 letters. [2022-07-13 04:00:33,817 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-13 04:00:33,817 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 112 states and 130 transitions. [2022-07-13 04:00:33,819 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 66 [2022-07-13 04:00:33,820 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 112 states to 108 states and 126 transitions. [2022-07-13 04:00:33,820 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 71 [2022-07-13 04:00:33,820 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 72 [2022-07-13 04:00:33,820 INFO L73 IsDeterministic]: Start isDeterministic. Operand 108 states and 126 transitions. [2022-07-13 04:00:33,820 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-13 04:00:33,820 INFO L369 hiAutomatonCegarLoop]: Abstraction has 108 states and 126 transitions. [2022-07-13 04:00:33,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states and 126 transitions. [2022-07-13 04:00:33,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 107. [2022-07-13 04:00:33,831 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-13 04:00:33,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 124 transitions. [2022-07-13 04:00:33,833 INFO L392 hiAutomatonCegarLoop]: Abstraction has 107 states and 124 transitions. [2022-07-13 04:00:33,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 04:00:33,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 04:00:33,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 04:00:33,834 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-13 04:00:33,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 04:00:33,847 INFO L93 Difference]: Finished difference Result 129 states and 148 transitions. [2022-07-13 04:00:33,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 04:00:33,847 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 129 states and 148 transitions. [2022-07-13 04:00:33,851 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 93 [2022-07-13 04:00:33,852 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 129 states to 98 states and 112 transitions. [2022-07-13 04:00:33,852 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 98 [2022-07-13 04:00:33,852 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 98 [2022-07-13 04:00:33,852 INFO L73 IsDeterministic]: Start isDeterministic. Operand 98 states and 112 transitions. [2022-07-13 04:00:33,853 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 04:00:33,853 INFO L369 hiAutomatonCegarLoop]: Abstraction has 98 states and 112 transitions. [2022-07-13 04:00:33,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states and 112 transitions. [2022-07-13 04:00:33,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 66. [2022-07-13 04:00:33,855 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-13 04:00:33,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 76 transitions. [2022-07-13 04:00:33,856 INFO L392 hiAutomatonCegarLoop]: Abstraction has 66 states and 76 transitions. [2022-07-13 04:00:33,856 INFO L374 stractBuchiCegarLoop]: Abstraction has 66 states and 76 transitions. [2022-07-13 04:00:33,856 INFO L287 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-07-13 04:00:33,856 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 66 states and 76 transitions. [2022-07-13 04:00:33,857 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 62 [2022-07-13 04:00:33,857 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 04:00:33,857 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 04:00:33,857 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2022-07-13 04:00:33,857 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-13 04:00:33,857 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-13 04:00:33,857 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-13 04:00:33,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:00:33,858 INFO L85 PathProgramCache]: Analyzing trace with hash 925670, now seen corresponding path program 1 times [2022-07-13 04:00:33,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:00:33,858 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807523157] [2022-07-13 04:00:33,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:00:33,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:00:33,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:00:33,874 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 04:00:33,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:00:33,887 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 04:00:33,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:00:33,888 INFO L85 PathProgramCache]: Analyzing trace with hash -145650952, now seen corresponding path program 2 times [2022-07-13 04:00:33,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:00:33,888 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055956519] [2022-07-13 04:00:33,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:00:33,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:00:33,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:00:33,893 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 04:00:33,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:00:33,916 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 04:00:33,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:00:33,917 INFO L85 PathProgramCache]: Analyzing trace with hash -1671450765, now seen corresponding path program 1 times [2022-07-13 04:00:33,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:00:33,917 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362333996] [2022-07-13 04:00:33,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:00:33,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:00:33,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 04:00:33,945 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-13 04:00:33,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 04:00:33,945 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362333996] [2022-07-13 04:00:33,945 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [362333996] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 04:00:33,945 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 04:00:33,945 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-13 04:00:33,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825707558] [2022-07-13 04:00:33,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 04:00:34,017 INFO L210 LassoAnalysis]: Preferences: [2022-07-13 04:00:34,017 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-13 04:00:34,017 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-13 04:00:34,017 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-13 04:00:34,017 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-07-13 04:00:34,017 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:00:34,017 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-13 04:00:34,017 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-13 04:00:34,017 INFO L133 ssoRankerPreferences]: Filename of dumped script: heapsort.i_Iteration3_Loop [2022-07-13 04:00:34,017 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-13 04:00:34,017 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-13 04:00:34,019 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-13 04:00:34,020 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-13 04:00:34,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-13 04:00:34,068 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-13 04:00:34,068 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-07-13 04:00:34,068 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:00:34,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:00:34,070 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-13 04:00:34,071 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-13 04:00:34,072 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-13 04:00:34,072 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-13 04:00:34,094 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-13 04:00:34,094 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-13 04:00:34,111 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-13 04:00:34,112 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:00:34,112 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:00:34,113 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-13 04:00:34,115 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-13 04:00:34,116 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-13 04:00:34,116 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-13 04:00:34,138 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-13 04:00:34,138 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-13 04:00:34,169 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-13 04:00:34,170 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:00:34,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:00:34,171 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-13 04:00:34,172 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-13 04:00:34,174 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-13 04:00:34,174 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-13 04:00:34,249 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2022-07-13 04:00:34,250 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:00:34,250 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:00:34,264 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-13 04:00:34,280 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-13 04:00:34,280 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-07-13 04:00:34,280 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-13 04:00:34,472 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-07-13 04:00:34,476 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-13 04:00:34,478 INFO L210 LassoAnalysis]: Preferences: [2022-07-13 04:00:34,478 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-13 04:00:34,478 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-13 04:00:34,478 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-13 04:00:34,478 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-13 04:00:34,478 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:00:34,478 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-13 04:00:34,478 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-13 04:00:34,479 INFO L133 ssoRankerPreferences]: Filename of dumped script: heapsort.i_Iteration3_Loop [2022-07-13 04:00:34,479 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-13 04:00:34,479 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-13 04:00:34,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-13 04:00:34,486 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-13 04:00:34,500 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-13 04:00:34,563 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-13 04:00:34,563 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-13 04:00:34,563 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:00:34,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:00:34,565 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-13 04:00:34,566 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-13 04:00:34,567 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-13 04:00:34,572 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:00:34,572 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 04:00:34,572 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:00:34,573 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:00:34,573 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:00:34,573 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 04:00:34,573 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 04:00:34,589 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:00:34,606 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-13 04:00:34,607 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:00:34,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:00:34,608 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-13 04:00:34,608 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-13 04:00:34,660 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-13 04:00:34,665 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:00:34,665 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 04:00:34,666 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:00:34,666 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:00:34,666 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:00:34,668 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 04:00:34,668 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 04:00:34,682 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-13 04:00:34,686 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-07-13 04:00:34,686 INFO L444 ModelExtractionUtils]: 4 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. [2022-07-13 04:00:34,686 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:00:34,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:00:34,687 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-13 04:00:34,688 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-13 04:00:34,689 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-13 04:00:34,689 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-07-13 04:00:34,689 INFO L513 LassoAnalysis]: Proved termination. [2022-07-13 04:00:34,689 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-13 04:00:34,704 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2022-07-13 04:00:34,705 INFO L293 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-07-13 04:00:34,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:00:34,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 04:00:34,747 INFO L263 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-13 04:00:34,748 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 04:00:34,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 04:00:34,756 INFO L263 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-13 04:00:34,757 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 04:00:34,796 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2022-07-13 04:00:34,810 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2022-07-13 04:00:34,828 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-13 04:00:34,829 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-13 04:00:34,830 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-13 04:00:34,848 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-13 04:00:34,849 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-13 04:00:34,849 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-13 04:00:34,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 81 transitions. [2022-07-13 04:00:34,850 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 81 transitions. Stem has 4 letters. Loop has 7 letters. [2022-07-13 04:00:34,850 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-13 04:00:34,850 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 81 transitions. Stem has 11 letters. Loop has 7 letters. [2022-07-13 04:00:34,851 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-13 04:00:34,851 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 81 transitions. Stem has 4 letters. Loop has 14 letters. [2022-07-13 04:00:34,851 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-13 04:00:34,851 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 160 states and 185 transitions. [2022-07-13 04:00:34,853 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 87 [2022-07-13 04:00:34,857 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 160 states to 125 states and 145 transitions. [2022-07-13 04:00:34,857 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 93 [2022-07-13 04:00:34,857 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 94 [2022-07-13 04:00:34,857 INFO L73 IsDeterministic]: Start isDeterministic. Operand 125 states and 145 transitions. [2022-07-13 04:00:34,858 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-13 04:00:34,858 INFO L369 hiAutomatonCegarLoop]: Abstraction has 125 states and 145 transitions. [2022-07-13 04:00:34,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states and 145 transitions. [2022-07-13 04:00:34,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 67. [2022-07-13 04:00:34,860 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-13 04:00:34,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 78 transitions. [2022-07-13 04:00:34,861 INFO L392 hiAutomatonCegarLoop]: Abstraction has 67 states and 78 transitions. [2022-07-13 04:00:34,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 04:00:34,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 04:00:34,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-13 04:00:34,862 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-13 04:00:34,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 04:00:34,966 INFO L93 Difference]: Finished difference Result 207 states and 231 transitions. [2022-07-13 04:00:34,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-13 04:00:34,969 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 207 states and 231 transitions. [2022-07-13 04:00:34,972 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 128 [2022-07-13 04:00:34,975 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 207 states to 207 states and 231 transitions. [2022-07-13 04:00:34,975 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 155 [2022-07-13 04:00:34,976 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 155 [2022-07-13 04:00:34,976 INFO L73 IsDeterministic]: Start isDeterministic. Operand 207 states and 231 transitions. [2022-07-13 04:00:34,980 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-13 04:00:34,980 INFO L369 hiAutomatonCegarLoop]: Abstraction has 207 states and 231 transitions. [2022-07-13 04:00:34,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states and 231 transitions. [2022-07-13 04:00:34,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 69. [2022-07-13 04:00:34,988 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-13 04:00:34,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 80 transitions. [2022-07-13 04:00:34,988 INFO L392 hiAutomatonCegarLoop]: Abstraction has 69 states and 80 transitions. [2022-07-13 04:00:34,988 INFO L374 stractBuchiCegarLoop]: Abstraction has 69 states and 80 transitions. [2022-07-13 04:00:34,988 INFO L287 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-07-13 04:00:34,988 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 69 states and 80 transitions. [2022-07-13 04:00:34,989 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 31 [2022-07-13 04:00:34,989 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 04:00:34,989 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 04:00:34,989 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2022-07-13 04:00:34,989 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-13 04:00:34,989 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-13 04:00:34,989 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-13 04:00:34,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:00:34,990 INFO L85 PathProgramCache]: Analyzing trace with hash 925672, now seen corresponding path program 3 times [2022-07-13 04:00:34,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:00:34,990 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558715281] [2022-07-13 04:00:34,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:00:34,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:00:34,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:00:34,996 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 04:00:35,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:00:35,001 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 04:00:35,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:00:35,002 INFO L85 PathProgramCache]: Analyzing trace with hash -124656242, now seen corresponding path program 1 times [2022-07-13 04:00:35,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:00:35,002 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206762693] [2022-07-13 04:00:35,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:00:35,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:00:35,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 04:00:35,022 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-13 04:00:35,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 04:00:35,023 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206762693] [2022-07-13 04:00:35,023 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [206762693] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 04:00:35,023 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 04:00:35,023 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 04:00:35,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101448155] [2022-07-13 04:00:35,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 04:00:35,024 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-13 04:00:35,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 04:00:35,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 04:00:35,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 04:00:35,025 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-13 04:00:35,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 04:00:35,071 INFO L93 Difference]: Finished difference Result 129 states and 146 transitions. [2022-07-13 04:00:35,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 04:00:35,072 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 129 states and 146 transitions. [2022-07-13 04:00:35,072 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 61 [2022-07-13 04:00:35,073 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 129 states to 128 states and 145 transitions. [2022-07-13 04:00:35,073 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 67 [2022-07-13 04:00:35,073 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 67 [2022-07-13 04:00:35,073 INFO L73 IsDeterministic]: Start isDeterministic. Operand 128 states and 145 transitions. [2022-07-13 04:00:35,073 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-13 04:00:35,073 INFO L369 hiAutomatonCegarLoop]: Abstraction has 128 states and 145 transitions. [2022-07-13 04:00:35,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states and 145 transitions. [2022-07-13 04:00:35,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 69. [2022-07-13 04:00:35,075 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-13 04:00:35,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 80 transitions. [2022-07-13 04:00:35,076 INFO L392 hiAutomatonCegarLoop]: Abstraction has 69 states and 80 transitions. [2022-07-13 04:00:35,076 INFO L374 stractBuchiCegarLoop]: Abstraction has 69 states and 80 transitions. [2022-07-13 04:00:35,076 INFO L287 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2022-07-13 04:00:35,076 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 69 states and 80 transitions. [2022-07-13 04:00:35,076 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 32 [2022-07-13 04:00:35,076 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 04:00:35,076 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 04:00:35,076 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2022-07-13 04:00:35,076 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 04:00:35,076 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-13 04:00:35,077 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-13 04:00:35,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:00:35,077 INFO L85 PathProgramCache]: Analyzing trace with hash 925672, now seen corresponding path program 4 times [2022-07-13 04:00:35,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:00:35,077 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799710220] [2022-07-13 04:00:35,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:00:35,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:00:35,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:00:35,082 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 04:00:35,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:00:35,092 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 04:00:35,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:00:35,095 INFO L85 PathProgramCache]: Analyzing trace with hash -470789538, now seen corresponding path program 1 times [2022-07-13 04:00:35,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:00:35,096 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281602923] [2022-07-13 04:00:35,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:00:35,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:00:35,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:00:35,111 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 04:00:35,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:00:35,120 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 04:00:35,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:00:35,122 INFO L85 PathProgramCache]: Analyzing trace with hash 1515786757, now seen corresponding path program 1 times [2022-07-13 04:00:35,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:00:35,123 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431991088] [2022-07-13 04:00:35,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:00:35,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:00:35,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 04:00:35,146 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-13 04:00:35,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 04:00:35,146 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431991088] [2022-07-13 04:00:35,146 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [431991088] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 04:00:35,146 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 04:00:35,146 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 04:00:35,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961018569] [2022-07-13 04:00:35,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 04:00:35,297 INFO L210 LassoAnalysis]: Preferences: [2022-07-13 04:00:35,297 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-13 04:00:35,297 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-13 04:00:35,297 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-13 04:00:35,297 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-07-13 04:00:35,297 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:00:35,297 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-13 04:00:35,297 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-13 04:00:35,297 INFO L133 ssoRankerPreferences]: Filename of dumped script: heapsort.i_Iteration5_Loop [2022-07-13 04:00:35,297 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-13 04:00:35,297 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-13 04:00:35,299 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-13 04:00:35,303 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-13 04:00:35,306 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-13 04:00:35,317 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-13 04:00:35,375 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-13 04:00:35,375 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-07-13 04:00:35,375 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:00:35,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:00:35,376 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-13 04:00:35,378 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-13 04:00:35,379 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-13 04:00:35,379 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-13 04:00:35,398 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-13 04:00:35,398 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-13 04:00:35,413 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-13 04:00:35,414 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:00:35,414 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:00:35,415 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-13 04:00:35,415 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-13 04:00:35,417 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-13 04:00:35,417 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-13 04:00:35,427 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-13 04:00:35,427 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-13 04:00:35,444 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-13 04:00:35,445 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:00:35,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:00:35,446 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-13 04:00:35,447 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-13 04:00:35,448 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-13 04:00:35,448 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-13 04:00:35,484 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-13 04:00:35,485 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:00:35,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:00:35,486 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-13 04:00:35,486 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-13 04:00:35,487 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-07-13 04:00:35,488 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-13 04:00:35,889 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-07-13 04:00:35,894 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-13 04:00:35,894 INFO L210 LassoAnalysis]: Preferences: [2022-07-13 04:00:35,894 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-13 04:00:35,894 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-13 04:00:35,894 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-13 04:00:35,894 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-13 04:00:35,894 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:00:35,894 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-13 04:00:35,894 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-13 04:00:35,894 INFO L133 ssoRankerPreferences]: Filename of dumped script: heapsort.i_Iteration5_Loop [2022-07-13 04:00:35,894 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-13 04:00:35,894 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-13 04:00:35,895 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-13 04:00:35,915 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-13 04:00:35,918 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-13 04:00:35,923 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-13 04:00:35,974 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-13 04:00:35,974 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-13 04:00:35,974 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:00:35,975 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:00:35,976 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-13 04:00:35,977 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-13 04:00:35,979 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-13 04:00:35,985 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:00:35,985 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 04:00:35,985 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:00:35,985 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:00:35,985 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:00:35,987 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 04:00:35,987 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 04:00:35,998 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-13 04:00:36,000 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2022-07-13 04:00:36,001 INFO L444 ModelExtractionUtils]: 5 out of 7 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-07-13 04:00:36,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:00:36,001 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:00:36,002 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-13 04:00:36,003 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-13 04:00:36,016 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-13 04:00:36,016 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-07-13 04:00:36,016 INFO L513 LassoAnalysis]: Proved termination. [2022-07-13 04:00:36,016 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-13 04:00:36,032 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-13 04:00:36,033 INFO L293 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-07-13 04:00:36,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:00:36,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 04:00:36,060 INFO L263 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-13 04:00:36,061 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 04:00:36,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 04:00:36,074 INFO L263 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-13 04:00:36,075 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 04:00:36,134 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-13 04:00:36,134 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-13 04:00:36,135 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-13 04:00:36,153 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-13 04:00:36,154 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-13 04:00:36,154 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-13 04:00:36,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 80 transitions. [2022-07-13 04:00:36,154 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 80 transitions. Stem has 4 letters. Loop has 14 letters. [2022-07-13 04:00:36,155 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-13 04:00:36,155 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 80 transitions. Stem has 18 letters. Loop has 14 letters. [2022-07-13 04:00:36,155 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-13 04:00:36,155 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 80 transitions. Stem has 4 letters. Loop has 28 letters. [2022-07-13 04:00:36,155 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-13 04:00:36,155 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 133 states and 153 transitions. [2022-07-13 04:00:36,156 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 57 [2022-07-13 04:00:36,156 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 133 states to 128 states and 147 transitions. [2022-07-13 04:00:36,156 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 63 [2022-07-13 04:00:36,157 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 64 [2022-07-13 04:00:36,157 INFO L73 IsDeterministic]: Start isDeterministic. Operand 128 states and 147 transitions. [2022-07-13 04:00:36,157 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-13 04:00:36,157 INFO L369 hiAutomatonCegarLoop]: Abstraction has 128 states and 147 transitions. [2022-07-13 04:00:36,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states and 147 transitions. [2022-07-13 04:00:36,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 127. [2022-07-13 04:00:36,160 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-13 04:00:36,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 146 transitions. [2022-07-13 04:00:36,160 INFO L392 hiAutomatonCegarLoop]: Abstraction has 127 states and 146 transitions. [2022-07-13 04:00:36,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 04:00:36,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 04:00:36,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 04:00:36,161 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-13 04:00:36,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 04:00:36,195 INFO L93 Difference]: Finished difference Result 70 states and 80 transitions. [2022-07-13 04:00:36,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 04:00:36,195 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 70 states and 80 transitions. [2022-07-13 04:00:36,196 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 32 [2022-07-13 04:00:36,196 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 70 states to 69 states and 79 transitions. [2022-07-13 04:00:36,196 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 37 [2022-07-13 04:00:36,197 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 37 [2022-07-13 04:00:36,197 INFO L73 IsDeterministic]: Start isDeterministic. Operand 69 states and 79 transitions. [2022-07-13 04:00:36,197 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-13 04:00:36,197 INFO L369 hiAutomatonCegarLoop]: Abstraction has 69 states and 79 transitions. [2022-07-13 04:00:36,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states and 79 transitions. [2022-07-13 04:00:36,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2022-07-13 04:00:36,198 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-13 04:00:36,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 79 transitions. [2022-07-13 04:00:36,198 INFO L392 hiAutomatonCegarLoop]: Abstraction has 69 states and 79 transitions. [2022-07-13 04:00:36,198 INFO L374 stractBuchiCegarLoop]: Abstraction has 69 states and 79 transitions. [2022-07-13 04:00:36,198 INFO L287 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2022-07-13 04:00:36,198 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 69 states and 79 transitions. [2022-07-13 04:00:36,199 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 32 [2022-07-13 04:00:36,199 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 04:00:36,199 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 04:00:36,199 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-07-13 04:00:36,199 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 04:00:36,199 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-13 04:00:36,199 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-13 04:00:36,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:00:36,199 INFO L85 PathProgramCache]: Analyzing trace with hash 28695791, now seen corresponding path program 1 times [2022-07-13 04:00:36,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:00:36,200 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962804955] [2022-07-13 04:00:36,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:00:36,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:00:36,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:00:36,205 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 04:00:36,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:00:36,226 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 04:00:36,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:00:36,226 INFO L85 PathProgramCache]: Analyzing trace with hash -1285304700, now seen corresponding path program 2 times [2022-07-13 04:00:36,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:00:36,226 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233692010] [2022-07-13 04:00:36,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:00:36,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:00:36,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:00:36,231 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 04:00:36,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:00:36,237 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 04:00:36,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:00:36,237 INFO L85 PathProgramCache]: Analyzing trace with hash 765817586, now seen corresponding path program 1 times [2022-07-13 04:00:36,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:00:36,237 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416113337] [2022-07-13 04:00:36,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:00:36,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:00:36,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 04:00:36,276 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-13 04:00:36,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 04:00:36,277 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416113337] [2022-07-13 04:00:36,277 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1416113337] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 04:00:36,277 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 04:00:36,277 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-13 04:00:36,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142756930] [2022-07-13 04:00:36,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 04:00:36,391 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-13 04:00:36,447 INFO L210 LassoAnalysis]: Preferences: [2022-07-13 04:00:36,447 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-13 04:00:36,447 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-13 04:00:36,447 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-13 04:00:36,447 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-07-13 04:00:36,447 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:00:36,447 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-13 04:00:36,447 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-13 04:00:36,447 INFO L133 ssoRankerPreferences]: Filename of dumped script: heapsort.i_Iteration6_Loop [2022-07-13 04:00:36,447 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-13 04:00:36,447 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-13 04:00:36,448 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-13 04:00:36,451 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-13 04:00:36,454 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-13 04:00:36,466 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-13 04:00:36,521 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-13 04:00:36,521 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-07-13 04:00:36,521 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:00:36,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:00:36,523 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-13 04:00:36,530 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-13 04:00:36,530 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-13 04:00:36,540 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-13 04:00:36,548 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-13 04:00:36,548 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-13 04:00:36,564 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-13 04:00:36,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:00:36,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:00:36,565 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-13 04:00:36,571 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-13 04:00:36,571 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-13 04:00:36,571 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-13 04:00:36,583 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-13 04:00:36,583 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-13 04:00:36,600 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-13 04:00:36,600 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:00:36,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:00:36,601 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-13 04:00:36,602 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-13 04:00:36,604 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-13 04:00:36,604 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-13 04:00:36,641 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-13 04:00:36,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:00:36,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:00:36,643 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-13 04:00:36,643 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-13 04:00:36,645 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-07-13 04:00:36,645 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-13 04:00:36,984 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-07-13 04:00:36,989 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2022-07-13 04:00:36,989 INFO L210 LassoAnalysis]: Preferences: [2022-07-13 04:00:36,989 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-13 04:00:36,989 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-13 04:00:36,989 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-13 04:00:36,989 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-13 04:00:36,989 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:00:36,989 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-13 04:00:36,989 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-13 04:00:36,989 INFO L133 ssoRankerPreferences]: Filename of dumped script: heapsort.i_Iteration6_Loop [2022-07-13 04:00:36,989 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-13 04:00:36,989 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-13 04:00:36,990 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-13 04:00:37,001 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-13 04:00:37,012 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-13 04:00:37,014 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-13 04:00:37,065 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-13 04:00:37,066 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-13 04:00:37,066 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:00:37,066 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:00:37,067 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-13 04:00:37,067 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-13 04:00:37,128 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-13 04:00:37,135 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:00:37,135 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 04:00:37,135 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:00:37,135 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2022-07-13 04:00:37,135 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:00:37,136 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-07-13 04:00:37,136 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 04:00:37,150 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:00:37,168 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-13 04:00:37,168 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:00:37,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:00:37,169 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-13 04:00:37,170 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-13 04:00:37,171 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-13 04:00:37,178 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:00:37,179 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 04:00:37,179 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:00:37,179 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:00:37,179 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:00:37,182 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 04:00:37,182 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 04:00:37,195 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-13 04:00:37,198 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-07-13 04:00:37,198 INFO L444 ModelExtractionUtils]: 4 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. [2022-07-13 04:00:37,198 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:00:37,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:00:37,199 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-13 04:00:37,200 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-13 04:00:37,201 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-13 04:00:37,201 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-07-13 04:00:37,201 INFO L513 LassoAnalysis]: Proved termination. [2022-07-13 04:00:37,201 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-13 04:00:37,227 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-13 04:00:37,227 INFO L293 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-07-13 04:00:37,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:00:37,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 04:00:37,257 INFO L263 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-13 04:00:37,257 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 04:00:37,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 04:00:37,301 INFO L263 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-13 04:00:37,301 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 04:00:37,321 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-13 04:00:37,322 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-13 04:00:37,322 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-13 04:00:37,349 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-13 04:00:37,349 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-13 04:00:37,350 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-13 04:00:37,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 47 transitions. [2022-07-13 04:00:37,350 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 47 transitions. Stem has 5 letters. Loop has 14 letters. [2022-07-13 04:00:37,350 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-13 04:00:37,350 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 47 transitions. Stem has 19 letters. Loop has 14 letters. [2022-07-13 04:00:37,350 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-13 04:00:37,350 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 47 transitions. Stem has 5 letters. Loop has 28 letters. [2022-07-13 04:00:37,350 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-13 04:00:37,350 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 137 states and 159 transitions. [2022-07-13 04:00:37,351 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2022-07-13 04:00:37,352 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 137 states to 131 states and 152 transitions. [2022-07-13 04:00:37,352 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33 [2022-07-13 04:00:37,352 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 34 [2022-07-13 04:00:37,352 INFO L73 IsDeterministic]: Start isDeterministic. Operand 131 states and 152 transitions. [2022-07-13 04:00:37,352 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-13 04:00:37,352 INFO L369 hiAutomatonCegarLoop]: Abstraction has 131 states and 152 transitions. [2022-07-13 04:00:37,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states and 152 transitions. [2022-07-13 04:00:37,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 129. [2022-07-13 04:00:37,354 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-13 04:00:37,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 149 transitions. [2022-07-13 04:00:37,354 INFO L392 hiAutomatonCegarLoop]: Abstraction has 129 states and 149 transitions. [2022-07-13 04:00:37,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 04:00:37,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-13 04:00:37,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-13 04:00:37,355 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-13 04:00:37,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 04:00:37,458 INFO L93 Difference]: Finished difference Result 430 states and 476 transitions. [2022-07-13 04:00:37,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-13 04:00:37,458 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 430 states and 476 transitions. [2022-07-13 04:00:37,460 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 64 [2022-07-13 04:00:37,462 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 430 states to 379 states and 421 transitions. [2022-07-13 04:00:37,462 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 96 [2022-07-13 04:00:37,462 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 96 [2022-07-13 04:00:37,462 INFO L73 IsDeterministic]: Start isDeterministic. Operand 379 states and 421 transitions. [2022-07-13 04:00:37,462 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-13 04:00:37,462 INFO L369 hiAutomatonCegarLoop]: Abstraction has 379 states and 421 transitions. [2022-07-13 04:00:37,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states and 421 transitions. [2022-07-13 04:00:37,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 130. [2022-07-13 04:00:37,464 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-13 04:00:37,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 150 transitions. [2022-07-13 04:00:37,465 INFO L392 hiAutomatonCegarLoop]: Abstraction has 130 states and 150 transitions. [2022-07-13 04:00:37,465 INFO L374 stractBuchiCegarLoop]: Abstraction has 130 states and 150 transitions. [2022-07-13 04:00:37,465 INFO L287 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2022-07-13 04:00:37,465 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 130 states and 150 transitions. [2022-07-13 04:00:37,465 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2022-07-13 04:00:37,465 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 04:00:37,465 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 04:00:37,466 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2022-07-13 04:00:37,466 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 04:00:37,466 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-13 04:00:37,466 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-13 04:00:37,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:00:37,466 INFO L85 PathProgramCache]: Analyzing trace with hash 889569551, now seen corresponding path program 1 times [2022-07-13 04:00:37,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:00:37,466 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327393593] [2022-07-13 04:00:37,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:00:37,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:00:37,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:00:37,471 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 04:00:37,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:00:37,475 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 04:00:37,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:00:37,475 INFO L85 PathProgramCache]: Analyzing trace with hash 184163919, now seen corresponding path program 1 times [2022-07-13 04:00:37,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:00:37,475 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736585697] [2022-07-13 04:00:37,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:00:37,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:00:37,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 04:00:37,534 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-13 04:00:37,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 04:00:37,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736585697] [2022-07-13 04:00:37,541 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1736585697] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 04:00:37,541 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 04:00:37,541 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 04:00:37,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369002361] [2022-07-13 04:00:37,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 04:00:37,542 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-13 04:00:37,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 04:00:37,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-13 04:00:37,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-13 04:00:37,543 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-13 04:00:37,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 04:00:37,660 INFO L93 Difference]: Finished difference Result 225 states and 251 transitions. [2022-07-13 04:00:37,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-13 04:00:37,662 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 225 states and 251 transitions. [2022-07-13 04:00:37,663 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2022-07-13 04:00:37,663 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 225 states to 210 states and 236 transitions. [2022-07-13 04:00:37,664 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 32 [2022-07-13 04:00:37,664 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 32 [2022-07-13 04:00:37,664 INFO L73 IsDeterministic]: Start isDeterministic. Operand 210 states and 236 transitions. [2022-07-13 04:00:37,664 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-13 04:00:37,664 INFO L369 hiAutomatonCegarLoop]: Abstraction has 210 states and 236 transitions. [2022-07-13 04:00:37,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states and 236 transitions. [2022-07-13 04:00:37,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 175. [2022-07-13 04:00:37,666 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-13 04:00:37,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 197 transitions. [2022-07-13 04:00:37,666 INFO L392 hiAutomatonCegarLoop]: Abstraction has 175 states and 197 transitions. [2022-07-13 04:00:37,666 INFO L374 stractBuchiCegarLoop]: Abstraction has 175 states and 197 transitions. [2022-07-13 04:00:37,666 INFO L287 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2022-07-13 04:00:37,666 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 175 states and 197 transitions. [2022-07-13 04:00:37,667 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2022-07-13 04:00:37,667 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 04:00:37,667 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 04:00:37,668 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2022-07-13 04:00:37,668 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-13 04:00:37,668 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-13 04:00:37,668 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-13 04:00:37,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:00:37,668 INFO L85 PathProgramCache]: Analyzing trace with hash 889569551, now seen corresponding path program 2 times [2022-07-13 04:00:37,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:00:37,669 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789791311] [2022-07-13 04:00:37,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:00:37,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:00:37,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:00:37,676 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 04:00:37,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:00:37,690 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 04:00:37,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:00:37,691 INFO L85 PathProgramCache]: Analyzing trace with hash -1105792449, now seen corresponding path program 1 times [2022-07-13 04:00:37,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:00:37,691 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274557214] [2022-07-13 04:00:37,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:00:37,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:00:37,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:00:37,716 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 04:00:37,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 04:00:37,729 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 04:00:37,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:00:37,730 INFO L85 PathProgramCache]: Analyzing trace with hash -1170285327, now seen corresponding path program 1 times [2022-07-13 04:00:37,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 04:00:37,730 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098362635] [2022-07-13 04:00:37,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:00:37,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 04:00:37,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 04:00:37,783 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-13 04:00:37,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 04:00:37,783 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098362635] [2022-07-13 04:00:37,783 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2098362635] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 04:00:37,783 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [624107431] [2022-07-13 04:00:37,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 04:00:37,783 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 04:00:37,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:00:37,784 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-13 04:00:37,785 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-13 04:00:37,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 04:00:37,824 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-13 04:00:37,825 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 04:00:38,011 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-13 04:00:38,056 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-13 04:00:38,056 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 04:00:38,057 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [624107431] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 04:00:38,057 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 04:00:38,057 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 11 [2022-07-13 04:00:38,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091359536] [2022-07-13 04:00:38,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 04:00:38,243 INFO L210 LassoAnalysis]: Preferences: [2022-07-13 04:00:38,243 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-13 04:00:38,243 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-13 04:00:38,243 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-13 04:00:38,243 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-07-13 04:00:38,243 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:00:38,244 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-13 04:00:38,244 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-13 04:00:38,244 INFO L133 ssoRankerPreferences]: Filename of dumped script: heapsort.i_Iteration8_Loop [2022-07-13 04:00:38,244 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-13 04:00:38,244 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-13 04:00:38,244 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-13 04:00:38,246 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-13 04:00:38,253 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-13 04:00:38,254 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-13 04:00:38,290 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-13 04:00:38,290 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-07-13 04:00:38,290 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:00:38,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:00:38,292 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-13 04:00:38,307 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-13 04:00:38,308 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-13 04:00:38,308 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-13 04:00:38,329 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-13 04:00:38,329 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-13 04:00:38,345 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-13 04:00:38,345 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:00:38,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:00:38,346 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-13 04:00:38,350 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-13 04:00:38,350 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-13 04:00:38,367 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-13 04:00:38,397 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2022-07-13 04:00:38,397 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:00:38,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:00:38,398 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-13 04:00:38,408 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-13 04:00:38,409 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-07-13 04:00:38,409 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-13 04:00:38,493 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-07-13 04:00:38,497 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-13 04:00:38,497 INFO L210 LassoAnalysis]: Preferences: [2022-07-13 04:00:38,497 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-13 04:00:38,497 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-13 04:00:38,497 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-13 04:00:38,497 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-13 04:00:38,497 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:00:38,497 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-13 04:00:38,497 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-13 04:00:38,498 INFO L133 ssoRankerPreferences]: Filename of dumped script: heapsort.i_Iteration8_Loop [2022-07-13 04:00:38,498 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-13 04:00:38,498 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-13 04:00:38,498 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-13 04:00:38,509 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-13 04:00:38,516 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-13 04:00:38,519 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-13 04:00:38,561 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-13 04:00:38,561 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-13 04:00:38,562 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:00:38,562 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:00:38,563 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-13 04:00:38,564 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-13 04:00:38,566 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-13 04:00:38,572 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:00:38,572 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 04:00:38,572 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:00:38,572 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2022-07-13 04:00:38,572 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:00:38,573 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-07-13 04:00:38,573 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 04:00:38,588 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 04:00:38,604 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-13 04:00:38,605 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:00:38,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:00:38,606 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-13 04:00:38,607 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-13 04:00:38,608 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-13 04:00:38,614 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 04:00:38,614 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 04:00:38,614 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 04:00:38,614 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 04:00:38,614 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 04:00:38,617 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 04:00:38,617 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 04:00:38,639 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-13 04:00:38,643 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-07-13 04:00:38,643 INFO L444 ModelExtractionUtils]: 2 out of 6 variables were initially zero. Simplification set additionally 1 variables to zero. [2022-07-13 04:00:38,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 04:00:38,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 04:00:38,646 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-13 04:00:38,647 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-13 04:00:38,648 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-13 04:00:38,648 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-07-13 04:00:38,648 INFO L513 LassoAnalysis]: Proved termination. [2022-07-13 04:00:38,648 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-13 04:00:38,664 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Ended with exit code 0 [2022-07-13 04:00:38,664 INFO L293 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-07-13 04:00:38,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:00:38,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 04:00:38,688 INFO L263 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-13 04:00:38,688 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 04:00:38,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 04:00:38,708 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 14 conjunts are in the unsatisfiable core [2022-07-13 04:00:38,709 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 04:00:38,864 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-13 04:00:38,864 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-13 04:00:38,865 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-13 04:00:38,948 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-13 04:00:38,948 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-13 04:00:38,949 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-13 04:00:38,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 47 transitions. [2022-07-13 04:00:38,949 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 47 transitions. Stem has 6 letters. Loop has 25 letters. [2022-07-13 04:00:38,950 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-13 04:00:38,950 INFO L577 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-07-13 04:00:38,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:00:38,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 04:00:38,968 INFO L263 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-13 04:00:38,968 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 04:00:38,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 04:00:38,986 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 14 conjunts are in the unsatisfiable core [2022-07-13 04:00:38,987 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 04:00:39,069 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-13 04:00:39,182 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-13 04:00:39,183 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-13 04:00:39,183 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-13 04:00:39,303 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-13 04:00:39,304 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-13 04:00:39,304 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-13 04:00:39,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 47 transitions. [2022-07-13 04:00:39,305 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 47 transitions. Stem has 6 letters. Loop has 25 letters. [2022-07-13 04:00:39,305 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-13 04:00:39,305 INFO L577 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-07-13 04:00:39,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:00:39,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 04:00:39,321 INFO L263 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-13 04:00:39,321 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 04:00:39,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 04:00:39,342 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 14 conjunts are in the unsatisfiable core [2022-07-13 04:00:39,342 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 04:00:39,472 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-13 04:00:39,473 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-13 04:00:39,473 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-13 04:00:39,544 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-13 04:00:39,546 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-13 04:00:39,546 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-13 04:00:39,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 86 transitions. [2022-07-13 04:00:39,547 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 86 transitions. Stem has 6 letters. Loop has 25 letters. [2022-07-13 04:00:39,547 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-13 04:00:39,547 INFO L577 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-07-13 04:00:39,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:00:39,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 04:00:39,563 INFO L263 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-13 04:00:39,563 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 04:00:39,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 04:00:39,577 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 14 conjunts are in the unsatisfiable core [2022-07-13 04:00:39,578 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 04:00:39,717 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-13 04:00:39,718 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-13 04:00:39,718 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-13 04:00:39,813 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-13 04:00:39,813 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-13 04:00:39,813 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-13 04:00:39,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 86 transitions. [2022-07-13 04:00:39,813 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 86 transitions. Stem has 6 letters. Loop has 25 letters. [2022-07-13 04:00:39,814 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-13 04:00:39,814 INFO L577 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-07-13 04:00:39,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 04:00:39,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 04:00:39,828 INFO L263 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-13 04:00:39,829 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 04:00:39,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 04:00:39,848 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 14 conjunts are in the unsatisfiable core [2022-07-13 04:00:39,849 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 04:00:39,985 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-13 04:00:39,986 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-13 04:00:39,987 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-13 04:00:40,161 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-13 04:00:40,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-13 04:00:40,162 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-13 04:00:40,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 196 transitions. [2022-07-13 04:00:40,162 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 196 transitions. Stem has 6 letters. Loop has 25 letters. [2022-07-13 04:00:40,163 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-13 04:00:40,163 INFO L577 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-07-13 04:00:40,164 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-13 04:00:40,169 INFO L158 Benchmark]: Toolchain (without parser) took 8307.84ms. Allocated memory was 117.4MB in the beginning and 172.0MB in the end (delta: 54.5MB). Free memory was 81.0MB in the beginning and 89.5MB in the end (delta: -8.6MB). Peak memory consumption was 44.6MB. Max. memory is 16.1GB. [2022-07-13 04:00:40,170 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 117.4MB. Free memory was 87.9MB in the beginning and 87.9MB in the end (delta: 26.8kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 04:00:40,170 INFO L158 Benchmark]: CACSL2BoogieTranslator took 268.82ms. Allocated memory is still 117.4MB. Free memory was 80.7MB in the beginning and 90.2MB in the end (delta: -9.5MB). Peak memory consumption was 9.6MB. Max. memory is 16.1GB. [2022-07-13 04:00:40,170 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.12ms. Allocated memory is still 117.4MB. Free memory was 90.2MB in the beginning and 88.2MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-13 04:00:40,170 INFO L158 Benchmark]: Boogie Preprocessor took 17.26ms. Allocated memory is still 117.4MB. Free memory was 88.2MB in the beginning and 87.5MB in the end (delta: 656.6kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 04:00:40,170 INFO L158 Benchmark]: RCFGBuilder took 310.21ms. Allocated memory is still 117.4MB. Free memory was 86.9MB in the beginning and 74.9MB in the end (delta: 11.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-07-13 04:00:40,171 INFO L158 Benchmark]: BuchiAutomizer took 7677.13ms. Allocated memory was 117.4MB in the beginning and 172.0MB in the end (delta: 54.5MB). Free memory was 74.9MB in the beginning and 89.5MB in the end (delta: -14.6MB). Peak memory consumption was 39.2MB. Max. memory is 16.1GB. [2022-07-13 04:00:40,172 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.16ms. Allocated memory is still 117.4MB. Free memory was 87.9MB in the beginning and 87.9MB in the end (delta: 26.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 268.82ms. Allocated memory is still 117.4MB. Free memory was 80.7MB in the beginning and 90.2MB in the end (delta: -9.5MB). Peak memory consumption was 9.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 26.12ms. Allocated memory is still 117.4MB. Free memory was 90.2MB in the beginning and 88.2MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 17.26ms. Allocated memory is still 117.4MB. Free memory was 88.2MB in the beginning and 87.5MB in the end (delta: 656.6kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 310.21ms. Allocated memory is still 117.4MB. Free memory was 86.9MB in the beginning and 74.9MB in the end (delta: 11.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * BuchiAutomizer took 7677.13ms. Allocated memory was 117.4MB in the beginning and 172.0MB in the end (delta: 54.5MB). Free memory was 74.9MB in the beginning and 89.5MB in the end (delta: -14.6MB). Peak memory consumption was 39.2MB. 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-13 04:00:40,197 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-13 04:00:40,408 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