./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/loops/bubble_sort-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version e19ca921 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/loops/bubble_sort-1.c -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 121046493a5b65b32f3b8bf8adee655ff03b45acd38f0a8519ee3c99065fa840 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-e19ca92 [2021-12-22 20:11:39,685 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-22 20:11:39,691 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-22 20:11:39,730 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-22 20:11:39,731 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-22 20:11:39,732 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-22 20:11:39,733 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-22 20:11:39,734 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-22 20:11:39,735 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-22 20:11:39,735 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-22 20:11:39,736 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-22 20:11:39,737 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-22 20:11:39,737 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-22 20:11:39,737 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-22 20:11:39,738 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-22 20:11:39,739 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-22 20:11:39,743 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-22 20:11:39,746 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-22 20:11:39,748 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-22 20:11:39,751 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-22 20:11:39,752 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-22 20:11:39,756 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-22 20:11:39,756 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-22 20:11:39,757 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-22 20:11:39,759 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-22 20:11:39,760 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-22 20:11:39,760 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-22 20:11:39,761 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-22 20:11:39,761 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-22 20:11:39,767 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-22 20:11:39,768 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-22 20:11:39,768 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-22 20:11:39,770 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-22 20:11:39,771 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-22 20:11:39,771 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-22 20:11:39,772 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-22 20:11:39,772 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-22 20:11:39,772 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-22 20:11:39,772 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-22 20:11:39,773 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-22 20:11:39,773 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-22 20:11:39,774 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2021-12-22 20:11:39,800 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-22 20:11:39,801 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-22 20:11:39,801 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-22 20:11:39,801 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-22 20:11:39,802 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-22 20:11:39,802 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-22 20:11:39,802 INFO L138 SettingsManager]: * Use SBE=true [2021-12-22 20:11:39,802 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-12-22 20:11:39,802 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-12-22 20:11:39,803 INFO L138 SettingsManager]: * Use old map elimination=false [2021-12-22 20:11:39,803 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-12-22 20:11:39,803 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-12-22 20:11:39,803 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-12-22 20:11:39,804 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-22 20:11:39,804 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-22 20:11:39,804 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-22 20:11:39,804 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-22 20:11:39,804 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-22 20:11:39,804 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-22 20:11:39,804 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-12-22 20:11:39,805 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-12-22 20:11:39,805 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-12-22 20:11:39,805 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-22 20:11:39,805 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-22 20:11:39,805 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-12-22 20:11:39,805 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-22 20:11:39,805 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-12-22 20:11:39,806 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-22 20:11:39,806 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-22 20:11:39,806 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-22 20:11:39,806 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-22 20:11:39,806 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-22 20:11:39,807 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-12-22 20:11:39,807 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 -> 121046493a5b65b32f3b8bf8adee655ff03b45acd38f0a8519ee3c99065fa840 [2021-12-22 20:11:40,000 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-22 20:11:40,015 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-22 20:11:40,018 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-22 20:11:40,019 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-22 20:11:40,019 INFO L275 PluginConnector]: CDTParser initialized [2021-12-22 20:11:40,020 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loops/bubble_sort-1.c [2021-12-22 20:11:40,069 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd09b4f0b/b66025390f5e46a3914995f219d50261/FLAG19c99a95d [2021-12-22 20:11:40,428 INFO L306 CDTParser]: Found 1 translation units. [2021-12-22 20:11:40,428 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops/bubble_sort-1.c [2021-12-22 20:11:40,434 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd09b4f0b/b66025390f5e46a3914995f219d50261/FLAG19c99a95d [2021-12-22 20:11:40,443 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd09b4f0b/b66025390f5e46a3914995f219d50261 [2021-12-22 20:11:40,445 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-22 20:11:40,446 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-22 20:11:40,447 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-22 20:11:40,447 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-22 20:11:40,449 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-22 20:11:40,450 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.12 08:11:40" (1/1) ... [2021-12-22 20:11:40,451 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c7f677f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 08:11:40, skipping insertion in model container [2021-12-22 20:11:40,451 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.12 08:11:40" (1/1) ... [2021-12-22 20:11:40,455 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-22 20:11:40,465 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-22 20:11:40,585 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/loops/bubble_sort-1.c[325,338] [2021-12-22 20:11:40,626 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-22 20:11:40,632 INFO L203 MainTranslator]: Completed pre-run [2021-12-22 20:11:40,640 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/loops/bubble_sort-1.c[325,338] [2021-12-22 20:11:40,649 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-22 20:11:40,657 INFO L208 MainTranslator]: Completed translation [2021-12-22 20:11:40,658 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 08:11:40 WrapperNode [2021-12-22 20:11:40,658 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-22 20:11:40,659 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-22 20:11:40,659 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-22 20:11:40,660 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-22 20:11:40,665 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 08:11:40" (1/1) ... [2021-12-22 20:11:40,681 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 08:11:40" (1/1) ... [2021-12-22 20:11:40,709 INFO L137 Inliner]: procedures = 17, calls = 29, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 117 [2021-12-22 20:11:40,710 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-22 20:11:40,710 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-22 20:11:40,710 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-22 20:11:40,710 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-22 20:11:40,716 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 08:11:40" (1/1) ... [2021-12-22 20:11:40,716 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 08:11:40" (1/1) ... [2021-12-22 20:11:40,726 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 08:11:40" (1/1) ... [2021-12-22 20:11:40,727 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 08:11:40" (1/1) ... [2021-12-22 20:11:40,734 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 08:11:40" (1/1) ... [2021-12-22 20:11:40,744 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 08:11:40" (1/1) ... [2021-12-22 20:11:40,745 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 08:11:40" (1/1) ... [2021-12-22 20:11:40,746 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-22 20:11:40,747 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-22 20:11:40,747 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-22 20:11:40,747 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-22 20:11:40,754 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 08:11:40" (1/1) ... [2021-12-22 20:11:40,759 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-22 20:11:40,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 20:11:40,785 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) [2021-12-22 20:11:40,802 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 [2021-12-22 20:11:40,817 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-22 20:11:40,818 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-22 20:11:40,818 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-22 20:11:40,818 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-22 20:11:40,818 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-22 20:11:40,818 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-22 20:11:40,818 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-22 20:11:40,819 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-22 20:11:40,883 INFO L234 CfgBuilder]: Building ICFG [2021-12-22 20:11:40,885 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-22 20:11:41,071 INFO L275 CfgBuilder]: Performing block encoding [2021-12-22 20:11:41,076 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-22 20:11:41,076 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2021-12-22 20:11:41,078 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 08:11:41 BoogieIcfgContainer [2021-12-22 20:11:41,078 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-22 20:11:41,078 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-12-22 20:11:41,079 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-12-22 20:11:41,082 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-12-22 20:11:41,083 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-22 20:11:41,083 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.12 08:11:40" (1/3) ... [2021-12-22 20:11:41,083 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@fcdddae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.12 08:11:41, skipping insertion in model container [2021-12-22 20:11:41,084 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-22 20:11:41,084 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 08:11:40" (2/3) ... [2021-12-22 20:11:41,084 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@fcdddae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.12 08:11:41, skipping insertion in model container [2021-12-22 20:11:41,084 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-22 20:11:41,084 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 08:11:41" (3/3) ... [2021-12-22 20:11:41,085 INFO L388 chiAutomizerObserver]: Analyzing ICFG bubble_sort-1.c [2021-12-22 20:11:41,114 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-12-22 20:11:41,114 INFO L360 BuchiCegarLoop]: Hoare is false [2021-12-22 20:11:41,114 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-12-22 20:11:41,114 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-12-22 20:11:41,114 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-12-22 20:11:41,114 INFO L364 BuchiCegarLoop]: Difference is false [2021-12-22 20:11:41,115 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-12-22 20:11:41,115 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-12-22 20:11:41,126 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 27 states, 26 states have (on average 1.6923076923076923) internal successors, (44), 26 states have internal predecessors, (44), 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) [2021-12-22 20:11:41,149 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 14 [2021-12-22 20:11:41,150 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-22 20:11:41,150 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-22 20:11:41,155 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2021-12-22 20:11:41,155 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-22 20:11:41,156 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-12-22 20:11:41,156 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 27 states, 26 states have (on average 1.6923076923076923) internal successors, (44), 26 states have internal predecessors, (44), 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) [2021-12-22 20:11:41,159 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 14 [2021-12-22 20:11:41,159 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-22 20:11:41,160 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-22 20:11:41,160 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2021-12-22 20:11:41,160 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-22 20:11:41,166 INFO L791 eck$LassoCheckResult]: Stem: 19#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(16, 2);call #Ultimate.allocInit(12, 3); 7#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_~argc#1, main_~#argv#1.base, main_~#argv#1.offset;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;assume { :begin_inline_q1 } true;q1_#in~argc#1, q1_#in~argv#1.base, q1_#in~argv#1.offset := main_~argc#1, main_~#argv#1.base, main_~#argv#1.offset;havoc q1_#t~nondet16#1, q1_#t~switch17#1, q1_#t~pre18#1, q1_#t~pre19#1, q1_#t~pre20#1, q1_#t~nondet22#1, q1_#t~mem23#1, q1_#t~mem24#1, q1_#t~post21#1, q1_~r~0#1, q1_~temp~0#1, q1_~argc#1, q1_~argv#1.base, q1_~argv#1.offset, q1_~N~0#1, q1_~#a~1#1.base, q1_~#a~1#1.offset, q1_~i~1#1;q1_~argc#1 := q1_#in~argc#1;q1_~argv#1.base, q1_~argv#1.offset := q1_#in~argv#1.base, q1_#in~argv#1.offset; 6#L56true assume !(q1_~argc#1 < 2);q1_~N~0#1 := q1_#t~nondet16#1;havoc q1_#t~nondet16#1;call q1_~#a~1#1.base, q1_~#a~1#1.offset := #Ultimate.allocOnStack(4 * q1_~N~0#1);havoc q1_~i~1#1;q1_#t~switch17#1 := false; 27#L65true assume q1_#t~switch17#1;q1_~i~1#1 := 0; 11#L66-3true [2021-12-22 20:11:41,166 INFO L793 eck$LassoCheckResult]: Loop: 11#L66-3true assume !!(q1_~i~1#1 < q1_~N~0#1);call write~int(q1_~i~1#1, q1_~#a~1#1.base, q1_~#a~1#1.offset + 4 * q1_~i~1#1, 4); 12#L66-2true q1_#t~pre18#1 := 1 + q1_~i~1#1;q1_~i~1#1 := 1 + q1_~i~1#1;havoc q1_#t~pre18#1; 11#L66-3true [2021-12-22 20:11:41,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 20:11:41,175 INFO L85 PathProgramCache]: Analyzing trace with hash 925670, now seen corresponding path program 1 times [2021-12-22 20:11:41,182 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 20:11:41,183 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223899412] [2021-12-22 20:11:41,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 20:11:41,184 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 20:11:41,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 20:11:41,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 20:11:41,317 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 20:11:41,318 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223899412] [2021-12-22 20:11:41,319 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1223899412] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 20:11:41,319 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 20:11:41,319 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-22 20:11:41,321 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410451611] [2021-12-22 20:11:41,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 20:11:41,324 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-22 20:11:41,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 20:11:41,327 INFO L85 PathProgramCache]: Analyzing trace with hash 1539, now seen corresponding path program 1 times [2021-12-22 20:11:41,327 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 20:11:41,327 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367623573] [2021-12-22 20:11:41,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 20:11:41,328 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 20:11:41,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-22 20:11:41,348 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-22 20:11:41,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-22 20:11:41,372 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-22 20:11:41,437 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 20:11:41,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-22 20:11:41,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-22 20:11:41,458 INFO L87 Difference]: Start difference. First operand has 27 states, 26 states have (on average 1.6923076923076923) internal successors, (44), 26 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 20:11:41,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 20:11:41,476 INFO L93 Difference]: Finished difference Result 24 states and 31 transitions. [2021-12-22 20:11:41,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-22 20:11:41,482 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 31 transitions. [2021-12-22 20:11:41,485 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2021-12-22 20:11:41,488 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 19 states and 25 transitions. [2021-12-22 20:11:41,489 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2021-12-22 20:11:41,489 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2021-12-22 20:11:41,489 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 25 transitions. [2021-12-22 20:11:41,490 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-22 20:11:41,490 INFO L681 BuchiCegarLoop]: Abstraction has 19 states and 25 transitions. [2021-12-22 20:11:41,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 25 transitions. [2021-12-22 20:11:41,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2021-12-22 20:11:41,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 17 states have internal predecessors, (24), 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) [2021-12-22 20:11:41,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 24 transitions. [2021-12-22 20:11:41,510 INFO L704 BuchiCegarLoop]: Abstraction has 18 states and 24 transitions. [2021-12-22 20:11:41,510 INFO L587 BuchiCegarLoop]: Abstraction has 18 states and 24 transitions. [2021-12-22 20:11:41,510 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-12-22 20:11:41,510 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 24 transitions. [2021-12-22 20:11:41,512 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2021-12-22 20:11:41,512 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-22 20:11:41,512 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-22 20:11:41,512 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2021-12-22 20:11:41,512 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-22 20:11:41,513 INFO L791 eck$LassoCheckResult]: Stem: 60#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(16, 2);call #Ultimate.allocInit(12, 3); 61#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_~argc#1, main_~#argv#1.base, main_~#argv#1.offset;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;assume { :begin_inline_q1 } true;q1_#in~argc#1, q1_#in~argv#1.base, q1_#in~argv#1.offset := main_~argc#1, main_~#argv#1.base, main_~#argv#1.offset;havoc q1_#t~nondet16#1, q1_#t~switch17#1, q1_#t~pre18#1, q1_#t~pre19#1, q1_#t~pre20#1, q1_#t~nondet22#1, q1_#t~mem23#1, q1_#t~mem24#1, q1_#t~post21#1, q1_~r~0#1, q1_~temp~0#1, q1_~argc#1, q1_~argv#1.base, q1_~argv#1.offset, q1_~N~0#1, q1_~#a~1#1.base, q1_~#a~1#1.offset, q1_~i~1#1;q1_~argc#1 := q1_#in~argc#1;q1_~argv#1.base, q1_~argv#1.offset := q1_#in~argv#1.base, q1_#in~argv#1.offset; 64#L56 assume !(q1_~argc#1 < 2);q1_~N~0#1 := q1_#t~nondet16#1;havoc q1_#t~nondet16#1;call q1_~#a~1#1.base, q1_~#a~1#1.offset := #Ultimate.allocOnStack(4 * q1_~N~0#1);havoc q1_~i~1#1;q1_#t~switch17#1 := false; 65#L65 assume !q1_#t~switch17#1;q1_#t~switch17#1 := q1_#t~switch17#1; 77#L69 assume !q1_#t~switch17#1;q1_#t~switch17#1 := true; 76#L73 assume q1_#t~switch17#1;q1_~i~1#1 := 0; 71#L74-3 [2021-12-22 20:11:41,514 INFO L793 eck$LassoCheckResult]: Loop: 71#L74-3 assume !!(q1_~i~1#1 < q1_~N~0#1);call write~int(q1_~i~1#1, q1_~#a~1#1.base, q1_~#a~1#1.offset + 4 * q1_~i~1#1, 4); 70#L74-2 q1_#t~pre20#1 := 1 + q1_~i~1#1;q1_~i~1#1 := 1 + q1_~i~1#1;havoc q1_#t~pre20#1; 71#L74-3 [2021-12-22 20:11:41,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 20:11:41,515 INFO L85 PathProgramCache]: Analyzing trace with hash 889584664, now seen corresponding path program 1 times [2021-12-22 20:11:41,516 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 20:11:41,516 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754338608] [2021-12-22 20:11:41,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 20:11:41,517 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 20:11:41,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-22 20:11:41,546 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-22 20:11:41,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-22 20:11:41,557 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-22 20:11:41,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 20:11:41,558 INFO L85 PathProgramCache]: Analyzing trace with hash 2691, now seen corresponding path program 1 times [2021-12-22 20:11:41,558 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 20:11:41,558 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192394404] [2021-12-22 20:11:41,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 20:11:41,559 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 20:11:41,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-22 20:11:41,570 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-22 20:11:41,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-22 20:11:41,596 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-22 20:11:41,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 20:11:41,596 INFO L85 PathProgramCache]: Analyzing trace with hash 192371930, now seen corresponding path program 1 times [2021-12-22 20:11:41,596 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 20:11:41,596 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848034718] [2021-12-22 20:11:41,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 20:11:41,597 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 20:11:41,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-22 20:11:41,611 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-22 20:11:41,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-22 20:11:41,647 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-22 20:11:42,154 INFO L210 LassoAnalysis]: Preferences: [2021-12-22 20:11:42,155 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-22 20:11:42,155 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-22 20:11:42,155 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-22 20:11:42,156 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-22 20:11:42,156 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-22 20:11:42,156 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-22 20:11:42,156 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-22 20:11:42,156 INFO L133 ssoRankerPreferences]: Filename of dumped script: bubble_sort-1.c_Iteration2_Lasso [2021-12-22 20:11:42,156 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-22 20:11:42,156 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-22 20:11:42,167 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-22 20:11:42,171 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-22 20:11:42,357 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-22 20:11:42,359 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-22 20:11:42,361 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-22 20:11:42,368 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-22 20:11:42,371 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-22 20:11:42,372 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-22 20:11:42,374 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-22 20:11:42,376 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-22 20:11:42,378 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-22 20:11:42,393 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-22 20:11:42,396 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-22 20:11:42,422 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-22 20:11:42,431 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-22 20:11:42,437 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-22 20:11:42,438 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-22 20:11:42,439 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-22 20:11:42,682 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-22 20:11:42,686 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-22 20:11:42,687 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-22 20:11:42,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 20:11:42,689 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) [2021-12-22 20:11:42,690 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 [2021-12-22 20:11:42,691 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 [2021-12-22 20:11:42,698 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-22 20:11:42,698 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-22 20:11:42,698 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-22 20:11:42,698 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-22 20:11:42,699 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-22 20:11:42,700 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-22 20:11:42,700 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-22 20:11:42,708 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-22 20:11:42,727 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2021-12-22 20:11:42,728 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-22 20:11:42,728 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 20:11:42,744 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) [2021-12-22 20:11:42,745 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 [2021-12-22 20:11:42,747 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 [2021-12-22 20:11:42,753 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-22 20:11:42,753 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-22 20:11:42,753 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-22 20:11:42,753 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-22 20:11:42,756 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-22 20:11:42,756 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-22 20:11:42,771 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-22 20:11:42,789 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 [2021-12-22 20:11:42,790 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-22 20:11:42,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 20:11:42,791 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) [2021-12-22 20:11:42,792 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 [2021-12-22 20:11:42,793 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 [2021-12-22 20:11:42,799 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-22 20:11:42,799 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-22 20:11:42,799 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-22 20:11:42,799 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-22 20:11:42,802 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-22 20:11:42,802 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-22 20:11:42,822 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-22 20:11:42,840 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2021-12-22 20:11:42,840 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-22 20:11:42,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 20:11:42,841 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) [2021-12-22 20:11:42,842 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 [2021-12-22 20:11:42,843 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 [2021-12-22 20:11:42,849 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-22 20:11:42,849 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-22 20:11:42,849 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-22 20:11:42,849 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-22 20:11:42,853 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-22 20:11:42,854 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-22 20:11:42,865 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-22 20:11:42,880 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 [2021-12-22 20:11:42,881 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-22 20:11:42,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 20:11:42,882 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) [2021-12-22 20:11:42,882 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 [2021-12-22 20:11:42,883 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 [2021-12-22 20:11:42,889 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-22 20:11:42,890 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-22 20:11:42,890 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-22 20:11:42,890 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-22 20:11:42,892 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-22 20:11:42,892 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-22 20:11:42,904 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-22 20:11:42,932 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2021-12-22 20:11:42,932 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-22 20:11:42,933 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 20:11:42,933 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) [2021-12-22 20:11:42,934 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 [2021-12-22 20:11:42,935 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 [2021-12-22 20:11:42,942 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-22 20:11:42,942 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-22 20:11:42,942 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-22 20:11:42,943 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-22 20:11:42,944 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-22 20:11:42,944 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-22 20:11:42,959 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-22 20:11:42,989 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 [2021-12-22 20:11:42,989 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-22 20:11:42,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 20:11:42,991 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) [2021-12-22 20:11:42,992 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 [2021-12-22 20:11:42,994 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 [2021-12-22 20:11:43,001 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-22 20:11:43,001 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-22 20:11:43,001 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-22 20:11:43,001 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-22 20:11:43,008 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-22 20:11:43,008 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-22 20:11:43,031 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-22 20:11:43,051 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 [2021-12-22 20:11:43,051 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-22 20:11:43,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 20:11:43,052 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) [2021-12-22 20:11:43,053 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 [2021-12-22 20:11:43,054 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 [2021-12-22 20:11:43,061 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-22 20:11:43,062 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-22 20:11:43,062 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-22 20:11:43,062 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-22 20:11:43,064 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-22 20:11:43,064 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-22 20:11:43,082 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-22 20:11:43,097 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2021-12-22 20:11:43,098 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-22 20:11:43,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 20:11:43,099 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) [2021-12-22 20:11:43,099 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 [2021-12-22 20:11:43,100 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 [2021-12-22 20:11:43,107 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-22 20:11:43,107 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-22 20:11:43,107 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-22 20:11:43,107 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-22 20:11:43,109 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-22 20:11:43,109 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-22 20:11:43,111 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-22 20:11:43,126 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 [2021-12-22 20:11:43,126 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-22 20:11:43,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 20:11:43,127 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) [2021-12-22 20:11:43,130 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 [2021-12-22 20:11:43,131 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 [2021-12-22 20:11:43,137 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-22 20:11:43,137 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-22 20:11:43,137 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-22 20:11:43,137 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-22 20:11:43,142 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-22 20:11:43,142 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-22 20:11:43,155 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-22 20:11:43,197 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2021-12-22 20:11:43,197 INFO L444 ModelExtractionUtils]: 8 out of 16 variables were initially zero. Simplification set additionally 5 variables to zero. [2021-12-22 20:11:43,198 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-22 20:11:43,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 20:11:43,211 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) [2021-12-22 20:11:43,256 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 [2021-12-22 20:11:43,256 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-22 20:11:43,280 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-12-22 20:11:43,281 INFO L513 LassoAnalysis]: Proved termination. [2021-12-22 20:11:43,281 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_q1_~i~1#1, ULTIMATE.start_q1_~N~0#1) = -1*ULTIMATE.start_q1_~i~1#1 + 1*ULTIMATE.start_q1_~N~0#1 Supporting invariants [] [2021-12-22 20:11:43,299 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 [2021-12-22 20:11:43,311 INFO L297 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2021-12-22 20:11:43,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 20:11:43,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 20:11:43,354 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-22 20:11:43,355 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 20:11:43,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 20:11:43,372 INFO L263 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-22 20:11:43,372 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 20:11:43,385 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 20:11:43,388 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 [2021-12-22 20:11:43,389 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 24 transitions. cyclomatic complexity: 9 Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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) [2021-12-22 20:11:43,415 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 24 transitions. cyclomatic complexity: 9. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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 28 states and 40 transitions. Complement of second has 7 states. [2021-12-22 20:11:43,416 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 [2021-12-22 20:11:43,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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) [2021-12-22 20:11:43,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 20 transitions. [2021-12-22 20:11:43,418 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 20 transitions. Stem has 6 letters. Loop has 2 letters. [2021-12-22 20:11:43,418 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-22 20:11:43,418 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 20 transitions. Stem has 8 letters. Loop has 2 letters. [2021-12-22 20:11:43,418 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-22 20:11:43,418 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 20 transitions. Stem has 6 letters. Loop has 4 letters. [2021-12-22 20:11:43,419 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-22 20:11:43,419 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 40 transitions. [2021-12-22 20:11:43,420 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14 [2021-12-22 20:11:43,420 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 26 states and 36 transitions. [2021-12-22 20:11:43,420 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2021-12-22 20:11:43,420 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2021-12-22 20:11:43,420 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 36 transitions. [2021-12-22 20:11:43,421 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-22 20:11:43,421 INFO L681 BuchiCegarLoop]: Abstraction has 26 states and 36 transitions. [2021-12-22 20:11:43,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 36 transitions. [2021-12-22 20:11:43,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 19. [2021-12-22 20:11:43,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.368421052631579) internal successors, (26), 18 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 20:11:43,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 26 transitions. [2021-12-22 20:11:43,422 INFO L704 BuchiCegarLoop]: Abstraction has 19 states and 26 transitions. [2021-12-22 20:11:43,422 INFO L587 BuchiCegarLoop]: Abstraction has 19 states and 26 transitions. [2021-12-22 20:11:43,422 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-12-22 20:11:43,422 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 26 transitions. [2021-12-22 20:11:43,423 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2021-12-22 20:11:43,423 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-22 20:11:43,423 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-22 20:11:43,423 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2021-12-22 20:11:43,423 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-12-22 20:11:43,423 INFO L791 eck$LassoCheckResult]: Stem: 178#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(16, 2);call #Ultimate.allocInit(12, 3); 179#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_~argc#1, main_~#argv#1.base, main_~#argv#1.offset;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;assume { :begin_inline_q1 } true;q1_#in~argc#1, q1_#in~argv#1.base, q1_#in~argv#1.offset := main_~argc#1, main_~#argv#1.base, main_~#argv#1.offset;havoc q1_#t~nondet16#1, q1_#t~switch17#1, q1_#t~pre18#1, q1_#t~pre19#1, q1_#t~pre20#1, q1_#t~nondet22#1, q1_#t~mem23#1, q1_#t~mem24#1, q1_#t~post21#1, q1_~r~0#1, q1_~temp~0#1, q1_~argc#1, q1_~argv#1.base, q1_~argv#1.offset, q1_~N~0#1, q1_~#a~1#1.base, q1_~#a~1#1.offset, q1_~i~1#1;q1_~argc#1 := q1_#in~argc#1;q1_~argv#1.base, q1_~argv#1.offset := q1_#in~argv#1.base, q1_#in~argv#1.offset; 182#L56 assume !(q1_~argc#1 < 2);q1_~N~0#1 := q1_#t~nondet16#1;havoc q1_#t~nondet16#1;call q1_~#a~1#1.base, q1_~#a~1#1.offset := #Ultimate.allocOnStack(4 * q1_~N~0#1);havoc q1_~i~1#1;q1_#t~switch17#1 := false; 183#L65 assume !q1_#t~switch17#1;q1_#t~switch17#1 := q1_#t~switch17#1; 196#L69 assume !q1_#t~switch17#1;q1_#t~switch17#1 := true; 194#L73 assume !q1_#t~switch17#1; 180#L63 havoc q1_#t~switch17#1;assume { :begin_inline_bubblesort } true;bubblesort_#in~size#1, bubblesort_#in~item#1.base, bubblesort_#in~item#1.offset := q1_~N~0#1, q1_~#a~1#1.base, q1_~#a~1#1.offset;havoc bubblesort_#t~mem6#1, bubblesort_#t~mem7#1, bubblesort_#t~mem8#1, bubblesort_#t~mem9#1, bubblesort_#t~pre5#1, bubblesort_#t~pre4#1, bubblesort_~size#1, bubblesort_~item#1.base, bubblesort_~item#1.offset, bubblesort_~a~0#1, bubblesort_~b~0#1, bubblesort_~t~0#1;bubblesort_~size#1 := bubblesort_#in~size#1;bubblesort_~item#1.base, bubblesort_~item#1.offset := bubblesort_#in~item#1.base, bubblesort_#in~item#1.offset;havoc bubblesort_~a~0#1;havoc bubblesort_~b~0#1;havoc bubblesort_~t~0#1;bubblesort_~a~0#1 := 1; 181#L18-3 [2021-12-22 20:11:43,423 INFO L793 eck$LassoCheckResult]: Loop: 181#L18-3 assume !!(bubblesort_~a~0#1 < bubblesort_~size#1);bubblesort_~b~0#1 := bubblesort_~size#1 - 1; 192#L20-3 assume !(bubblesort_~b~0#1 >= bubblesort_~a~0#1); 191#L18-2 bubblesort_#t~pre4#1 := 1 + bubblesort_~a~0#1;bubblesort_~a~0#1 := 1 + bubblesort_~a~0#1;havoc bubblesort_#t~pre4#1; 181#L18-3 [2021-12-22 20:11:43,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 20:11:43,424 INFO L85 PathProgramCache]: Analyzing trace with hash 1807321784, now seen corresponding path program 1 times [2021-12-22 20:11:43,424 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 20:11:43,424 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750842372] [2021-12-22 20:11:43,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 20:11:43,424 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 20:11:43,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 20:11:43,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 20:11:43,456 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 20:11:43,456 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750842372] [2021-12-22 20:11:43,457 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1750842372] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 20:11:43,457 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 20:11:43,457 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-22 20:11:43,457 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251278246] [2021-12-22 20:11:43,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 20:11:43,458 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-22 20:11:43,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 20:11:43,458 INFO L85 PathProgramCache]: Analyzing trace with hash 114407, now seen corresponding path program 1 times [2021-12-22 20:11:43,458 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 20:11:43,459 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834663396] [2021-12-22 20:11:43,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 20:11:43,459 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 20:11:43,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 20:11:43,475 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 20:11:43,476 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 20:11:43,477 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834663396] [2021-12-22 20:11:43,477 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834663396] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 20:11:43,477 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 20:11:43,477 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-22 20:11:43,478 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396631580] [2021-12-22 20:11:43,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 20:11:43,480 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-22 20:11:43,480 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 20:11:43,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-22 20:11:43,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-22 20:11:43,481 INFO L87 Difference]: Start difference. First operand 19 states and 26 transitions. cyclomatic complexity: 10 Second operand has 3 states, 3 states have (on average 1.0) internal successors, (3), 2 states have internal predecessors, (3), 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) [2021-12-22 20:11:43,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 20:11:43,495 INFO L93 Difference]: Finished difference Result 20 states and 27 transitions. [2021-12-22 20:11:43,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-22 20:11:43,496 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 27 transitions. [2021-12-22 20:11:43,497 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2021-12-22 20:11:43,498 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 20 states and 27 transitions. [2021-12-22 20:11:43,498 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2021-12-22 20:11:43,498 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2021-12-22 20:11:43,499 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 27 transitions. [2021-12-22 20:11:43,499 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-22 20:11:43,499 INFO L681 BuchiCegarLoop]: Abstraction has 20 states and 27 transitions. [2021-12-22 20:11:43,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 27 transitions. [2021-12-22 20:11:43,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2021-12-22 20:11:43,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.35) internal successors, (27), 19 states have internal predecessors, (27), 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) [2021-12-22 20:11:43,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 27 transitions. [2021-12-22 20:11:43,502 INFO L704 BuchiCegarLoop]: Abstraction has 20 states and 27 transitions. [2021-12-22 20:11:43,502 INFO L587 BuchiCegarLoop]: Abstraction has 20 states and 27 transitions. [2021-12-22 20:11:43,502 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-12-22 20:11:43,502 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 27 transitions. [2021-12-22 20:11:43,502 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2021-12-22 20:11:43,503 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-22 20:11:43,503 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-22 20:11:43,503 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2021-12-22 20:11:43,504 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2021-12-22 20:11:43,504 INFO L791 eck$LassoCheckResult]: Stem: 224#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(16, 2);call #Ultimate.allocInit(12, 3); 225#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_~argc#1, main_~#argv#1.base, main_~#argv#1.offset;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;assume { :begin_inline_q1 } true;q1_#in~argc#1, q1_#in~argv#1.base, q1_#in~argv#1.offset := main_~argc#1, main_~#argv#1.base, main_~#argv#1.offset;havoc q1_#t~nondet16#1, q1_#t~switch17#1, q1_#t~pre18#1, q1_#t~pre19#1, q1_#t~pre20#1, q1_#t~nondet22#1, q1_#t~mem23#1, q1_#t~mem24#1, q1_#t~post21#1, q1_~r~0#1, q1_~temp~0#1, q1_~argc#1, q1_~argv#1.base, q1_~argv#1.offset, q1_~N~0#1, q1_~#a~1#1.base, q1_~#a~1#1.offset, q1_~i~1#1;q1_~argc#1 := q1_#in~argc#1;q1_~argv#1.base, q1_~argv#1.offset := q1_#in~argv#1.base, q1_#in~argv#1.offset; 228#L56 assume !(q1_~argc#1 < 2);q1_~N~0#1 := q1_#t~nondet16#1;havoc q1_#t~nondet16#1;call q1_~#a~1#1.base, q1_~#a~1#1.offset := #Ultimate.allocOnStack(4 * q1_~N~0#1);havoc q1_~i~1#1;q1_#t~switch17#1 := false; 229#L65 assume !q1_#t~switch17#1;q1_#t~switch17#1 := q1_#t~switch17#1; 243#L69 assume !q1_#t~switch17#1;q1_#t~switch17#1 := true; 241#L73 assume !q1_#t~switch17#1; 226#L63 havoc q1_#t~switch17#1;assume { :begin_inline_bubblesort } true;bubblesort_#in~size#1, bubblesort_#in~item#1.base, bubblesort_#in~item#1.offset := q1_~N~0#1, q1_~#a~1#1.base, q1_~#a~1#1.offset;havoc bubblesort_#t~mem6#1, bubblesort_#t~mem7#1, bubblesort_#t~mem8#1, bubblesort_#t~mem9#1, bubblesort_#t~pre5#1, bubblesort_#t~pre4#1, bubblesort_~size#1, bubblesort_~item#1.base, bubblesort_~item#1.offset, bubblesort_~a~0#1, bubblesort_~b~0#1, bubblesort_~t~0#1;bubblesort_~size#1 := bubblesort_#in~size#1;bubblesort_~item#1.base, bubblesort_~item#1.offset := bubblesort_#in~item#1.base, bubblesort_#in~item#1.offset;havoc bubblesort_~a~0#1;havoc bubblesort_~b~0#1;havoc bubblesort_~t~0#1;bubblesort_~a~0#1 := 1; 227#L18-3 [2021-12-22 20:11:43,504 INFO L793 eck$LassoCheckResult]: Loop: 227#L18-3 assume !!(bubblesort_~a~0#1 < bubblesort_~size#1);bubblesort_~b~0#1 := bubblesort_~size#1 - 1; 238#L20-3 assume !!(bubblesort_~b~0#1 >= bubblesort_~a~0#1); 239#L23 assume !(bubblesort_~b~0#1 - 1 < bubblesort_~size#1 && bubblesort_~b~0#1 < bubblesort_~size#1); 233#L20-2 bubblesort_#t~pre5#1 := bubblesort_~b~0#1 - 1;bubblesort_~b~0#1 := bubblesort_~b~0#1 - 1;havoc bubblesort_#t~pre5#1; 240#L20-3 assume !(bubblesort_~b~0#1 >= bubblesort_~a~0#1); 237#L18-2 bubblesort_#t~pre4#1 := 1 + bubblesort_~a~0#1;bubblesort_~a~0#1 := 1 + bubblesort_~a~0#1;havoc bubblesort_#t~pre4#1; 227#L18-3 [2021-12-22 20:11:43,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 20:11:43,505 INFO L85 PathProgramCache]: Analyzing trace with hash 1807321784, now seen corresponding path program 2 times [2021-12-22 20:11:43,505 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 20:11:43,505 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200392351] [2021-12-22 20:11:43,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 20:11:43,505 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 20:11:43,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 20:11:43,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 20:11:43,541 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 20:11:43,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200392351] [2021-12-22 20:11:43,541 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1200392351] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 20:11:43,541 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 20:11:43,541 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-22 20:11:43,542 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582145348] [2021-12-22 20:11:43,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 20:11:43,542 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-22 20:11:43,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 20:11:43,542 INFO L85 PathProgramCache]: Analyzing trace with hash -884895266, now seen corresponding path program 1 times [2021-12-22 20:11:43,543 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 20:11:43,543 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13428506] [2021-12-22 20:11:43,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 20:11:43,543 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 20:11:43,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 20:11:43,557 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 20:11:43,558 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 20:11:43,558 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13428506] [2021-12-22 20:11:43,558 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [13428506] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 20:11:43,558 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 20:11:43,558 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-22 20:11:43,559 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711958264] [2021-12-22 20:11:43,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 20:11:43,559 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-22 20:11:43,559 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 20:11:43,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-22 20:11:43,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-22 20:11:43,561 INFO L87 Difference]: Start difference. First operand 20 states and 27 transitions. cyclomatic complexity: 10 Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 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) [2021-12-22 20:11:43,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 20:11:43,572 INFO L93 Difference]: Finished difference Result 21 states and 27 transitions. [2021-12-22 20:11:43,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-22 20:11:43,573 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 27 transitions. [2021-12-22 20:11:43,575 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2021-12-22 20:11:43,577 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 21 states and 27 transitions. [2021-12-22 20:11:43,577 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2021-12-22 20:11:43,577 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2021-12-22 20:11:43,577 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 27 transitions. [2021-12-22 20:11:43,578 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-22 20:11:43,578 INFO L681 BuchiCegarLoop]: Abstraction has 21 states and 27 transitions. [2021-12-22 20:11:43,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 27 transitions. [2021-12-22 20:11:43,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2021-12-22 20:11:43,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.3) internal successors, (26), 19 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 20:11:43,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 26 transitions. [2021-12-22 20:11:43,580 INFO L704 BuchiCegarLoop]: Abstraction has 20 states and 26 transitions. [2021-12-22 20:11:43,581 INFO L587 BuchiCegarLoop]: Abstraction has 20 states and 26 transitions. [2021-12-22 20:11:43,581 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2021-12-22 20:11:43,581 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 26 transitions. [2021-12-22 20:11:43,582 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2021-12-22 20:11:43,582 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-22 20:11:43,582 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-22 20:11:43,582 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2021-12-22 20:11:43,582 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2021-12-22 20:11:43,582 INFO L791 eck$LassoCheckResult]: Stem: 272#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(16, 2);call #Ultimate.allocInit(12, 3); 273#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_~argc#1, main_~#argv#1.base, main_~#argv#1.offset;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;assume { :begin_inline_q1 } true;q1_#in~argc#1, q1_#in~argv#1.base, q1_#in~argv#1.offset := main_~argc#1, main_~#argv#1.base, main_~#argv#1.offset;havoc q1_#t~nondet16#1, q1_#t~switch17#1, q1_#t~pre18#1, q1_#t~pre19#1, q1_#t~pre20#1, q1_#t~nondet22#1, q1_#t~mem23#1, q1_#t~mem24#1, q1_#t~post21#1, q1_~r~0#1, q1_~temp~0#1, q1_~argc#1, q1_~argv#1.base, q1_~argv#1.offset, q1_~N~0#1, q1_~#a~1#1.base, q1_~#a~1#1.offset, q1_~i~1#1;q1_~argc#1 := q1_#in~argc#1;q1_~argv#1.base, q1_~argv#1.offset := q1_#in~argv#1.base, q1_#in~argv#1.offset; 276#L56 assume !(q1_~argc#1 < 2);q1_~N~0#1 := q1_#t~nondet16#1;havoc q1_#t~nondet16#1;call q1_~#a~1#1.base, q1_~#a~1#1.offset := #Ultimate.allocOnStack(4 * q1_~N~0#1);havoc q1_~i~1#1;q1_#t~switch17#1 := false; 277#L65 assume !q1_#t~switch17#1;q1_#t~switch17#1 := q1_#t~switch17#1; 291#L69 assume !q1_#t~switch17#1;q1_#t~switch17#1 := true; 289#L73 assume !q1_#t~switch17#1; 274#L63 havoc q1_#t~switch17#1;assume { :begin_inline_bubblesort } true;bubblesort_#in~size#1, bubblesort_#in~item#1.base, bubblesort_#in~item#1.offset := q1_~N~0#1, q1_~#a~1#1.base, q1_~#a~1#1.offset;havoc bubblesort_#t~mem6#1, bubblesort_#t~mem7#1, bubblesort_#t~mem8#1, bubblesort_#t~mem9#1, bubblesort_#t~pre5#1, bubblesort_#t~pre4#1, bubblesort_~size#1, bubblesort_~item#1.base, bubblesort_~item#1.offset, bubblesort_~a~0#1, bubblesort_~b~0#1, bubblesort_~t~0#1;bubblesort_~size#1 := bubblesort_#in~size#1;bubblesort_~item#1.base, bubblesort_~item#1.offset := bubblesort_#in~item#1.base, bubblesort_#in~item#1.offset;havoc bubblesort_~a~0#1;havoc bubblesort_~b~0#1;havoc bubblesort_~t~0#1;bubblesort_~a~0#1 := 1; 275#L18-3 [2021-12-22 20:11:43,583 INFO L793 eck$LassoCheckResult]: Loop: 275#L18-3 assume !!(bubblesort_~a~0#1 < bubblesort_~size#1);bubblesort_~b~0#1 := bubblesort_~size#1 - 1; 286#L20-3 assume !!(bubblesort_~b~0#1 >= bubblesort_~a~0#1); 287#L23 assume bubblesort_~b~0#1 - 1 < bubblesort_~size#1 && bubblesort_~b~0#1 < bubblesort_~size#1;call bubblesort_#t~mem6#1 := read~int(bubblesort_~item#1.base, bubblesort_~item#1.offset + 4 * (bubblesort_~b~0#1 - 1), 4);call bubblesort_#t~mem7#1 := read~int(bubblesort_~item#1.base, bubblesort_~item#1.offset + 4 * bubblesort_~b~0#1, 4); 280#L25 assume bubblesort_#t~mem6#1 > bubblesort_#t~mem7#1;havoc bubblesort_#t~mem6#1;havoc bubblesort_#t~mem7#1;call bubblesort_#t~mem8#1 := read~int(bubblesort_~item#1.base, bubblesort_~item#1.offset + 4 * (bubblesort_~b~0#1 - 1), 4);bubblesort_~t~0#1 := bubblesort_#t~mem8#1;havoc bubblesort_#t~mem8#1;call bubblesort_#t~mem9#1 := read~int(bubblesort_~item#1.base, bubblesort_~item#1.offset + 4 * bubblesort_~b~0#1, 4);call write~int(bubblesort_#t~mem9#1, bubblesort_~item#1.base, bubblesort_~item#1.offset + 4 * (bubblesort_~b~0#1 - 1), 4);havoc bubblesort_#t~mem9#1;call write~int(bubblesort_~t~0#1, bubblesort_~item#1.base, bubblesort_~item#1.offset + 4 * bubblesort_~b~0#1, 4); 281#L20-2 bubblesort_#t~pre5#1 := bubblesort_~b~0#1 - 1;bubblesort_~b~0#1 := bubblesort_~b~0#1 - 1;havoc bubblesort_#t~pre5#1; 288#L20-3 assume !(bubblesort_~b~0#1 >= bubblesort_~a~0#1); 285#L18-2 bubblesort_#t~pre4#1 := 1 + bubblesort_~a~0#1;bubblesort_~a~0#1 := 1 + bubblesort_~a~0#1;havoc bubblesort_#t~pre4#1; 275#L18-3 [2021-12-22 20:11:43,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 20:11:43,583 INFO L85 PathProgramCache]: Analyzing trace with hash 1807321784, now seen corresponding path program 3 times [2021-12-22 20:11:43,584 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 20:11:43,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757991554] [2021-12-22 20:11:43,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 20:11:43,584 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 20:11:43,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 20:11:43,604 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 20:11:43,604 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 20:11:43,604 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757991554] [2021-12-22 20:11:43,604 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1757991554] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 20:11:43,604 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 20:11:43,604 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-22 20:11:43,604 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045907765] [2021-12-22 20:11:43,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 20:11:43,605 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-22 20:11:43,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 20:11:43,605 INFO L85 PathProgramCache]: Analyzing trace with hash -1669532239, now seen corresponding path program 1 times [2021-12-22 20:11:43,605 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 20:11:43,605 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567511988] [2021-12-22 20:11:43,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 20:11:43,605 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 20:11:43,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-22 20:11:43,610 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-22 20:11:43,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-22 20:11:43,627 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-22 20:11:43,737 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2021-12-22 20:11:43,764 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 20:11:43,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-22 20:11:43,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-22 20:11:43,765 INFO L87 Difference]: Start difference. First operand 20 states and 26 transitions. cyclomatic complexity: 9 Second operand has 3 states, 3 states have (on average 2.3333333333333335) 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) [2021-12-22 20:11:43,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 20:11:43,772 INFO L93 Difference]: Finished difference Result 20 states and 25 transitions. [2021-12-22 20:11:43,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-22 20:11:43,773 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 25 transitions. [2021-12-22 20:11:43,774 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2021-12-22 20:11:43,774 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 20 states and 25 transitions. [2021-12-22 20:11:43,774 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2021-12-22 20:11:43,774 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2021-12-22 20:11:43,774 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 25 transitions. [2021-12-22 20:11:43,774 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-22 20:11:43,774 INFO L681 BuchiCegarLoop]: Abstraction has 20 states and 25 transitions. [2021-12-22 20:11:43,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 25 transitions. [2021-12-22 20:11:43,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2021-12-22 20:11:43,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.25) internal successors, (25), 19 states have internal predecessors, (25), 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) [2021-12-22 20:11:43,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 25 transitions. [2021-12-22 20:11:43,775 INFO L704 BuchiCegarLoop]: Abstraction has 20 states and 25 transitions. [2021-12-22 20:11:43,775 INFO L587 BuchiCegarLoop]: Abstraction has 20 states and 25 transitions. [2021-12-22 20:11:43,775 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2021-12-22 20:11:43,776 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 25 transitions. [2021-12-22 20:11:43,776 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2021-12-22 20:11:43,776 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-22 20:11:43,776 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-22 20:11:43,776 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 20:11:43,776 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-22 20:11:43,776 INFO L791 eck$LassoCheckResult]: Stem: 318#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(16, 2);call #Ultimate.allocInit(12, 3); 319#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_~argc#1, main_~#argv#1.base, main_~#argv#1.offset;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;assume { :begin_inline_q1 } true;q1_#in~argc#1, q1_#in~argv#1.base, q1_#in~argv#1.offset := main_~argc#1, main_~#argv#1.base, main_~#argv#1.offset;havoc q1_#t~nondet16#1, q1_#t~switch17#1, q1_#t~pre18#1, q1_#t~pre19#1, q1_#t~pre20#1, q1_#t~nondet22#1, q1_#t~mem23#1, q1_#t~mem24#1, q1_#t~post21#1, q1_~r~0#1, q1_~temp~0#1, q1_~argc#1, q1_~argv#1.base, q1_~argv#1.offset, q1_~N~0#1, q1_~#a~1#1.base, q1_~#a~1#1.offset, q1_~i~1#1;q1_~argc#1 := q1_#in~argc#1;q1_~argv#1.base, q1_~argv#1.offset := q1_#in~argv#1.base, q1_#in~argv#1.offset; 322#L56 assume !(q1_~argc#1 < 2);q1_~N~0#1 := q1_#t~nondet16#1;havoc q1_#t~nondet16#1;call q1_~#a~1#1.base, q1_~#a~1#1.offset := #Ultimate.allocOnStack(4 * q1_~N~0#1);havoc q1_~i~1#1;q1_#t~switch17#1 := false; 323#L65 assume !q1_#t~switch17#1;q1_#t~switch17#1 := q1_#t~switch17#1; 337#L69 assume !q1_#t~switch17#1;q1_#t~switch17#1 := true; 335#L73 assume q1_#t~switch17#1;q1_~i~1#1 := 0; 336#L74-3 assume !(q1_~i~1#1 < q1_~N~0#1); 330#L74-4 q1_~i~1#1 := 0; 325#L76-3 [2021-12-22 20:11:43,776 INFO L793 eck$LassoCheckResult]: Loop: 325#L76-3 assume !!(q1_~i~1#1 < q1_~N~0#1);q1_~r~0#1 := q1_~i~1#1 + (if q1_#t~nondet22#1 < 0 && 0 != q1_#t~nondet22#1 % (q1_~N~0#1 - q1_~i~1#1) then (if q1_~N~0#1 - q1_~i~1#1 < 0 then q1_#t~nondet22#1 % (q1_~N~0#1 - q1_~i~1#1) + (q1_~N~0#1 - q1_~i~1#1) else q1_#t~nondet22#1 % (q1_~N~0#1 - q1_~i~1#1) - (q1_~N~0#1 - q1_~i~1#1)) else q1_#t~nondet22#1 % (q1_~N~0#1 - q1_~i~1#1));havoc q1_#t~nondet22#1;call q1_#t~mem23#1 := read~int(q1_~#a~1#1.base, q1_~#a~1#1.offset + 4 * q1_~i~1#1, 4);q1_~temp~0#1 := q1_#t~mem23#1;havoc q1_#t~mem23#1;call q1_#t~mem24#1 := read~int(q1_~#a~1#1.base, q1_~#a~1#1.offset + 4 * q1_~r~0#1, 4);call write~int(q1_#t~mem24#1, q1_~#a~1#1.base, q1_~#a~1#1.offset + 4 * q1_~i~1#1, 4);havoc q1_#t~mem24#1;call write~int(q1_~temp~0#1, q1_~#a~1#1.base, q1_~#a~1#1.offset + 4 * q1_~r~0#1, 4); 324#L76-2 q1_#t~post21#1 := q1_~i~1#1;q1_~i~1#1 := 1 + q1_#t~post21#1;havoc q1_#t~post21#1; 325#L76-3 [2021-12-22 20:11:43,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 20:11:43,777 INFO L85 PathProgramCache]: Analyzing trace with hash 192371872, now seen corresponding path program 1 times [2021-12-22 20:11:43,777 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 20:11:43,777 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236041806] [2021-12-22 20:11:43,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 20:11:43,777 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 20:11:43,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-22 20:11:43,782 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-22 20:11:43,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-22 20:11:43,793 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-22 20:11:43,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 20:11:43,793 INFO L85 PathProgramCache]: Analyzing trace with hash 3139, now seen corresponding path program 1 times [2021-12-22 20:11:43,793 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 20:11:43,793 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098527829] [2021-12-22 20:11:43,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 20:11:43,794 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 20:11:43,798 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-22 20:11:43,799 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1295480520] [2021-12-22 20:11:43,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 20:11:43,799 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 20:11:43,799 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 20:11:43,801 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-22 20:11:43,802 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2021-12-22 20:11:43,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-22 20:11:43,830 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-22 20:11:43,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-22 20:11:43,836 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-22 20:11:43,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 20:11:43,837 INFO L85 PathProgramCache]: Analyzing trace with hash 185777442, now seen corresponding path program 1 times [2021-12-22 20:11:43,837 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 20:11:43,837 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233245261] [2021-12-22 20:11:43,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 20:11:43,837 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 20:11:43,846 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-22 20:11:43,846 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [571956918] [2021-12-22 20:11:43,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 20:11:43,846 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 20:11:43,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 20:11:43,847 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-22 20:11:43,848 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2021-12-22 20:11:43,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 20:11:43,886 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-22 20:11:43,887 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 20:11:43,919 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 20:11:43,920 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-22 20:11:43,920 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 20:11:43,920 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233245261] [2021-12-22 20:11:43,920 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-22 20:11:43,920 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [571956918] [2021-12-22 20:11:43,920 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [571956918] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 20:11:43,920 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 20:11:43,920 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-22 20:11:43,920 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062557214] [2021-12-22 20:11:43,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 20:11:44,039 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 20:11:44,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-22 20:11:44,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-12-22 20:11:44,039 INFO L87 Difference]: Start difference. First operand 20 states and 25 transitions. cyclomatic complexity: 8 Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 20:11:44,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 20:11:44,078 INFO L93 Difference]: Finished difference Result 41 states and 51 transitions. [2021-12-22 20:11:44,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-22 20:11:44,080 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 51 transitions. [2021-12-22 20:11:44,081 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 23 [2021-12-22 20:11:44,081 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 41 states and 51 transitions. [2021-12-22 20:11:44,081 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 38 [2021-12-22 20:11:44,081 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 38 [2021-12-22 20:11:44,082 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 51 transitions. [2021-12-22 20:11:44,082 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-22 20:11:44,082 INFO L681 BuchiCegarLoop]: Abstraction has 41 states and 51 transitions. [2021-12-22 20:11:44,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 51 transitions. [2021-12-22 20:11:44,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 22. [2021-12-22 20:11:44,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 21 states have internal predecessors, (27), 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) [2021-12-22 20:11:44,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 27 transitions. [2021-12-22 20:11:44,083 INFO L704 BuchiCegarLoop]: Abstraction has 22 states and 27 transitions. [2021-12-22 20:11:44,083 INFO L587 BuchiCegarLoop]: Abstraction has 22 states and 27 transitions. [2021-12-22 20:11:44,083 INFO L425 BuchiCegarLoop]: ======== Iteration 7============ [2021-12-22 20:11:44,083 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 27 transitions. [2021-12-22 20:11:44,083 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2021-12-22 20:11:44,084 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-22 20:11:44,084 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-22 20:11:44,084 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 20:11:44,084 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2021-12-22 20:11:44,084 INFO L791 eck$LassoCheckResult]: Stem: 420#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(16, 2);call #Ultimate.allocInit(12, 3); 421#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_~argc#1, main_~#argv#1.base, main_~#argv#1.offset;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;assume { :begin_inline_q1 } true;q1_#in~argc#1, q1_#in~argv#1.base, q1_#in~argv#1.offset := main_~argc#1, main_~#argv#1.base, main_~#argv#1.offset;havoc q1_#t~nondet16#1, q1_#t~switch17#1, q1_#t~pre18#1, q1_#t~pre19#1, q1_#t~pre20#1, q1_#t~nondet22#1, q1_#t~mem23#1, q1_#t~mem24#1, q1_#t~post21#1, q1_~r~0#1, q1_~temp~0#1, q1_~argc#1, q1_~argv#1.base, q1_~argv#1.offset, q1_~N~0#1, q1_~#a~1#1.base, q1_~#a~1#1.offset, q1_~i~1#1;q1_~argc#1 := q1_#in~argc#1;q1_~argv#1.base, q1_~argv#1.offset := q1_#in~argv#1.base, q1_#in~argv#1.offset; 424#L56 assume !(q1_~argc#1 < 2);q1_~N~0#1 := q1_#t~nondet16#1;havoc q1_#t~nondet16#1;call q1_~#a~1#1.base, q1_~#a~1#1.offset := #Ultimate.allocOnStack(4 * q1_~N~0#1);havoc q1_~i~1#1;q1_#t~switch17#1 := false; 425#L65 assume !q1_#t~switch17#1;q1_#t~switch17#1 := q1_#t~switch17#1; 440#L69 assume !q1_#t~switch17#1;q1_#t~switch17#1 := true; 438#L73 assume q1_#t~switch17#1;q1_~i~1#1 := 0; 439#L74-3 assume !(q1_~i~1#1 < q1_~N~0#1); 432#L74-4 q1_~i~1#1 := 0; 433#L76-3 assume !(q1_~i~1#1 < q1_~N~0#1); 422#L63 havoc q1_#t~switch17#1;assume { :begin_inline_bubblesort } true;bubblesort_#in~size#1, bubblesort_#in~item#1.base, bubblesort_#in~item#1.offset := q1_~N~0#1, q1_~#a~1#1.base, q1_~#a~1#1.offset;havoc bubblesort_#t~mem6#1, bubblesort_#t~mem7#1, bubblesort_#t~mem8#1, bubblesort_#t~mem9#1, bubblesort_#t~pre5#1, bubblesort_#t~pre4#1, bubblesort_~size#1, bubblesort_~item#1.base, bubblesort_~item#1.offset, bubblesort_~a~0#1, bubblesort_~b~0#1, bubblesort_~t~0#1;bubblesort_~size#1 := bubblesort_#in~size#1;bubblesort_~item#1.base, bubblesort_~item#1.offset := bubblesort_#in~item#1.base, bubblesort_#in~item#1.offset;havoc bubblesort_~a~0#1;havoc bubblesort_~b~0#1;havoc bubblesort_~t~0#1;bubblesort_~a~0#1 := 1; 423#L18-3 [2021-12-22 20:11:44,084 INFO L793 eck$LassoCheckResult]: Loop: 423#L18-3 assume !!(bubblesort_~a~0#1 < bubblesort_~size#1);bubblesort_~b~0#1 := bubblesort_~size#1 - 1; 435#L20-3 assume !!(bubblesort_~b~0#1 >= bubblesort_~a~0#1); 436#L23 assume bubblesort_~b~0#1 - 1 < bubblesort_~size#1 && bubblesort_~b~0#1 < bubblesort_~size#1;call bubblesort_#t~mem6#1 := read~int(bubblesort_~item#1.base, bubblesort_~item#1.offset + 4 * (bubblesort_~b~0#1 - 1), 4);call bubblesort_#t~mem7#1 := read~int(bubblesort_~item#1.base, bubblesort_~item#1.offset + 4 * bubblesort_~b~0#1, 4); 428#L25 assume bubblesort_#t~mem6#1 > bubblesort_#t~mem7#1;havoc bubblesort_#t~mem6#1;havoc bubblesort_#t~mem7#1;call bubblesort_#t~mem8#1 := read~int(bubblesort_~item#1.base, bubblesort_~item#1.offset + 4 * (bubblesort_~b~0#1 - 1), 4);bubblesort_~t~0#1 := bubblesort_#t~mem8#1;havoc bubblesort_#t~mem8#1;call bubblesort_#t~mem9#1 := read~int(bubblesort_~item#1.base, bubblesort_~item#1.offset + 4 * bubblesort_~b~0#1, 4);call write~int(bubblesort_#t~mem9#1, bubblesort_~item#1.base, bubblesort_~item#1.offset + 4 * (bubblesort_~b~0#1 - 1), 4);havoc bubblesort_#t~mem9#1;call write~int(bubblesort_~t~0#1, bubblesort_~item#1.base, bubblesort_~item#1.offset + 4 * bubblesort_~b~0#1, 4); 429#L20-2 bubblesort_#t~pre5#1 := bubblesort_~b~0#1 - 1;bubblesort_~b~0#1 := bubblesort_~b~0#1 - 1;havoc bubblesort_#t~pre5#1; 437#L20-3 assume !(bubblesort_~b~0#1 >= bubblesort_~a~0#1); 434#L18-2 bubblesort_#t~pre4#1 := 1 + bubblesort_~a~0#1;bubblesort_~a~0#1 := 1 + bubblesort_~a~0#1;havoc bubblesort_#t~pre4#1; 423#L18-3 [2021-12-22 20:11:44,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 20:11:44,084 INFO L85 PathProgramCache]: Analyzing trace with hash 185777387, now seen corresponding path program 1 times [2021-12-22 20:11:44,084 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 20:11:44,085 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633675156] [2021-12-22 20:11:44,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 20:11:44,085 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 20:11:44,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-22 20:11:44,095 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-22 20:11:44,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-22 20:11:44,113 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-22 20:11:44,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 20:11:44,115 INFO L85 PathProgramCache]: Analyzing trace with hash -1669532239, now seen corresponding path program 2 times [2021-12-22 20:11:44,115 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 20:11:44,115 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045541306] [2021-12-22 20:11:44,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 20:11:44,115 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 20:11:44,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-22 20:11:44,127 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-22 20:11:44,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-22 20:11:44,132 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-22 20:11:44,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 20:11:44,132 INFO L85 PathProgramCache]: Analyzing trace with hash -1443775097, now seen corresponding path program 1 times [2021-12-22 20:11:44,133 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 20:11:44,133 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290084293] [2021-12-22 20:11:44,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 20:11:44,133 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 20:11:44,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 20:11:44,179 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-22 20:11:44,179 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 20:11:44,179 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290084293] [2021-12-22 20:11:44,179 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1290084293] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 20:11:44,179 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 20:11:44,179 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-22 20:11:44,180 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811923063] [2021-12-22 20:11:44,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 20:11:44,280 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 20:11:44,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-22 20:11:44,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-22 20:11:44,280 INFO L87 Difference]: Start difference. First operand 22 states and 27 transitions. cyclomatic complexity: 8 Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 20:11:44,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 20:11:44,319 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2021-12-22 20:11:44,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-22 20:11:44,319 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 32 transitions. [2021-12-22 20:11:44,320 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2021-12-22 20:11:44,320 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 23 states and 27 transitions. [2021-12-22 20:11:44,320 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2021-12-22 20:11:44,320 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2021-12-22 20:11:44,320 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 27 transitions. [2021-12-22 20:11:44,320 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-22 20:11:44,320 INFO L681 BuchiCegarLoop]: Abstraction has 23 states and 27 transitions. [2021-12-22 20:11:44,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 27 transitions. [2021-12-22 20:11:44,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21. [2021-12-22 20:11:44,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 20 states have internal predecessors, (25), 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) [2021-12-22 20:11:44,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2021-12-22 20:11:44,321 INFO L704 BuchiCegarLoop]: Abstraction has 21 states and 25 transitions. [2021-12-22 20:11:44,321 INFO L587 BuchiCegarLoop]: Abstraction has 21 states and 25 transitions. [2021-12-22 20:11:44,322 INFO L425 BuchiCegarLoop]: ======== Iteration 8============ [2021-12-22 20:11:44,322 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 25 transitions. [2021-12-22 20:11:44,322 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2021-12-22 20:11:44,322 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-22 20:11:44,322 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-22 20:11:44,322 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 20:11:44,322 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-22 20:11:44,322 INFO L791 eck$LassoCheckResult]: Stem: 483#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(16, 2);call #Ultimate.allocInit(12, 3); 484#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_~argc#1, main_~#argv#1.base, main_~#argv#1.offset;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;assume { :begin_inline_q1 } true;q1_#in~argc#1, q1_#in~argv#1.base, q1_#in~argv#1.offset := main_~argc#1, main_~#argv#1.base, main_~#argv#1.offset;havoc q1_#t~nondet16#1, q1_#t~switch17#1, q1_#t~pre18#1, q1_#t~pre19#1, q1_#t~pre20#1, q1_#t~nondet22#1, q1_#t~mem23#1, q1_#t~mem24#1, q1_#t~post21#1, q1_~r~0#1, q1_~temp~0#1, q1_~argc#1, q1_~argv#1.base, q1_~argv#1.offset, q1_~N~0#1, q1_~#a~1#1.base, q1_~#a~1#1.offset, q1_~i~1#1;q1_~argc#1 := q1_#in~argc#1;q1_~argv#1.base, q1_~argv#1.offset := q1_#in~argv#1.base, q1_#in~argv#1.offset; 487#L56 assume !(q1_~argc#1 < 2);q1_~N~0#1 := q1_#t~nondet16#1;havoc q1_#t~nondet16#1;call q1_~#a~1#1.base, q1_~#a~1#1.offset := #Ultimate.allocOnStack(4 * q1_~N~0#1);havoc q1_~i~1#1;q1_#t~switch17#1 := false; 488#L65 assume !q1_#t~switch17#1;q1_#t~switch17#1 := q1_#t~switch17#1; 503#L69 assume !q1_#t~switch17#1;q1_#t~switch17#1 := true; 501#L73 assume q1_#t~switch17#1;q1_~i~1#1 := 0; 502#L74-3 assume !!(q1_~i~1#1 < q1_~N~0#1);call write~int(q1_~i~1#1, q1_~#a~1#1.base, q1_~#a~1#1.offset + 4 * q1_~i~1#1, 4); 493#L74-2 q1_#t~pre20#1 := 1 + q1_~i~1#1;q1_~i~1#1 := 1 + q1_~i~1#1;havoc q1_#t~pre20#1; 494#L74-3 assume !(q1_~i~1#1 < q1_~N~0#1); 495#L74-4 q1_~i~1#1 := 0; 496#L76-3 assume !!(q1_~i~1#1 < q1_~N~0#1);q1_~r~0#1 := q1_~i~1#1 + (if q1_#t~nondet22#1 < 0 && 0 != q1_#t~nondet22#1 % (q1_~N~0#1 - q1_~i~1#1) then (if q1_~N~0#1 - q1_~i~1#1 < 0 then q1_#t~nondet22#1 % (q1_~N~0#1 - q1_~i~1#1) + (q1_~N~0#1 - q1_~i~1#1) else q1_#t~nondet22#1 % (q1_~N~0#1 - q1_~i~1#1) - (q1_~N~0#1 - q1_~i~1#1)) else q1_#t~nondet22#1 % (q1_~N~0#1 - q1_~i~1#1));havoc q1_#t~nondet22#1;call q1_#t~mem23#1 := read~int(q1_~#a~1#1.base, q1_~#a~1#1.offset + 4 * q1_~i~1#1, 4);q1_~temp~0#1 := q1_#t~mem23#1;havoc q1_#t~mem23#1;call q1_#t~mem24#1 := read~int(q1_~#a~1#1.base, q1_~#a~1#1.offset + 4 * q1_~r~0#1, 4);call write~int(q1_#t~mem24#1, q1_~#a~1#1.base, q1_~#a~1#1.offset + 4 * q1_~i~1#1, 4);havoc q1_#t~mem24#1;call write~int(q1_~temp~0#1, q1_~#a~1#1.base, q1_~#a~1#1.offset + 4 * q1_~r~0#1, 4); 489#L76-2 [2021-12-22 20:11:44,322 INFO L793 eck$LassoCheckResult]: Loop: 489#L76-2 q1_#t~post21#1 := q1_~i~1#1;q1_~i~1#1 := 1 + q1_#t~post21#1;havoc q1_#t~post21#1; 490#L76-3 assume !!(q1_~i~1#1 < q1_~N~0#1);q1_~r~0#1 := q1_~i~1#1 + (if q1_#t~nondet22#1 < 0 && 0 != q1_#t~nondet22#1 % (q1_~N~0#1 - q1_~i~1#1) then (if q1_~N~0#1 - q1_~i~1#1 < 0 then q1_#t~nondet22#1 % (q1_~N~0#1 - q1_~i~1#1) + (q1_~N~0#1 - q1_~i~1#1) else q1_#t~nondet22#1 % (q1_~N~0#1 - q1_~i~1#1) - (q1_~N~0#1 - q1_~i~1#1)) else q1_#t~nondet22#1 % (q1_~N~0#1 - q1_~i~1#1));havoc q1_#t~nondet22#1;call q1_#t~mem23#1 := read~int(q1_~#a~1#1.base, q1_~#a~1#1.offset + 4 * q1_~i~1#1, 4);q1_~temp~0#1 := q1_#t~mem23#1;havoc q1_#t~mem23#1;call q1_#t~mem24#1 := read~int(q1_~#a~1#1.base, q1_~#a~1#1.offset + 4 * q1_~r~0#1, 4);call write~int(q1_#t~mem24#1, q1_~#a~1#1.base, q1_~#a~1#1.offset + 4 * q1_~i~1#1, 4);havoc q1_#t~mem24#1;call write~int(q1_~temp~0#1, q1_~#a~1#1.base, q1_~#a~1#1.offset + 4 * q1_~r~0#1, 4); 489#L76-2 [2021-12-22 20:11:44,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 20:11:44,323 INFO L85 PathProgramCache]: Analyzing trace with hash 1465845666, now seen corresponding path program 1 times [2021-12-22 20:11:44,323 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 20:11:44,323 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237722243] [2021-12-22 20:11:44,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 20:11:44,323 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 20:11:44,328 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-22 20:11:44,328 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [963819335] [2021-12-22 20:11:44,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 20:11:44,329 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 20:11:44,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 20:11:44,372 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-22 20:11:44,373 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2021-12-22 20:11:44,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-22 20:11:44,413 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-22 20:11:44,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-22 20:11:44,433 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-22 20:11:44,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 20:11:44,433 INFO L85 PathProgramCache]: Analyzing trace with hash 3199, now seen corresponding path program 2 times [2021-12-22 20:11:44,434 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 20:11:44,434 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338412346] [2021-12-22 20:11:44,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 20:11:44,434 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 20:11:44,438 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-22 20:11:44,439 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1702149601] [2021-12-22 20:11:44,439 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-22 20:11:44,439 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 20:11:44,439 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 20:11:44,444 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-22 20:11:44,445 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2021-12-22 20:11:44,474 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-12-22 20:11:44,474 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2021-12-22 20:11:44,475 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-22 20:11:44,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-22 20:11:44,480 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-22 20:11:44,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 20:11:44,481 INFO L85 PathProgramCache]: Analyzing trace with hash -71585824, now seen corresponding path program 1 times [2021-12-22 20:11:44,481 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 20:11:44,481 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198444921] [2021-12-22 20:11:44,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 20:11:44,482 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 20:11:44,492 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-22 20:11:44,492 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1705387562] [2021-12-22 20:11:44,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 20:11:44,492 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 20:11:44,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 20:11:44,494 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-22 20:11:44,495 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2021-12-22 20:11:44,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 20:11:44,536 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-22 20:11:44,539 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 20:11:44,606 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 20:11:44,607 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-22 20:11:44,639 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 20:11:44,639 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 20:11:44,640 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198444921] [2021-12-22 20:11:44,641 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-22 20:11:44,642 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1705387562] [2021-12-22 20:11:44,643 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1705387562] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-22 20:11:44,643 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-22 20:11:44,643 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2021-12-22 20:11:44,644 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405901479] [2021-12-22 20:11:44,644 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-22 20:11:44,756 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 20:11:44,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-22 20:11:44,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2021-12-22 20:11:44,757 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. cyclomatic complexity: 7 Second operand has 9 states, 8 states have (on average 2.125) internal successors, (17), 9 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 20:11:44,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 20:11:44,825 INFO L93 Difference]: Finished difference Result 47 states and 57 transitions. [2021-12-22 20:11:44,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-22 20:11:44,826 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 47 states and 57 transitions. [2021-12-22 20:11:44,827 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 23 [2021-12-22 20:11:44,827 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 47 states to 47 states and 57 transitions. [2021-12-22 20:11:44,827 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 42 [2021-12-22 20:11:44,827 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 42 [2021-12-22 20:11:44,827 INFO L73 IsDeterministic]: Start isDeterministic. Operand 47 states and 57 transitions. [2021-12-22 20:11:44,828 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-22 20:11:44,828 INFO L681 BuchiCegarLoop]: Abstraction has 47 states and 57 transitions. [2021-12-22 20:11:44,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states and 57 transitions. [2021-12-22 20:11:44,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 27. [2021-12-22 20:11:44,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 26 states have internal predecessors, (32), 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) [2021-12-22 20:11:44,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 32 transitions. [2021-12-22 20:11:44,829 INFO L704 BuchiCegarLoop]: Abstraction has 27 states and 32 transitions. [2021-12-22 20:11:44,829 INFO L587 BuchiCegarLoop]: Abstraction has 27 states and 32 transitions. [2021-12-22 20:11:44,829 INFO L425 BuchiCegarLoop]: ======== Iteration 9============ [2021-12-22 20:11:44,829 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 32 transitions. [2021-12-22 20:11:44,829 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2021-12-22 20:11:44,830 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-22 20:11:44,830 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-22 20:11:44,830 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 20:11:44,830 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-22 20:11:44,830 INFO L791 eck$LassoCheckResult]: Stem: 643#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(16, 2);call #Ultimate.allocInit(12, 3); 644#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_~argc#1, main_~#argv#1.base, main_~#argv#1.offset;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;assume { :begin_inline_q1 } true;q1_#in~argc#1, q1_#in~argv#1.base, q1_#in~argv#1.offset := main_~argc#1, main_~#argv#1.base, main_~#argv#1.offset;havoc q1_#t~nondet16#1, q1_#t~switch17#1, q1_#t~pre18#1, q1_#t~pre19#1, q1_#t~pre20#1, q1_#t~nondet22#1, q1_#t~mem23#1, q1_#t~mem24#1, q1_#t~post21#1, q1_~r~0#1, q1_~temp~0#1, q1_~argc#1, q1_~argv#1.base, q1_~argv#1.offset, q1_~N~0#1, q1_~#a~1#1.base, q1_~#a~1#1.offset, q1_~i~1#1;q1_~argc#1 := q1_#in~argc#1;q1_~argv#1.base, q1_~argv#1.offset := q1_#in~argv#1.base, q1_#in~argv#1.offset; 647#L56 assume !(q1_~argc#1 < 2);q1_~N~0#1 := q1_#t~nondet16#1;havoc q1_#t~nondet16#1;call q1_~#a~1#1.base, q1_~#a~1#1.offset := #Ultimate.allocOnStack(4 * q1_~N~0#1);havoc q1_~i~1#1;q1_#t~switch17#1 := false; 648#L65 assume !q1_#t~switch17#1;q1_#t~switch17#1 := q1_#t~switch17#1; 664#L69 assume !q1_#t~switch17#1;q1_#t~switch17#1 := true; 662#L73 assume q1_#t~switch17#1;q1_~i~1#1 := 0; 663#L74-3 assume !!(q1_~i~1#1 < q1_~N~0#1);call write~int(q1_~i~1#1, q1_~#a~1#1.base, q1_~#a~1#1.offset + 4 * q1_~i~1#1, 4); 653#L74-2 q1_#t~pre20#1 := 1 + q1_~i~1#1;q1_~i~1#1 := 1 + q1_~i~1#1;havoc q1_#t~pre20#1; 654#L74-3 assume !!(q1_~i~1#1 < q1_~N~0#1);call write~int(q1_~i~1#1, q1_~#a~1#1.base, q1_~#a~1#1.offset + 4 * q1_~i~1#1, 4); 665#L74-2 q1_#t~pre20#1 := 1 + q1_~i~1#1;q1_~i~1#1 := 1 + q1_~i~1#1;havoc q1_#t~pre20#1; 669#L74-3 assume !(q1_~i~1#1 < q1_~N~0#1); 668#L74-4 q1_~i~1#1 := 0; 657#L76-3 assume !!(q1_~i~1#1 < q1_~N~0#1);q1_~r~0#1 := q1_~i~1#1 + (if q1_#t~nondet22#1 < 0 && 0 != q1_#t~nondet22#1 % (q1_~N~0#1 - q1_~i~1#1) then (if q1_~N~0#1 - q1_~i~1#1 < 0 then q1_#t~nondet22#1 % (q1_~N~0#1 - q1_~i~1#1) + (q1_~N~0#1 - q1_~i~1#1) else q1_#t~nondet22#1 % (q1_~N~0#1 - q1_~i~1#1) - (q1_~N~0#1 - q1_~i~1#1)) else q1_#t~nondet22#1 % (q1_~N~0#1 - q1_~i~1#1));havoc q1_#t~nondet22#1;call q1_#t~mem23#1 := read~int(q1_~#a~1#1.base, q1_~#a~1#1.offset + 4 * q1_~i~1#1, 4);q1_~temp~0#1 := q1_#t~mem23#1;havoc q1_#t~mem23#1;call q1_#t~mem24#1 := read~int(q1_~#a~1#1.base, q1_~#a~1#1.offset + 4 * q1_~r~0#1, 4);call write~int(q1_#t~mem24#1, q1_~#a~1#1.base, q1_~#a~1#1.offset + 4 * q1_~i~1#1, 4);havoc q1_#t~mem24#1;call write~int(q1_~temp~0#1, q1_~#a~1#1.base, q1_~#a~1#1.offset + 4 * q1_~r~0#1, 4); 649#L76-2 [2021-12-22 20:11:44,830 INFO L793 eck$LassoCheckResult]: Loop: 649#L76-2 q1_#t~post21#1 := q1_~i~1#1;q1_~i~1#1 := 1 + q1_#t~post21#1;havoc q1_#t~post21#1; 650#L76-3 assume !!(q1_~i~1#1 < q1_~N~0#1);q1_~r~0#1 := q1_~i~1#1 + (if q1_#t~nondet22#1 < 0 && 0 != q1_#t~nondet22#1 % (q1_~N~0#1 - q1_~i~1#1) then (if q1_~N~0#1 - q1_~i~1#1 < 0 then q1_#t~nondet22#1 % (q1_~N~0#1 - q1_~i~1#1) + (q1_~N~0#1 - q1_~i~1#1) else q1_#t~nondet22#1 % (q1_~N~0#1 - q1_~i~1#1) - (q1_~N~0#1 - q1_~i~1#1)) else q1_#t~nondet22#1 % (q1_~N~0#1 - q1_~i~1#1));havoc q1_#t~nondet22#1;call q1_#t~mem23#1 := read~int(q1_~#a~1#1.base, q1_~#a~1#1.offset + 4 * q1_~i~1#1, 4);q1_~temp~0#1 := q1_#t~mem23#1;havoc q1_#t~mem23#1;call q1_#t~mem24#1 := read~int(q1_~#a~1#1.base, q1_~#a~1#1.offset + 4 * q1_~r~0#1, 4);call write~int(q1_#t~mem24#1, q1_~#a~1#1.base, q1_~#a~1#1.offset + 4 * q1_~i~1#1, 4);havoc q1_#t~mem24#1;call write~int(q1_~temp~0#1, q1_~#a~1#1.base, q1_~#a~1#1.offset + 4 * q1_~r~0#1, 4); 649#L76-2 [2021-12-22 20:11:44,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 20:11:44,830 INFO L85 PathProgramCache]: Analyzing trace with hash -69873632, now seen corresponding path program 2 times [2021-12-22 20:11:44,831 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 20:11:44,831 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398873129] [2021-12-22 20:11:44,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 20:11:44,831 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 20:11:44,843 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-22 20:11:44,845 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [426987277] [2021-12-22 20:11:44,845 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-22 20:11:44,845 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 20:11:44,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 20:11:44,847 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-22 20:11:44,861 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2021-12-22 20:11:44,893 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-22 20:11:44,893 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2021-12-22 20:11:44,893 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-22 20:11:44,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-22 20:11:44,909 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-22 20:11:44,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 20:11:44,910 INFO L85 PathProgramCache]: Analyzing trace with hash 3199, now seen corresponding path program 3 times [2021-12-22 20:11:44,910 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 20:11:44,910 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798813353] [2021-12-22 20:11:44,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 20:11:44,911 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 20:11:44,913 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-22 20:11:44,913 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1592198697] [2021-12-22 20:11:44,913 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-22 20:11:44,914 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 20:11:44,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 20:11:44,915 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-22 20:11:44,941 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2021-12-22 20:11:44,946 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2021-12-22 20:11:44,947 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2021-12-22 20:11:44,947 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-22 20:11:44,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-22 20:11:44,952 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-22 20:11:44,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 20:11:44,953 INFO L85 PathProgramCache]: Analyzing trace with hash 1570918622, now seen corresponding path program 2 times [2021-12-22 20:11:44,953 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 20:11:44,953 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609775830] [2021-12-22 20:11:44,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 20:11:44,953 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 20:11:44,960 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-22 20:11:44,960 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [405576736] [2021-12-22 20:11:44,960 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-22 20:11:44,960 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 20:11:44,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 20:11:44,962 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-22 20:11:44,965 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2021-12-22 20:11:45,018 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-22 20:11:45,018 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2021-12-22 20:11:45,018 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-22 20:11:45,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-22 20:11:45,036 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-22 20:11:46,138 INFO L210 LassoAnalysis]: Preferences: [2021-12-22 20:11:46,138 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-22 20:11:46,138 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-22 20:11:46,138 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-22 20:11:46,139 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-22 20:11:46,139 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-22 20:11:46,139 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-22 20:11:46,139 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-22 20:11:46,139 INFO L133 ssoRankerPreferences]: Filename of dumped script: bubble_sort-1.c_Iteration9_Lasso [2021-12-22 20:11:46,139 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-22 20:11:46,139 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-22 20:11:46,142 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-22 20:11:46,160 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-22 20:11:46,162 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-22 20:11:46,163 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-22 20:11:46,164 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-22 20:11:46,165 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-22 20:11:46,166 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-22 20:11:46,168 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-22 20:11:46,580 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-22 20:11:46,586 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-22 20:11:46,588 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-22 20:11:46,589 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-22 20:11:46,591 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-22 20:11:46,596 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-22 20:11:46,598 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-22 20:11:47,717 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-22 20:11:47,718 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-22 20:11:47,718 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-22 20:11:47,718 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 20:11:47,719 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) [2021-12-22 20:11:47,720 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 [2021-12-22 20:11:47,721 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 [2021-12-22 20:11:47,727 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-22 20:11:47,728 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-22 20:11:47,728 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-22 20:11:47,728 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-22 20:11:47,730 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-22 20:11:47,730 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-22 20:11:47,741 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-22 20:11:47,767 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 [2021-12-22 20:11:47,767 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-22 20:11:47,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 20:11:47,768 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) [2021-12-22 20:11:47,769 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 [2021-12-22 20:11:47,771 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 [2021-12-22 20:11:47,776 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-22 20:11:47,776 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-22 20:11:47,776 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-22 20:11:47,776 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-22 20:11:47,776 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-22 20:11:47,777 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-22 20:11:47,777 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-22 20:11:47,777 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-22 20:11:47,795 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2021-12-22 20:11:47,795 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-22 20:11:47,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 20:11:47,796 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) [2021-12-22 20:11:47,797 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 [2021-12-22 20:11:47,798 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 [2021-12-22 20:11:47,804 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-22 20:11:47,804 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-22 20:11:47,804 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-22 20:11:47,804 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-22 20:11:47,804 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-22 20:11:47,805 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-22 20:11:47,805 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-22 20:11:47,811 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-22 20:11:47,826 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2021-12-22 20:11:47,826 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-22 20:11:47,826 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 20:11:47,827 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) [2021-12-22 20:11:47,828 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 [2021-12-22 20:11:47,829 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 [2021-12-22 20:11:47,835 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-22 20:11:47,835 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-22 20:11:47,835 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-22 20:11:47,835 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-22 20:11:47,835 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-22 20:11:47,836 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-22 20:11:47,836 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-22 20:11:47,843 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-22 20:11:47,858 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2021-12-22 20:11:47,859 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-22 20:11:47,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 20:11:47,860 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) [2021-12-22 20:11:47,861 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 [2021-12-22 20:11:47,862 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 [2021-12-22 20:11:47,868 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-22 20:11:47,868 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-22 20:11:47,868 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-22 20:11:47,868 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-22 20:11:47,869 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-22 20:11:47,869 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-22 20:11:47,871 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-22 20:11:47,886 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 [2021-12-22 20:11:47,886 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-22 20:11:47,886 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 20:11:47,887 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) [2021-12-22 20:11:47,887 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 [2021-12-22 20:11:47,889 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 [2021-12-22 20:11:47,894 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-22 20:11:47,895 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-22 20:11:47,895 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-22 20:11:47,895 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-22 20:11:47,895 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-22 20:11:47,895 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-22 20:11:47,895 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-22 20:11:47,896 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-22 20:11:47,910 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2021-12-22 20:11:47,911 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-22 20:11:47,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 20:11:47,912 INFO L229 MonitoredProcess]: Starting monitored process 27 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) [2021-12-22 20:11:47,912 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2021-12-22 20:11:47,913 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 [2021-12-22 20:11:47,919 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-22 20:11:47,919 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-22 20:11:47,919 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-22 20:11:47,919 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-22 20:11:47,920 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-22 20:11:47,920 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-22 20:11:47,931 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-22 20:11:47,947 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2021-12-22 20:11:47,947 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-22 20:11:47,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 20:11:47,948 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) [2021-12-22 20:11:47,948 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 [2021-12-22 20:11:47,951 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 [2021-12-22 20:11:47,957 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-22 20:11:47,957 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-22 20:11:47,957 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-22 20:11:47,957 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-22 20:11:47,959 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-22 20:11:47,959 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-22 20:11:47,961 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-22 20:11:47,976 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0 [2021-12-22 20:11:47,977 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-22 20:11:47,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 20:11:47,978 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) [2021-12-22 20:11:47,978 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 [2021-12-22 20:11:47,980 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-22 20:11:47,986 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-22 20:11:47,986 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-22 20:11:47,986 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-22 20:11:47,986 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-22 20:11:47,988 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-22 20:11:47,988 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-22 20:11:47,990 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-22 20:11:48,007 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 [2021-12-22 20:11:48,007 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-22 20:11:48,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 20:11:48,008 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) [2021-12-22 20:11:48,008 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 [2021-12-22 20:11:48,010 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 [2021-12-22 20:11:48,016 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-22 20:11:48,016 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-22 20:11:48,016 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-22 20:11:48,016 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-22 20:11:48,017 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-22 20:11:48,017 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-22 20:11:48,019 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-22 20:11:48,038 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Ended with exit code 0 [2021-12-22 20:11:48,038 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-22 20:11:48,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 20:11:48,039 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) [2021-12-22 20:11:48,039 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 [2021-12-22 20:11:48,041 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 [2021-12-22 20:11:48,047 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-22 20:11:48,047 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-22 20:11:48,047 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-22 20:11:48,047 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-22 20:11:48,048 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-22 20:11:48,048 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-22 20:11:48,077 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-22 20:11:48,092 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Ended with exit code 0 [2021-12-22 20:11:48,092 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-22 20:11:48,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 20:11:48,093 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) [2021-12-22 20:11:48,093 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 [2021-12-22 20:11:48,095 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 [2021-12-22 20:11:48,101 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-22 20:11:48,101 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-22 20:11:48,101 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-22 20:11:48,101 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-22 20:11:48,111 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-22 20:11:48,111 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-22 20:11:48,115 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-22 20:11:48,130 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 [2021-12-22 20:11:48,130 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-22 20:11:48,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 20:11:48,131 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) [2021-12-22 20:11:48,132 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 [2021-12-22 20:11:48,133 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 [2021-12-22 20:11:48,139 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-22 20:11:48,139 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-22 20:11:48,139 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-22 20:11:48,139 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-22 20:11:48,141 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-22 20:11:48,141 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-22 20:11:48,147 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-22 20:11:48,162 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Ended with exit code 0 [2021-12-22 20:11:48,163 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-22 20:11:48,163 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 20:11:48,163 INFO L229 MonitoredProcess]: Starting monitored process 34 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) [2021-12-22 20:11:48,169 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2021-12-22 20:11:48,169 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 [2021-12-22 20:11:48,176 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-22 20:11:48,176 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-22 20:11:48,176 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-22 20:11:48,176 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-22 20:11:48,177 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-22 20:11:48,177 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-22 20:11:48,180 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-22 20:11:48,195 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Ended with exit code 0 [2021-12-22 20:11:48,195 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-22 20:11:48,195 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 20:11:48,196 INFO L229 MonitoredProcess]: Starting monitored process 35 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) [2021-12-22 20:11:48,197 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2021-12-22 20:11:48,198 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 [2021-12-22 20:11:48,204 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-22 20:11:48,204 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-22 20:11:48,204 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-22 20:11:48,204 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-22 20:11:48,205 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-22 20:11:48,205 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-22 20:11:48,207 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-22 20:11:48,222 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Ended with exit code 0 [2021-12-22 20:11:48,222 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-22 20:11:48,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 20:11:48,227 INFO L229 MonitoredProcess]: Starting monitored process 36 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) [2021-12-22 20:11:48,228 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 [2021-12-22 20:11:48,234 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2021-12-22 20:11:48,235 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-22 20:11:48,235 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-22 20:11:48,235 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-22 20:11:48,235 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-22 20:11:48,236 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-22 20:11:48,236 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-22 20:11:48,246 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-22 20:11:48,262 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Ended with exit code 0 [2021-12-22 20:11:48,262 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-22 20:11:48,262 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 20:11:48,263 INFO L229 MonitoredProcess]: Starting monitored process 37 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) [2021-12-22 20:11:48,263 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2021-12-22 20:11:48,265 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 [2021-12-22 20:11:48,270 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-22 20:11:48,270 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-22 20:11:48,271 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-22 20:11:48,271 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-22 20:11:48,278 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-22 20:11:48,278 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-22 20:11:48,283 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-22 20:11:48,298 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Forceful destruction successful, exit code 0 [2021-12-22 20:11:48,299 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-22 20:11:48,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 20:11:48,300 INFO L229 MonitoredProcess]: Starting monitored process 38 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) [2021-12-22 20:11:48,301 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2021-12-22 20:11:48,302 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-22 20:11:48,308 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-22 20:11:48,308 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-22 20:11:48,308 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-22 20:11:48,308 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-22 20:11:48,310 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-22 20:11:48,310 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-22 20:11:48,335 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-22 20:11:48,350 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Ended with exit code 0 [2021-12-22 20:11:48,350 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-22 20:11:48,351 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 20:11:48,351 INFO L229 MonitoredProcess]: Starting monitored process 39 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) [2021-12-22 20:11:48,352 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2021-12-22 20:11:48,353 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 [2021-12-22 20:11:48,359 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-22 20:11:48,359 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-22 20:11:48,359 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-22 20:11:48,359 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-22 20:11:48,360 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-22 20:11:48,360 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-22 20:11:48,363 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-22 20:11:48,377 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Ended with exit code 0 [2021-12-22 20:11:48,377 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-22 20:11:48,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 20:11:48,378 INFO L229 MonitoredProcess]: Starting monitored process 40 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) [2021-12-22 20:11:48,381 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2021-12-22 20:11:48,382 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 [2021-12-22 20:11:48,387 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-22 20:11:48,388 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-22 20:11:48,388 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-22 20:11:48,388 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-22 20:11:48,388 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-22 20:11:48,388 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-22 20:11:48,388 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-22 20:11:48,397 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-22 20:11:48,411 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Ended with exit code 0 [2021-12-22 20:11:48,412 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-22 20:11:48,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 20:11:48,412 INFO L229 MonitoredProcess]: Starting monitored process 41 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) [2021-12-22 20:11:48,413 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2021-12-22 20:11:48,414 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 [2021-12-22 20:11:48,421 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-22 20:11:48,421 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-22 20:11:48,421 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-22 20:11:48,421 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-22 20:11:48,422 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-22 20:11:48,422 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-22 20:11:48,427 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-22 20:11:48,441 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Ended with exit code 0 [2021-12-22 20:11:48,442 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-22 20:11:48,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 20:11:48,443 INFO L229 MonitoredProcess]: Starting monitored process 42 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) [2021-12-22 20:11:48,443 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2021-12-22 20:11:48,444 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 [2021-12-22 20:11:48,451 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-22 20:11:48,451 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2021-12-22 20:11:48,451 INFO L204 nArgumentSynthesizer]: 3 loop disjuncts [2021-12-22 20:11:48,451 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-22 20:11:48,481 INFO L401 nArgumentSynthesizer]: We have 36 Motzkin's Theorem applications. [2021-12-22 20:11:48,481 INFO L402 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2021-12-22 20:11:48,540 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-22 20:11:48,615 INFO L443 ModelExtractionUtils]: Simplification made 20 calls to the SMT solver. [2021-12-22 20:11:48,615 INFO L444 ModelExtractionUtils]: 24 out of 50 variables were initially zero. Simplification set additionally 23 variables to zero. [2021-12-22 20:11:48,615 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-22 20:11:48,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 20:11:48,616 INFO L229 MonitoredProcess]: Starting monitored process 43 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) [2021-12-22 20:11:48,617 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2021-12-22 20:11:48,619 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-22 20:11:48,628 INFO L438 nArgumentSynthesizer]: Removed 6 redundant supporting invariants from a total of 6. [2021-12-22 20:11:48,628 INFO L513 LassoAnalysis]: Proved termination. [2021-12-22 20:11:48,628 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_q1_~#a~1#1.base)_2, ULTIMATE.start_q1_~i~1#1) = 1*v_rep(select #length ULTIMATE.start_q1_~#a~1#1.base)_2 - 4*ULTIMATE.start_q1_~i~1#1 Supporting invariants [] [2021-12-22 20:11:48,647 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Forceful destruction successful, exit code 0 [2021-12-22 20:11:48,680 INFO L297 tatePredicateManager]: 10 out of 11 supporting invariants were superfluous and have been removed [2021-12-22 20:11:48,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 20:11:48,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 20:11:48,719 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-22 20:11:48,720 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 20:11:48,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 20:11:48,761 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-22 20:11:48,761 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 20:11:48,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 20:11:48,777 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2021-12-22 20:11:48,777 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 32 transitions. cyclomatic complexity: 8 Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 20:11:48,829 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states and 32 transitions. cyclomatic complexity: 8. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 38 states and 48 transitions. Complement of second has 5 states. [2021-12-22 20:11:48,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2021-12-22 20:11:48,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-22 20:11:48,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 23 transitions. [2021-12-22 20:11:48,830 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 13 letters. Loop has 2 letters. [2021-12-22 20:11:48,831 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-22 20:11:48,831 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 15 letters. Loop has 2 letters. [2021-12-22 20:11:48,831 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-22 20:11:48,831 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 13 letters. Loop has 4 letters. [2021-12-22 20:11:48,831 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-22 20:11:48,831 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 48 transitions. [2021-12-22 20:11:48,832 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2021-12-22 20:11:48,832 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 29 states and 35 transitions. [2021-12-22 20:11:48,832 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2021-12-22 20:11:48,832 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2021-12-22 20:11:48,832 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 35 transitions. [2021-12-22 20:11:48,832 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-22 20:11:48,832 INFO L681 BuchiCegarLoop]: Abstraction has 29 states and 35 transitions. [2021-12-22 20:11:48,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 35 transitions. [2021-12-22 20:11:48,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2021-12-22 20:11:48,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 27 states have internal predecessors, (34), 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) [2021-12-22 20:11:48,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2021-12-22 20:11:48,834 INFO L704 BuchiCegarLoop]: Abstraction has 28 states and 34 transitions. [2021-12-22 20:11:48,834 INFO L587 BuchiCegarLoop]: Abstraction has 28 states and 34 transitions. [2021-12-22 20:11:48,834 INFO L425 BuchiCegarLoop]: ======== Iteration 10============ [2021-12-22 20:11:48,834 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 34 transitions. [2021-12-22 20:11:48,834 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2021-12-22 20:11:48,834 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-22 20:11:48,834 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-22 20:11:48,835 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 20:11:48,835 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2021-12-22 20:11:48,835 INFO L791 eck$LassoCheckResult]: Stem: 824#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(16, 2);call #Ultimate.allocInit(12, 3); 825#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_~argc#1, main_~#argv#1.base, main_~#argv#1.offset;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;assume { :begin_inline_q1 } true;q1_#in~argc#1, q1_#in~argv#1.base, q1_#in~argv#1.offset := main_~argc#1, main_~#argv#1.base, main_~#argv#1.offset;havoc q1_#t~nondet16#1, q1_#t~switch17#1, q1_#t~pre18#1, q1_#t~pre19#1, q1_#t~pre20#1, q1_#t~nondet22#1, q1_#t~mem23#1, q1_#t~mem24#1, q1_#t~post21#1, q1_~r~0#1, q1_~temp~0#1, q1_~argc#1, q1_~argv#1.base, q1_~argv#1.offset, q1_~N~0#1, q1_~#a~1#1.base, q1_~#a~1#1.offset, q1_~i~1#1;q1_~argc#1 := q1_#in~argc#1;q1_~argv#1.base, q1_~argv#1.offset := q1_#in~argv#1.base, q1_#in~argv#1.offset; 828#L56 assume !(q1_~argc#1 < 2);q1_~N~0#1 := q1_#t~nondet16#1;havoc q1_#t~nondet16#1;call q1_~#a~1#1.base, q1_~#a~1#1.offset := #Ultimate.allocOnStack(4 * q1_~N~0#1);havoc q1_~i~1#1;q1_#t~switch17#1 := false; 829#L65 assume !q1_#t~switch17#1;q1_#t~switch17#1 := q1_#t~switch17#1; 846#L69 assume !q1_#t~switch17#1;q1_#t~switch17#1 := true; 844#L73 assume q1_#t~switch17#1;q1_~i~1#1 := 0; 845#L74-3 assume !!(q1_~i~1#1 < q1_~N~0#1);call write~int(q1_~i~1#1, q1_~#a~1#1.base, q1_~#a~1#1.offset + 4 * q1_~i~1#1, 4); 847#L74-2 q1_#t~pre20#1 := 1 + q1_~i~1#1;q1_~i~1#1 := 1 + q1_~i~1#1;havoc q1_#t~pre20#1; 848#L74-3 assume !(q1_~i~1#1 < q1_~N~0#1); 838#L74-4 q1_~i~1#1 := 0; 839#L76-3 assume !!(q1_~i~1#1 < q1_~N~0#1);q1_~r~0#1 := q1_~i~1#1 + (if q1_#t~nondet22#1 < 0 && 0 != q1_#t~nondet22#1 % (q1_~N~0#1 - q1_~i~1#1) then (if q1_~N~0#1 - q1_~i~1#1 < 0 then q1_#t~nondet22#1 % (q1_~N~0#1 - q1_~i~1#1) + (q1_~N~0#1 - q1_~i~1#1) else q1_#t~nondet22#1 % (q1_~N~0#1 - q1_~i~1#1) - (q1_~N~0#1 - q1_~i~1#1)) else q1_#t~nondet22#1 % (q1_~N~0#1 - q1_~i~1#1));havoc q1_#t~nondet22#1;call q1_#t~mem23#1 := read~int(q1_~#a~1#1.base, q1_~#a~1#1.offset + 4 * q1_~i~1#1, 4);q1_~temp~0#1 := q1_#t~mem23#1;havoc q1_#t~mem23#1;call q1_#t~mem24#1 := read~int(q1_~#a~1#1.base, q1_~#a~1#1.offset + 4 * q1_~r~0#1, 4);call write~int(q1_#t~mem24#1, q1_~#a~1#1.base, q1_~#a~1#1.offset + 4 * q1_~i~1#1, 4);havoc q1_#t~mem24#1;call write~int(q1_~temp~0#1, q1_~#a~1#1.base, q1_~#a~1#1.offset + 4 * q1_~r~0#1, 4); 830#L76-2 q1_#t~post21#1 := q1_~i~1#1;q1_~i~1#1 := 1 + q1_#t~post21#1;havoc q1_#t~post21#1; 831#L76-3 assume !(q1_~i~1#1 < q1_~N~0#1); 826#L63 havoc q1_#t~switch17#1;assume { :begin_inline_bubblesort } true;bubblesort_#in~size#1, bubblesort_#in~item#1.base, bubblesort_#in~item#1.offset := q1_~N~0#1, q1_~#a~1#1.base, q1_~#a~1#1.offset;havoc bubblesort_#t~mem6#1, bubblesort_#t~mem7#1, bubblesort_#t~mem8#1, bubblesort_#t~mem9#1, bubblesort_#t~pre5#1, bubblesort_#t~pre4#1, bubblesort_~size#1, bubblesort_~item#1.base, bubblesort_~item#1.offset, bubblesort_~a~0#1, bubblesort_~b~0#1, bubblesort_~t~0#1;bubblesort_~size#1 := bubblesort_#in~size#1;bubblesort_~item#1.base, bubblesort_~item#1.offset := bubblesort_#in~item#1.base, bubblesort_#in~item#1.offset;havoc bubblesort_~a~0#1;havoc bubblesort_~b~0#1;havoc bubblesort_~t~0#1;bubblesort_~a~0#1 := 1; 827#L18-3 [2021-12-22 20:11:48,835 INFO L793 eck$LassoCheckResult]: Loop: 827#L18-3 assume !!(bubblesort_~a~0#1 < bubblesort_~size#1);bubblesort_~b~0#1 := bubblesort_~size#1 - 1; 841#L20-3 assume !!(bubblesort_~b~0#1 >= bubblesort_~a~0#1); 842#L23 assume bubblesort_~b~0#1 - 1 < bubblesort_~size#1 && bubblesort_~b~0#1 < bubblesort_~size#1;call bubblesort_#t~mem6#1 := read~int(bubblesort_~item#1.base, bubblesort_~item#1.offset + 4 * (bubblesort_~b~0#1 - 1), 4);call bubblesort_#t~mem7#1 := read~int(bubblesort_~item#1.base, bubblesort_~item#1.offset + 4 * bubblesort_~b~0#1, 4); 834#L25 assume bubblesort_#t~mem6#1 > bubblesort_#t~mem7#1;havoc bubblesort_#t~mem6#1;havoc bubblesort_#t~mem7#1;call bubblesort_#t~mem8#1 := read~int(bubblesort_~item#1.base, bubblesort_~item#1.offset + 4 * (bubblesort_~b~0#1 - 1), 4);bubblesort_~t~0#1 := bubblesort_#t~mem8#1;havoc bubblesort_#t~mem8#1;call bubblesort_#t~mem9#1 := read~int(bubblesort_~item#1.base, bubblesort_~item#1.offset + 4 * bubblesort_~b~0#1, 4);call write~int(bubblesort_#t~mem9#1, bubblesort_~item#1.base, bubblesort_~item#1.offset + 4 * (bubblesort_~b~0#1 - 1), 4);havoc bubblesort_#t~mem9#1;call write~int(bubblesort_~t~0#1, bubblesort_~item#1.base, bubblesort_~item#1.offset + 4 * bubblesort_~b~0#1, 4); 835#L20-2 bubblesort_#t~pre5#1 := bubblesort_~b~0#1 - 1;bubblesort_~b~0#1 := bubblesort_~b~0#1 - 1;havoc bubblesort_#t~pre5#1; 843#L20-3 assume !(bubblesort_~b~0#1 >= bubblesort_~a~0#1); 840#L18-2 bubblesort_#t~pre4#1 := 1 + bubblesort_~a~0#1;bubblesort_~a~0#1 := 1 + bubblesort_~a~0#1;havoc bubblesort_#t~pre4#1; 827#L18-3 [2021-12-22 20:11:48,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 20:11:48,835 INFO L85 PathProgramCache]: Analyzing trace with hash 2075806767, now seen corresponding path program 1 times [2021-12-22 20:11:48,835 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 20:11:48,836 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427649298] [2021-12-22 20:11:48,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 20:11:48,836 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 20:11:48,841 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-22 20:11:48,841 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1083900631] [2021-12-22 20:11:48,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 20:11:48,842 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 20:11:48,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 20:11:48,844 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-22 20:11:48,845 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Waiting until timeout for monitored process [2021-12-22 20:11:48,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-22 20:11:48,888 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-22 20:11:48,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-22 20:11:48,904 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-22 20:11:48,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 20:11:48,905 INFO L85 PathProgramCache]: Analyzing trace with hash -1669532239, now seen corresponding path program 3 times [2021-12-22 20:11:48,905 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 20:11:48,905 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489277407] [2021-12-22 20:11:48,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 20:11:48,905 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 20:11:48,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-22 20:11:48,909 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-22 20:11:48,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-22 20:11:48,912 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-22 20:11:48,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 20:11:48,913 INFO L85 PathProgramCache]: Analyzing trace with hash -548718141, now seen corresponding path program 1 times [2021-12-22 20:11:48,913 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 20:11:48,913 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455981670] [2021-12-22 20:11:48,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 20:11:48,913 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 20:11:48,918 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-22 20:11:48,918 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1444231111] [2021-12-22 20:11:48,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 20:11:48,918 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 20:11:48,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 20:11:48,919 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-22 20:11:48,920 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Waiting until timeout for monitored process [2021-12-22 20:11:48,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 20:11:48,968 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-22 20:11:48,968 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 20:11:49,011 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-22 20:11:49,011 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-22 20:11:49,048 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-22 20:11:49,048 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 20:11:49,048 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455981670] [2021-12-22 20:11:49,049 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-22 20:11:49,049 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1444231111] [2021-12-22 20:11:49,049 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1444231111] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-22 20:11:49,049 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-22 20:11:49,049 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2021-12-22 20:11:49,049 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052230099] [2021-12-22 20:11:49,049 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-22 20:11:49,152 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Forceful destruction successful, exit code 0 [2021-12-22 20:11:49,171 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 20:11:49,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-22 20:11:49,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-12-22 20:11:49,172 INFO L87 Difference]: Start difference. First operand 28 states and 34 transitions. cyclomatic complexity: 9 Second operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 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) [2021-12-22 20:11:49,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 20:11:49,233 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2021-12-22 20:11:49,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-22 20:11:49,234 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 41 transitions. [2021-12-22 20:11:49,234 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2021-12-22 20:11:49,234 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 28 states and 33 transitions. [2021-12-22 20:11:49,234 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2021-12-22 20:11:49,234 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2021-12-22 20:11:49,234 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 33 transitions. [2021-12-22 20:11:49,234 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-22 20:11:49,234 INFO L681 BuchiCegarLoop]: Abstraction has 28 states and 33 transitions. [2021-12-22 20:11:49,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 33 transitions. [2021-12-22 20:11:49,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 25. [2021-12-22 20:11:49,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.16) internal successors, (29), 24 states have internal predecessors, (29), 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) [2021-12-22 20:11:49,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2021-12-22 20:11:49,236 INFO L704 BuchiCegarLoop]: Abstraction has 25 states and 29 transitions. [2021-12-22 20:11:49,236 INFO L587 BuchiCegarLoop]: Abstraction has 25 states and 29 transitions. [2021-12-22 20:11:49,236 INFO L425 BuchiCegarLoop]: ======== Iteration 11============ [2021-12-22 20:11:49,236 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 29 transitions. [2021-12-22 20:11:49,236 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2021-12-22 20:11:49,236 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-22 20:11:49,236 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-22 20:11:49,236 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 20:11:49,236 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2021-12-22 20:11:49,236 INFO L791 eck$LassoCheckResult]: Stem: 1025#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(16, 2);call #Ultimate.allocInit(12, 3); 1026#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_~argc#1, main_~#argv#1.base, main_~#argv#1.offset;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;assume { :begin_inline_q1 } true;q1_#in~argc#1, q1_#in~argv#1.base, q1_#in~argv#1.offset := main_~argc#1, main_~#argv#1.base, main_~#argv#1.offset;havoc q1_#t~nondet16#1, q1_#t~switch17#1, q1_#t~pre18#1, q1_#t~pre19#1, q1_#t~pre20#1, q1_#t~nondet22#1, q1_#t~mem23#1, q1_#t~mem24#1, q1_#t~post21#1, q1_~r~0#1, q1_~temp~0#1, q1_~argc#1, q1_~argv#1.base, q1_~argv#1.offset, q1_~N~0#1, q1_~#a~1#1.base, q1_~#a~1#1.offset, q1_~i~1#1;q1_~argc#1 := q1_#in~argc#1;q1_~argv#1.base, q1_~argv#1.offset := q1_#in~argv#1.base, q1_#in~argv#1.offset; 1029#L56 assume !(q1_~argc#1 < 2);q1_~N~0#1 := q1_#t~nondet16#1;havoc q1_#t~nondet16#1;call q1_~#a~1#1.base, q1_~#a~1#1.offset := #Ultimate.allocOnStack(4 * q1_~N~0#1);havoc q1_~i~1#1;q1_#t~switch17#1 := false; 1030#L65 assume !q1_#t~switch17#1;q1_#t~switch17#1 := q1_#t~switch17#1; 1047#L69 assume !q1_#t~switch17#1;q1_#t~switch17#1 := true; 1045#L73 assume q1_#t~switch17#1;q1_~i~1#1 := 0; 1046#L74-3 assume !!(q1_~i~1#1 < q1_~N~0#1);call write~int(q1_~i~1#1, q1_~#a~1#1.base, q1_~#a~1#1.offset + 4 * q1_~i~1#1, 4); 1037#L74-2 q1_#t~pre20#1 := 1 + q1_~i~1#1;q1_~i~1#1 := 1 + q1_~i~1#1;havoc q1_#t~pre20#1; 1038#L74-3 assume !!(q1_~i~1#1 < q1_~N~0#1);call write~int(q1_~i~1#1, q1_~#a~1#1.base, q1_~#a~1#1.offset + 4 * q1_~i~1#1, 4); 1048#L74-2 q1_#t~pre20#1 := 1 + q1_~i~1#1;q1_~i~1#1 := 1 + q1_~i~1#1;havoc q1_#t~pre20#1; 1049#L74-3 assume !(q1_~i~1#1 < q1_~N~0#1); 1039#L74-4 q1_~i~1#1 := 0; 1040#L76-3 assume !!(q1_~i~1#1 < q1_~N~0#1);q1_~r~0#1 := q1_~i~1#1 + (if q1_#t~nondet22#1 < 0 && 0 != q1_#t~nondet22#1 % (q1_~N~0#1 - q1_~i~1#1) then (if q1_~N~0#1 - q1_~i~1#1 < 0 then q1_#t~nondet22#1 % (q1_~N~0#1 - q1_~i~1#1) + (q1_~N~0#1 - q1_~i~1#1) else q1_#t~nondet22#1 % (q1_~N~0#1 - q1_~i~1#1) - (q1_~N~0#1 - q1_~i~1#1)) else q1_#t~nondet22#1 % (q1_~N~0#1 - q1_~i~1#1));havoc q1_#t~nondet22#1;call q1_#t~mem23#1 := read~int(q1_~#a~1#1.base, q1_~#a~1#1.offset + 4 * q1_~i~1#1, 4);q1_~temp~0#1 := q1_#t~mem23#1;havoc q1_#t~mem23#1;call q1_#t~mem24#1 := read~int(q1_~#a~1#1.base, q1_~#a~1#1.offset + 4 * q1_~r~0#1, 4);call write~int(q1_#t~mem24#1, q1_~#a~1#1.base, q1_~#a~1#1.offset + 4 * q1_~i~1#1, 4);havoc q1_#t~mem24#1;call write~int(q1_~temp~0#1, q1_~#a~1#1.base, q1_~#a~1#1.offset + 4 * q1_~r~0#1, 4); 1031#L76-2 q1_#t~post21#1 := q1_~i~1#1;q1_~i~1#1 := 1 + q1_#t~post21#1;havoc q1_#t~post21#1; 1032#L76-3 assume !!(q1_~i~1#1 < q1_~N~0#1);q1_~r~0#1 := q1_~i~1#1 + (if q1_#t~nondet22#1 < 0 && 0 != q1_#t~nondet22#1 % (q1_~N~0#1 - q1_~i~1#1) then (if q1_~N~0#1 - q1_~i~1#1 < 0 then q1_#t~nondet22#1 % (q1_~N~0#1 - q1_~i~1#1) + (q1_~N~0#1 - q1_~i~1#1) else q1_#t~nondet22#1 % (q1_~N~0#1 - q1_~i~1#1) - (q1_~N~0#1 - q1_~i~1#1)) else q1_#t~nondet22#1 % (q1_~N~0#1 - q1_~i~1#1));havoc q1_#t~nondet22#1;call q1_#t~mem23#1 := read~int(q1_~#a~1#1.base, q1_~#a~1#1.offset + 4 * q1_~i~1#1, 4);q1_~temp~0#1 := q1_#t~mem23#1;havoc q1_#t~mem23#1;call q1_#t~mem24#1 := read~int(q1_~#a~1#1.base, q1_~#a~1#1.offset + 4 * q1_~r~0#1, 4);call write~int(q1_#t~mem24#1, q1_~#a~1#1.base, q1_~#a~1#1.offset + 4 * q1_~i~1#1, 4);havoc q1_#t~mem24#1;call write~int(q1_~temp~0#1, q1_~#a~1#1.base, q1_~#a~1#1.offset + 4 * q1_~r~0#1, 4); 1033#L76-2 q1_#t~post21#1 := q1_~i~1#1;q1_~i~1#1 := 1 + q1_#t~post21#1;havoc q1_#t~post21#1; 1034#L76-3 assume !(q1_~i~1#1 < q1_~N~0#1); 1027#L63 havoc q1_#t~switch17#1;assume { :begin_inline_bubblesort } true;bubblesort_#in~size#1, bubblesort_#in~item#1.base, bubblesort_#in~item#1.offset := q1_~N~0#1, q1_~#a~1#1.base, q1_~#a~1#1.offset;havoc bubblesort_#t~mem6#1, bubblesort_#t~mem7#1, bubblesort_#t~mem8#1, bubblesort_#t~mem9#1, bubblesort_#t~pre5#1, bubblesort_#t~pre4#1, bubblesort_~size#1, bubblesort_~item#1.base, bubblesort_~item#1.offset, bubblesort_~a~0#1, bubblesort_~b~0#1, bubblesort_~t~0#1;bubblesort_~size#1 := bubblesort_#in~size#1;bubblesort_~item#1.base, bubblesort_~item#1.offset := bubblesort_#in~item#1.base, bubblesort_#in~item#1.offset;havoc bubblesort_~a~0#1;havoc bubblesort_~b~0#1;havoc bubblesort_~t~0#1;bubblesort_~a~0#1 := 1; 1028#L18-3 [2021-12-22 20:11:49,236 INFO L793 eck$LassoCheckResult]: Loop: 1028#L18-3 assume !!(bubblesort_~a~0#1 < bubblesort_~size#1);bubblesort_~b~0#1 := bubblesort_~size#1 - 1; 1042#L20-3 assume !!(bubblesort_~b~0#1 >= bubblesort_~a~0#1); 1043#L23 assume bubblesort_~b~0#1 - 1 < bubblesort_~size#1 && bubblesort_~b~0#1 < bubblesort_~size#1;call bubblesort_#t~mem6#1 := read~int(bubblesort_~item#1.base, bubblesort_~item#1.offset + 4 * (bubblesort_~b~0#1 - 1), 4);call bubblesort_#t~mem7#1 := read~int(bubblesort_~item#1.base, bubblesort_~item#1.offset + 4 * bubblesort_~b~0#1, 4); 1035#L25 assume bubblesort_#t~mem6#1 > bubblesort_#t~mem7#1;havoc bubblesort_#t~mem6#1;havoc bubblesort_#t~mem7#1;call bubblesort_#t~mem8#1 := read~int(bubblesort_~item#1.base, bubblesort_~item#1.offset + 4 * (bubblesort_~b~0#1 - 1), 4);bubblesort_~t~0#1 := bubblesort_#t~mem8#1;havoc bubblesort_#t~mem8#1;call bubblesort_#t~mem9#1 := read~int(bubblesort_~item#1.base, bubblesort_~item#1.offset + 4 * bubblesort_~b~0#1, 4);call write~int(bubblesort_#t~mem9#1, bubblesort_~item#1.base, bubblesort_~item#1.offset + 4 * (bubblesort_~b~0#1 - 1), 4);havoc bubblesort_#t~mem9#1;call write~int(bubblesort_~t~0#1, bubblesort_~item#1.base, bubblesort_~item#1.offset + 4 * bubblesort_~b~0#1, 4); 1036#L20-2 bubblesort_#t~pre5#1 := bubblesort_~b~0#1 - 1;bubblesort_~b~0#1 := bubblesort_~b~0#1 - 1;havoc bubblesort_#t~pre5#1; 1044#L20-3 assume !(bubblesort_~b~0#1 >= bubblesort_~a~0#1); 1041#L18-2 bubblesort_#t~pre4#1 := 1 + bubblesort_~a~0#1;bubblesort_~a~0#1 := 1 + bubblesort_~a~0#1;havoc bubblesort_#t~pre4#1; 1028#L18-3 [2021-12-22 20:11:49,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 20:11:49,237 INFO L85 PathProgramCache]: Analyzing trace with hash 1273080179, now seen corresponding path program 2 times [2021-12-22 20:11:49,237 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 20:11:49,237 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369699498] [2021-12-22 20:11:49,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 20:11:49,237 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 20:11:49,243 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-22 20:11:49,243 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1691284819] [2021-12-22 20:11:49,243 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-22 20:11:49,243 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 20:11:49,243 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 20:11:49,247 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-22 20:11:49,247 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Waiting until timeout for monitored process [2021-12-22 20:11:49,298 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-22 20:11:49,298 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2021-12-22 20:11:49,298 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-22 20:11:49,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-22 20:11:49,319 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-22 20:11:49,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 20:11:49,320 INFO L85 PathProgramCache]: Analyzing trace with hash -1669532239, now seen corresponding path program 4 times [2021-12-22 20:11:49,320 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 20:11:49,320 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297661052] [2021-12-22 20:11:49,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 20:11:49,320 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 20:11:49,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-22 20:11:49,325 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-22 20:11:49,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-22 20:11:49,328 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-22 20:11:49,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 20:11:49,329 INFO L85 PathProgramCache]: Analyzing trace with hash 1247881215, now seen corresponding path program 2 times [2021-12-22 20:11:49,329 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 20:11:49,329 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046654528] [2021-12-22 20:11:49,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 20:11:49,329 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 20:11:49,335 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-22 20:11:49,336 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2121050344] [2021-12-22 20:11:49,336 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-22 20:11:49,336 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 20:11:49,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 20:11:49,337 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-22 20:11:49,338 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Waiting until timeout for monitored process [2021-12-22 20:11:49,397 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-22 20:11:49,397 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2021-12-22 20:11:49,397 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-22 20:11:49,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-22 20:11:49,423 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-22 20:11:52,791 INFO L210 LassoAnalysis]: Preferences: [2021-12-22 20:11:52,791 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-22 20:11:52,791 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-22 20:11:52,791 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-22 20:11:52,791 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-22 20:11:52,791 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-22 20:11:52,791 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-22 20:11:52,791 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-22 20:11:52,791 INFO L133 ssoRankerPreferences]: Filename of dumped script: bubble_sort-1.c_Iteration11_Lasso [2021-12-22 20:11:52,791 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-22 20:11:52,791 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-22 20:11:52,794 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-22 20:11:52,796 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-22 20:11:52,797 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-22 20:11:52,799 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-22 20:11:52,800 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-22 20:11:52,801 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-22 20:11:52,802 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-22 20:11:52,809 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-22 20:11:52,810 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-22 20:11:52,811 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-22 20:11:52,813 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-22 20:11:52,814 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-22 20:11:52,815 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-22 20:11:52,817 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-22 20:11:52,823 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-22 20:11:52,824 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-22 20:11:52,825 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-22 20:11:52,827 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-22 20:11:52,831 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-22 20:11:52,833 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-22 20:11:52,834 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-22 20:11:52,835 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-22 20:11:53,648 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.IllegalArgumentException at de.uni_freiburg.informatik.ultimate.util.datastructures.ScopedHashMap.put(ScopedHashMap.java:331) at java.base/java.util.AbstractMap.putAll(AbstractMap.java:281) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.PureSubstitution.(PureSubstitution.java:81) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.Substitution.(Substitution.java:48) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.Substitution.apply(Substitution.java:59) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.replaceMapReads(MapEliminator.java:518) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.getRewrittenTransFormula(MapEliminator.java:342) at de.uni_freiburg.informatik.ultimate.lassoranker.preprocessors.MapEliminationLassoPreprocessor.process(MapEliminationLassoPreprocessor.java:111) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.applyPreprocessor(LassoBuilder.java:154) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.preprocess(LassoBuilder.java:262) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.preprocess(LassoAnalysis.java:280) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.(LassoAnalysis.java:229) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.synthesize(LassoCheck.java:609) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkLassoTermination(LassoCheck.java:953) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.(LassoCheck.java:862) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.(LassoCheck.java:252) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.iterate(BuchiCegarLoop.java:457) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:142) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:397) 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) [2021-12-22 20:11:53,657 INFO L158 Benchmark]: Toolchain (without parser) took 13210.43ms. Allocated memory was 113.2MB in the beginning and 239.1MB in the end (delta: 125.8MB). Free memory was 84.2MB in the beginning and 192.2MB in the end (delta: -108.1MB). Peak memory consumption was 146.9MB. Max. memory is 16.1GB. [2021-12-22 20:11:53,657 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 113.2MB. Free memory was 72.3MB in the beginning and 72.2MB in the end (delta: 84.1kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-22 20:11:53,658 INFO L158 Benchmark]: CACSL2BoogieTranslator took 211.23ms. Allocated memory was 113.2MB in the beginning and 159.4MB in the end (delta: 46.1MB). Free memory was 83.9MB in the beginning and 131.9MB in the end (delta: -48.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-12-22 20:11:53,658 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.43ms. Allocated memory is still 159.4MB. Free memory was 131.9MB in the beginning and 130.3MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-22 20:11:53,658 INFO L158 Benchmark]: Boogie Preprocessor took 36.01ms. Allocated memory is still 159.4MB. Free memory was 130.3MB in the beginning and 128.9MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-22 20:11:53,658 INFO L158 Benchmark]: RCFGBuilder took 331.04ms. Allocated memory is still 159.4MB. Free memory was 128.6MB in the beginning and 116.3MB in the end (delta: 12.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2021-12-22 20:11:53,658 INFO L158 Benchmark]: BuchiAutomizer took 12577.84ms. Allocated memory was 159.4MB in the beginning and 239.1MB in the end (delta: 79.7MB). Free memory was 116.1MB in the beginning and 192.2MB in the end (delta: -76.2MB). Peak memory consumption was 135.7MB. Max. memory is 16.1GB. [2021-12-22 20:11:53,659 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.10ms. Allocated memory is still 113.2MB. Free memory was 72.3MB in the beginning and 72.2MB in the end (delta: 84.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 211.23ms. Allocated memory was 113.2MB in the beginning and 159.4MB in the end (delta: 46.1MB). Free memory was 83.9MB in the beginning and 131.9MB in the end (delta: -48.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 50.43ms. Allocated memory is still 159.4MB. Free memory was 131.9MB in the beginning and 130.3MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 36.01ms. Allocated memory is still 159.4MB. Free memory was 130.3MB in the beginning and 128.9MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 331.04ms. Allocated memory is still 159.4MB. Free memory was 128.6MB in the beginning and 116.3MB in the end (delta: 12.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * BuchiAutomizer took 12577.84ms. Allocated memory was 159.4MB in the beginning and 239.1MB in the end (delta: 79.7MB). Free memory was 116.1MB in the beginning and 192.2MB in the end (delta: -76.2MB). Peak memory consumption was 135.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: IllegalArgumentException: null de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: IllegalArgumentException: null: de.uni_freiburg.informatik.ultimate.util.datastructures.ScopedHashMap.put(ScopedHashMap.java:331) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2021-12-22 20:11:53,681 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Forceful destruction successful, exit code 0 [2021-12-22 20:11:53,880 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Ended with exit code 0 [2021-12-22 20:11:54,081 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Forceful destruction successful, exit code 0 [2021-12-22 20:11:54,282 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Forceful destruction successful, exit code 0 [2021-12-22 20:11:54,481 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2021-12-22 20:11:54,681 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2021-12-22 20:11:54,881 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2021-12-22 20:11:55,081 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2021-12-22 20:11:55,281 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2021-12-22 20:11:55,482 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2021-12-22 20:11:55,681 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2021-12-22 20:11:55,882 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2021-12-22 20:11:56,083 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with 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: IllegalArgumentException: null