./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/loops/bubble_sort-1.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/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-03d7b7b [2022-02-21 03:57:29,150 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-21 03:57:29,152 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-21 03:57:29,187 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-21 03:57:29,187 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-21 03:57:29,190 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-21 03:57:29,191 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-21 03:57:29,194 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-21 03:57:29,195 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-21 03:57:29,199 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-21 03:57:29,199 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-21 03:57:29,200 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-21 03:57:29,201 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-21 03:57:29,202 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-21 03:57:29,204 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-21 03:57:29,206 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-21 03:57:29,207 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-21 03:57:29,207 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-21 03:57:29,209 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-21 03:57:29,213 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-21 03:57:29,214 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-21 03:57:29,215 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-21 03:57:29,216 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-21 03:57:29,217 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-21 03:57:29,219 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-21 03:57:29,219 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-21 03:57:29,219 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-21 03:57:29,220 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-21 03:57:29,221 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-21 03:57:29,222 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-21 03:57:29,222 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-21 03:57:29,223 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-21 03:57:29,224 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-21 03:57:29,225 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-21 03:57:29,226 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-21 03:57:29,226 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-21 03:57:29,226 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-21 03:57:29,227 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-21 03:57:29,227 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-21 03:57:29,227 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-21 03:57:29,228 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-21 03:57:29,229 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2022-02-21 03:57:29,255 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-21 03:57:29,255 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-21 03:57:29,256 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-21 03:57:29,256 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-21 03:57:29,257 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-21 03:57:29,257 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-21 03:57:29,257 INFO L138 SettingsManager]: * Use SBE=true [2022-02-21 03:57:29,257 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-02-21 03:57:29,257 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-02-21 03:57:29,257 INFO L138 SettingsManager]: * Use old map elimination=false [2022-02-21 03:57:29,258 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-02-21 03:57:29,258 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-02-21 03:57:29,258 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-02-21 03:57:29,259 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-21 03:57:29,259 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-21 03:57:29,259 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-21 03:57:29,259 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-21 03:57:29,259 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-21 03:57:29,259 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-21 03:57:29,259 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-02-21 03:57:29,260 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-02-21 03:57:29,260 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-02-21 03:57:29,260 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-21 03:57:29,260 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-21 03:57:29,260 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-02-21 03:57:29,260 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-21 03:57:29,260 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-02-21 03:57:29,261 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-21 03:57:29,261 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-21 03:57:29,261 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-21 03:57:29,261 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-21 03:57:29,262 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-02-21 03:57:29,262 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 [2022-02-21 03:57:29,453 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-21 03:57:29,478 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-21 03:57:29,480 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-21 03:57:29,481 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-21 03:57:29,481 INFO L275 PluginConnector]: CDTParser initialized [2022-02-21 03:57:29,482 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loops/bubble_sort-1.c [2022-02-21 03:57:29,555 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5d5e24e01/39a94463cbd1433591e77eb9b7c7adb5/FLAGb97b9550a [2022-02-21 03:57:29,876 INFO L306 CDTParser]: Found 1 translation units. [2022-02-21 03:57:29,877 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops/bubble_sort-1.c [2022-02-21 03:57:29,883 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5d5e24e01/39a94463cbd1433591e77eb9b7c7adb5/FLAGb97b9550a [2022-02-21 03:57:30,310 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5d5e24e01/39a94463cbd1433591e77eb9b7c7adb5 [2022-02-21 03:57:30,312 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-21 03:57:30,313 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-21 03:57:30,315 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-21 03:57:30,315 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-21 03:57:30,318 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-21 03:57:30,319 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:57:30" (1/1) ... [2022-02-21 03:57:30,320 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b6e2a08 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:57:30, skipping insertion in model container [2022-02-21 03:57:30,320 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:57:30" (1/1) ... [2022-02-21 03:57:30,324 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-21 03:57:30,336 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 03:57:30,448 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] [2022-02-21 03:57:30,483 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:57:30,489 INFO L203 MainTranslator]: Completed pre-run [2022-02-21 03:57:30,497 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] [2022-02-21 03:57:30,507 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:57:30,516 INFO L208 MainTranslator]: Completed translation [2022-02-21 03:57:30,516 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:57:30 WrapperNode [2022-02-21 03:57:30,516 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-21 03:57:30,518 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-21 03:57:30,518 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-21 03:57:30,518 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-21 03:57:30,522 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:57:30" (1/1) ... [2022-02-21 03:57:30,540 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:57:30" (1/1) ... [2022-02-21 03:57:30,566 INFO L137 Inliner]: procedures = 17, calls = 29, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 117 [2022-02-21 03:57:30,567 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-21 03:57:30,568 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-21 03:57:30,568 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-21 03:57:30,568 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-21 03:57:30,573 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:57:30" (1/1) ... [2022-02-21 03:57:30,573 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:57:30" (1/1) ... [2022-02-21 03:57:30,576 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:57:30" (1/1) ... [2022-02-21 03:57:30,576 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:57:30" (1/1) ... [2022-02-21 03:57:30,582 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:57:30" (1/1) ... [2022-02-21 03:57:30,585 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:57:30" (1/1) ... [2022-02-21 03:57:30,586 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:57:30" (1/1) ... [2022-02-21 03:57:30,588 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-21 03:57:30,589 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-21 03:57:30,589 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-21 03:57:30,589 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-21 03:57:30,589 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:57:30" (1/1) ... [2022-02-21 03:57:30,607 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:57:30,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:57:30,624 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:57:30,628 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2022-02-21 03:57:30,662 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-21 03:57:30,662 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-21 03:57:30,662 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-21 03:57:30,663 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-21 03:57:30,663 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-21 03:57:30,663 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-21 03:57:30,663 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-21 03:57:30,663 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-21 03:57:30,718 INFO L234 CfgBuilder]: Building ICFG [2022-02-21 03:57:30,720 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-21 03:57:30,955 INFO L275 CfgBuilder]: Performing block encoding [2022-02-21 03:57:30,960 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-21 03:57:30,960 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2022-02-21 03:57:30,962 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:57:30 BoogieIcfgContainer [2022-02-21 03:57:30,962 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-21 03:57:30,962 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-02-21 03:57:30,963 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-02-21 03:57:30,965 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-02-21 03:57:30,965 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:57:30,966 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 21.02 03:57:30" (1/3) ... [2022-02-21 03:57:30,966 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@68197cde and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 03:57:30, skipping insertion in model container [2022-02-21 03:57:30,967 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:57:30,967 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:57:30" (2/3) ... [2022-02-21 03:57:30,967 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@68197cde and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 03:57:30, skipping insertion in model container [2022-02-21 03:57:30,967 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:57:30,967 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:57:30" (3/3) ... [2022-02-21 03:57:30,968 INFO L388 chiAutomizerObserver]: Analyzing ICFG bubble_sort-1.c [2022-02-21 03:57:30,997 INFO L359 BuchiCegarLoop]: Interprodecural is true [2022-02-21 03:57:30,999 INFO L360 BuchiCegarLoop]: Hoare is false [2022-02-21 03:57:31,000 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-02-21 03:57:31,000 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-02-21 03:57:31,000 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-02-21 03:57:31,000 INFO L364 BuchiCegarLoop]: Difference is false [2022-02-21 03:57:31,000 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-02-21 03:57:31,001 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2022-02-21 03:57:31,012 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) [2022-02-21 03:57:31,029 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 14 [2022-02-21 03:57:31,029 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:57:31,029 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:57:31,033 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2022-02-21 03:57:31,033 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 03:57:31,033 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2022-02-21 03:57:31,034 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) [2022-02-21 03:57:31,042 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 14 [2022-02-21 03:57:31,042 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:57:31,043 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:57:31,043 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2022-02-21 03:57:31,043 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 03:57:31,048 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 [2022-02-21 03:57:31,048 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 [2022-02-21 03:57:31,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:57:31,052 INFO L85 PathProgramCache]: Analyzing trace with hash 925670, now seen corresponding path program 1 times [2022-02-21 03:57:31,058 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:57:31,058 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053778374] [2022-02-21 03:57:31,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:57:31,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:57:31,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:57:31,195 INFO L290 TraceCheckUtils]: 0: Hoare triple {31#true} 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); {31#true} is VALID [2022-02-21 03:57:31,195 INFO L290 TraceCheckUtils]: 1: Hoare triple {31#true} 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; {31#true} is VALID [2022-02-21 03:57:31,197 INFO L290 TraceCheckUtils]: 2: Hoare triple {31#true} 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; {33#(not |ULTIMATE.start_q1_#t~switch17#1|)} is VALID [2022-02-21 03:57:31,197 INFO L290 TraceCheckUtils]: 3: Hoare triple {33#(not |ULTIMATE.start_q1_#t~switch17#1|)} assume q1_#t~switch17#1;q1_~i~1#1 := 0; {32#false} is VALID [2022-02-21 03:57:31,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:57:31,198 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:57:31,199 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053778374] [2022-02-21 03:57:31,200 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1053778374] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:57:31,200 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:57:31,200 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-21 03:57:31,203 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603690797] [2022-02-21 03:57:31,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:57:31,206 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 03:57:31,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:57:31,207 INFO L85 PathProgramCache]: Analyzing trace with hash 1539, now seen corresponding path program 1 times [2022-02-21 03:57:31,208 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:57:31,208 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675795904] [2022-02-21 03:57:31,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:57:31,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:57:31,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:57:31,229 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:57:31,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:57:31,246 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:57:31,301 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:57:31,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 03:57:31,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:57:31,324 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) [2022-02-21 03:57:31,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:57:31,381 INFO L93 Difference]: Finished difference Result 24 states and 31 transitions. [2022-02-21 03:57:31,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 03:57:31,382 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 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) [2022-02-21 03:57:31,390 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 4 edges. 4 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:57:31,395 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 31 transitions. [2022-02-21 03:57:31,405 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2022-02-21 03:57:31,410 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 19 states and 25 transitions. [2022-02-21 03:57:31,410 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2022-02-21 03:57:31,411 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2022-02-21 03:57:31,411 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 25 transitions. [2022-02-21 03:57:31,412 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:57:31,412 INFO L681 BuchiCegarLoop]: Abstraction has 19 states and 25 transitions. [2022-02-21 03:57:31,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 25 transitions. [2022-02-21 03:57:31,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2022-02-21 03:57:31,428 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:57:31,429 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states and 25 transitions. Second 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) [2022-02-21 03:57:31,430 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states and 25 transitions. Second 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) [2022-02-21 03:57:31,431 INFO L87 Difference]: Start difference. First operand 19 states and 25 transitions. Second 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) [2022-02-21 03:57:31,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:57:31,433 INFO L93 Difference]: Finished difference Result 19 states and 25 transitions. [2022-02-21 03:57:31,434 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 25 transitions. [2022-02-21 03:57:31,434 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:57:31,435 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:57:31,435 INFO L74 IsIncluded]: Start isIncluded. First 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) Second operand 19 states and 25 transitions. [2022-02-21 03:57:31,436 INFO L87 Difference]: Start difference. First 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) Second operand 19 states and 25 transitions. [2022-02-21 03:57:31,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:57:31,438 INFO L93 Difference]: Finished difference Result 19 states and 25 transitions. [2022-02-21 03:57:31,438 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 25 transitions. [2022-02-21 03:57:31,438 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:57:31,438 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:57:31,438 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:57:31,439 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:57:31,440 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) [2022-02-21 03:57:31,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 24 transitions. [2022-02-21 03:57:31,444 INFO L704 BuchiCegarLoop]: Abstraction has 18 states and 24 transitions. [2022-02-21 03:57:31,444 INFO L587 BuchiCegarLoop]: Abstraction has 18 states and 24 transitions. [2022-02-21 03:57:31,444 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2022-02-21 03:57:31,444 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 24 transitions. [2022-02-21 03:57:31,445 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2022-02-21 03:57:31,446 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:57:31,446 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:57:31,446 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2022-02-21 03:57:31,451 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 03:57:31,452 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 [2022-02-21 03:57:31,452 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 [2022-02-21 03:57:31,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:57:31,454 INFO L85 PathProgramCache]: Analyzing trace with hash 889584664, now seen corresponding path program 1 times [2022-02-21 03:57:31,454 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:57:31,455 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578780945] [2022-02-21 03:57:31,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:57:31,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:57:31,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:57:31,480 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:57:31,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:57:31,512 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:57:31,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:57:31,513 INFO L85 PathProgramCache]: Analyzing trace with hash 2691, now seen corresponding path program 1 times [2022-02-21 03:57:31,513 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:57:31,513 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590428016] [2022-02-21 03:57:31,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:57:31,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:57:31,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:57:31,520 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:57:31,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:57:31,527 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:57:31,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:57:31,529 INFO L85 PathProgramCache]: Analyzing trace with hash 192371930, now seen corresponding path program 1 times [2022-02-21 03:57:31,529 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:57:31,529 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954826619] [2022-02-21 03:57:31,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:57:31,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:57:31,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:57:31,561 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:57:31,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:57:31,579 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:57:32,073 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:57:32,074 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:57:32,074 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:57:32,074 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:57:32,074 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:57:32,074 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:57:32,074 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:57:32,075 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:57:32,075 INFO L133 ssoRankerPreferences]: Filename of dumped script: bubble_sort-1.c_Iteration2_Lasso [2022-02-21 03:57:32,075 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:57:32,075 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:57:32,087 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:57:32,092 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:57:32,302 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:57:32,306 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:57:32,309 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:57:32,317 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:57:32,319 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:57:32,322 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:57:32,324 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:57:32,326 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:57:32,329 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:57:32,331 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:57:32,333 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:57:32,339 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:57:32,341 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:57:32,348 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:57:32,350 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:57:32,352 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:57:32,729 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:57:32,732 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:57:32,734 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:57:32,735 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:57:32,736 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:57:32,758 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:57:32,766 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:57:32,766 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:57:32,766 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:57:32,766 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:57:32,766 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:57:32,769 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2022-02-21 03:57:32,769 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:57:32,770 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:57:32,784 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:57:32,801 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2022-02-21 03:57:32,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:57:32,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:57:32,802 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:57:32,804 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2022-02-21 03:57:32,805 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:57:32,811 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:57:32,811 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:57:32,811 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:57:32,811 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:57:32,815 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:57:32,815 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:57:32,835 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:57:32,852 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2022-02-21 03:57:32,852 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:57:32,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:57:32,854 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:57:32,867 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2022-02-21 03:57:32,868 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:57:32,874 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:57:32,875 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:57:32,875 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:57:32,875 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:57:32,877 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:57:32,877 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:57:32,888 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:57:32,906 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2022-02-21 03:57:32,906 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:57:32,906 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:57:32,908 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:57:32,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 [2022-02-21 03:57:32,919 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:57:32,920 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:57:32,920 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:57:32,920 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:57:32,922 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:57:32,922 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:57:32,926 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2022-02-21 03:57:32,939 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:57:32,957 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2022-02-21 03:57:32,957 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:57:32,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:57:32,958 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:57:32,960 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2022-02-21 03:57:32,961 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:57:32,968 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:57:32,968 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:57:32,968 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:57:32,968 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:57:32,970 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:57:32,970 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:57:32,983 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:57:33,001 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2022-02-21 03:57:33,002 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:57:33,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:57:33,003 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:57:33,003 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2022-02-21 03:57:33,005 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:57:33,011 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:57:33,011 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:57:33,011 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:57:33,011 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:57:33,018 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:57:33,018 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:57:33,020 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:57:33,035 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2022-02-21 03:57:33,036 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:57:33,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:57:33,037 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:57:33,037 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2022-02-21 03:57:33,039 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:57:33,045 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:57:33,045 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:57:33,045 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:57:33,045 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:57:33,047 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:57:33,047 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:57:33,063 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:57:33,079 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2022-02-21 03:57:33,079 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:57:33,080 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:57:33,082 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:57:33,085 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2022-02-21 03:57:33,085 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:57:33,092 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:57:33,092 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:57:33,092 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:57:33,092 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:57:33,094 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:57:33,094 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:57:33,116 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:57:33,134 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2022-02-21 03:57:33,134 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:57:33,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:57:33,135 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:57:33,143 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2022-02-21 03:57:33,157 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:57:33,164 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:57:33,165 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:57:33,165 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:57:33,165 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:57:33,167 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:57:33,168 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:57:33,182 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:57:33,200 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2022-02-21 03:57:33,200 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:57:33,200 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:57:33,209 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:57:33,215 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:57:33,222 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:57:33,222 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:57:33,222 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:57:33,222 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:57:33,226 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:57:33,226 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:57:33,232 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2022-02-21 03:57:33,238 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:57:33,250 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2022-02-21 03:57:33,250 INFO L444 ModelExtractionUtils]: 8 out of 16 variables were initially zero. Simplification set additionally 5 variables to zero. [2022-02-21 03:57:33,252 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:57:33,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:57:33,253 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:57:33,255 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2022-02-21 03:57:33,256 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:57:33,277 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-02-21 03:57:33,277 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:57:33,278 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 [] [2022-02-21 03:57:33,308 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2022-02-21 03:57:33,341 INFO L297 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2022-02-21 03:57:33,346 INFO L390 LassoCheck]: Loop: "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);" "q1_#t~pre20#1 := 1 + q1_~i~1#1;q1_~i~1#1 := 1 + q1_~i~1#1;havoc q1_#t~pre20#1;" [2022-02-21 03:57:33,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:57:33,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:57:33,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:57:33,397 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:57:33,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:57:33,404 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:57:33,417 INFO L290 TraceCheckUtils]: 0: Hoare triple {125#unseeded} 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); {125#unseeded} is VALID [2022-02-21 03:57:33,418 INFO L290 TraceCheckUtils]: 1: Hoare triple {125#unseeded} 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; {125#unseeded} is VALID [2022-02-21 03:57:33,418 INFO L290 TraceCheckUtils]: 2: Hoare triple {125#unseeded} 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; {125#unseeded} is VALID [2022-02-21 03:57:33,419 INFO L290 TraceCheckUtils]: 3: Hoare triple {125#unseeded} assume !q1_#t~switch17#1;q1_#t~switch17#1 := q1_#t~switch17#1; {125#unseeded} is VALID [2022-02-21 03:57:33,419 INFO L290 TraceCheckUtils]: 4: Hoare triple {125#unseeded} assume !q1_#t~switch17#1;q1_#t~switch17#1 := true; {125#unseeded} is VALID [2022-02-21 03:57:33,419 INFO L290 TraceCheckUtils]: 5: Hoare triple {125#unseeded} assume q1_#t~switch17#1;q1_~i~1#1 := 0; {125#unseeded} is VALID [2022-02-21 03:57:33,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:57:33,427 INFO L263 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 03:57:33,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:57:33,431 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:57:33,453 INFO L290 TraceCheckUtils]: 0: Hoare triple {128#(>= oldRank0 (+ |ULTIMATE.start_q1_~N~0#1| (* (- 1) |ULTIMATE.start_q1_~i~1#1|)))} 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); {188#(and (< |ULTIMATE.start_q1_~i~1#1| |ULTIMATE.start_q1_~N~0#1|) (>= oldRank0 (+ |ULTIMATE.start_q1_~N~0#1| (* |ULTIMATE.start_q1_~i~1#1| (- 1)))))} is VALID [2022-02-21 03:57:33,454 INFO L290 TraceCheckUtils]: 1: Hoare triple {188#(and (< |ULTIMATE.start_q1_~i~1#1| |ULTIMATE.start_q1_~N~0#1|) (>= oldRank0 (+ |ULTIMATE.start_q1_~N~0#1| (* |ULTIMATE.start_q1_~i~1#1| (- 1)))))} q1_#t~pre20#1 := 1 + q1_~i~1#1;q1_~i~1#1 := 1 + q1_~i~1#1;havoc q1_#t~pre20#1; {168#(or unseeded (and (>= oldRank0 0) (> oldRank0 (+ |ULTIMATE.start_q1_~N~0#1| (* (- 1) |ULTIMATE.start_q1_~i~1#1|)))))} is VALID [2022-02-21 03:57:33,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:57:33,455 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 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) [2022-02-21 03:57:33,461 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:57:33,462 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:57:33,462 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:33,464 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2022-02-21 03:57:33,465 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) [2022-02-21 03:57:33,520 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. [2022-02-21 03:57:33,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2022-02-21 03:57:33,520 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:57:33,520 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 24 transitions. cyclomatic complexity: 9 [2022-02-21 03:57:33,520 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:57:33,521 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:57:33,521 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. 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) [2022-02-21 03:57:33,522 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:57:33,522 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:57:33,522 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:57:33,522 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 40 transitions. [2022-02-21 03:57:33,523 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14 [2022-02-21 03:57:33,523 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:57:33,523 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:57:33,524 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 18 states and 24 transitions. cyclomatic complexity: 9 [2022-02-21 03:57:33,525 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 10 examples of accepted words. [2022-02-21 03:57:33,525 INFO L70 LassoExtractor]: Start lassoExtractor. 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) [2022-02-21 03:57:33,526 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:57:33,526 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:57:33,527 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 28 states and 40 transitions. cyclomatic complexity: 16 [2022-02-21 03:57:33,528 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 14 examples of accepted words. [2022-02-21 03:57:33,528 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 24 transitions. cyclomatic complexity: 9 Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:57:33,528 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:33,529 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:57:33,529 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:33,529 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 40 transitions. cyclomatic complexity: 16 Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:57:33,529 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:33,529 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 24 transitions. cyclomatic complexity: 9 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:57:33,529 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:33,530 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:57:33,530 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:33,530 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 40 transitions. cyclomatic complexity: 16 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:57:33,530 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:33,530 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 24 transitions. cyclomatic complexity: 9 Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:57:33,530 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:33,530 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:57:33,530 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:33,531 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 40 transitions. cyclomatic complexity: 16 Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:57:33,531 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:33,531 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 24 transitions. cyclomatic complexity: 9 Stem has 28 letters. Loop has 28 letters. [2022-02-21 03:57:33,531 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:33,531 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 28 letters. Loop has 28 letters. [2022-02-21 03:57:33,531 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:33,531 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 40 transitions. cyclomatic complexity: 16 Stem has 28 letters. Loop has 28 letters. [2022-02-21 03:57:33,532 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:33,532 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 24 transitions. cyclomatic complexity: 9 Stem has 18 letters. Loop has 18 letters. [2022-02-21 03:57:33,532 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:33,532 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 18 letters. Loop has 18 letters. [2022-02-21 03:57:33,532 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:33,532 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 40 transitions. cyclomatic complexity: 16 Stem has 18 letters. Loop has 18 letters. [2022-02-21 03:57:33,532 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:33,532 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 24 transitions. cyclomatic complexity: 9 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:57:33,532 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:33,533 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:57:33,533 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:33,533 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 40 transitions. cyclomatic complexity: 16 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:57:33,533 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:33,533 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 24 transitions. cyclomatic complexity: 9 Stem has 10 letters. Loop has 4 letters. [2022-02-21 03:57:33,533 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:33,533 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 10 letters. Loop has 4 letters. [2022-02-21 03:57:33,534 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:33,534 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 40 transitions. cyclomatic complexity: 16 Stem has 10 letters. Loop has 4 letters. [2022-02-21 03:57:33,534 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:33,534 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 24 transitions. cyclomatic complexity: 9 Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:57:33,534 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:33,534 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:57:33,534 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:33,535 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 40 transitions. cyclomatic complexity: 16 Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:57:33,535 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:33,535 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 24 transitions. cyclomatic complexity: 9 Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:57:33,535 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:33,535 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:57:33,535 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:33,535 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 40 transitions. cyclomatic complexity: 16 Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:57:33,535 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:33,536 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 24 transitions. cyclomatic complexity: 9 Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:57:33,536 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:33,536 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:57:33,536 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:33,536 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 40 transitions. cyclomatic complexity: 16 Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:57:33,536 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:33,536 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 24 transitions. cyclomatic complexity: 9 Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:57:33,537 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:33,537 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:57:33,537 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:33,537 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 40 transitions. cyclomatic complexity: 16 Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:57:33,537 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:33,537 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 24 transitions. cyclomatic complexity: 9 Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:57:33,537 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:33,537 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:57:33,538 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:33,538 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 40 transitions. cyclomatic complexity: 16 Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:57:33,538 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:33,538 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 24 transitions. cyclomatic complexity: 9 Stem has 9 letters. Loop has 2 letters. [2022-02-21 03:57:33,538 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:33,538 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 9 letters. Loop has 2 letters. [2022-02-21 03:57:33,538 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:33,538 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 40 transitions. cyclomatic complexity: 16 Stem has 9 letters. Loop has 2 letters. [2022-02-21 03:57:33,539 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:33,539 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 24 transitions. cyclomatic complexity: 9 Stem has 8 letters. Loop has 2 letters. [2022-02-21 03:57:33,539 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:33,539 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 8 letters. Loop has 2 letters. [2022-02-21 03:57:33,539 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:33,539 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 40 transitions. cyclomatic complexity: 16 Stem has 8 letters. Loop has 2 letters. [2022-02-21 03:57:33,539 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:33,539 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 24 transitions. cyclomatic complexity: 9 Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:57:33,540 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:33,540 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:57:33,540 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:33,540 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 40 transitions. cyclomatic complexity: 16 Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:57:33,540 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:33,540 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 24 transitions. cyclomatic complexity: 9 Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:57:33,540 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:33,540 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:57:33,541 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:33,541 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 40 transitions. cyclomatic complexity: 16 Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:57:33,541 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:33,541 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 24 transitions. cyclomatic complexity: 9 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:57:33,541 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:33,541 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:57:33,541 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:33,542 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 40 transitions. cyclomatic complexity: 16 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:57:33,542 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:33,542 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 24 transitions. cyclomatic complexity: 9 Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:57:33,542 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:33,542 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:57:33,542 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:33,542 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 40 transitions. cyclomatic complexity: 16 Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:57:33,542 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:33,542 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 24 transitions. cyclomatic complexity: 9 Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:57:33,543 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:33,543 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:57:33,543 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:33,543 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 40 transitions. cyclomatic complexity: 16 Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:57:33,543 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:33,543 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 24 transitions. cyclomatic complexity: 9 Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:57:33,543 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:33,544 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:57:33,544 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:33,544 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 40 transitions. cyclomatic complexity: 16 Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:57:33,544 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:33,544 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 24 transitions. cyclomatic complexity: 9 Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:57:33,544 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:33,544 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:57:33,544 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:33,544 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 40 transitions. cyclomatic complexity: 16 Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:57:33,545 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:33,545 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 24 transitions. cyclomatic complexity: 9 Stem has 13 letters. Loop has 4 letters. [2022-02-21 03:57:33,545 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:33,545 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 13 letters. Loop has 4 letters. [2022-02-21 03:57:33,545 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:33,545 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 40 transitions. cyclomatic complexity: 16 Stem has 13 letters. Loop has 4 letters. [2022-02-21 03:57:33,545 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:33,545 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 24 transitions. cyclomatic complexity: 9 Stem has 13 letters. Loop has 3 letters. [2022-02-21 03:57:33,546 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:33,546 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 13 letters. Loop has 3 letters. [2022-02-21 03:57:33,546 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:33,546 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 40 transitions. cyclomatic complexity: 16 Stem has 13 letters. Loop has 3 letters. [2022-02-21 03:57:33,546 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:33,546 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 24 transitions. cyclomatic complexity: 9 Stem has 8 letters. Loop has 2 letters. [2022-02-21 03:57:33,546 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:33,546 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 8 letters. Loop has 2 letters. [2022-02-21 03:57:33,547 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:33,547 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 40 transitions. cyclomatic complexity: 16 Stem has 8 letters. Loop has 2 letters. [2022-02-21 03:57:33,547 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:33,547 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 24 transitions. cyclomatic complexity: 9 Stem has 9 letters. Loop has 2 letters. [2022-02-21 03:57:33,547 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:33,547 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 9 letters. Loop has 2 letters. [2022-02-21 03:57:33,547 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:33,547 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 40 transitions. cyclomatic complexity: 16 Stem has 9 letters. Loop has 2 letters. [2022-02-21 03:57:33,548 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:33,548 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 24 transitions. cyclomatic complexity: 9 Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:57:33,548 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:33,548 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:57:33,548 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:33,548 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 40 transitions. cyclomatic complexity: 16 Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:57:33,548 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:33,548 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 24 transitions. cyclomatic complexity: 9 Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:57:33,548 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:33,549 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:57:33,549 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:33,549 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 40 transitions. cyclomatic complexity: 16 Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:57:33,549 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:33,549 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 24 transitions. cyclomatic complexity: 9 Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:57:33,549 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:33,549 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:57:33,550 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:33,550 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 40 transitions. cyclomatic complexity: 16 Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:57:33,550 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:33,550 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 24 transitions. cyclomatic complexity: 9 Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:57:33,550 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:33,550 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:57:33,550 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:33,550 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 40 transitions. cyclomatic complexity: 16 Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:57:33,551 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:33,551 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 24 transitions. cyclomatic complexity: 9 Stem has 10 letters. Loop has 4 letters. [2022-02-21 03:57:33,551 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:33,551 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 10 letters. Loop has 4 letters. [2022-02-21 03:57:33,551 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:33,551 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 40 transitions. cyclomatic complexity: 16 Stem has 10 letters. Loop has 4 letters. [2022-02-21 03:57:33,551 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:33,551 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 24 transitions. cyclomatic complexity: 9 Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:57:33,552 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:33,552 INFO L84 BuchiAccepts]: Start buchiAccepts 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) Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:57:33,552 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:33,552 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 40 transitions. cyclomatic complexity: 16 Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:57:33,552 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:33,552 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:57:33,553 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) [2022-02-21 03:57:33,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 20 transitions. [2022-02-21 03:57:33,554 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 20 transitions. Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:57:33,554 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:33,554 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 20 transitions. Stem has 8 letters. Loop has 2 letters. [2022-02-21 03:57:33,554 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:33,554 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 20 transitions. Stem has 6 letters. Loop has 4 letters. [2022-02-21 03:57:33,554 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:33,554 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 40 transitions. cyclomatic complexity: 16 [2022-02-21 03:57:33,556 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 14 [2022-02-21 03:57:33,557 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 26 states and 36 transitions. [2022-02-21 03:57:33,557 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2022-02-21 03:57:33,557 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2022-02-21 03:57:33,557 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 36 transitions. [2022-02-21 03:57:33,557 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:57:33,557 INFO L681 BuchiCegarLoop]: Abstraction has 26 states and 36 transitions. [2022-02-21 03:57:33,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 36 transitions. [2022-02-21 03:57:33,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 19. [2022-02-21 03:57:33,558 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:57:33,558 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states and 36 transitions. Second 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) [2022-02-21 03:57:33,559 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states and 36 transitions. Second 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) [2022-02-21 03:57:33,559 INFO L87 Difference]: Start difference. First operand 26 states and 36 transitions. Second 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) [2022-02-21 03:57:33,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:57:33,560 INFO L93 Difference]: Finished difference Result 26 states and 36 transitions. [2022-02-21 03:57:33,560 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 36 transitions. [2022-02-21 03:57:33,560 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:57:33,560 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:57:33,560 INFO L74 IsIncluded]: Start isIncluded. First 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) Second operand 26 states and 36 transitions. [2022-02-21 03:57:33,561 INFO L87 Difference]: Start difference. First 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) Second operand 26 states and 36 transitions. [2022-02-21 03:57:33,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:57:33,562 INFO L93 Difference]: Finished difference Result 26 states and 36 transitions. [2022-02-21 03:57:33,562 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 36 transitions. [2022-02-21 03:57:33,562 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:57:33,562 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:57:33,562 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:57:33,562 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:57:33,562 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) [2022-02-21 03:57:33,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 26 transitions. [2022-02-21 03:57:33,563 INFO L704 BuchiCegarLoop]: Abstraction has 19 states and 26 transitions. [2022-02-21 03:57:33,563 INFO L587 BuchiCegarLoop]: Abstraction has 19 states and 26 transitions. [2022-02-21 03:57:33,563 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2022-02-21 03:57:33,564 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 26 transitions. [2022-02-21 03:57:33,564 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2022-02-21 03:57:33,564 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:57:33,564 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:57:33,564 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:57:33,564 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-02-21 03:57:33,565 INFO L791 eck$LassoCheckResult]: Stem: 230#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); 231#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; 234#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; 235#L65 assume !q1_#t~switch17#1;q1_#t~switch17#1 := q1_#t~switch17#1; 248#L69 assume !q1_#t~switch17#1;q1_#t~switch17#1 := true; 246#L73 assume !q1_#t~switch17#1; 232#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; 233#L18-3 [2022-02-21 03:57:33,565 INFO L793 eck$LassoCheckResult]: Loop: 233#L18-3 assume !!(bubblesort_~a~0#1 < bubblesort_~size#1);bubblesort_~b~0#1 := bubblesort_~size#1 - 1; 244#L20-3 assume !(bubblesort_~b~0#1 >= bubblesort_~a~0#1); 243#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; 233#L18-3 [2022-02-21 03:57:33,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:57:33,565 INFO L85 PathProgramCache]: Analyzing trace with hash 1807321784, now seen corresponding path program 1 times [2022-02-21 03:57:33,565 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:57:33,566 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636047881] [2022-02-21 03:57:33,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:57:33,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:57:33,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:57:33,585 INFO L290 TraceCheckUtils]: 0: Hoare triple {304#true} 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); {304#true} is VALID [2022-02-21 03:57:33,585 INFO L290 TraceCheckUtils]: 1: Hoare triple {304#true} 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; {304#true} is VALID [2022-02-21 03:57:33,585 INFO L290 TraceCheckUtils]: 2: Hoare triple {304#true} 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; {304#true} is VALID [2022-02-21 03:57:33,586 INFO L290 TraceCheckUtils]: 3: Hoare triple {304#true} assume !q1_#t~switch17#1;q1_#t~switch17#1 := q1_#t~switch17#1; {304#true} is VALID [2022-02-21 03:57:33,586 INFO L290 TraceCheckUtils]: 4: Hoare triple {304#true} assume !q1_#t~switch17#1;q1_#t~switch17#1 := true; {306#|ULTIMATE.start_q1_#t~switch17#1|} is VALID [2022-02-21 03:57:33,586 INFO L290 TraceCheckUtils]: 5: Hoare triple {306#|ULTIMATE.start_q1_#t~switch17#1|} assume !q1_#t~switch17#1; {305#false} is VALID [2022-02-21 03:57:33,586 INFO L290 TraceCheckUtils]: 6: Hoare triple {305#false} 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; {305#false} is VALID [2022-02-21 03:57:33,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:57:33,587 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:57:33,587 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636047881] [2022-02-21 03:57:33,587 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [636047881] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:57:33,587 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:57:33,587 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 03:57:33,587 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641647605] [2022-02-21 03:57:33,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:57:33,588 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 03:57:33,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:57:33,588 INFO L85 PathProgramCache]: Analyzing trace with hash 114407, now seen corresponding path program 1 times [2022-02-21 03:57:33,588 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:57:33,588 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814734364] [2022-02-21 03:57:33,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:57:33,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:57:33,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:57:33,602 INFO L290 TraceCheckUtils]: 0: Hoare triple {307#true} assume !!(bubblesort_~a~0#1 < bubblesort_~size#1);bubblesort_~b~0#1 := bubblesort_~size#1 - 1; {309#(<= |ULTIMATE.start_bubblesort_~a~0#1| |ULTIMATE.start_bubblesort_~b~0#1|)} is VALID [2022-02-21 03:57:33,602 INFO L290 TraceCheckUtils]: 1: Hoare triple {309#(<= |ULTIMATE.start_bubblesort_~a~0#1| |ULTIMATE.start_bubblesort_~b~0#1|)} assume !(bubblesort_~b~0#1 >= bubblesort_~a~0#1); {308#false} is VALID [2022-02-21 03:57:33,602 INFO L290 TraceCheckUtils]: 2: Hoare triple {308#false} bubblesort_#t~pre4#1 := 1 + bubblesort_~a~0#1;bubblesort_~a~0#1 := 1 + bubblesort_~a~0#1;havoc bubblesort_#t~pre4#1; {308#false} is VALID [2022-02-21 03:57:33,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:57:33,603 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:57:33,603 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814734364] [2022-02-21 03:57:33,605 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1814734364] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:57:33,605 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:57:33,606 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-21 03:57:33,606 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944340812] [2022-02-21 03:57:33,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:57:33,606 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 03:57:33,606 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:57:33,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 03:57:33,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:57:33,608 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) [2022-02-21 03:57:33,671 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2022-02-21 03:57:33,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:57:33,683 INFO L93 Difference]: Finished difference Result 20 states and 27 transitions. [2022-02-21 03:57:33,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 03:57:33,684 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 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) [2022-02-21 03:57:33,687 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 3 edges. 3 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:57:33,689 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 27 transitions. [2022-02-21 03:57:33,690 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2022-02-21 03:57:33,695 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 20 states and 27 transitions. [2022-02-21 03:57:33,696 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2022-02-21 03:57:33,696 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2022-02-21 03:57:33,696 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 27 transitions. [2022-02-21 03:57:33,696 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:57:33,696 INFO L681 BuchiCegarLoop]: Abstraction has 20 states and 27 transitions. [2022-02-21 03:57:33,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 27 transitions. [2022-02-21 03:57:33,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2022-02-21 03:57:33,698 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:57:33,698 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states and 27 transitions. Second 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) [2022-02-21 03:57:33,698 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states and 27 transitions. Second 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) [2022-02-21 03:57:33,699 INFO L87 Difference]: Start difference. First operand 20 states and 27 transitions. Second 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) [2022-02-21 03:57:33,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:57:33,700 INFO L93 Difference]: Finished difference Result 20 states and 27 transitions. [2022-02-21 03:57:33,700 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 27 transitions. [2022-02-21 03:57:33,700 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:57:33,700 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:57:33,700 INFO L74 IsIncluded]: Start isIncluded. First 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) Second operand 20 states and 27 transitions. [2022-02-21 03:57:33,700 INFO L87 Difference]: Start difference. First 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) Second operand 20 states and 27 transitions. [2022-02-21 03:57:33,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:57:33,701 INFO L93 Difference]: Finished difference Result 20 states and 27 transitions. [2022-02-21 03:57:33,701 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 27 transitions. [2022-02-21 03:57:33,701 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:57:33,702 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:57:33,702 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:57:33,702 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:57:33,702 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) [2022-02-21 03:57:33,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 27 transitions. [2022-02-21 03:57:33,703 INFO L704 BuchiCegarLoop]: Abstraction has 20 states and 27 transitions. [2022-02-21 03:57:33,703 INFO L587 BuchiCegarLoop]: Abstraction has 20 states and 27 transitions. [2022-02-21 03:57:33,703 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2022-02-21 03:57:33,703 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 27 transitions. [2022-02-21 03:57:33,703 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2022-02-21 03:57:33,704 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:57:33,704 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:57:33,705 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:57:33,705 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2022-02-21 03:57:33,705 INFO L791 eck$LassoCheckResult]: Stem: 330#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); 331#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; 334#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; 335#L65 assume !q1_#t~switch17#1;q1_#t~switch17#1 := q1_#t~switch17#1; 349#L69 assume !q1_#t~switch17#1;q1_#t~switch17#1 := true; 347#L73 assume !q1_#t~switch17#1; 332#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; 333#L18-3 [2022-02-21 03:57:33,706 INFO L793 eck$LassoCheckResult]: Loop: 333#L18-3 assume !!(bubblesort_~a~0#1 < bubblesort_~size#1);bubblesort_~b~0#1 := bubblesort_~size#1 - 1; 344#L20-3 assume !!(bubblesort_~b~0#1 >= bubblesort_~a~0#1); 345#L23 assume !(bubblesort_~b~0#1 - 1 < bubblesort_~size#1 && bubblesort_~b~0#1 < bubblesort_~size#1); 339#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; 346#L20-3 assume !(bubblesort_~b~0#1 >= bubblesort_~a~0#1); 343#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; 333#L18-3 [2022-02-21 03:57:33,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:57:33,706 INFO L85 PathProgramCache]: Analyzing trace with hash 1807321784, now seen corresponding path program 2 times [2022-02-21 03:57:33,706 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:57:33,706 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693986374] [2022-02-21 03:57:33,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:57:33,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:57:33,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:57:33,748 INFO L290 TraceCheckUtils]: 0: Hoare triple {393#true} 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); {393#true} is VALID [2022-02-21 03:57:33,748 INFO L290 TraceCheckUtils]: 1: Hoare triple {393#true} 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; {393#true} is VALID [2022-02-21 03:57:33,748 INFO L290 TraceCheckUtils]: 2: Hoare triple {393#true} 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; {393#true} is VALID [2022-02-21 03:57:33,749 INFO L290 TraceCheckUtils]: 3: Hoare triple {393#true} assume !q1_#t~switch17#1;q1_#t~switch17#1 := q1_#t~switch17#1; {393#true} is VALID [2022-02-21 03:57:33,750 INFO L290 TraceCheckUtils]: 4: Hoare triple {393#true} assume !q1_#t~switch17#1;q1_#t~switch17#1 := true; {395#|ULTIMATE.start_q1_#t~switch17#1|} is VALID [2022-02-21 03:57:33,750 INFO L290 TraceCheckUtils]: 5: Hoare triple {395#|ULTIMATE.start_q1_#t~switch17#1|} assume !q1_#t~switch17#1; {394#false} is VALID [2022-02-21 03:57:33,751 INFO L290 TraceCheckUtils]: 6: Hoare triple {394#false} 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; {394#false} is VALID [2022-02-21 03:57:33,751 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:57:33,751 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:57:33,751 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693986374] [2022-02-21 03:57:33,751 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [693986374] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:57:33,751 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:57:33,751 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 03:57:33,752 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534348878] [2022-02-21 03:57:33,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:57:33,752 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 03:57:33,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:57:33,752 INFO L85 PathProgramCache]: Analyzing trace with hash -884895266, now seen corresponding path program 1 times [2022-02-21 03:57:33,752 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:57:33,753 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728089022] [2022-02-21 03:57:33,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:57:33,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:57:33,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:57:33,768 INFO L290 TraceCheckUtils]: 0: Hoare triple {396#true} assume !!(bubblesort_~a~0#1 < bubblesort_~size#1);bubblesort_~b~0#1 := bubblesort_~size#1 - 1; {398#(<= (+ |ULTIMATE.start_bubblesort_~b~0#1| 1) |ULTIMATE.start_bubblesort_~size#1|)} is VALID [2022-02-21 03:57:33,768 INFO L290 TraceCheckUtils]: 1: Hoare triple {398#(<= (+ |ULTIMATE.start_bubblesort_~b~0#1| 1) |ULTIMATE.start_bubblesort_~size#1|)} assume !!(bubblesort_~b~0#1 >= bubblesort_~a~0#1); {398#(<= (+ |ULTIMATE.start_bubblesort_~b~0#1| 1) |ULTIMATE.start_bubblesort_~size#1|)} is VALID [2022-02-21 03:57:33,769 INFO L290 TraceCheckUtils]: 2: Hoare triple {398#(<= (+ |ULTIMATE.start_bubblesort_~b~0#1| 1) |ULTIMATE.start_bubblesort_~size#1|)} assume !(bubblesort_~b~0#1 - 1 < bubblesort_~size#1 && bubblesort_~b~0#1 < bubblesort_~size#1); {397#false} is VALID [2022-02-21 03:57:33,769 INFO L290 TraceCheckUtils]: 3: Hoare triple {397#false} bubblesort_#t~pre5#1 := bubblesort_~b~0#1 - 1;bubblesort_~b~0#1 := bubblesort_~b~0#1 - 1;havoc bubblesort_#t~pre5#1; {397#false} is VALID [2022-02-21 03:57:33,769 INFO L290 TraceCheckUtils]: 4: Hoare triple {397#false} assume !(bubblesort_~b~0#1 >= bubblesort_~a~0#1); {397#false} is VALID [2022-02-21 03:57:33,769 INFO L290 TraceCheckUtils]: 5: Hoare triple {397#false} bubblesort_#t~pre4#1 := 1 + bubblesort_~a~0#1;bubblesort_~a~0#1 := 1 + bubblesort_~a~0#1;havoc bubblesort_#t~pre4#1; {397#false} is VALID [2022-02-21 03:57:33,769 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:57:33,770 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:57:33,770 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728089022] [2022-02-21 03:57:33,770 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [728089022] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:57:33,770 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:57:33,770 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-21 03:57:33,770 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711118081] [2022-02-21 03:57:33,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:57:33,771 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 03:57:33,771 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:57:33,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 03:57:33,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:57:33,772 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) [2022-02-21 03:57:33,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:57:33,805 INFO L93 Difference]: Finished difference Result 21 states and 27 transitions. [2022-02-21 03:57:33,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 03:57:33,805 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 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) [2022-02-21 03:57:33,809 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:57:33,810 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 27 transitions. [2022-02-21 03:57:33,811 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2022-02-21 03:57:33,811 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 21 states and 27 transitions. [2022-02-21 03:57:33,811 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2022-02-21 03:57:33,812 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2022-02-21 03:57:33,812 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 27 transitions. [2022-02-21 03:57:33,812 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:57:33,812 INFO L681 BuchiCegarLoop]: Abstraction has 21 states and 27 transitions. [2022-02-21 03:57:33,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 27 transitions. [2022-02-21 03:57:33,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2022-02-21 03:57:33,813 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:57:33,813 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states and 27 transitions. Second operand has 20 states, 20 states have (on average 1.3) internal successors, (26), 19 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:57:33,813 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states and 27 transitions. Second operand has 20 states, 20 states have (on average 1.3) internal successors, (26), 19 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:57:33,813 INFO L87 Difference]: Start difference. First operand 21 states and 27 transitions. Second operand has 20 states, 20 states have (on average 1.3) internal successors, (26), 19 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:57:33,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:57:33,814 INFO L93 Difference]: Finished difference Result 21 states and 27 transitions. [2022-02-21 03:57:33,814 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 27 transitions. [2022-02-21 03:57:33,814 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:57:33,814 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:57:33,814 INFO L74 IsIncluded]: Start isIncluded. First 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) Second operand 21 states and 27 transitions. [2022-02-21 03:57:33,815 INFO L87 Difference]: Start difference. First 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) Second operand 21 states and 27 transitions. [2022-02-21 03:57:33,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:57:33,815 INFO L93 Difference]: Finished difference Result 21 states and 27 transitions. [2022-02-21 03:57:33,815 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 27 transitions. [2022-02-21 03:57:33,816 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:57:33,816 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:57:33,816 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:57:33,816 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:57:33,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.3) internal successors, (26), 19 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:57:33,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 26 transitions. [2022-02-21 03:57:33,817 INFO L704 BuchiCegarLoop]: Abstraction has 20 states and 26 transitions. [2022-02-21 03:57:33,817 INFO L587 BuchiCegarLoop]: Abstraction has 20 states and 26 transitions. [2022-02-21 03:57:33,817 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2022-02-21 03:57:33,817 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 26 transitions. [2022-02-21 03:57:33,817 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2022-02-21 03:57:33,817 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:57:33,817 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:57:33,818 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:57:33,818 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:57:33,818 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; 439#L69 assume !q1_#t~switch17#1;q1_#t~switch17#1 := true; 437#L73 assume !q1_#t~switch17#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 [2022-02-21 03:57:33,818 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; 434#L20-3 assume !(bubblesort_~b~0#1 >= bubblesort_~a~0#1); 433#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 [2022-02-21 03:57:33,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:57:33,819 INFO L85 PathProgramCache]: Analyzing trace with hash 1807321784, now seen corresponding path program 3 times [2022-02-21 03:57:33,819 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:57:33,819 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459277956] [2022-02-21 03:57:33,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:57:33,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:57:33,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:57:33,834 INFO L290 TraceCheckUtils]: 0: Hoare triple {485#true} 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); {485#true} is VALID [2022-02-21 03:57:33,834 INFO L290 TraceCheckUtils]: 1: Hoare triple {485#true} 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; {485#true} is VALID [2022-02-21 03:57:33,834 INFO L290 TraceCheckUtils]: 2: Hoare triple {485#true} 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; {485#true} is VALID [2022-02-21 03:57:33,834 INFO L290 TraceCheckUtils]: 3: Hoare triple {485#true} assume !q1_#t~switch17#1;q1_#t~switch17#1 := q1_#t~switch17#1; {485#true} is VALID [2022-02-21 03:57:33,835 INFO L290 TraceCheckUtils]: 4: Hoare triple {485#true} assume !q1_#t~switch17#1;q1_#t~switch17#1 := true; {487#|ULTIMATE.start_q1_#t~switch17#1|} is VALID [2022-02-21 03:57:33,835 INFO L290 TraceCheckUtils]: 5: Hoare triple {487#|ULTIMATE.start_q1_#t~switch17#1|} assume !q1_#t~switch17#1; {486#false} is VALID [2022-02-21 03:57:33,835 INFO L290 TraceCheckUtils]: 6: Hoare triple {486#false} 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; {486#false} is VALID [2022-02-21 03:57:33,835 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:57:33,836 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:57:33,836 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459277956] [2022-02-21 03:57:33,836 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1459277956] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:57:33,836 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:57:33,836 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 03:57:33,836 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395406761] [2022-02-21 03:57:33,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:57:33,837 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 03:57:33,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:57:33,837 INFO L85 PathProgramCache]: Analyzing trace with hash -1669532239, now seen corresponding path program 1 times [2022-02-21 03:57:33,837 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:57:33,837 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166362346] [2022-02-21 03:57:33,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:57:33,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:57:33,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:57:33,847 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:57:33,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:57:33,853 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:57:33,978 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:57:33,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 03:57:33,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:57:33,978 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) [2022-02-21 03:57:34,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:57:34,020 INFO L93 Difference]: Finished difference Result 20 states and 25 transitions. [2022-02-21 03:57:34,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 03:57:34,020 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 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) [2022-02-21 03:57:34,025 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:57:34,026 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 25 transitions. [2022-02-21 03:57:34,026 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2022-02-21 03:57:34,027 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 20 states and 25 transitions. [2022-02-21 03:57:34,027 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2022-02-21 03:57:34,027 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2022-02-21 03:57:34,027 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 25 transitions. [2022-02-21 03:57:34,027 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:57:34,027 INFO L681 BuchiCegarLoop]: Abstraction has 20 states and 25 transitions. [2022-02-21 03:57:34,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 25 transitions. [2022-02-21 03:57:34,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2022-02-21 03:57:34,028 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:57:34,028 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states and 25 transitions. Second 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) [2022-02-21 03:57:34,028 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states and 25 transitions. Second 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) [2022-02-21 03:57:34,028 INFO L87 Difference]: Start difference. First operand 20 states and 25 transitions. Second 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) [2022-02-21 03:57:34,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:57:34,029 INFO L93 Difference]: Finished difference Result 20 states and 25 transitions. [2022-02-21 03:57:34,029 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 25 transitions. [2022-02-21 03:57:34,029 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:57:34,029 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:57:34,029 INFO L74 IsIncluded]: Start isIncluded. First 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) Second operand 20 states and 25 transitions. [2022-02-21 03:57:34,029 INFO L87 Difference]: Start difference. First 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) Second operand 20 states and 25 transitions. [2022-02-21 03:57:34,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:57:34,029 INFO L93 Difference]: Finished difference Result 20 states and 25 transitions. [2022-02-21 03:57:34,029 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 25 transitions. [2022-02-21 03:57:34,030 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:57:34,030 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:57:34,030 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:57:34,030 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:57:34,030 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) [2022-02-21 03:57:34,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 25 transitions. [2022-02-21 03:57:34,030 INFO L704 BuchiCegarLoop]: Abstraction has 20 states and 25 transitions. [2022-02-21 03:57:34,030 INFO L587 BuchiCegarLoop]: Abstraction has 20 states and 25 transitions. [2022-02-21 03:57:34,030 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2022-02-21 03:57:34,030 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 25 transitions. [2022-02-21 03:57:34,031 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2022-02-21 03:57:34,031 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:57:34,031 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:57:34,031 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:57:34,031 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 03:57:34,031 INFO L791 eck$LassoCheckResult]: Stem: 510#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); 511#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; 514#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; 515#L65 assume !q1_#t~switch17#1;q1_#t~switch17#1 := q1_#t~switch17#1; 529#L69 assume !q1_#t~switch17#1;q1_#t~switch17#1 := true; 527#L73 assume q1_#t~switch17#1;q1_~i~1#1 := 0; 528#L74-3 assume !(q1_~i~1#1 < q1_~N~0#1); 522#L74-4 q1_~i~1#1 := 0; 517#L76-3 [2022-02-21 03:57:34,031 INFO L793 eck$LassoCheckResult]: Loop: 517#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); 516#L76-2 q1_#t~post21#1 := q1_~i~1#1;q1_~i~1#1 := 1 + q1_#t~post21#1;havoc q1_#t~post21#1; 517#L76-3 [2022-02-21 03:57:34,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:57:34,032 INFO L85 PathProgramCache]: Analyzing trace with hash 192371872, now seen corresponding path program 1 times [2022-02-21 03:57:34,032 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:57:34,032 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491518147] [2022-02-21 03:57:34,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:57:34,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:57:34,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:57:34,055 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:57:34,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:57:34,062 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:57:34,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:57:34,062 INFO L85 PathProgramCache]: Analyzing trace with hash 3139, now seen corresponding path program 1 times [2022-02-21 03:57:34,062 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:57:34,062 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471679216] [2022-02-21 03:57:34,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:57:34,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:57:34,067 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-21 03:57:34,068 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [784642256] [2022-02-21 03:57:34,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:57:34,068 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:57:34,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:57:34,069 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:57:34,084 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-02-21 03:57:34,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:57:34,111 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:57:34,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:57:34,118 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:57:34,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:57:34,118 INFO L85 PathProgramCache]: Analyzing trace with hash 185777442, now seen corresponding path program 1 times [2022-02-21 03:57:34,118 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:57:34,118 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816443160] [2022-02-21 03:57:34,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:57:34,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:57:34,128 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-21 03:57:34,128 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1150708814] [2022-02-21 03:57:34,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:57:34,128 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:57:34,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:57:34,160 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) [2022-02-21 03:57:34,162 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-02-21 03:57:34,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:57:34,229 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 03:57:34,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:57:34,235 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:57:34,295 INFO L290 TraceCheckUtils]: 0: Hoare triple {577#true} 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); {577#true} is VALID [2022-02-21 03:57:34,295 INFO L290 TraceCheckUtils]: 1: Hoare triple {577#true} 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; {577#true} is VALID [2022-02-21 03:57:34,296 INFO L290 TraceCheckUtils]: 2: Hoare triple {577#true} 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; {577#true} is VALID [2022-02-21 03:57:34,296 INFO L290 TraceCheckUtils]: 3: Hoare triple {577#true} assume !q1_#t~switch17#1;q1_#t~switch17#1 := q1_#t~switch17#1; {577#true} is VALID [2022-02-21 03:57:34,296 INFO L290 TraceCheckUtils]: 4: Hoare triple {577#true} assume !q1_#t~switch17#1;q1_#t~switch17#1 := true; {577#true} is VALID [2022-02-21 03:57:34,296 INFO L290 TraceCheckUtils]: 5: Hoare triple {577#true} assume q1_#t~switch17#1;q1_~i~1#1 := 0; {597#(<= |ULTIMATE.start_q1_~i~1#1| 0)} is VALID [2022-02-21 03:57:34,297 INFO L290 TraceCheckUtils]: 6: Hoare triple {597#(<= |ULTIMATE.start_q1_~i~1#1| 0)} assume !(q1_~i~1#1 < q1_~N~0#1); {601#(<= |ULTIMATE.start_q1_~N~0#1| 0)} is VALID [2022-02-21 03:57:34,297 INFO L290 TraceCheckUtils]: 7: Hoare triple {601#(<= |ULTIMATE.start_q1_~N~0#1| 0)} q1_~i~1#1 := 0; {605#(and (<= 0 |ULTIMATE.start_q1_~i~1#1|) (<= |ULTIMATE.start_q1_~N~0#1| 0))} is VALID [2022-02-21 03:57:34,298 INFO L290 TraceCheckUtils]: 8: Hoare triple {605#(and (<= 0 |ULTIMATE.start_q1_~i~1#1|) (<= |ULTIMATE.start_q1_~N~0#1| 0))} 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); {578#false} is VALID [2022-02-21 03:57:34,298 INFO L290 TraceCheckUtils]: 9: Hoare triple {578#false} q1_#t~post21#1 := q1_~i~1#1;q1_~i~1#1 := 1 + q1_#t~post21#1;havoc q1_#t~post21#1; {578#false} is VALID [2022-02-21 03:57:34,299 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:57:34,299 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-21 03:57:34,299 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:57:34,299 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816443160] [2022-02-21 03:57:34,299 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-21 03:57:34,299 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1150708814] [2022-02-21 03:57:34,300 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1150708814] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:57:34,300 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:57:34,300 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-21 03:57:34,300 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570388246] [2022-02-21 03:57:34,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:57:34,448 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:57:34,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-21 03:57:34,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-02-21 03:57:34,449 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) [2022-02-21 03:57:34,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:57:34,549 INFO L93 Difference]: Finished difference Result 41 states and 51 transitions. [2022-02-21 03:57:34,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-21 03:57:34,549 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:57:34,560 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:57:34,561 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 51 transitions. [2022-02-21 03:57:34,562 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 23 [2022-02-21 03:57:34,562 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 41 states and 51 transitions. [2022-02-21 03:57:34,562 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 38 [2022-02-21 03:57:34,563 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 38 [2022-02-21 03:57:34,563 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 51 transitions. [2022-02-21 03:57:34,563 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:57:34,563 INFO L681 BuchiCegarLoop]: Abstraction has 41 states and 51 transitions. [2022-02-21 03:57:34,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 51 transitions. [2022-02-21 03:57:34,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 22. [2022-02-21 03:57:34,564 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:57:34,564 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states and 51 transitions. Second 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) [2022-02-21 03:57:34,564 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states and 51 transitions. Second 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) [2022-02-21 03:57:34,564 INFO L87 Difference]: Start difference. First operand 41 states and 51 transitions. Second 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) [2022-02-21 03:57:34,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:57:34,565 INFO L93 Difference]: Finished difference Result 41 states and 51 transitions. [2022-02-21 03:57:34,565 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 51 transitions. [2022-02-21 03:57:34,565 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:57:34,565 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:57:34,565 INFO L74 IsIncluded]: Start isIncluded. First 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) Second operand 41 states and 51 transitions. [2022-02-21 03:57:34,565 INFO L87 Difference]: Start difference. First 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) Second operand 41 states and 51 transitions. [2022-02-21 03:57:34,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:57:34,566 INFO L93 Difference]: Finished difference Result 41 states and 51 transitions. [2022-02-21 03:57:34,566 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 51 transitions. [2022-02-21 03:57:34,566 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:57:34,567 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:57:34,567 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:57:34,567 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:57:34,567 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) [2022-02-21 03:57:34,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 27 transitions. [2022-02-21 03:57:34,567 INFO L704 BuchiCegarLoop]: Abstraction has 22 states and 27 transitions. [2022-02-21 03:57:34,567 INFO L587 BuchiCegarLoop]: Abstraction has 22 states and 27 transitions. [2022-02-21 03:57:34,567 INFO L425 BuchiCegarLoop]: ======== Iteration 7============ [2022-02-21 03:57:34,567 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 27 transitions. [2022-02-21 03:57:34,567 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2022-02-21 03:57:34,568 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:57:34,568 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:57:34,568 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:57:34,568 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:57:34,568 INFO L791 eck$LassoCheckResult]: Stem: 654#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); 655#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; 658#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; 659#L65 assume !q1_#t~switch17#1;q1_#t~switch17#1 := q1_#t~switch17#1; 674#L69 assume !q1_#t~switch17#1;q1_#t~switch17#1 := true; 672#L73 assume q1_#t~switch17#1;q1_~i~1#1 := 0; 673#L74-3 assume !(q1_~i~1#1 < q1_~N~0#1); 666#L74-4 q1_~i~1#1 := 0; 667#L76-3 assume !(q1_~i~1#1 < q1_~N~0#1); 656#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; 657#L18-3 [2022-02-21 03:57:34,568 INFO L793 eck$LassoCheckResult]: Loop: 657#L18-3 assume !!(bubblesort_~a~0#1 < bubblesort_~size#1);bubblesort_~b~0#1 := bubblesort_~size#1 - 1; 669#L20-3 assume !!(bubblesort_~b~0#1 >= bubblesort_~a~0#1); 670#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); 662#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); 663#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; 671#L20-3 assume !(bubblesort_~b~0#1 >= bubblesort_~a~0#1); 668#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; 657#L18-3 [2022-02-21 03:57:34,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:57:34,568 INFO L85 PathProgramCache]: Analyzing trace with hash 185777387, now seen corresponding path program 1 times [2022-02-21 03:57:34,568 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:57:34,569 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426236641] [2022-02-21 03:57:34,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:57:34,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:57:34,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:57:34,587 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:57:34,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:57:34,596 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:57:34,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:57:34,597 INFO L85 PathProgramCache]: Analyzing trace with hash -1669532239, now seen corresponding path program 2 times [2022-02-21 03:57:34,597 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:57:34,597 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879472396] [2022-02-21 03:57:34,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:57:34,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:57:34,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:57:34,606 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:57:34,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:57:34,615 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:57:34,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:57:34,616 INFO L85 PathProgramCache]: Analyzing trace with hash -1443775097, now seen corresponding path program 1 times [2022-02-21 03:57:34,616 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:57:34,617 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400358698] [2022-02-21 03:57:34,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:57:34,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:57:34,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:57:34,683 INFO L290 TraceCheckUtils]: 0: Hoare triple {765#true} 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); {765#true} is VALID [2022-02-21 03:57:34,683 INFO L290 TraceCheckUtils]: 1: Hoare triple {765#true} 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; {765#true} is VALID [2022-02-21 03:57:34,684 INFO L290 TraceCheckUtils]: 2: Hoare triple {765#true} 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; {765#true} is VALID [2022-02-21 03:57:34,684 INFO L290 TraceCheckUtils]: 3: Hoare triple {765#true} assume !q1_#t~switch17#1;q1_#t~switch17#1 := q1_#t~switch17#1; {765#true} is VALID [2022-02-21 03:57:34,685 INFO L290 TraceCheckUtils]: 4: Hoare triple {765#true} assume !q1_#t~switch17#1;q1_#t~switch17#1 := true; {765#true} is VALID [2022-02-21 03:57:34,686 INFO L290 TraceCheckUtils]: 5: Hoare triple {765#true} assume q1_#t~switch17#1;q1_~i~1#1 := 0; {767#(= |ULTIMATE.start_q1_~i~1#1| 0)} is VALID [2022-02-21 03:57:34,686 INFO L290 TraceCheckUtils]: 6: Hoare triple {767#(= |ULTIMATE.start_q1_~i~1#1| 0)} assume !(q1_~i~1#1 < q1_~N~0#1); {768#(<= |ULTIMATE.start_q1_~N~0#1| 0)} is VALID [2022-02-21 03:57:34,687 INFO L290 TraceCheckUtils]: 7: Hoare triple {768#(<= |ULTIMATE.start_q1_~N~0#1| 0)} q1_~i~1#1 := 0; {768#(<= |ULTIMATE.start_q1_~N~0#1| 0)} is VALID [2022-02-21 03:57:34,687 INFO L290 TraceCheckUtils]: 8: Hoare triple {768#(<= |ULTIMATE.start_q1_~N~0#1| 0)} assume !(q1_~i~1#1 < q1_~N~0#1); {768#(<= |ULTIMATE.start_q1_~N~0#1| 0)} is VALID [2022-02-21 03:57:34,688 INFO L290 TraceCheckUtils]: 9: Hoare triple {768#(<= |ULTIMATE.start_q1_~N~0#1| 0)} 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; {769#(and (<= |ULTIMATE.start_bubblesort_~size#1| 0) (= (+ (- 1) |ULTIMATE.start_bubblesort_~a~0#1|) 0))} is VALID [2022-02-21 03:57:34,688 INFO L290 TraceCheckUtils]: 10: Hoare triple {769#(and (<= |ULTIMATE.start_bubblesort_~size#1| 0) (= (+ (- 1) |ULTIMATE.start_bubblesort_~a~0#1|) 0))} assume !!(bubblesort_~a~0#1 < bubblesort_~size#1);bubblesort_~b~0#1 := bubblesort_~size#1 - 1; {766#false} is VALID [2022-02-21 03:57:34,688 INFO L290 TraceCheckUtils]: 11: Hoare triple {766#false} assume !!(bubblesort_~b~0#1 >= bubblesort_~a~0#1); {766#false} is VALID [2022-02-21 03:57:34,689 INFO L290 TraceCheckUtils]: 12: Hoare triple {766#false} 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); {766#false} is VALID [2022-02-21 03:57:34,689 INFO L290 TraceCheckUtils]: 13: Hoare triple {766#false} 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); {766#false} is VALID [2022-02-21 03:57:34,689 INFO L290 TraceCheckUtils]: 14: Hoare triple {766#false} bubblesort_#t~pre5#1 := bubblesort_~b~0#1 - 1;bubblesort_~b~0#1 := bubblesort_~b~0#1 - 1;havoc bubblesort_#t~pre5#1; {766#false} is VALID [2022-02-21 03:57:34,689 INFO L290 TraceCheckUtils]: 15: Hoare triple {766#false} assume !(bubblesort_~b~0#1 >= bubblesort_~a~0#1); {766#false} is VALID [2022-02-21 03:57:34,689 INFO L290 TraceCheckUtils]: 16: Hoare triple {766#false} bubblesort_#t~pre4#1 := 1 + bubblesort_~a~0#1;bubblesort_~a~0#1 := 1 + bubblesort_~a~0#1;havoc bubblesort_#t~pre4#1; {766#false} is VALID [2022-02-21 03:57:34,689 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-21 03:57:34,690 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:57:34,690 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400358698] [2022-02-21 03:57:34,690 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1400358698] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:57:34,690 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:57:34,691 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-21 03:57:34,691 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700604256] [2022-02-21 03:57:34,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:57:34,824 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:57:34,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-21 03:57:34,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-21 03:57:34,825 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) [2022-02-21 03:57:34,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:57:34,923 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2022-02-21 03:57:34,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-21 03:57:34,924 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 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) [2022-02-21 03:57:34,940 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:57:34,941 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 32 transitions. [2022-02-21 03:57:34,942 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2022-02-21 03:57:34,942 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 23 states and 27 transitions. [2022-02-21 03:57:34,942 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2022-02-21 03:57:34,942 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2022-02-21 03:57:34,942 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 27 transitions. [2022-02-21 03:57:34,942 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:57:34,942 INFO L681 BuchiCegarLoop]: Abstraction has 23 states and 27 transitions. [2022-02-21 03:57:34,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 27 transitions. [2022-02-21 03:57:34,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21. [2022-02-21 03:57:34,943 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:57:34,943 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states and 27 transitions. Second 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) [2022-02-21 03:57:34,943 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states and 27 transitions. Second 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) [2022-02-21 03:57:34,944 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second 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) [2022-02-21 03:57:34,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:57:34,944 INFO L93 Difference]: Finished difference Result 23 states and 27 transitions. [2022-02-21 03:57:34,944 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2022-02-21 03:57:34,944 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:57:34,944 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:57:34,944 INFO L74 IsIncluded]: Start isIncluded. First 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) Second operand 23 states and 27 transitions. [2022-02-21 03:57:34,944 INFO L87 Difference]: Start difference. First 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) Second operand 23 states and 27 transitions. [2022-02-21 03:57:34,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:57:34,947 INFO L93 Difference]: Finished difference Result 23 states and 27 transitions. [2022-02-21 03:57:34,948 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2022-02-21 03:57:34,948 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:57:34,948 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:57:34,948 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:57:34,948 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:57:34,948 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) [2022-02-21 03:57:34,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2022-02-21 03:57:34,948 INFO L704 BuchiCegarLoop]: Abstraction has 21 states and 25 transitions. [2022-02-21 03:57:34,948 INFO L587 BuchiCegarLoop]: Abstraction has 21 states and 25 transitions. [2022-02-21 03:57:34,948 INFO L425 BuchiCegarLoop]: ======== Iteration 8============ [2022-02-21 03:57:34,948 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 25 transitions. [2022-02-21 03:57:34,949 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2022-02-21 03:57:34,949 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:57:34,949 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:57:34,949 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:57:34,949 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 03:57:34,949 INFO L791 eck$LassoCheckResult]: Stem: 801#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); 802#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; 805#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; 806#L65 assume !q1_#t~switch17#1;q1_#t~switch17#1 := q1_#t~switch17#1; 821#L69 assume !q1_#t~switch17#1;q1_#t~switch17#1 := true; 819#L73 assume q1_#t~switch17#1;q1_~i~1#1 := 0; 820#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); 811#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; 812#L74-3 assume !(q1_~i~1#1 < q1_~N~0#1); 813#L74-4 q1_~i~1#1 := 0; 814#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); 807#L76-2 [2022-02-21 03:57:34,950 INFO L793 eck$LassoCheckResult]: Loop: 807#L76-2 q1_#t~post21#1 := q1_~i~1#1;q1_~i~1#1 := 1 + q1_#t~post21#1;havoc q1_#t~post21#1; 808#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); 807#L76-2 [2022-02-21 03:57:34,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:57:34,950 INFO L85 PathProgramCache]: Analyzing trace with hash 1465845666, now seen corresponding path program 1 times [2022-02-21 03:57:34,951 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:57:34,951 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187785298] [2022-02-21 03:57:34,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:57:34,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:57:34,961 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-21 03:57:34,961 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1713857354] [2022-02-21 03:57:34,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:57:34,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:57:34,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:57:34,963 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) [2022-02-21 03:57:34,999 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-02-21 03:57:35,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:57:35,010 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:57:35,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:57:35,026 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:57:35,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:57:35,027 INFO L85 PathProgramCache]: Analyzing trace with hash 3199, now seen corresponding path program 2 times [2022-02-21 03:57:35,027 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:57:35,028 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2147196984] [2022-02-21 03:57:35,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:57:35,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:57:35,033 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-21 03:57:35,033 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [611937049] [2022-02-21 03:57:35,033 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-21 03:57:35,033 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:57:35,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:57:35,035 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) [2022-02-21 03:57:35,036 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-02-21 03:57:35,064 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-02-21 03:57:35,065 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-02-21 03:57:35,065 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:57:35,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:57:35,070 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:57:35,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:57:35,071 INFO L85 PathProgramCache]: Analyzing trace with hash -71585824, now seen corresponding path program 1 times [2022-02-21 03:57:35,071 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:57:35,071 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095662909] [2022-02-21 03:57:35,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:57:35,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:57:35,083 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-21 03:57:35,086 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [59439740] [2022-02-21 03:57:35,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:57:35,087 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:57:35,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:57:35,106 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) [2022-02-21 03:57:35,109 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-02-21 03:57:35,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:57:35,171 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-21 03:57:35,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:57:35,178 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:57:35,256 INFO L290 TraceCheckUtils]: 0: Hoare triple {875#true} 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); {875#true} is VALID [2022-02-21 03:57:35,256 INFO L290 TraceCheckUtils]: 1: Hoare triple {875#true} 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; {875#true} is VALID [2022-02-21 03:57:35,256 INFO L290 TraceCheckUtils]: 2: Hoare triple {875#true} 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; {875#true} is VALID [2022-02-21 03:57:35,256 INFO L290 TraceCheckUtils]: 3: Hoare triple {875#true} assume !q1_#t~switch17#1;q1_#t~switch17#1 := q1_#t~switch17#1; {875#true} is VALID [2022-02-21 03:57:35,257 INFO L290 TraceCheckUtils]: 4: Hoare triple {875#true} assume !q1_#t~switch17#1;q1_#t~switch17#1 := true; {875#true} is VALID [2022-02-21 03:57:35,257 INFO L290 TraceCheckUtils]: 5: Hoare triple {875#true} assume q1_#t~switch17#1;q1_~i~1#1 := 0; {895#(<= |ULTIMATE.start_q1_~i~1#1| 0)} is VALID [2022-02-21 03:57:35,257 INFO L290 TraceCheckUtils]: 6: Hoare triple {895#(<= |ULTIMATE.start_q1_~i~1#1| 0)} 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); {895#(<= |ULTIMATE.start_q1_~i~1#1| 0)} is VALID [2022-02-21 03:57:35,258 INFO L290 TraceCheckUtils]: 7: Hoare triple {895#(<= |ULTIMATE.start_q1_~i~1#1| 0)} q1_#t~pre20#1 := 1 + q1_~i~1#1;q1_~i~1#1 := 1 + q1_~i~1#1;havoc q1_#t~pre20#1; {902#(<= |ULTIMATE.start_q1_~i~1#1| 1)} is VALID [2022-02-21 03:57:35,258 INFO L290 TraceCheckUtils]: 8: Hoare triple {902#(<= |ULTIMATE.start_q1_~i~1#1| 1)} assume !(q1_~i~1#1 < q1_~N~0#1); {906#(<= |ULTIMATE.start_q1_~N~0#1| 1)} is VALID [2022-02-21 03:57:35,259 INFO L290 TraceCheckUtils]: 9: Hoare triple {906#(<= |ULTIMATE.start_q1_~N~0#1| 1)} q1_~i~1#1 := 0; {910#(and (<= 0 |ULTIMATE.start_q1_~i~1#1|) (<= |ULTIMATE.start_q1_~N~0#1| 1))} is VALID [2022-02-21 03:57:35,259 INFO L290 TraceCheckUtils]: 10: Hoare triple {910#(and (<= 0 |ULTIMATE.start_q1_~i~1#1|) (<= |ULTIMATE.start_q1_~N~0#1| 1))} 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); {910#(and (<= 0 |ULTIMATE.start_q1_~i~1#1|) (<= |ULTIMATE.start_q1_~N~0#1| 1))} is VALID [2022-02-21 03:57:35,260 INFO L290 TraceCheckUtils]: 11: Hoare triple {910#(and (<= 0 |ULTIMATE.start_q1_~i~1#1|) (<= |ULTIMATE.start_q1_~N~0#1| 1))} q1_#t~post21#1 := q1_~i~1#1;q1_~i~1#1 := 1 + q1_#t~post21#1;havoc q1_#t~post21#1; {917#(and (<= |ULTIMATE.start_q1_~N~0#1| 1) (<= 1 |ULTIMATE.start_q1_~i~1#1|))} is VALID [2022-02-21 03:57:35,261 INFO L290 TraceCheckUtils]: 12: Hoare triple {917#(and (<= |ULTIMATE.start_q1_~N~0#1| 1) (<= 1 |ULTIMATE.start_q1_~i~1#1|))} 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); {876#false} is VALID [2022-02-21 03:57:35,261 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:57:35,261 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:57:35,330 INFO L290 TraceCheckUtils]: 12: Hoare triple {921#(not (< |ULTIMATE.start_q1_~i~1#1| |ULTIMATE.start_q1_~N~0#1|))} 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); {876#false} is VALID [2022-02-21 03:57:35,331 INFO L290 TraceCheckUtils]: 11: Hoare triple {925#(<= |ULTIMATE.start_q1_~N~0#1| (+ |ULTIMATE.start_q1_~i~1#1| 1))} q1_#t~post21#1 := q1_~i~1#1;q1_~i~1#1 := 1 + q1_#t~post21#1;havoc q1_#t~post21#1; {921#(not (< |ULTIMATE.start_q1_~i~1#1| |ULTIMATE.start_q1_~N~0#1|))} is VALID [2022-02-21 03:57:35,331 INFO L290 TraceCheckUtils]: 10: Hoare triple {925#(<= |ULTIMATE.start_q1_~N~0#1| (+ |ULTIMATE.start_q1_~i~1#1| 1))} 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); {925#(<= |ULTIMATE.start_q1_~N~0#1| (+ |ULTIMATE.start_q1_~i~1#1| 1))} is VALID [2022-02-21 03:57:35,332 INFO L290 TraceCheckUtils]: 9: Hoare triple {906#(<= |ULTIMATE.start_q1_~N~0#1| 1)} q1_~i~1#1 := 0; {925#(<= |ULTIMATE.start_q1_~N~0#1| (+ |ULTIMATE.start_q1_~i~1#1| 1))} is VALID [2022-02-21 03:57:35,332 INFO L290 TraceCheckUtils]: 8: Hoare triple {902#(<= |ULTIMATE.start_q1_~i~1#1| 1)} assume !(q1_~i~1#1 < q1_~N~0#1); {906#(<= |ULTIMATE.start_q1_~N~0#1| 1)} is VALID [2022-02-21 03:57:35,333 INFO L290 TraceCheckUtils]: 7: Hoare triple {895#(<= |ULTIMATE.start_q1_~i~1#1| 0)} q1_#t~pre20#1 := 1 + q1_~i~1#1;q1_~i~1#1 := 1 + q1_~i~1#1;havoc q1_#t~pre20#1; {902#(<= |ULTIMATE.start_q1_~i~1#1| 1)} is VALID [2022-02-21 03:57:35,333 INFO L290 TraceCheckUtils]: 6: Hoare triple {895#(<= |ULTIMATE.start_q1_~i~1#1| 0)} 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); {895#(<= |ULTIMATE.start_q1_~i~1#1| 0)} is VALID [2022-02-21 03:57:35,333 INFO L290 TraceCheckUtils]: 5: Hoare triple {875#true} assume q1_#t~switch17#1;q1_~i~1#1 := 0; {895#(<= |ULTIMATE.start_q1_~i~1#1| 0)} is VALID [2022-02-21 03:57:35,334 INFO L290 TraceCheckUtils]: 4: Hoare triple {875#true} assume !q1_#t~switch17#1;q1_#t~switch17#1 := true; {875#true} is VALID [2022-02-21 03:57:35,334 INFO L290 TraceCheckUtils]: 3: Hoare triple {875#true} assume !q1_#t~switch17#1;q1_#t~switch17#1 := q1_#t~switch17#1; {875#true} is VALID [2022-02-21 03:57:35,334 INFO L290 TraceCheckUtils]: 2: Hoare triple {875#true} 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; {875#true} is VALID [2022-02-21 03:57:35,334 INFO L290 TraceCheckUtils]: 1: Hoare triple {875#true} 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; {875#true} is VALID [2022-02-21 03:57:35,334 INFO L290 TraceCheckUtils]: 0: Hoare triple {875#true} 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); {875#true} is VALID [2022-02-21 03:57:35,334 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:57:35,334 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:57:35,335 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095662909] [2022-02-21 03:57:35,335 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-21 03:57:35,335 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [59439740] [2022-02-21 03:57:35,335 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [59439740] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:57:35,335 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-21 03:57:35,335 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2022-02-21 03:57:35,335 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286976650] [2022-02-21 03:57:35,335 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-21 03:57:35,452 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:57:35,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-21 03:57:35,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-02-21 03:57:35,452 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) [2022-02-21 03:57:35,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:57:35,635 INFO L93 Difference]: Finished difference Result 47 states and 57 transitions. [2022-02-21 03:57:35,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-21 03:57:35,636 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 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) [2022-02-21 03:57:35,649 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:57:35,650 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 47 states and 57 transitions. [2022-02-21 03:57:35,651 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 23 [2022-02-21 03:57:35,652 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 47 states to 47 states and 57 transitions. [2022-02-21 03:57:35,652 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 42 [2022-02-21 03:57:35,652 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 42 [2022-02-21 03:57:35,652 INFO L73 IsDeterministic]: Start isDeterministic. Operand 47 states and 57 transitions. [2022-02-21 03:57:35,652 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:57:35,652 INFO L681 BuchiCegarLoop]: Abstraction has 47 states and 57 transitions. [2022-02-21 03:57:35,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states and 57 transitions. [2022-02-21 03:57:35,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 27. [2022-02-21 03:57:35,653 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:57:35,654 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states and 57 transitions. Second 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) [2022-02-21 03:57:35,654 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states and 57 transitions. Second 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) [2022-02-21 03:57:35,654 INFO L87 Difference]: Start difference. First operand 47 states and 57 transitions. Second 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) [2022-02-21 03:57:35,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:57:35,655 INFO L93 Difference]: Finished difference Result 47 states and 57 transitions. [2022-02-21 03:57:35,655 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 57 transitions. [2022-02-21 03:57:35,655 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:57:35,655 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:57:35,655 INFO L74 IsIncluded]: Start isIncluded. First 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) Second operand 47 states and 57 transitions. [2022-02-21 03:57:35,655 INFO L87 Difference]: Start difference. First 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) Second operand 47 states and 57 transitions. [2022-02-21 03:57:35,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:57:35,656 INFO L93 Difference]: Finished difference Result 47 states and 57 transitions. [2022-02-21 03:57:35,656 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 57 transitions. [2022-02-21 03:57:35,656 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:57:35,656 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:57:35,656 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:57:35,656 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:57:35,656 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) [2022-02-21 03:57:35,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 32 transitions. [2022-02-21 03:57:35,657 INFO L704 BuchiCegarLoop]: Abstraction has 27 states and 32 transitions. [2022-02-21 03:57:35,657 INFO L587 BuchiCegarLoop]: Abstraction has 27 states and 32 transitions. [2022-02-21 03:57:35,657 INFO L425 BuchiCegarLoop]: ======== Iteration 9============ [2022-02-21 03:57:35,657 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 32 transitions. [2022-02-21 03:57:35,657 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2022-02-21 03:57:35,657 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:57:35,657 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:57:35,658 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:57:35,658 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 03:57:35,660 INFO L791 eck$LassoCheckResult]: Stem: 1009#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); 1010#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; 1013#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; 1014#L65 assume !q1_#t~switch17#1;q1_#t~switch17#1 := q1_#t~switch17#1; 1030#L69 assume !q1_#t~switch17#1;q1_#t~switch17#1 := true; 1028#L73 assume q1_#t~switch17#1;q1_~i~1#1 := 0; 1029#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); 1019#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; 1020#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); 1031#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; 1035#L74-3 assume !(q1_~i~1#1 < q1_~N~0#1); 1034#L74-4 q1_~i~1#1 := 0; 1023#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); 1015#L76-2 [2022-02-21 03:57:35,660 INFO L793 eck$LassoCheckResult]: Loop: 1015#L76-2 q1_#t~post21#1 := q1_~i~1#1;q1_~i~1#1 := 1 + q1_#t~post21#1;havoc q1_#t~post21#1; 1016#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); 1015#L76-2 [2022-02-21 03:57:35,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:57:35,660 INFO L85 PathProgramCache]: Analyzing trace with hash -69873632, now seen corresponding path program 2 times [2022-02-21 03:57:35,661 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:57:35,661 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800357654] [2022-02-21 03:57:35,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:57:35,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:57:35,687 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-21 03:57:35,688 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2123277560] [2022-02-21 03:57:35,688 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-21 03:57:35,688 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:57:35,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:57:35,689 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) [2022-02-21 03:57:35,711 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-02-21 03:57:35,736 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-21 03:57:35,737 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-02-21 03:57:35,737 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:57:35,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:57:35,759 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:57:35,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:57:35,760 INFO L85 PathProgramCache]: Analyzing trace with hash 3199, now seen corresponding path program 3 times [2022-02-21 03:57:35,761 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:57:35,761 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411067502] [2022-02-21 03:57:35,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:57:35,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:57:35,768 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-21 03:57:35,768 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [321295968] [2022-02-21 03:57:35,768 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-21 03:57:35,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:57:35,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:57:35,770 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) [2022-02-21 03:57:35,791 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-02-21 03:57:35,804 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-02-21 03:57:35,805 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-02-21 03:57:35,805 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:57:35,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:57:35,810 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:57:35,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:57:35,811 INFO L85 PathProgramCache]: Analyzing trace with hash 1570918622, now seen corresponding path program 2 times [2022-02-21 03:57:35,811 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:57:35,811 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367688888] [2022-02-21 03:57:35,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:57:35,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:57:35,826 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-21 03:57:35,827 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [917957655] [2022-02-21 03:57:35,827 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-21 03:57:35,827 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:57:35,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:57:35,828 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) [2022-02-21 03:57:35,838 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-02-21 03:57:35,893 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-21 03:57:35,893 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-02-21 03:57:35,893 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:57:35,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:57:35,933 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:57:37,164 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:57:37,164 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:57:37,164 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:57:37,164 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:57:37,164 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:57:37,164 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:57:37,165 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:57:37,165 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:57:37,165 INFO L133 ssoRankerPreferences]: Filename of dumped script: bubble_sort-1.c_Iteration9_Lasso [2022-02-21 03:57:37,165 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:57:37,165 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:57:37,180 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:57:37,187 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:57:37,189 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:57:37,191 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:57:37,193 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:57:37,195 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:57:37,196 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:57:37,198 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:57:37,663 WARN L259 bleTransFormulaUtils]: 1 quantified variables [2022-02-21 03:57:37,664 WARN L259 bleTransFormulaUtils]: 1 quantified variables [2022-02-21 03:57:37,672 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:57:37,678 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:57:37,680 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:57:37,682 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:57:37,684 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:57:37,689 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:57:37,692 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:57:51,200 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:57:51,201 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:57:51,201 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:57:51,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:57:51,202 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:57:51,203 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2022-02-21 03:57:51,208 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:57:51,214 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:57:51,214 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:57:51,214 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:57:51,214 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:57:51,217 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:57:51,217 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:57:51,232 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:57:51,248 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2022-02-21 03:57:51,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:57:51,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:57:51,250 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:57:51,250 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2022-02-21 03:57:51,252 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:57:51,257 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:57:51,257 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:57:51,258 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:57:51,258 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:57:51,258 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:57:51,258 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:57:51,258 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:57:51,259 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:57:51,275 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 [2022-02-21 03:57:51,275 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:57:51,276 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:57:51,277 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:57:51,278 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2022-02-21 03:57:51,278 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:57:51,283 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:57:51,284 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:57:51,284 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:57:51,284 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:57:51,284 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:57:51,284 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:57:51,284 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:57:51,285 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:57:51,303 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2022-02-21 03:57:51,304 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:57:51,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:57:51,305 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:57:51,305 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2022-02-21 03:57:51,307 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:57:51,312 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:57:51,313 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:57:51,313 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:57:51,313 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:57:51,313 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:57:51,313 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:57:51,313 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:57:51,314 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:57:51,331 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2022-02-21 03:57:51,331 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:57:51,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:57:51,332 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:57:51,333 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2022-02-21 03:57:51,334 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:57:51,339 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:57:51,339 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:57:51,340 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:57:51,340 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:57:51,341 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:57:51,341 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:57:51,356 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:57:51,375 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2022-02-21 03:57:51,375 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:57:51,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:57:51,376 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:57:51,383 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:57:51,387 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2022-02-21 03:57:51,388 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:57:51,388 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:57:51,388 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:57:51,388 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:57:51,388 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:57:51,388 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:57:51,389 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:57:51,389 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:57:51,404 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 [2022-02-21 03:57:51,405 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:57:51,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:57:51,406 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) [2022-02-21 03:57:51,406 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 [2022-02-21 03:57:51,408 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:57:51,413 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:57:51,413 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:57:51,413 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:57:51,413 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:57:51,414 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:57:51,414 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:57:51,416 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:57:51,432 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0 [2022-02-21 03:57:51,432 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:57:51,432 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:57:51,433 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:57:51,435 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2022-02-21 03:57:51,435 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:57:51,440 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:57:51,440 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:57:51,440 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:57:51,441 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:57:51,442 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:57:51,442 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:57:51,444 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:57:51,460 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 [2022-02-21 03:57:51,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:57:51,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:57:51,461 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:57:51,462 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2022-02-21 03:57:51,463 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:57:51,469 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:57:51,469 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:57:51,469 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:57:51,469 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:57:51,470 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:57:51,470 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:57:51,486 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:57:51,501 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Ended with exit code 0 [2022-02-21 03:57:51,502 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:57:51,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:57:51,504 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:57:51,504 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2022-02-21 03:57:51,506 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:57:51,511 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:57:51,512 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:57:51,512 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:57:51,512 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:57:51,513 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:57:51,513 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:57:51,515 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:57:51,532 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0 [2022-02-21 03:57:51,533 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:57:51,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:57:51,534 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:57:51,534 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2022-02-21 03:57:51,535 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:57:51,541 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:57:51,541 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:57:51,541 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:57:51,541 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:57:51,543 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:57:51,543 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:57:51,545 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:57:51,560 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 [2022-02-21 03:57:51,560 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:57:51,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:57:51,561 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:57:51,566 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2022-02-21 03:57:51,568 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:57:51,573 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:57:51,574 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:57:51,574 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:57:51,574 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:57:51,575 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:57:51,575 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:57:51,583 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:57:51,598 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Ended with exit code 0 [2022-02-21 03:57:51,599 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:57:51,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:57:51,600 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:57:51,601 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2022-02-21 03:57:51,602 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:57:51,607 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:57:51,607 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:57:51,607 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:57:51,608 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:57:51,609 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:57:51,609 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:57:51,611 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:57:51,626 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 [2022-02-21 03:57:51,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:57:51,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:57:51,627 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) [2022-02-21 03:57:51,628 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 [2022-02-21 03:57:51,629 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:57:51,634 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:57:51,634 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:57:51,634 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:57:51,634 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:57:51,636 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:57:51,636 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:57:51,641 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:57:51,656 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 [2022-02-21 03:57:51,657 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:57:51,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:57:51,658 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) [2022-02-21 03:57:51,658 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 [2022-02-21 03:57:51,660 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:57:51,665 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:57:51,665 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:57:51,665 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:57:51,665 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:57:51,666 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:57:51,666 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:57:51,668 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:57:51,684 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 [2022-02-21 03:57:51,684 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:57:51,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:57:51,685 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) [2022-02-21 03:57:51,686 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 [2022-02-21 03:57:51,687 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:57:51,692 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:57:51,692 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:57:51,692 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:57:51,692 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:57:51,694 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:57:51,694 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:57:51,696 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:57:51,711 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 [2022-02-21 03:57:51,711 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:57:51,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:57:51,719 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) [2022-02-21 03:57:51,720 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 [2022-02-21 03:57:51,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 [2022-02-21 03:57:51,726 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:57:51,727 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:57:51,727 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:57:51,727 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:57:51,728 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:57:51,728 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:57:51,751 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:57:51,771 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 [2022-02-21 03:57:51,771 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:57:51,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:57:51,787 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) [2022-02-21 03:57:51,788 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 [2022-02-21 03:57:51,788 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:57:51,794 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:57:51,794 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:57:51,794 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:57:51,794 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:57:51,796 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:57:51,796 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:57:51,800 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:57:51,815 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 [2022-02-21 03:57:51,815 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:57:51,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:57:51,816 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) [2022-02-21 03:57:51,817 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 [2022-02-21 03:57:51,818 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:57:51,824 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:57:51,824 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:57:51,824 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:57:51,824 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:57:51,825 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:57:51,825 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:57:51,840 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:57:51,857 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 [2022-02-21 03:57:51,857 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:57:51,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:57:51,858 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) [2022-02-21 03:57:51,859 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 [2022-02-21 03:57:51,860 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:57:51,866 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:57:51,866 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:57:51,866 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:57:51,866 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:57:51,866 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:57:51,866 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:57:51,866 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:57:51,867 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:57:51,883 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 [2022-02-21 03:57:51,883 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:57:51,883 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:57:51,884 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) [2022-02-21 03:57:51,885 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 [2022-02-21 03:57:51,886 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:57:51,891 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:57:51,891 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:57:51,891 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:57:51,892 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:57:51,892 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:57:51,893 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:57:51,895 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:57:51,910 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 [2022-02-21 03:57:51,910 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:57:51,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:57:51,911 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) [2022-02-21 03:57:51,912 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 [2022-02-21 03:57:51,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 [2022-02-21 03:57:51,918 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:57:51,918 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2022-02-21 03:57:51,918 INFO L204 nArgumentSynthesizer]: 3 loop disjuncts [2022-02-21 03:57:51,918 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:57:51,947 INFO L401 nArgumentSynthesizer]: We have 36 Motzkin's Theorem applications. [2022-02-21 03:57:51,947 INFO L402 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2022-02-21 03:57:52,009 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:57:52,082 INFO L443 ModelExtractionUtils]: Simplification made 20 calls to the SMT solver. [2022-02-21 03:57:52,082 INFO L444 ModelExtractionUtils]: 24 out of 50 variables were initially zero. Simplification set additionally 23 variables to zero. [2022-02-21 03:57:52,082 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:57:52,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:57:52,083 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) [2022-02-21 03:57:52,084 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 [2022-02-21 03:57:52,085 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:57:52,093 INFO L438 nArgumentSynthesizer]: Removed 6 redundant supporting invariants from a total of 6. [2022-02-21 03:57:52,093 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:57:52,093 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 [] [2022-02-21 03:57:52,110 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Ended with exit code 0 [2022-02-21 03:57:52,171 INFO L297 tatePredicateManager]: 10 out of 11 supporting invariants were superfluous and have been removed [2022-02-21 03:57:52,176 INFO L390 LassoCheck]: Loop: "q1_#t~post21#1 := q1_~i~1#1;q1_~i~1#1 := 1 + q1_#t~post21#1;havoc q1_#t~post21#1;" "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);" [2022-02-21 03:57:52,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:57:52,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:57:52,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:57:52,220 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 03:57:52,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:57:52,224 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:57:52,261 INFO L290 TraceCheckUtils]: 0: Hoare triple {1139#unseeded} 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); {1139#unseeded} is VALID [2022-02-21 03:57:52,261 INFO L290 TraceCheckUtils]: 1: Hoare triple {1139#unseeded} 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; {1139#unseeded} is VALID [2022-02-21 03:57:52,262 INFO L290 TraceCheckUtils]: 2: Hoare triple {1139#unseeded} 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; {1208#(and (= |ULTIMATE.start_q1_~#a~1#1.offset| 0) unseeded)} is VALID [2022-02-21 03:57:52,262 INFO L290 TraceCheckUtils]: 3: Hoare triple {1208#(and (= |ULTIMATE.start_q1_~#a~1#1.offset| 0) unseeded)} assume !q1_#t~switch17#1;q1_#t~switch17#1 := q1_#t~switch17#1; {1208#(and (= |ULTIMATE.start_q1_~#a~1#1.offset| 0) unseeded)} is VALID [2022-02-21 03:57:52,262 INFO L290 TraceCheckUtils]: 4: Hoare triple {1208#(and (= |ULTIMATE.start_q1_~#a~1#1.offset| 0) unseeded)} assume !q1_#t~switch17#1;q1_#t~switch17#1 := true; {1208#(and (= |ULTIMATE.start_q1_~#a~1#1.offset| 0) unseeded)} is VALID [2022-02-21 03:57:52,263 INFO L290 TraceCheckUtils]: 5: Hoare triple {1208#(and (= |ULTIMATE.start_q1_~#a~1#1.offset| 0) unseeded)} assume q1_#t~switch17#1;q1_~i~1#1 := 0; {1208#(and (= |ULTIMATE.start_q1_~#a~1#1.offset| 0) unseeded)} is VALID [2022-02-21 03:57:52,263 INFO L290 TraceCheckUtils]: 6: Hoare triple {1208#(and (= |ULTIMATE.start_q1_~#a~1#1.offset| 0) unseeded)} 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); {1208#(and (= |ULTIMATE.start_q1_~#a~1#1.offset| 0) unseeded)} is VALID [2022-02-21 03:57:52,263 INFO L290 TraceCheckUtils]: 7: Hoare triple {1208#(and (= |ULTIMATE.start_q1_~#a~1#1.offset| 0) unseeded)} q1_#t~pre20#1 := 1 + q1_~i~1#1;q1_~i~1#1 := 1 + q1_~i~1#1;havoc q1_#t~pre20#1; {1208#(and (= |ULTIMATE.start_q1_~#a~1#1.offset| 0) unseeded)} is VALID [2022-02-21 03:57:52,264 INFO L290 TraceCheckUtils]: 8: Hoare triple {1208#(and (= |ULTIMATE.start_q1_~#a~1#1.offset| 0) unseeded)} 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); {1208#(and (= |ULTIMATE.start_q1_~#a~1#1.offset| 0) unseeded)} is VALID [2022-02-21 03:57:52,264 INFO L290 TraceCheckUtils]: 9: Hoare triple {1208#(and (= |ULTIMATE.start_q1_~#a~1#1.offset| 0) unseeded)} q1_#t~pre20#1 := 1 + q1_~i~1#1;q1_~i~1#1 := 1 + q1_~i~1#1;havoc q1_#t~pre20#1; {1208#(and (= |ULTIMATE.start_q1_~#a~1#1.offset| 0) unseeded)} is VALID [2022-02-21 03:57:52,265 INFO L290 TraceCheckUtils]: 10: Hoare triple {1208#(and (= |ULTIMATE.start_q1_~#a~1#1.offset| 0) unseeded)} assume !(q1_~i~1#1 < q1_~N~0#1); {1208#(and (= |ULTIMATE.start_q1_~#a~1#1.offset| 0) unseeded)} is VALID [2022-02-21 03:57:52,266 INFO L290 TraceCheckUtils]: 11: Hoare triple {1208#(and (= |ULTIMATE.start_q1_~#a~1#1.offset| 0) unseeded)} q1_~i~1#1 := 0; {1208#(and (= |ULTIMATE.start_q1_~#a~1#1.offset| 0) unseeded)} is VALID [2022-02-21 03:57:52,267 INFO L290 TraceCheckUtils]: 12: Hoare triple {1208#(and (= |ULTIMATE.start_q1_~#a~1#1.offset| 0) unseeded)} 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); {1208#(and (= |ULTIMATE.start_q1_~#a~1#1.offset| 0) unseeded)} is VALID [2022-02-21 03:57:52,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:57:52,275 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-21 03:57:52,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:57:52,278 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:57:52,306 INFO L290 TraceCheckUtils]: 0: Hoare triple {1209#(and (= |ULTIMATE.start_q1_~#a~1#1.offset| 0) (>= oldRank0 (+ (select |#length| |ULTIMATE.start_q1_~#a~1#1.base|) (* (- 4) |ULTIMATE.start_q1_~i~1#1|))))} q1_#t~post21#1 := q1_~i~1#1;q1_~i~1#1 := 1 + q1_#t~post21#1;havoc q1_#t~post21#1; {1253#(and (= |ULTIMATE.start_q1_~#a~1#1.offset| 0) (<= (+ 1 (div (+ (* (- 1) (select |#length| |ULTIMATE.start_q1_~#a~1#1.base|)) oldRank0) (- 4))) |ULTIMATE.start_q1_~i~1#1|))} is VALID [2022-02-21 03:57:52,308 INFO L290 TraceCheckUtils]: 1: Hoare triple {1253#(and (= |ULTIMATE.start_q1_~#a~1#1.offset| 0) (<= (+ 1 (div (+ (* (- 1) (select |#length| |ULTIMATE.start_q1_~#a~1#1.base|)) oldRank0) (- 4))) |ULTIMATE.start_q1_~i~1#1|))} 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); {1211#(and (= |ULTIMATE.start_q1_~#a~1#1.offset| 0) (or unseeded (and (>= oldRank0 0) (> oldRank0 (+ (select |#length| |ULTIMATE.start_q1_~#a~1#1.base|) (* (- 4) |ULTIMATE.start_q1_~i~1#1|))))))} is VALID [2022-02-21 03:57:52,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:57:52,308 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:57:52,316 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:57:52,316 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 13 letters. Loop has 2 letters. [2022-02-21 03:57:52,316 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:52,316 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2022-02-21 03:57:52,316 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) [2022-02-21 03:57:52,398 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. [2022-02-21 03:57:52,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2022-02-21 03:57:52,399 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:57:52,399 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 32 transitions. cyclomatic complexity: 8 [2022-02-21 03:57:52,399 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:57:52,399 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:57:52,399 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:57:52,399 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:57:52,400 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:57:52,400 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:57:52,400 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 48 transitions. [2022-02-21 03:57:52,400 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2022-02-21 03:57:52,400 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:57:52,400 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:57:52,400 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 27 states and 32 transitions. cyclomatic complexity: 8 [2022-02-21 03:57:52,401 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 9 examples of accepted words. [2022-02-21 03:57:52,401 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:57:52,402 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:57:52,402 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:57:52,402 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 38 states and 48 transitions. cyclomatic complexity: 14 [2022-02-21 03:57:52,403 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 7 examples of accepted words. [2022-02-21 03:57:52,403 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 32 transitions. cyclomatic complexity: 8 Stem has 13 letters. Loop has 2 letters. [2022-02-21 03:57:52,403 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:52,403 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 13 letters. Loop has 2 letters. [2022-02-21 03:57:52,403 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:52,403 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 48 transitions. cyclomatic complexity: 14 Stem has 13 letters. Loop has 2 letters. [2022-02-21 03:57:52,403 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:52,403 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 32 transitions. cyclomatic complexity: 8 Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:57:52,403 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:52,403 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:57:52,403 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:52,403 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 48 transitions. cyclomatic complexity: 14 Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:57:52,403 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:52,404 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 32 transitions. cyclomatic complexity: 8 Stem has 14 letters. Loop has 7 letters. [2022-02-21 03:57:52,404 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:52,405 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 14 letters. Loop has 7 letters. [2022-02-21 03:57:52,405 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:52,405 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 48 transitions. cyclomatic complexity: 14 Stem has 14 letters. Loop has 7 letters. [2022-02-21 03:57:52,405 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:52,405 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 32 transitions. cyclomatic complexity: 8 Stem has 38 letters. Loop has 38 letters. [2022-02-21 03:57:52,405 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:52,405 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 38 letters. Loop has 38 letters. [2022-02-21 03:57:52,405 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:52,405 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 48 transitions. cyclomatic complexity: 14 Stem has 38 letters. Loop has 38 letters. [2022-02-21 03:57:52,405 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:52,405 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 32 transitions. cyclomatic complexity: 8 Stem has 27 letters. Loop has 27 letters. [2022-02-21 03:57:52,405 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:52,405 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 27 letters. Loop has 27 letters. [2022-02-21 03:57:52,405 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:52,405 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 48 transitions. cyclomatic complexity: 14 Stem has 27 letters. Loop has 27 letters. [2022-02-21 03:57:52,405 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:52,405 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 32 transitions. cyclomatic complexity: 8 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:57:52,405 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:52,406 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:57:52,406 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:52,406 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 48 transitions. cyclomatic complexity: 14 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:57:52,406 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:52,406 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 32 transitions. cyclomatic complexity: 8 Stem has 20 letters. Loop has 7 letters. [2022-02-21 03:57:52,406 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:52,406 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 20 letters. Loop has 7 letters. [2022-02-21 03:57:52,406 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:52,406 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 48 transitions. cyclomatic complexity: 14 Stem has 20 letters. Loop has 7 letters. [2022-02-21 03:57:52,406 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:52,406 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 32 transitions. cyclomatic complexity: 8 Stem has 15 letters. Loop has 7 letters. [2022-02-21 03:57:52,406 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:52,406 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 7 letters. [2022-02-21 03:57:52,406 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:52,406 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 48 transitions. cyclomatic complexity: 14 Stem has 15 letters. Loop has 7 letters. [2022-02-21 03:57:52,406 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:52,407 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 32 transitions. cyclomatic complexity: 8 Stem has 16 letters. Loop has 4 letters. [2022-02-21 03:57:52,407 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:52,407 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 16 letters. Loop has 4 letters. [2022-02-21 03:57:52,407 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:52,407 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 48 transitions. cyclomatic complexity: 14 Stem has 16 letters. Loop has 4 letters. [2022-02-21 03:57:52,407 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:52,407 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 32 transitions. cyclomatic complexity: 8 Stem has 19 letters. Loop has 4 letters. [2022-02-21 03:57:52,407 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:52,407 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 19 letters. Loop has 4 letters. [2022-02-21 03:57:52,407 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:52,407 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 48 transitions. cyclomatic complexity: 14 Stem has 19 letters. Loop has 4 letters. [2022-02-21 03:57:52,407 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:52,407 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 32 transitions. cyclomatic complexity: 8 Stem has 14 letters. Loop has 7 letters. [2022-02-21 03:57:52,407 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:52,407 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 14 letters. Loop has 7 letters. [2022-02-21 03:57:52,408 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:52,408 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 48 transitions. cyclomatic complexity: 14 Stem has 14 letters. Loop has 7 letters. [2022-02-21 03:57:52,408 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:52,408 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 32 transitions. cyclomatic complexity: 8 Stem has 17 letters. Loop has 4 letters. [2022-02-21 03:57:52,408 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:52,408 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 17 letters. Loop has 4 letters. [2022-02-21 03:57:52,408 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:52,408 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 48 transitions. cyclomatic complexity: 14 Stem has 17 letters. Loop has 4 letters. [2022-02-21 03:57:52,408 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:52,408 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 32 transitions. cyclomatic complexity: 8 Stem has 18 letters. Loop has 4 letters. [2022-02-21 03:57:52,408 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:52,408 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 18 letters. Loop has 4 letters. [2022-02-21 03:57:52,408 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:52,408 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 48 transitions. cyclomatic complexity: 14 Stem has 18 letters. Loop has 4 letters. [2022-02-21 03:57:52,408 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:52,408 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 32 transitions. cyclomatic complexity: 8 Stem has 13 letters. Loop has 2 letters. [2022-02-21 03:57:52,408 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:52,409 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 13 letters. Loop has 2 letters. [2022-02-21 03:57:52,409 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:52,409 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 48 transitions. cyclomatic complexity: 14 Stem has 13 letters. Loop has 2 letters. [2022-02-21 03:57:52,409 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:52,409 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 32 transitions. cyclomatic complexity: 8 Stem has 14 letters. Loop has 2 letters. [2022-02-21 03:57:52,409 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:52,409 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 14 letters. Loop has 2 letters. [2022-02-21 03:57:52,409 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:52,409 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 48 transitions. cyclomatic complexity: 14 Stem has 14 letters. Loop has 2 letters. [2022-02-21 03:57:52,409 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:52,409 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 32 transitions. cyclomatic complexity: 8 Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:57:52,409 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:52,409 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:57:52,409 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:52,409 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 48 transitions. cyclomatic complexity: 14 Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:57:52,409 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:52,409 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 32 transitions. cyclomatic complexity: 8 Stem has 17 letters. Loop has 4 letters. [2022-02-21 03:57:52,409 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:52,410 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 17 letters. Loop has 4 letters. [2022-02-21 03:57:52,410 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:52,410 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 48 transitions. cyclomatic complexity: 14 Stem has 17 letters. Loop has 4 letters. [2022-02-21 03:57:52,410 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:52,410 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 32 transitions. cyclomatic complexity: 8 Stem has 18 letters. Loop has 4 letters. [2022-02-21 03:57:52,410 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:52,410 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 18 letters. Loop has 4 letters. [2022-02-21 03:57:52,410 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:52,410 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 48 transitions. cyclomatic complexity: 14 Stem has 18 letters. Loop has 4 letters. [2022-02-21 03:57:52,410 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:52,410 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 32 transitions. cyclomatic complexity: 8 Stem has 19 letters. Loop has 4 letters. [2022-02-21 03:57:52,410 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:52,410 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 19 letters. Loop has 4 letters. [2022-02-21 03:57:52,410 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:52,410 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 48 transitions. cyclomatic complexity: 14 Stem has 19 letters. Loop has 4 letters. [2022-02-21 03:57:52,410 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:52,410 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 32 transitions. cyclomatic complexity: 8 Stem has 20 letters. Loop has 7 letters. [2022-02-21 03:57:52,411 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:52,411 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 20 letters. Loop has 7 letters. [2022-02-21 03:57:52,411 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:52,411 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 48 transitions. cyclomatic complexity: 14 Stem has 20 letters. Loop has 7 letters. [2022-02-21 03:57:52,411 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:52,411 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 32 transitions. cyclomatic complexity: 8 Stem has 14 letters. Loop has 7 letters. [2022-02-21 03:57:52,411 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:52,411 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 14 letters. Loop has 7 letters. [2022-02-21 03:57:52,411 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:52,411 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 48 transitions. cyclomatic complexity: 14 Stem has 14 letters. Loop has 7 letters. [2022-02-21 03:57:52,411 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:52,411 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 32 transitions. cyclomatic complexity: 8 Stem has 15 letters. Loop has 7 letters. [2022-02-21 03:57:52,411 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:52,411 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 7 letters. [2022-02-21 03:57:52,411 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:52,412 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 48 transitions. cyclomatic complexity: 14 Stem has 15 letters. Loop has 7 letters. [2022-02-21 03:57:52,412 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:52,412 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 32 transitions. cyclomatic complexity: 8 Stem has 16 letters. Loop has 4 letters. [2022-02-21 03:57:52,412 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:52,412 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 16 letters. Loop has 4 letters. [2022-02-21 03:57:52,412 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:52,412 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 48 transitions. cyclomatic complexity: 14 Stem has 16 letters. Loop has 4 letters. [2022-02-21 03:57:52,412 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:52,412 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:57:52,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:57:52,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 23 transitions. [2022-02-21 03:57:52,413 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 13 letters. Loop has 2 letters. [2022-02-21 03:57:52,413 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:52,413 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 15 letters. Loop has 2 letters. [2022-02-21 03:57:52,413 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:52,413 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 13 letters. Loop has 4 letters. [2022-02-21 03:57:52,413 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:57:52,414 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 48 transitions. cyclomatic complexity: 14 [2022-02-21 03:57:52,414 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2022-02-21 03:57:52,415 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 29 states and 35 transitions. [2022-02-21 03:57:52,415 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2022-02-21 03:57:52,415 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2022-02-21 03:57:52,415 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 35 transitions. [2022-02-21 03:57:52,415 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:57:52,415 INFO L681 BuchiCegarLoop]: Abstraction has 29 states and 35 transitions. [2022-02-21 03:57:52,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 35 transitions. [2022-02-21 03:57:52,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2022-02-21 03:57:52,416 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:57:52,416 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states and 35 transitions. Second 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) [2022-02-21 03:57:52,416 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states and 35 transitions. Second 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) [2022-02-21 03:57:52,417 INFO L87 Difference]: Start difference. First operand 29 states and 35 transitions. Second 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) [2022-02-21 03:57:52,417 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:57:52,418 INFO L93 Difference]: Finished difference Result 29 states and 35 transitions. [2022-02-21 03:57:52,418 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2022-02-21 03:57:52,418 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:57:52,418 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:57:52,419 INFO L74 IsIncluded]: Start isIncluded. First 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) Second operand 29 states and 35 transitions. [2022-02-21 03:57:52,419 INFO L87 Difference]: Start difference. First 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) Second operand 29 states and 35 transitions. [2022-02-21 03:57:52,423 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:57:52,424 INFO L93 Difference]: Finished difference Result 29 states and 35 transitions. [2022-02-21 03:57:52,425 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2022-02-21 03:57:52,425 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:57:52,425 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:57:52,425 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:57:52,425 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:57:52,425 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) [2022-02-21 03:57:52,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2022-02-21 03:57:52,426 INFO L704 BuchiCegarLoop]: Abstraction has 28 states and 34 transitions. [2022-02-21 03:57:52,426 INFO L587 BuchiCegarLoop]: Abstraction has 28 states and 34 transitions. [2022-02-21 03:57:52,426 INFO L425 BuchiCegarLoop]: ======== Iteration 10============ [2022-02-21 03:57:52,426 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 34 transitions. [2022-02-21 03:57:52,428 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2022-02-21 03:57:52,428 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:57:52,428 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:57:52,428 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:57:52,428 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:57:52,429 INFO L791 eck$LassoCheckResult]: Stem: 1304#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); 1305#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; 1308#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; 1309#L65 assume !q1_#t~switch17#1;q1_#t~switch17#1 := q1_#t~switch17#1; 1326#L69 assume !q1_#t~switch17#1;q1_#t~switch17#1 := true; 1324#L73 assume q1_#t~switch17#1;q1_~i~1#1 := 0; 1325#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); 1327#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; 1328#L74-3 assume !(q1_~i~1#1 < q1_~N~0#1); 1319#L74-4 q1_~i~1#1 := 0; 1318#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); 1310#L76-2 q1_#t~post21#1 := q1_~i~1#1;q1_~i~1#1 := 1 + q1_#t~post21#1;havoc q1_#t~post21#1; 1311#L76-3 assume !(q1_~i~1#1 < q1_~N~0#1); 1306#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; 1307#L18-3 [2022-02-21 03:57:52,429 INFO L793 eck$LassoCheckResult]: Loop: 1307#L18-3 assume !!(bubblesort_~a~0#1 < bubblesort_~size#1);bubblesort_~b~0#1 := bubblesort_~size#1 - 1; 1321#L20-3 assume !!(bubblesort_~b~0#1 >= bubblesort_~a~0#1); 1322#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); 1314#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); 1315#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; 1323#L20-3 assume !(bubblesort_~b~0#1 >= bubblesort_~a~0#1); 1320#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; 1307#L18-3 [2022-02-21 03:57:52,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:57:52,429 INFO L85 PathProgramCache]: Analyzing trace with hash 2075806767, now seen corresponding path program 1 times [2022-02-21 03:57:52,429 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:57:52,430 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802467892] [2022-02-21 03:57:52,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:57:52,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:57:52,441 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-21 03:57:52,442 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1009564387] [2022-02-21 03:57:52,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:57:52,442 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:57:52,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:57:52,443 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) [2022-02-21 03:57:52,466 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Waiting until timeout for monitored process [2022-02-21 03:57:52,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:57:52,510 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:57:52,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:57:52,529 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 [2022-02-21 03:57:52,535 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:57:52,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:57:52,538 INFO L85 PathProgramCache]: Analyzing trace with hash -1669532239, now seen corresponding path program 3 times [2022-02-21 03:57:52,538 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:57:52,538 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683001760] [2022-02-21 03:57:52,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:57:52,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:57:52,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:57:52,550 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:57:52,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:57:52,559 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:57:52,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:57:52,560 INFO L85 PathProgramCache]: Analyzing trace with hash -548718141, now seen corresponding path program 1 times [2022-02-21 03:57:52,560 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:57:52,560 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652297815] [2022-02-21 03:57:52,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:57:52,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:57:52,574 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-21 03:57:52,574 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1636869038] [2022-02-21 03:57:52,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:57:52,574 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:57:52,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:57:52,576 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) [2022-02-21 03:57:52,577 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Waiting until timeout for monitored process [2022-02-21 03:57:52,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:57:52,631 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-21 03:57:52,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:57:52,641 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:57:52,754 INFO L290 TraceCheckUtils]: 0: Hoare triple {1497#true} 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); {1497#true} is VALID [2022-02-21 03:57:52,754 INFO L290 TraceCheckUtils]: 1: Hoare triple {1497#true} 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; {1497#true} is VALID [2022-02-21 03:57:52,754 INFO L290 TraceCheckUtils]: 2: Hoare triple {1497#true} 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; {1497#true} is VALID [2022-02-21 03:57:52,755 INFO L290 TraceCheckUtils]: 3: Hoare triple {1497#true} assume !q1_#t~switch17#1;q1_#t~switch17#1 := q1_#t~switch17#1; {1497#true} is VALID [2022-02-21 03:57:52,755 INFO L290 TraceCheckUtils]: 4: Hoare triple {1497#true} assume !q1_#t~switch17#1;q1_#t~switch17#1 := true; {1497#true} is VALID [2022-02-21 03:57:52,756 INFO L290 TraceCheckUtils]: 5: Hoare triple {1497#true} assume q1_#t~switch17#1;q1_~i~1#1 := 0; {1517#(<= |ULTIMATE.start_q1_~i~1#1| 0)} is VALID [2022-02-21 03:57:52,756 INFO L290 TraceCheckUtils]: 6: Hoare triple {1517#(<= |ULTIMATE.start_q1_~i~1#1| 0)} 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); {1517#(<= |ULTIMATE.start_q1_~i~1#1| 0)} is VALID [2022-02-21 03:57:52,757 INFO L290 TraceCheckUtils]: 7: Hoare triple {1517#(<= |ULTIMATE.start_q1_~i~1#1| 0)} q1_#t~pre20#1 := 1 + q1_~i~1#1;q1_~i~1#1 := 1 + q1_~i~1#1;havoc q1_#t~pre20#1; {1524#(<= |ULTIMATE.start_q1_~i~1#1| 1)} is VALID [2022-02-21 03:57:52,758 INFO L290 TraceCheckUtils]: 8: Hoare triple {1524#(<= |ULTIMATE.start_q1_~i~1#1| 1)} assume !(q1_~i~1#1 < q1_~N~0#1); {1528#(<= |ULTIMATE.start_q1_~N~0#1| 1)} is VALID [2022-02-21 03:57:52,758 INFO L290 TraceCheckUtils]: 9: Hoare triple {1528#(<= |ULTIMATE.start_q1_~N~0#1| 1)} q1_~i~1#1 := 0; {1528#(<= |ULTIMATE.start_q1_~N~0#1| 1)} is VALID [2022-02-21 03:57:52,767 INFO L290 TraceCheckUtils]: 10: Hoare triple {1528#(<= |ULTIMATE.start_q1_~N~0#1| 1)} 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); {1528#(<= |ULTIMATE.start_q1_~N~0#1| 1)} is VALID [2022-02-21 03:57:52,768 INFO L290 TraceCheckUtils]: 11: Hoare triple {1528#(<= |ULTIMATE.start_q1_~N~0#1| 1)} q1_#t~post21#1 := q1_~i~1#1;q1_~i~1#1 := 1 + q1_#t~post21#1;havoc q1_#t~post21#1; {1528#(<= |ULTIMATE.start_q1_~N~0#1| 1)} is VALID [2022-02-21 03:57:52,768 INFO L290 TraceCheckUtils]: 12: Hoare triple {1528#(<= |ULTIMATE.start_q1_~N~0#1| 1)} assume !(q1_~i~1#1 < q1_~N~0#1); {1528#(<= |ULTIMATE.start_q1_~N~0#1| 1)} is VALID [2022-02-21 03:57:52,769 INFO L290 TraceCheckUtils]: 13: Hoare triple {1528#(<= |ULTIMATE.start_q1_~N~0#1| 1)} 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; {1544#(and (<= |ULTIMATE.start_bubblesort_~size#1| 1) (<= 1 |ULTIMATE.start_bubblesort_~a~0#1|))} is VALID [2022-02-21 03:57:52,770 INFO L290 TraceCheckUtils]: 14: Hoare triple {1544#(and (<= |ULTIMATE.start_bubblesort_~size#1| 1) (<= 1 |ULTIMATE.start_bubblesort_~a~0#1|))} assume !!(bubblesort_~a~0#1 < bubblesort_~size#1);bubblesort_~b~0#1 := bubblesort_~size#1 - 1; {1498#false} is VALID [2022-02-21 03:57:52,770 INFO L290 TraceCheckUtils]: 15: Hoare triple {1498#false} assume !!(bubblesort_~b~0#1 >= bubblesort_~a~0#1); {1498#false} is VALID [2022-02-21 03:57:52,770 INFO L290 TraceCheckUtils]: 16: Hoare triple {1498#false} 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); {1498#false} is VALID [2022-02-21 03:57:52,770 INFO L290 TraceCheckUtils]: 17: Hoare triple {1498#false} 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); {1498#false} is VALID [2022-02-21 03:57:52,770 INFO L290 TraceCheckUtils]: 18: Hoare triple {1498#false} bubblesort_#t~pre5#1 := bubblesort_~b~0#1 - 1;bubblesort_~b~0#1 := bubblesort_~b~0#1 - 1;havoc bubblesort_#t~pre5#1; {1498#false} is VALID [2022-02-21 03:57:52,770 INFO L290 TraceCheckUtils]: 19: Hoare triple {1498#false} assume !(bubblesort_~b~0#1 >= bubblesort_~a~0#1); {1498#false} is VALID [2022-02-21 03:57:52,770 INFO L290 TraceCheckUtils]: 20: Hoare triple {1498#false} bubblesort_#t~pre4#1 := 1 + bubblesort_~a~0#1;bubblesort_~a~0#1 := 1 + bubblesort_~a~0#1;havoc bubblesort_#t~pre4#1; {1498#false} is VALID [2022-02-21 03:57:52,771 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-21 03:57:52,771 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:57:52,870 INFO L290 TraceCheckUtils]: 20: Hoare triple {1498#false} bubblesort_#t~pre4#1 := 1 + bubblesort_~a~0#1;bubblesort_~a~0#1 := 1 + bubblesort_~a~0#1;havoc bubblesort_#t~pre4#1; {1498#false} is VALID [2022-02-21 03:57:52,870 INFO L290 TraceCheckUtils]: 19: Hoare triple {1498#false} assume !(bubblesort_~b~0#1 >= bubblesort_~a~0#1); {1498#false} is VALID [2022-02-21 03:57:52,871 INFO L290 TraceCheckUtils]: 18: Hoare triple {1498#false} bubblesort_#t~pre5#1 := bubblesort_~b~0#1 - 1;bubblesort_~b~0#1 := bubblesort_~b~0#1 - 1;havoc bubblesort_#t~pre5#1; {1498#false} is VALID [2022-02-21 03:57:52,871 INFO L290 TraceCheckUtils]: 17: Hoare triple {1498#false} 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); {1498#false} is VALID [2022-02-21 03:57:52,871 INFO L290 TraceCheckUtils]: 16: Hoare triple {1498#false} 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); {1498#false} is VALID [2022-02-21 03:57:52,871 INFO L290 TraceCheckUtils]: 15: Hoare triple {1498#false} assume !!(bubblesort_~b~0#1 >= bubblesort_~a~0#1); {1498#false} is VALID [2022-02-21 03:57:52,871 INFO L290 TraceCheckUtils]: 14: Hoare triple {1584#(not (< |ULTIMATE.start_bubblesort_~a~0#1| |ULTIMATE.start_bubblesort_~size#1|))} assume !!(bubblesort_~a~0#1 < bubblesort_~size#1);bubblesort_~b~0#1 := bubblesort_~size#1 - 1; {1498#false} is VALID [2022-02-21 03:57:52,872 INFO L290 TraceCheckUtils]: 13: Hoare triple {1528#(<= |ULTIMATE.start_q1_~N~0#1| 1)} 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; {1584#(not (< |ULTIMATE.start_bubblesort_~a~0#1| |ULTIMATE.start_bubblesort_~size#1|))} is VALID [2022-02-21 03:57:52,872 INFO L290 TraceCheckUtils]: 12: Hoare triple {1528#(<= |ULTIMATE.start_q1_~N~0#1| 1)} assume !(q1_~i~1#1 < q1_~N~0#1); {1528#(<= |ULTIMATE.start_q1_~N~0#1| 1)} is VALID [2022-02-21 03:57:52,872 INFO L290 TraceCheckUtils]: 11: Hoare triple {1528#(<= |ULTIMATE.start_q1_~N~0#1| 1)} q1_#t~post21#1 := q1_~i~1#1;q1_~i~1#1 := 1 + q1_#t~post21#1;havoc q1_#t~post21#1; {1528#(<= |ULTIMATE.start_q1_~N~0#1| 1)} is VALID [2022-02-21 03:57:52,872 INFO L290 TraceCheckUtils]: 10: Hoare triple {1528#(<= |ULTIMATE.start_q1_~N~0#1| 1)} 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); {1528#(<= |ULTIMATE.start_q1_~N~0#1| 1)} is VALID [2022-02-21 03:57:52,873 INFO L290 TraceCheckUtils]: 9: Hoare triple {1528#(<= |ULTIMATE.start_q1_~N~0#1| 1)} q1_~i~1#1 := 0; {1528#(<= |ULTIMATE.start_q1_~N~0#1| 1)} is VALID [2022-02-21 03:57:52,874 INFO L290 TraceCheckUtils]: 8: Hoare triple {1524#(<= |ULTIMATE.start_q1_~i~1#1| 1)} assume !(q1_~i~1#1 < q1_~N~0#1); {1528#(<= |ULTIMATE.start_q1_~N~0#1| 1)} is VALID [2022-02-21 03:57:52,874 INFO L290 TraceCheckUtils]: 7: Hoare triple {1517#(<= |ULTIMATE.start_q1_~i~1#1| 0)} q1_#t~pre20#1 := 1 + q1_~i~1#1;q1_~i~1#1 := 1 + q1_~i~1#1;havoc q1_#t~pre20#1; {1524#(<= |ULTIMATE.start_q1_~i~1#1| 1)} is VALID [2022-02-21 03:57:52,874 INFO L290 TraceCheckUtils]: 6: Hoare triple {1517#(<= |ULTIMATE.start_q1_~i~1#1| 0)} 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); {1517#(<= |ULTIMATE.start_q1_~i~1#1| 0)} is VALID [2022-02-21 03:57:52,875 INFO L290 TraceCheckUtils]: 5: Hoare triple {1497#true} assume q1_#t~switch17#1;q1_~i~1#1 := 0; {1517#(<= |ULTIMATE.start_q1_~i~1#1| 0)} is VALID [2022-02-21 03:57:52,875 INFO L290 TraceCheckUtils]: 4: Hoare triple {1497#true} assume !q1_#t~switch17#1;q1_#t~switch17#1 := true; {1497#true} is VALID [2022-02-21 03:57:52,875 INFO L290 TraceCheckUtils]: 3: Hoare triple {1497#true} assume !q1_#t~switch17#1;q1_#t~switch17#1 := q1_#t~switch17#1; {1497#true} is VALID [2022-02-21 03:57:52,875 INFO L290 TraceCheckUtils]: 2: Hoare triple {1497#true} 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; {1497#true} is VALID [2022-02-21 03:57:52,875 INFO L290 TraceCheckUtils]: 1: Hoare triple {1497#true} 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; {1497#true} is VALID [2022-02-21 03:57:52,875 INFO L290 TraceCheckUtils]: 0: Hoare triple {1497#true} 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); {1497#true} is VALID [2022-02-21 03:57:52,875 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-21 03:57:52,875 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:57:52,876 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652297815] [2022-02-21 03:57:52,876 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-21 03:57:52,876 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1636869038] [2022-02-21 03:57:52,876 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1636869038] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:57:52,876 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-21 03:57:52,876 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2022-02-21 03:57:52,876 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559717082] [2022-02-21 03:57:52,876 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-21 03:57:52,976 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:57:52,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-21 03:57:52,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-02-21 03:57:52,977 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) [2022-02-21 03:57:53,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:57:53,088 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2022-02-21 03:57:53,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-21 03:57:53,089 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 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) [2022-02-21 03:57:53,105 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:57:53,106 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 41 transitions. [2022-02-21 03:57:53,106 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2022-02-21 03:57:53,107 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 28 states and 33 transitions. [2022-02-21 03:57:53,107 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2022-02-21 03:57:53,107 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2022-02-21 03:57:53,107 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 33 transitions. [2022-02-21 03:57:53,107 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:57:53,107 INFO L681 BuchiCegarLoop]: Abstraction has 28 states and 33 transitions. [2022-02-21 03:57:53,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 33 transitions. [2022-02-21 03:57:53,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 25. [2022-02-21 03:57:53,108 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:57:53,108 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states and 33 transitions. Second 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) [2022-02-21 03:57:53,108 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states and 33 transitions. Second 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) [2022-02-21 03:57:53,108 INFO L87 Difference]: Start difference. First operand 28 states and 33 transitions. Second 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) [2022-02-21 03:57:53,108 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:57:53,109 INFO L93 Difference]: Finished difference Result 28 states and 33 transitions. [2022-02-21 03:57:53,109 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 33 transitions. [2022-02-21 03:57:53,109 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:57:53,109 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:57:53,109 INFO L74 IsIncluded]: Start isIncluded. First 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) Second operand 28 states and 33 transitions. [2022-02-21 03:57:53,109 INFO L87 Difference]: Start difference. First 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) Second operand 28 states and 33 transitions. [2022-02-21 03:57:53,109 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:57:53,110 INFO L93 Difference]: Finished difference Result 28 states and 33 transitions. [2022-02-21 03:57:53,110 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 33 transitions. [2022-02-21 03:57:53,110 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:57:53,110 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:57:53,110 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:57:53,110 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:57:53,110 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) [2022-02-21 03:57:53,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2022-02-21 03:57:53,111 INFO L704 BuchiCegarLoop]: Abstraction has 25 states and 29 transitions. [2022-02-21 03:57:53,111 INFO L587 BuchiCegarLoop]: Abstraction has 25 states and 29 transitions. [2022-02-21 03:57:53,111 INFO L425 BuchiCegarLoop]: ======== Iteration 11============ [2022-02-21 03:57:53,111 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 29 transitions. [2022-02-21 03:57:53,111 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2022-02-21 03:57:53,111 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:57:53,111 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:57:53,111 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:57:53,111 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:57:53,111 INFO L791 eck$LassoCheckResult]: Stem: 1665#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); 1666#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; 1669#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; 1670#L65 assume !q1_#t~switch17#1;q1_#t~switch17#1 := q1_#t~switch17#1; 1687#L69 assume !q1_#t~switch17#1;q1_#t~switch17#1 := true; 1685#L73 assume q1_#t~switch17#1;q1_~i~1#1 := 0; 1686#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); 1677#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; 1678#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); 1688#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; 1689#L74-3 assume !(q1_~i~1#1 < q1_~N~0#1); 1679#L74-4 q1_~i~1#1 := 0; 1680#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); 1671#L76-2 q1_#t~post21#1 := q1_~i~1#1;q1_~i~1#1 := 1 + q1_#t~post21#1;havoc q1_#t~post21#1; 1672#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); 1673#L76-2 q1_#t~post21#1 := q1_~i~1#1;q1_~i~1#1 := 1 + q1_#t~post21#1;havoc q1_#t~post21#1; 1674#L76-3 assume !(q1_~i~1#1 < q1_~N~0#1); 1667#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; 1668#L18-3 [2022-02-21 03:57:53,112 INFO L793 eck$LassoCheckResult]: Loop: 1668#L18-3 assume !!(bubblesort_~a~0#1 < bubblesort_~size#1);bubblesort_~b~0#1 := bubblesort_~size#1 - 1; 1682#L20-3 assume !!(bubblesort_~b~0#1 >= bubblesort_~a~0#1); 1683#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); 1675#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); 1676#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; 1684#L20-3 assume !(bubblesort_~b~0#1 >= bubblesort_~a~0#1); 1681#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; 1668#L18-3 [2022-02-21 03:57:53,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:57:53,112 INFO L85 PathProgramCache]: Analyzing trace with hash 1273080179, now seen corresponding path program 2 times [2022-02-21 03:57:53,112 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:57:53,112 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523536822] [2022-02-21 03:57:53,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:57:53,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:57:53,137 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-21 03:57:53,137 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [415867731] [2022-02-21 03:57:53,137 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-21 03:57:53,137 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:57:53,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:57:53,139 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) [2022-02-21 03:57:53,141 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Waiting until timeout for monitored process [2022-02-21 03:57:53,198 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-21 03:57:53,198 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-02-21 03:57:53,199 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:57:53,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:57:53,222 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:57:53,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:57:53,222 INFO L85 PathProgramCache]: Analyzing trace with hash -1669532239, now seen corresponding path program 4 times [2022-02-21 03:57:53,222 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:57:53,222 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777967165] [2022-02-21 03:57:53,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:57:53,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:57:53,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:57:53,231 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:57:53,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:57:53,239 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:57:53,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:57:53,239 INFO L85 PathProgramCache]: Analyzing trace with hash 1247881215, now seen corresponding path program 2 times [2022-02-21 03:57:53,239 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:57:53,239 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087693775] [2022-02-21 03:57:53,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:57:53,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:57:53,258 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-21 03:57:53,258 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [356831908] [2022-02-21 03:57:53,258 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-21 03:57:53,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:57:53,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:57:53,260 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) [2022-02-21 03:57:53,279 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Waiting until timeout for monitored process [2022-02-21 03:57:53,330 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-21 03:57:53,331 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-02-21 03:57:53,331 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:57:53,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:57:53,369 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:57:56,602 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:57:56,602 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:57:56,602 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:57:56,602 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:57:56,602 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:57:56,602 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:57:56,602 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:57:56,602 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:57:56,602 INFO L133 ssoRankerPreferences]: Filename of dumped script: bubble_sort-1.c_Iteration11_Lasso [2022-02-21 03:57:56,602 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:57:56,602 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:57:56,604 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:57:56,607 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:57:56,609 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:57:56,610 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:57:56,612 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:57:56,614 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:57:56,615 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:57:56,623 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:57:56,625 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:57:56,627 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:57:56,629 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:57:56,631 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:57:56,632 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:57:56,634 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:57:56,640 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:57:56,642 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:57:56,643 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:57:56,645 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:57:56,651 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:57:56,653 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:57:56,655 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:57:56,656 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:57:57,719 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.AssertionError: v_rep(select (select #memory_int ULTIMATE.start_q1_~#a~1#1.base) (+ ULTIMATE.start_q1_~#a~1#1.offset (* ULTIMATE.start_q1_~i~1#1 4) (- 8)))_1 was not added to the transformula! at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminatorUtils.getReplacementVar(MapEliminatorUtils.java:260) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.replaceMapReads(MapEliminator.java:509) 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) [2022-02-21 03:57:57,723 INFO L158 Benchmark]: Toolchain (without parser) took 27409.54ms. Allocated memory was 88.1MB in the beginning and 174.1MB in the end (delta: 86.0MB). Free memory was 55.3MB in the beginning and 46.6MB in the end (delta: 8.7MB). Peak memory consumption was 101.3MB. Max. memory is 16.1GB. [2022-02-21 03:57:57,723 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 88.1MB. Free memory was 42.6MB in the beginning and 42.5MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:57:57,723 INFO L158 Benchmark]: CACSL2BoogieTranslator took 201.43ms. Allocated memory was 88.1MB in the beginning and 119.5MB in the end (delta: 31.5MB). Free memory was 55.1MB in the beginning and 93.3MB in the end (delta: -38.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-21 03:57:57,723 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.54ms. Allocated memory is still 119.5MB. Free memory was 93.3MB in the beginning and 91.1MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 03:57:57,723 INFO L158 Benchmark]: Boogie Preprocessor took 20.42ms. Allocated memory is still 119.5MB. Free memory was 91.1MB in the beginning and 89.4MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 03:57:57,723 INFO L158 Benchmark]: RCFGBuilder took 373.37ms. Allocated memory is still 119.5MB. Free memory was 89.4MB in the beginning and 73.8MB in the end (delta: 15.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-02-21 03:57:57,724 INFO L158 Benchmark]: BuchiAutomizer took 26758.91ms. Allocated memory was 119.5MB in the beginning and 174.1MB in the end (delta: 54.5MB). Free memory was 73.4MB in the beginning and 46.6MB in the end (delta: 26.8MB). Peak memory consumption was 89.4MB. Max. memory is 16.1GB. [2022-02-21 03:57:57,725 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 88.1MB. Free memory was 42.6MB in the beginning and 42.5MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 201.43ms. Allocated memory was 88.1MB in the beginning and 119.5MB in the end (delta: 31.5MB). Free memory was 55.1MB in the beginning and 93.3MB in the end (delta: -38.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 49.54ms. Allocated memory is still 119.5MB. Free memory was 93.3MB in the beginning and 91.1MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 20.42ms. Allocated memory is still 119.5MB. Free memory was 91.1MB in the beginning and 89.4MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 373.37ms. Allocated memory is still 119.5MB. Free memory was 89.4MB in the beginning and 73.8MB in the end (delta: 15.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * BuchiAutomizer took 26758.91ms. Allocated memory was 119.5MB in the beginning and 174.1MB in the end (delta: 54.5MB). Free memory was 73.4MB in the beginning and 46.6MB in the end (delta: 26.8MB). Peak memory consumption was 89.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: AssertionError: v_rep(select (select #memory_int ULTIMATE.start_q1_~#a~1#1.base) (+ ULTIMATE.start_q1_~#a~1#1.offset (* ULTIMATE.start_q1_~i~1#1 4) (- 8)))_1 was not added to the transformula! de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: AssertionError: v_rep(select (select #memory_int ULTIMATE.start_q1_~#a~1#1.base) (+ ULTIMATE.start_q1_~#a~1#1.offset (* ULTIMATE.start_q1_~i~1#1 4) (- 8)))_1 was not added to the transformula!: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminatorUtils.getReplacementVar(MapEliminatorUtils.java:260) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-02-21 03:57:57,748 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Forceful destruction successful, exit code 0 [2022-02-21 03:57:57,960 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Forceful destruction successful, exit code 0 [2022-02-21 03:57:58,160 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Ended with exit code 0 [2022-02-21 03:57:58,360 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Ended with exit code 0 [2022-02-21 03:57:58,560 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2022-02-21 03:57:58,765 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2022-02-21 03:57:58,961 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2022-02-21 03:57:59,160 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-02-21 03:57:59,361 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-02-21 03:57:59,562 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2022-02-21 03:57:59,761 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2022-02-21 03:57:59,962 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-02-21 03:58:00,166 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis No suitable file found in config dir /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config using search string *Termination*32bit*_Bitvector*.epf No suitable settings file found using Termination*32bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: v_rep(select (select #memory_int ULTIMATE.start_q1_~#a~1#1.base) (+ ULTIMATE.start_q1_~#a~1#1.offset (* ULTIMATE.start_q1_~i~1#1 4) (- 8)))_1 was not added to the transformula!