./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-restricted-15/NO_13.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 6c24879c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/termination-restricted-15/NO_13.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash eeea679d58a502ae5881094604c1f31424fa081cb4c3d3de58dd4530f33f3571 --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-13 03:11:07,872 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 03:11:07,874 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 03:11:07,903 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 03:11:07,904 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 03:11:07,904 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 03:11:07,905 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 03:11:07,907 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 03:11:07,908 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 03:11:07,909 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 03:11:07,910 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 03:11:07,911 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 03:11:07,911 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 03:11:07,912 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 03:11:07,913 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 03:11:07,914 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 03:11:07,914 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 03:11:07,915 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 03:11:07,917 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 03:11:07,918 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 03:11:07,920 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 03:11:07,920 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 03:11:07,921 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 03:11:07,922 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 03:11:07,923 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 03:11:07,925 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 03:11:07,926 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 03:11:07,926 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 03:11:07,927 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 03:11:07,927 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 03:11:07,928 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 03:11:07,928 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 03:11:07,929 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 03:11:07,930 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 03:11:07,930 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 03:11:07,931 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 03:11:07,931 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 03:11:07,932 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 03:11:07,932 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 03:11:07,933 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 03:11:07,934 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 03:11:07,942 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 03:11:07,944 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2022-07-13 03:11:07,965 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 03:11:07,965 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 03:11:07,965 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 03:11:07,966 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 03:11:07,966 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 03:11:07,967 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 03:11:07,967 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 03:11:07,967 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-07-13 03:11:07,967 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-07-13 03:11:07,967 INFO L138 SettingsManager]: * Use old map elimination=false [2022-07-13 03:11:07,968 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-07-13 03:11:07,968 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-07-13 03:11:07,968 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-07-13 03:11:07,968 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 03:11:07,968 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-13 03:11:07,969 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-13 03:11:07,969 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 03:11:07,969 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-07-13 03:11:07,969 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-07-13 03:11:07,969 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-07-13 03:11:07,970 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-13 03:11:07,970 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-07-13 03:11:07,970 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 03:11:07,970 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-07-13 03:11:07,970 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 03:11:07,971 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 03:11:07,971 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 03:11:07,971 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-13 03:11:07,972 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-07-13 03:11:07,972 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> eeea679d58a502ae5881094604c1f31424fa081cb4c3d3de58dd4530f33f3571 [2022-07-13 03:11:08,172 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 03:11:08,188 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 03:11:08,190 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 03:11:08,191 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 03:11:08,192 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 03:11:08,192 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-restricted-15/NO_13.c [2022-07-13 03:11:08,259 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9ee2fabb9/d889e4448a4a40419945b6c6fee2360d/FLAG8e026e6fa [2022-07-13 03:11:08,627 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 03:11:08,627 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-restricted-15/NO_13.c [2022-07-13 03:11:08,632 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9ee2fabb9/d889e4448a4a40419945b6c6fee2360d/FLAG8e026e6fa [2022-07-13 03:11:09,061 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9ee2fabb9/d889e4448a4a40419945b6c6fee2360d [2022-07-13 03:11:09,063 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 03:11:09,065 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 03:11:09,067 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 03:11:09,067 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 03:11:09,069 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 03:11:09,070 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 03:11:09" (1/1) ... [2022-07-13 03:11:09,071 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@38a546d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:11:09, skipping insertion in model container [2022-07-13 03:11:09,071 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 03:11:09" (1/1) ... [2022-07-13 03:11:09,076 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 03:11:09,086 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 03:11:09,231 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 03:11:09,234 INFO L203 MainTranslator]: Completed pre-run [2022-07-13 03:11:09,251 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 03:11:09,260 INFO L208 MainTranslator]: Completed translation [2022-07-13 03:11:09,261 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:11:09 WrapperNode [2022-07-13 03:11:09,261 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 03:11:09,262 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-13 03:11:09,263 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-13 03:11:09,263 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-13 03:11:09,270 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:11:09" (1/1) ... [2022-07-13 03:11:09,274 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:11:09" (1/1) ... [2022-07-13 03:11:09,286 INFO L137 Inliner]: procedures = 4, calls = 2, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 17 [2022-07-13 03:11:09,287 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-13 03:11:09,288 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-13 03:11:09,288 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-13 03:11:09,288 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-13 03:11:09,294 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:11:09" (1/1) ... [2022-07-13 03:11:09,295 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:11:09" (1/1) ... [2022-07-13 03:11:09,296 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:11:09" (1/1) ... [2022-07-13 03:11:09,296 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:11:09" (1/1) ... [2022-07-13 03:11:09,297 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:11:09" (1/1) ... [2022-07-13 03:11:09,300 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:11:09" (1/1) ... [2022-07-13 03:11:09,301 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:11:09" (1/1) ... [2022-07-13 03:11:09,302 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-13 03:11:09,303 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-13 03:11:09,303 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-13 03:11:09,304 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-13 03:11:09,304 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:11:09" (1/1) ... [2022-07-13 03:11:09,311 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:11:09,319 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:11:09,330 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 03:11:09,349 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2022-07-13 03:11:09,364 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-13 03:11:09,364 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-13 03:11:09,400 INFO L234 CfgBuilder]: Building ICFG [2022-07-13 03:11:09,401 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-13 03:11:09,454 INFO L275 CfgBuilder]: Performing block encoding [2022-07-13 03:11:09,459 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-13 03:11:09,459 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-13 03:11:09,461 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 03:11:09 BoogieIcfgContainer [2022-07-13 03:11:09,461 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-13 03:11:09,462 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-07-13 03:11:09,462 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-07-13 03:11:09,465 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-07-13 03:11:09,466 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-13 03:11:09,466 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 13.07 03:11:09" (1/3) ... [2022-07-13 03:11:09,467 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3a626f01 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 13.07 03:11:09, skipping insertion in model container [2022-07-13 03:11:09,467 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-13 03:11:09,467 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:11:09" (2/3) ... [2022-07-13 03:11:09,468 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3a626f01 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 13.07 03:11:09, skipping insertion in model container [2022-07-13 03:11:09,468 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-13 03:11:09,471 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 03:11:09" (3/3) ... [2022-07-13 03:11:09,472 INFO L354 chiAutomizerObserver]: Analyzing ICFG NO_13.c [2022-07-13 03:11:09,510 INFO L255 stractBuchiCegarLoop]: Interprodecural is true [2022-07-13 03:11:09,511 INFO L256 stractBuchiCegarLoop]: Hoare is false [2022-07-13 03:11:09,511 INFO L257 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-07-13 03:11:09,511 INFO L258 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-07-13 03:11:09,511 INFO L259 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-07-13 03:11:09,511 INFO L260 stractBuchiCegarLoop]: Difference is false [2022-07-13 03:11:09,512 INFO L261 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-07-13 03:11:09,512 INFO L265 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-07-13 03:11:09,518 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 03:11:09,530 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-07-13 03:11:09,530 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:11:09,530 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:11:09,533 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-13 03:11:09,533 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-13 03:11:09,534 INFO L287 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-07-13 03:11:09,534 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 03:11:09,534 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-07-13 03:11:09,535 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:11:09,535 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:11:09,535 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-13 03:11:09,535 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-13 03:11:09,539 INFO L752 eck$LassoCheckResult]: Stem: 5#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true; 6#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~i~0#1, main_~j~0#1;havoc main_~i~0#1;havoc main_~j~0#1;main_~j~0#1 := 100;main_~i~0#1 := 0; 2#L12-2true [2022-07-13 03:11:09,539 INFO L754 eck$LassoCheckResult]: Loop: 2#L12-2true assume !!(main_~i~0#1 < main_~j~0#1); 8#L12true assume !(51 < main_~j~0#1);main_~i~0#1 := main_~i~0#1 - 1;main_~j~0#1 := 1 + main_~j~0#1; 2#L12-2true [2022-07-13 03:11:09,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:11:09,543 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2022-07-13 03:11:09,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:11:09,549 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812690309] [2022-07-13 03:11:09,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:11:09,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:11:09,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:11:09,605 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:11:09,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:11:09,618 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:11:09,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:11:09,621 INFO L85 PathProgramCache]: Analyzing trace with hash 1318, now seen corresponding path program 1 times [2022-07-13 03:11:09,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:11:09,622 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388177432] [2022-07-13 03:11:09,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:11:09,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:11:09,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:11:09,631 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:11:09,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:11:09,636 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:11:09,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:11:09,639 INFO L85 PathProgramCache]: Analyzing trace with hash 925800, now seen corresponding path program 1 times [2022-07-13 03:11:09,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:11:09,640 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786646089] [2022-07-13 03:11:09,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:11:09,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:11:09,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:11:09,730 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 03:11:09,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 03:11:09,731 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786646089] [2022-07-13 03:11:09,732 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1786646089] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 03:11:09,732 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 03:11:09,732 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-13 03:11:09,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948149793] [2022-07-13 03:11:09,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 03:11:09,808 INFO L210 LassoAnalysis]: Preferences: [2022-07-13 03:11:09,815 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-13 03:11:09,816 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-13 03:11:09,816 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-13 03:11:09,816 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-07-13 03:11:09,816 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:11:09,816 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-13 03:11:09,816 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-13 03:11:09,816 INFO L133 ssoRankerPreferences]: Filename of dumped script: NO_13.c_Iteration1_Loop [2022-07-13 03:11:09,816 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-13 03:11:09,817 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-13 03:11:09,829 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:11:09,844 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:11:09,848 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:11:09,939 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-13 03:11:09,940 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-07-13 03:11:09,941 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:11:09,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:11:09,943 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 03:11:09,948 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2022-07-13 03:11:09,949 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-13 03:11:09,949 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-13 03:11:09,972 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-13 03:11:09,972 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_1=1} Honda state: {v_rep~unnamed0~0~true_1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-13 03:11:09,990 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2022-07-13 03:11:09,991 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:11:09,991 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:11:09,992 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 03:11:09,993 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2022-07-13 03:11:09,994 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-13 03:11:09,994 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-13 03:11:10,006 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-13 03:11:10,006 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_1=0} Honda state: {v_rep~unnamed0~0~false_1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-13 03:11:10,023 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2022-07-13 03:11:10,023 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:11:10,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:11:10,024 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 03:11:10,032 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-13 03:11:10,032 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-13 03:11:10,043 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2022-07-13 03:11:10,059 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2022-07-13 03:11:10,060 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:11:10,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:11:10,061 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 03:11:10,063 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2022-07-13 03:11:10,067 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-07-13 03:11:10,067 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-13 03:11:10,103 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-07-13 03:11:10,108 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2022-07-13 03:11:10,108 INFO L210 LassoAnalysis]: Preferences: [2022-07-13 03:11:10,109 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-13 03:11:10,109 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-13 03:11:10,109 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-13 03:11:10,109 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-13 03:11:10,109 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:11:10,109 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-13 03:11:10,109 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-13 03:11:10,109 INFO L133 ssoRankerPreferences]: Filename of dumped script: NO_13.c_Iteration1_Loop [2022-07-13 03:11:10,109 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-13 03:11:10,109 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-13 03:11:10,110 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:11:10,114 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:11:10,118 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:11:10,183 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-13 03:11:10,187 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-13 03:11:10,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:11:10,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:11:10,190 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 03:11:10,202 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:11:10,208 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2022-07-13 03:11:10,210 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:11:10,210 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:11:10,210 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:11:10,210 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:11:10,214 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 03:11:10,214 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 03:11:10,229 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:11:10,244 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2022-07-13 03:11:10,245 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:11:10,245 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:11:10,246 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 03:11:10,247 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2022-07-13 03:11:10,248 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:11:10,254 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:11:10,254 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:11:10,254 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:11:10,254 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:11:10,257 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 03:11:10,257 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 03:11:10,260 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:11:10,283 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2022-07-13 03:11:10,283 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:11:10,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:11:10,284 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 03:11:10,288 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2022-07-13 03:11:10,289 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:11:10,295 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:11:10,295 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:11:10,295 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:11:10,295 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:11:10,296 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:11:10,297 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 03:11:10,297 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:11:10,311 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-13 03:11:10,314 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-07-13 03:11:10,314 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-07-13 03:11:10,315 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:11:10,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:11:10,318 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 03:11:10,319 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2022-07-13 03:11:10,347 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-13 03:11:10,348 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-07-13 03:11:10,348 INFO L513 LassoAnalysis]: Proved termination. [2022-07-13 03:11:10,348 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0#1) = -2*ULTIMATE.start_main_~j~0#1 + 103 Supporting invariants [] [2022-07-13 03:11:10,364 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2022-07-13 03:11:10,367 INFO L293 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-07-13 03:11:10,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:11:10,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:11:10,395 INFO L263 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-13 03:11:10,396 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 03:11:10,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:11:10,428 WARN L261 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-13 03:11:10,429 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 03:11:10,434 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 03:11:10,457 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2022-07-13 03:11:10,467 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2022-07-13 03:11:10,468 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 7 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) Second operand has 3 states, 3 states have (on average 1.3333333333333333) 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-07-13 03:11:10,496 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 7 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). Second operand has 3 states, 3 states have (on average 1.3333333333333333) 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) Result 24 states and 31 transitions. Complement of second has 6 states. [2022-07-13 03:11:10,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2022-07-13 03:11:10,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.3333333333333333) 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-07-13 03:11:10,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2022-07-13 03:11:10,503 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 2 letters. Loop has 2 letters. [2022-07-13 03:11:10,503 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-13 03:11:10,503 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 4 letters. Loop has 2 letters. [2022-07-13 03:11:10,504 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-13 03:11:10,504 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 2 letters. Loop has 4 letters. [2022-07-13 03:11:10,504 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-13 03:11:10,505 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 31 transitions. [2022-07-13 03:11:10,507 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-07-13 03:11:10,509 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 8 states and 11 transitions. [2022-07-13 03:11:10,510 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2022-07-13 03:11:10,510 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2022-07-13 03:11:10,510 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 11 transitions. [2022-07-13 03:11:10,511 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-13 03:11:10,511 INFO L369 hiAutomatonCegarLoop]: Abstraction has 8 states and 11 transitions. [2022-07-13 03:11:10,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states and 11 transitions. [2022-07-13 03:11:10,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2022-07-13 03:11:10,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.375) internal successors, (11), 7 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 03:11:10,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 11 transitions. [2022-07-13 03:11:10,526 INFO L392 hiAutomatonCegarLoop]: Abstraction has 8 states and 11 transitions. [2022-07-13 03:11:10,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 03:11:10,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 03:11:10,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 03:11:10,529 INFO L87 Difference]: Start difference. First operand 8 states and 11 transitions. 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-07-13 03:11:10,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 03:11:10,537 INFO L93 Difference]: Finished difference Result 7 states and 8 transitions. [2022-07-13 03:11:10,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 03:11:10,538 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 7 states and 8 transitions. [2022-07-13 03:11:10,539 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-07-13 03:11:10,539 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 7 states to 6 states and 7 transitions. [2022-07-13 03:11:10,539 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2022-07-13 03:11:10,539 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2022-07-13 03:11:10,539 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 7 transitions. [2022-07-13 03:11:10,540 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 03:11:10,540 INFO L369 hiAutomatonCegarLoop]: Abstraction has 6 states and 7 transitions. [2022-07-13 03:11:10,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states and 7 transitions. [2022-07-13 03:11:10,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2022-07-13 03:11:10,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 03:11:10,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 7 transitions. [2022-07-13 03:11:10,541 INFO L392 hiAutomatonCegarLoop]: Abstraction has 6 states and 7 transitions. [2022-07-13 03:11:10,541 INFO L374 stractBuchiCegarLoop]: Abstraction has 6 states and 7 transitions. [2022-07-13 03:11:10,541 INFO L287 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-07-13 03:11:10,542 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6 states and 7 transitions. [2022-07-13 03:11:10,542 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-07-13 03:11:10,542 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:11:10,542 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:11:10,543 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2022-07-13 03:11:10,543 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-13 03:11:10,543 INFO L752 eck$LassoCheckResult]: Stem: 86#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 87#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~i~0#1, main_~j~0#1;havoc main_~i~0#1;havoc main_~j~0#1;main_~j~0#1 := 100;main_~i~0#1 := 0; 88#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 89#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 84#L12-2 [2022-07-13 03:11:10,543 INFO L754 eck$LassoCheckResult]: Loop: 84#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 85#L12 assume !(51 < main_~j~0#1);main_~i~0#1 := main_~i~0#1 - 1;main_~j~0#1 := 1 + main_~j~0#1; 84#L12-2 [2022-07-13 03:11:10,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:11:10,544 INFO L85 PathProgramCache]: Analyzing trace with hash 925798, now seen corresponding path program 1 times [2022-07-13 03:11:10,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:11:10,544 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288267940] [2022-07-13 03:11:10,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:11:10,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:11:10,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:11:10,549 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:11:10,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:11:10,553 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:11:10,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:11:10,554 INFO L85 PathProgramCache]: Analyzing trace with hash 1318, now seen corresponding path program 2 times [2022-07-13 03:11:10,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:11:10,554 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321893173] [2022-07-13 03:11:10,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:11:10,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:11:10,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:11:10,558 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:11:10,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:11:10,562 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:11:10,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:11:10,562 INFO L85 PathProgramCache]: Analyzing trace with hash 889692235, now seen corresponding path program 1 times [2022-07-13 03:11:10,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:11:10,563 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233909433] [2022-07-13 03:11:10,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:11:10,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:11:10,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:11:10,582 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 03:11:10,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 03:11:10,582 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233909433] [2022-07-13 03:11:10,583 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233909433] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 03:11:10,583 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [817451343] [2022-07-13 03:11:10,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:11:10,583 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 03:11:10,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:11:10,585 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 03:11:10,611 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-07-13 03:11:10,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:11:10,616 INFO L263 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-13 03:11:10,616 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 03:11:10,643 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 03:11:10,644 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 03:11:10,666 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 03:11:10,666 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [817451343] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 03:11:10,666 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 03:11:10,666 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2022-07-13 03:11:10,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938079964] [2022-07-13 03:11:10,667 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 03:11:10,696 INFO L210 LassoAnalysis]: Preferences: [2022-07-13 03:11:10,696 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-13 03:11:10,696 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-13 03:11:10,696 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-13 03:11:10,697 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-07-13 03:11:10,697 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:11:10,697 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-13 03:11:10,697 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-13 03:11:10,697 INFO L133 ssoRankerPreferences]: Filename of dumped script: NO_13.c_Iteration2_Loop [2022-07-13 03:11:10,697 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-13 03:11:10,697 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-13 03:11:10,699 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:11:10,702 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:11:10,705 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:11:10,761 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-13 03:11:10,762 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-07-13 03:11:10,763 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:11:10,763 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:11:10,768 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 03:11:10,769 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2022-07-13 03:11:10,771 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-13 03:11:10,771 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-13 03:11:10,783 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-13 03:11:10,783 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_3=0} Honda state: {v_rep~unnamed0~0~false_3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-13 03:11:10,799 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2022-07-13 03:11:10,799 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:11:10,799 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:11:10,800 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 03:11:10,801 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2022-07-13 03:11:10,802 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-13 03:11:10,802 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-13 03:11:10,814 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-13 03:11:10,814 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_3=1} Honda state: {v_rep~unnamed0~0~true_3=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-13 03:11:10,832 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2022-07-13 03:11:10,832 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:11:10,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:11:10,833 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 03:11:10,834 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2022-07-13 03:11:10,835 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-13 03:11:10,836 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-13 03:11:10,857 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2022-07-13 03:11:10,859 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:11:10,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:11:10,860 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 03:11:10,861 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2022-07-13 03:11:10,862 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-07-13 03:11:10,862 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-13 03:11:10,905 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-07-13 03:11:10,915 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2022-07-13 03:11:10,915 INFO L210 LassoAnalysis]: Preferences: [2022-07-13 03:11:10,915 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-13 03:11:10,915 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-13 03:11:10,915 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-13 03:11:10,915 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-13 03:11:10,915 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:11:10,916 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-13 03:11:10,916 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-13 03:11:10,916 INFO L133 ssoRankerPreferences]: Filename of dumped script: NO_13.c_Iteration2_Loop [2022-07-13 03:11:10,916 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-13 03:11:10,916 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-13 03:11:10,917 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:11:10,921 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:11:10,924 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:11:10,967 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-13 03:11:10,967 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-13 03:11:10,967 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:11:10,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:11:10,969 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 03:11:10,970 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2022-07-13 03:11:10,971 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:11:10,979 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:11:10,979 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:11:10,980 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:11:10,980 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:11:10,987 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 03:11:10,987 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 03:11:11,002 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:11:11,022 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2022-07-13 03:11:11,023 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:11:11,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:11:11,024 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 03:11:11,025 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2022-07-13 03:11:11,026 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:11:11,033 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:11:11,033 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:11:11,033 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:11:11,033 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:11:11,035 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 03:11:11,035 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 03:11:11,051 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:11:11,075 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2022-07-13 03:11:11,076 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:11:11,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:11:11,077 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 03:11:11,086 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:11:11,093 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:11:11,093 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:11:11,093 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:11:11,093 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:11:11,094 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:11:11,095 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 03:11:11,095 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:11:11,098 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2022-07-13 03:11:11,115 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-13 03:11:11,117 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-07-13 03:11:11,118 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-07-13 03:11:11,118 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:11:11,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:11:11,119 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 03:11:11,127 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-13 03:11:11,127 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-07-13 03:11:11,127 INFO L513 LassoAnalysis]: Proved termination. [2022-07-13 03:11:11,127 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0#1) = -2*ULTIMATE.start_main_~j~0#1 + 103 Supporting invariants [] [2022-07-13 03:11:11,133 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2022-07-13 03:11:11,144 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2022-07-13 03:11:11,145 INFO L293 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-07-13 03:11:11,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:11:11,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:11:11,161 INFO L263 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-13 03:11:11,162 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 03:11:11,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:11:11,169 WARN L261 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-13 03:11:11,169 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 03:11:11,171 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 03:11:11,172 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2022-07-13 03:11:11,172 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 6 states and 7 transitions. cyclomatic complexity: 2 Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 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-07-13 03:11:11,180 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 6 states and 7 transitions. cyclomatic complexity: 2. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 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) Result 10 states and 13 transitions. Complement of second has 5 states. [2022-07-13 03:11:11,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2022-07-13 03:11:11,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 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-07-13 03:11:11,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 6 transitions. [2022-07-13 03:11:11,181 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 4 letters. Loop has 2 letters. [2022-07-13 03:11:11,182 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-13 03:11:11,182 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 6 letters. Loop has 2 letters. [2022-07-13 03:11:11,182 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-13 03:11:11,182 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 4 letters. Loop has 4 letters. [2022-07-13 03:11:11,182 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-13 03:11:11,182 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 10 states and 13 transitions. [2022-07-13 03:11:11,183 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-07-13 03:11:11,183 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 10 states to 10 states and 13 transitions. [2022-07-13 03:11:11,183 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2022-07-13 03:11:11,184 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2022-07-13 03:11:11,184 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 13 transitions. [2022-07-13 03:11:11,184 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-13 03:11:11,184 INFO L369 hiAutomatonCegarLoop]: Abstraction has 10 states and 13 transitions. [2022-07-13 03:11:11,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 13 transitions. [2022-07-13 03:11:11,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2022-07-13 03:11:11,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.3) internal successors, (13), 9 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-07-13 03:11:11,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 13 transitions. [2022-07-13 03:11:11,185 INFO L392 hiAutomatonCegarLoop]: Abstraction has 10 states and 13 transitions. [2022-07-13 03:11:11,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 03:11:11,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-13 03:11:11,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-07-13 03:11:11,186 INFO L87 Difference]: Start difference. First operand 10 states and 13 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 03:11:11,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 03:11:11,201 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2022-07-13 03:11:11,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-13 03:11:11,202 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 14 transitions. [2022-07-13 03:11:11,203 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-07-13 03:11:11,203 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 12 states and 13 transitions. [2022-07-13 03:11:11,204 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2022-07-13 03:11:11,204 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2022-07-13 03:11:11,204 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 13 transitions. [2022-07-13 03:11:11,204 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 03:11:11,204 INFO L369 hiAutomatonCegarLoop]: Abstraction has 12 states and 13 transitions. [2022-07-13 03:11:11,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 13 transitions. [2022-07-13 03:11:11,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2022-07-13 03:11:11,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 11 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-07-13 03:11:11,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 13 transitions. [2022-07-13 03:11:11,206 INFO L392 hiAutomatonCegarLoop]: Abstraction has 12 states and 13 transitions. [2022-07-13 03:11:11,206 INFO L374 stractBuchiCegarLoop]: Abstraction has 12 states and 13 transitions. [2022-07-13 03:11:11,206 INFO L287 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-07-13 03:11:11,206 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 13 transitions. [2022-07-13 03:11:11,207 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-07-13 03:11:11,207 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:11:11,207 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:11:11,208 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 1, 1] [2022-07-13 03:11:11,208 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-13 03:11:11,208 INFO L752 eck$LassoCheckResult]: Stem: 197#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 198#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~i~0#1, main_~j~0#1;havoc main_~i~0#1;havoc main_~j~0#1;main_~j~0#1 := 100;main_~i~0#1 := 0; 199#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 200#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 195#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 196#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 206#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 205#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 204#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 203#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 202#L12-2 [2022-07-13 03:11:11,208 INFO L754 eck$LassoCheckResult]: Loop: 202#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 201#L12 assume !(51 < main_~j~0#1);main_~i~0#1 := main_~i~0#1 - 1;main_~j~0#1 := 1 + main_~j~0#1; 202#L12-2 [2022-07-13 03:11:11,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:11:11,209 INFO L85 PathProgramCache]: Analyzing trace with hash 742492623, now seen corresponding path program 2 times [2022-07-13 03:11:11,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:11:11,209 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213051090] [2022-07-13 03:11:11,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:11:11,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:11:11,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:11:11,218 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:11:11,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:11:11,226 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:11:11,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:11:11,227 INFO L85 PathProgramCache]: Analyzing trace with hash 1318, now seen corresponding path program 3 times [2022-07-13 03:11:11,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:11:11,227 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076064085] [2022-07-13 03:11:11,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:11:11,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:11:11,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:11:11,230 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:11:11,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:11:11,233 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:11:11,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:11:11,234 INFO L85 PathProgramCache]: Analyzing trace with hash 570839924, now seen corresponding path program 2 times [2022-07-13 03:11:11,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:11:11,234 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904255416] [2022-07-13 03:11:11,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:11:11,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:11:11,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:11:11,314 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2022-07-13 03:11:11,320 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 03:11:11,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 03:11:11,320 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904255416] [2022-07-13 03:11:11,320 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [904255416] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 03:11:11,320 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [577127422] [2022-07-13 03:11:11,320 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-13 03:11:11,321 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 03:11:11,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:11:11,324 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-07-13 03:11:11,326 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-07-13 03:11:11,354 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-13 03:11:11,354 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 03:11:11,354 INFO L263 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-13 03:11:11,355 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 03:11:11,378 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 03:11:11,378 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 03:11:11,429 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 03:11:11,429 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [577127422] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 03:11:11,430 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 03:11:11,430 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2022-07-13 03:11:11,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089801619] [2022-07-13 03:11:11,432 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 03:11:11,451 INFO L210 LassoAnalysis]: Preferences: [2022-07-13 03:11:11,451 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-13 03:11:11,451 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-13 03:11:11,451 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-13 03:11:11,451 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-07-13 03:11:11,451 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:11:11,451 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-13 03:11:11,451 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-13 03:11:11,452 INFO L133 ssoRankerPreferences]: Filename of dumped script: NO_13.c_Iteration3_Loop [2022-07-13 03:11:11,452 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-13 03:11:11,452 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-13 03:11:11,453 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:11:11,459 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:11:11,461 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:11:11,493 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-13 03:11:11,493 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-07-13 03:11:11,493 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:11:11,494 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:11:11,495 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 03:11:11,507 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2022-07-13 03:11:11,512 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-13 03:11:11,512 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-13 03:11:11,553 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2022-07-13 03:11:11,553 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:11:11,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:11:11,554 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 03:11:11,560 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-07-13 03:11:11,560 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-13 03:11:11,565 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2022-07-13 03:11:11,601 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-07-13 03:11:11,606 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2022-07-13 03:11:11,607 INFO L210 LassoAnalysis]: Preferences: [2022-07-13 03:11:11,607 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-13 03:11:11,607 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-13 03:11:11,607 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-13 03:11:11,607 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-13 03:11:11,607 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:11:11,607 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-13 03:11:11,607 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-13 03:11:11,607 INFO L133 ssoRankerPreferences]: Filename of dumped script: NO_13.c_Iteration3_Loop [2022-07-13 03:11:11,607 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-13 03:11:11,607 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-13 03:11:11,608 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:11:11,617 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:11:11,620 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:11:11,656 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-13 03:11:11,656 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-13 03:11:11,657 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:11:11,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:11:11,660 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 03:11:11,666 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2022-07-13 03:11:11,667 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:11:11,675 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:11:11,675 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:11:11,675 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:11:11,675 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:11:11,675 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:11:11,678 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 03:11:11,679 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:11:11,694 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-13 03:11:11,698 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-07-13 03:11:11,698 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-07-13 03:11:11,698 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:11:11,698 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:11:11,703 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 03:11:11,708 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-13 03:11:11,708 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-07-13 03:11:11,708 INFO L513 LassoAnalysis]: Proved termination. [2022-07-13 03:11:11,708 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0#1) = -2*ULTIMATE.start_main_~j~0#1 + 103 Supporting invariants [] [2022-07-13 03:11:11,715 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2022-07-13 03:11:11,724 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2022-07-13 03:11:11,725 INFO L293 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-07-13 03:11:11,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:11:11,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:11:11,745 INFO L263 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-13 03:11:11,746 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 03:11:11,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:11:11,761 WARN L261 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-13 03:11:11,761 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 03:11:11,763 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 03:11:11,764 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2022-07-13 03:11:11,764 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states and 13 transitions. cyclomatic complexity: 2 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-07-13 03:11:11,769 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states and 13 transitions. cyclomatic complexity: 2. 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) Result 13 states and 14 transitions. Complement of second has 5 states. [2022-07-13 03:11:11,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2022-07-13 03:11:11,770 INFO L82 GeneralOperation]: Start removeUnreachable. 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-07-13 03:11:11,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5 transitions. [2022-07-13 03:11:11,771 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 10 letters. Loop has 2 letters. [2022-07-13 03:11:11,771 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-13 03:11:11,771 INFO L577 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-07-13 03:11:11,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:11:11,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:11:11,786 INFO L263 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-13 03:11:11,786 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 03:11:11,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:11:11,798 WARN L261 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-13 03:11:11,799 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 03:11:11,800 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 03:11:11,801 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 1 loop predicates [2022-07-13 03:11:11,801 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states and 13 transitions. cyclomatic complexity: 2 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-07-13 03:11:11,806 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states and 13 transitions. cyclomatic complexity: 2. 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) Result 13 states and 14 transitions. Complement of second has 5 states. [2022-07-13 03:11:11,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2022-07-13 03:11:11,807 INFO L82 GeneralOperation]: Start removeUnreachable. 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-07-13 03:11:11,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5 transitions. [2022-07-13 03:11:11,807 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 10 letters. Loop has 2 letters. [2022-07-13 03:11:11,807 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-13 03:11:11,807 INFO L577 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-07-13 03:11:11,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:11:11,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:11:11,821 INFO L263 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-13 03:11:11,822 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 03:11:11,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:11:11,834 WARN L261 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-13 03:11:11,834 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 03:11:11,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 03:11:11,836 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2022-07-13 03:11:11,836 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states and 13 transitions. cyclomatic complexity: 2 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-07-13 03:11:11,844 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states and 13 transitions. cyclomatic complexity: 2. 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) Result 17 states and 19 transitions. Complement of second has 4 states. [2022-07-13 03:11:11,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2022-07-13 03:11:11,844 INFO L82 GeneralOperation]: Start removeUnreachable. 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-07-13 03:11:11,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 8 transitions. [2022-07-13 03:11:11,845 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 10 letters. Loop has 2 letters. [2022-07-13 03:11:11,845 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-13 03:11:11,845 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 12 letters. Loop has 2 letters. [2022-07-13 03:11:11,846 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-13 03:11:11,846 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 10 letters. Loop has 4 letters. [2022-07-13 03:11:11,846 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-13 03:11:11,846 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 19 transitions. [2022-07-13 03:11:11,847 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-07-13 03:11:11,847 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 14 states and 16 transitions. [2022-07-13 03:11:11,847 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2022-07-13 03:11:11,848 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2022-07-13 03:11:11,848 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 16 transitions. [2022-07-13 03:11:11,848 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-13 03:11:11,848 INFO L369 hiAutomatonCegarLoop]: Abstraction has 14 states and 16 transitions. [2022-07-13 03:11:11,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 16 transitions. [2022-07-13 03:11:11,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2022-07-13 03:11:11,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 12 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 03:11:11,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2022-07-13 03:11:11,850 INFO L392 hiAutomatonCegarLoop]: Abstraction has 13 states and 15 transitions. [2022-07-13 03:11:11,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 03:11:11,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-13 03:11:11,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2022-07-13 03:11:11,851 INFO L87 Difference]: Start difference. First operand 13 states and 15 transitions. Second operand has 12 states, 11 states have (on average 2.090909090909091) internal successors, (23), 12 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-07-13 03:11:11,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 03:11:11,877 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2022-07-13 03:11:11,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-13 03:11:11,878 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 34 transitions. [2022-07-13 03:11:11,879 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-07-13 03:11:11,880 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 26 states and 28 transitions. [2022-07-13 03:11:11,880 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2022-07-13 03:11:11,880 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2022-07-13 03:11:11,880 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 28 transitions. [2022-07-13 03:11:11,880 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-13 03:11:11,880 INFO L369 hiAutomatonCegarLoop]: Abstraction has 26 states and 28 transitions. [2022-07-13 03:11:11,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 28 transitions. [2022-07-13 03:11:11,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2022-07-13 03:11:11,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.08) internal successors, (27), 24 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-07-13 03:11:11,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2022-07-13 03:11:11,883 INFO L392 hiAutomatonCegarLoop]: Abstraction has 25 states and 27 transitions. [2022-07-13 03:11:11,883 INFO L374 stractBuchiCegarLoop]: Abstraction has 25 states and 27 transitions. [2022-07-13 03:11:11,883 INFO L287 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-07-13 03:11:11,883 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 27 transitions. [2022-07-13 03:11:11,884 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-07-13 03:11:11,884 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:11:11,884 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:11:11,885 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [10, 9, 1, 1] [2022-07-13 03:11:11,885 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-13 03:11:11,886 INFO L752 eck$LassoCheckResult]: Stem: 513#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 514#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~i~0#1, main_~j~0#1;havoc main_~i~0#1;havoc main_~j~0#1;main_~j~0#1 := 100;main_~i~0#1 := 0; 515#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 516#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 508#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 509#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 532#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 531#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 530#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 529#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 528#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 527#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 526#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 525#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 524#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 523#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 522#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 521#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 520#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 519#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 518#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 512#L12 [2022-07-13 03:11:11,886 INFO L754 eck$LassoCheckResult]: Loop: 512#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 517#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 512#L12 [2022-07-13 03:11:11,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:11:11,886 INFO L85 PathProgramCache]: Analyzing trace with hash -926509747, now seen corresponding path program 3 times [2022-07-13 03:11:11,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:11:11,886 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853323300] [2022-07-13 03:11:11,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:11:11,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:11:11,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:11:11,902 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:11:11,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:11:11,916 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:11:11,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:11:11,916 INFO L85 PathProgramCache]: Analyzing trace with hash 1406, now seen corresponding path program 1 times [2022-07-13 03:11:11,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:11:11,917 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340231145] [2022-07-13 03:11:11,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:11:11,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:11:11,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:11:11,920 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:11:11,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:11:11,922 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:11:11,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:11:11,922 INFO L85 PathProgramCache]: Analyzing trace with hash -1317636150, now seen corresponding path program 4 times [2022-07-13 03:11:11,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:11:11,923 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526237277] [2022-07-13 03:11:11,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:11:11,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:11:11,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:11:11,939 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:11:11,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:11:11,972 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:11:11,991 INFO L210 LassoAnalysis]: Preferences: [2022-07-13 03:11:11,991 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-13 03:11:11,992 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-13 03:11:11,992 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-13 03:11:11,992 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-07-13 03:11:11,992 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:11:11,992 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-13 03:11:11,992 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-13 03:11:11,992 INFO L133 ssoRankerPreferences]: Filename of dumped script: NO_13.c_Iteration4_Loop [2022-07-13 03:11:11,992 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-13 03:11:11,992 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-13 03:11:11,993 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:11:11,995 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:11:11,997 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:11:12,035 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-13 03:11:12,036 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-07-13 03:11:12,036 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:11:12,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:11:12,037 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 03:11:12,048 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-13 03:11:12,048 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-13 03:11:12,063 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2022-07-13 03:11:12,069 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-13 03:11:12,069 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_7=1} Honda state: {v_rep~unnamed0~0~true_7=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-13 03:11:12,092 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2022-07-13 03:11:12,092 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:11:12,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:11:12,093 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 03:11:12,096 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-13 03:11:12,096 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-13 03:11:12,107 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2022-07-13 03:11:12,117 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-13 03:11:12,117 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_7=0} Honda state: {v_rep~unnamed0~0~false_7=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-13 03:11:12,134 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2022-07-13 03:11:12,135 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:11:12,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:11:12,136 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 03:11:12,136 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2022-07-13 03:11:12,139 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-13 03:11:12,140 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-13 03:11:12,162 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-07-13 03:11:12,162 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:11:12,162 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:11:12,164 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-07-13 03:11:12,165 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-07-13 03:11:12,166 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-07-13 03:11:12,166 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-13 03:11:12,206 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-07-13 03:11:12,212 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2022-07-13 03:11:12,212 INFO L210 LassoAnalysis]: Preferences: [2022-07-13 03:11:12,212 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-13 03:11:12,212 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-13 03:11:12,212 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-13 03:11:12,212 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-13 03:11:12,224 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:11:12,224 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-13 03:11:12,224 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-13 03:11:12,224 INFO L133 ssoRankerPreferences]: Filename of dumped script: NO_13.c_Iteration4_Loop [2022-07-13 03:11:12,224 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-13 03:11:12,224 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-13 03:11:12,225 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:11:12,241 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:11:12,246 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:11:12,251 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2022-07-13 03:11:12,287 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-13 03:11:12,287 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-13 03:11:12,287 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:11:12,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:11:12,291 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 03:11:12,300 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:11:12,306 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:11:12,307 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:11:12,307 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:11:12,307 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:11:12,309 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 03:11:12,309 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 03:11:12,312 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2022-07-13 03:11:12,319 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:11:12,342 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2022-07-13 03:11:12,343 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:11:12,343 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:11:12,344 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 03:11:12,345 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2022-07-13 03:11:12,346 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:11:12,352 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:11:12,352 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:11:12,353 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:11:12,353 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:11:12,354 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 03:11:12,354 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 03:11:12,371 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:11:12,395 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2022-07-13 03:11:12,396 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:11:12,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:11:12,397 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 03:11:12,399 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:11:12,406 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:11:12,406 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:11:12,406 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:11:12,406 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:11:12,406 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:11:12,407 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 03:11:12,407 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:11:12,410 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2022-07-13 03:11:12,423 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-13 03:11:12,426 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-07-13 03:11:12,426 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2022-07-13 03:11:12,426 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:11:12,426 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:11:12,428 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 03:11:12,439 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-13 03:11:12,440 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-07-13 03:11:12,440 INFO L513 LassoAnalysis]: Proved termination. [2022-07-13 03:11:12,440 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0#1) = 1*ULTIMATE.start_main_~j~0#1 Supporting invariants [] [2022-07-13 03:11:12,447 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2022-07-13 03:11:12,464 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0 [2022-07-13 03:11:12,464 INFO L293 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-07-13 03:11:12,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:11:12,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:11:12,488 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-13 03:11:12,489 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 03:11:12,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:11:12,521 WARN L261 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-13 03:11:12,521 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 03:11:12,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 03:11:12,538 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2022-07-13 03:11:12,538 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 27 transitions. cyclomatic complexity: 3 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-07-13 03:11:12,551 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 27 transitions. cyclomatic complexity: 3. 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) Result 38 states and 42 transitions. Complement of second has 5 states. [2022-07-13 03:11:12,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2022-07-13 03:11:12,552 INFO L82 GeneralOperation]: Start removeUnreachable. 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-07-13 03:11:12,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 6 transitions. [2022-07-13 03:11:12,553 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 21 letters. Loop has 2 letters. [2022-07-13 03:11:12,553 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-13 03:11:12,553 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 23 letters. Loop has 2 letters. [2022-07-13 03:11:12,554 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-13 03:11:12,554 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 21 letters. Loop has 4 letters. [2022-07-13 03:11:12,555 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-13 03:11:12,556 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 42 transitions. [2022-07-13 03:11:12,559 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-07-13 03:11:12,563 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 28 states and 31 transitions. [2022-07-13 03:11:12,563 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2022-07-13 03:11:12,563 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2022-07-13 03:11:12,563 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 31 transitions. [2022-07-13 03:11:12,563 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-13 03:11:12,563 INFO L369 hiAutomatonCegarLoop]: Abstraction has 28 states and 31 transitions. [2022-07-13 03:11:12,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 31 transitions. [2022-07-13 03:11:12,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2022-07-13 03:11:12,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 26 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 03:11:12,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2022-07-13 03:11:12,567 INFO L392 hiAutomatonCegarLoop]: Abstraction has 27 states and 30 transitions. [2022-07-13 03:11:12,568 INFO L374 stractBuchiCegarLoop]: Abstraction has 27 states and 30 transitions. [2022-07-13 03:11:12,568 INFO L287 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2022-07-13 03:11:12,568 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 30 transitions. [2022-07-13 03:11:12,569 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-07-13 03:11:12,569 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:11:12,570 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:11:12,571 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [12, 10, 1, 1, 1] [2022-07-13 03:11:12,571 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-13 03:11:12,571 INFO L752 eck$LassoCheckResult]: Stem: 665#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 666#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~i~0#1, main_~j~0#1;havoc main_~i~0#1;havoc main_~j~0#1;main_~j~0#1 := 100;main_~i~0#1 := 0; 661#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 662#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 667#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 668#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 663#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 664#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 687#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 686#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 685#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 684#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 683#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 682#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 681#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 680#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 679#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 678#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 677#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 676#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 675#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 674#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 673#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 671#L12 assume !(51 < main_~j~0#1);main_~i~0#1 := main_~i~0#1 - 1;main_~j~0#1 := 1 + main_~j~0#1; 669#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 670#L12 [2022-07-13 03:11:12,572 INFO L754 eck$LassoCheckResult]: Loop: 670#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 672#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 670#L12 [2022-07-13 03:11:12,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:11:12,573 INFO L85 PathProgramCache]: Analyzing trace with hash 767012677, now seen corresponding path program 3 times [2022-07-13 03:11:12,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:11:12,573 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913126866] [2022-07-13 03:11:12,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:11:12,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:11:12,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:11:12,678 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 11 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 03:11:12,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 03:11:12,678 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913126866] [2022-07-13 03:11:12,679 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1913126866] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 03:11:12,679 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [849666068] [2022-07-13 03:11:12,679 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-13 03:11:12,679 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 03:11:12,679 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:11:12,680 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 03:11:12,681 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2022-07-13 03:11:12,710 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2022-07-13 03:11:12,711 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 03:11:12,712 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-13 03:11:12,714 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 03:11:12,750 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 11 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 03:11:12,751 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 03:11:12,923 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 11 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 03:11:12,923 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [849666068] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 03:11:12,923 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 03:11:12,923 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 24 [2022-07-13 03:11:12,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586050320] [2022-07-13 03:11:12,924 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 03:11:12,924 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-13 03:11:12,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:11:12,924 INFO L85 PathProgramCache]: Analyzing trace with hash 1406, now seen corresponding path program 2 times [2022-07-13 03:11:12,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:11:12,925 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372189226] [2022-07-13 03:11:12,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:11:12,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:11:12,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:11:12,928 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:11:12,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:11:12,929 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:11:12,946 INFO L210 LassoAnalysis]: Preferences: [2022-07-13 03:11:12,946 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-13 03:11:12,946 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-13 03:11:12,946 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-13 03:11:12,946 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-07-13 03:11:12,947 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:11:12,947 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-13 03:11:12,947 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-13 03:11:12,947 INFO L133 ssoRankerPreferences]: Filename of dumped script: NO_13.c_Iteration5_Loop [2022-07-13 03:11:12,947 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-13 03:11:12,947 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-13 03:11:12,948 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:11:12,953 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:11:12,955 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:11:12,987 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-13 03:11:12,987 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-07-13 03:11:12,988 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:11:12,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:11:12,991 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 03:11:12,993 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2022-07-13 03:11:12,994 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-13 03:11:12,994 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-13 03:11:13,017 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Forceful destruction successful, exit code 0 [2022-07-13 03:11:13,017 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:11:13,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:11:13,018 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-07-13 03:11:13,022 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-07-13 03:11:13,022 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-13 03:11:13,028 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-07-13 03:11:13,068 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-07-13 03:11:13,074 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Forceful destruction successful, exit code 0 [2022-07-13 03:11:13,074 INFO L210 LassoAnalysis]: Preferences: [2022-07-13 03:11:13,074 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-13 03:11:13,074 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-13 03:11:13,074 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-13 03:11:13,074 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-13 03:11:13,074 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:11:13,074 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-13 03:11:13,075 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-13 03:11:13,075 INFO L133 ssoRankerPreferences]: Filename of dumped script: NO_13.c_Iteration5_Loop [2022-07-13 03:11:13,075 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-13 03:11:13,075 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-13 03:11:13,075 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:11:13,078 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:11:13,085 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:11:13,120 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Forceful destruction successful, exit code 0 [2022-07-13 03:11:13,137 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-13 03:11:13,137 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-13 03:11:13,137 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:11:13,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:11:13,138 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-07-13 03:11:13,139 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-07-13 03:11:13,140 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:11:13,146 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:11:13,147 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:11:13,147 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:11:13,147 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:11:13,149 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 03:11:13,149 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-13 03:11:13,163 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:11:13,184 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Forceful destruction successful, exit code 0 [2022-07-13 03:11:13,185 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:11:13,185 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:11:13,187 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-07-13 03:11:13,192 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:11:13,199 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:11:13,199 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:11:13,199 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:11:13,199 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:11:13,199 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:11:13,200 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 03:11:13,201 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:11:13,204 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-07-13 03:11:13,215 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-13 03:11:13,217 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2022-07-13 03:11:13,218 INFO L444 ModelExtractionUtils]: 2 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-07-13 03:11:13,218 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:11:13,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:11:13,220 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-07-13 03:11:13,230 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-13 03:11:13,230 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-07-13 03:11:13,230 INFO L513 LassoAnalysis]: Proved termination. [2022-07-13 03:11:13,230 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0#1) = 1*ULTIMATE.start_main_~j~0#1 Supporting invariants [] [2022-07-13 03:11:13,235 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-07-13 03:11:13,246 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Forceful destruction successful, exit code 0 [2022-07-13 03:11:13,246 INFO L293 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-07-13 03:11:13,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:11:13,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:11:13,276 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-13 03:11:13,277 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 03:11:13,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:11:13,311 WARN L261 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-13 03:11:13,311 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 03:11:13,324 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 03:11:13,325 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2022-07-13 03:11:13,325 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 30 transitions. cyclomatic complexity: 5 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-07-13 03:11:13,334 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states and 30 transitions. cyclomatic complexity: 5. 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 38 states and 42 transitions. Complement of second has 5 states. [2022-07-13 03:11:13,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2022-07-13 03:11:13,335 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-07-13 03:11:13,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 6 transitions. [2022-07-13 03:11:13,336 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 25 letters. Loop has 2 letters. [2022-07-13 03:11:13,337 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-13 03:11:13,337 INFO L577 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-07-13 03:11:13,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:11:13,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:11:13,357 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-13 03:11:13,358 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 03:11:13,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:11:13,382 WARN L261 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-13 03:11:13,382 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 03:11:13,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 03:11:13,392 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2022-07-13 03:11:13,393 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 30 transitions. cyclomatic complexity: 5 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-07-13 03:11:13,404 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states and 30 transitions. cyclomatic complexity: 5. 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 39 states and 43 transitions. Complement of second has 5 states. [2022-07-13 03:11:13,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2022-07-13 03:11:13,404 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-07-13 03:11:13,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5 transitions. [2022-07-13 03:11:13,405 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 25 letters. Loop has 2 letters. [2022-07-13 03:11:13,405 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-13 03:11:13,405 INFO L577 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-07-13 03:11:13,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:11:13,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:11:13,427 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-13 03:11:13,428 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 03:11:13,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:11:13,459 WARN L261 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-13 03:11:13,459 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 03:11:13,470 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 03:11:13,471 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2022-07-13 03:11:13,471 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 30 transitions. cyclomatic complexity: 5 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-07-13 03:11:13,481 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states and 30 transitions. cyclomatic complexity: 5. 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 40 states and 45 transitions. Complement of second has 4 states. [2022-07-13 03:11:13,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2022-07-13 03:11:13,482 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-07-13 03:11:13,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2022-07-13 03:11:13,483 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 25 letters. Loop has 2 letters. [2022-07-13 03:11:13,483 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-13 03:11:13,483 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 27 letters. Loop has 2 letters. [2022-07-13 03:11:13,484 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-13 03:11:13,484 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 25 letters. Loop has 4 letters. [2022-07-13 03:11:13,484 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-13 03:11:13,485 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 45 transitions. [2022-07-13 03:11:13,486 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2022-07-13 03:11:13,486 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 29 states and 32 transitions. [2022-07-13 03:11:13,486 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2022-07-13 03:11:13,486 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2022-07-13 03:11:13,486 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 32 transitions. [2022-07-13 03:11:13,486 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-13 03:11:13,487 INFO L369 hiAutomatonCegarLoop]: Abstraction has 29 states and 32 transitions. [2022-07-13 03:11:13,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 32 transitions. [2022-07-13 03:11:13,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 26. [2022-07-13 03:11:13,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 1.0769230769230769) internal successors, (28), 25 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 03:11:13,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2022-07-13 03:11:13,489 INFO L392 hiAutomatonCegarLoop]: Abstraction has 26 states and 28 transitions. [2022-07-13 03:11:13,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 03:11:13,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-07-13 03:11:13,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2022-07-13 03:11:13,490 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand has 24 states, 24 states have (on average 2.0) internal successors, (48), 24 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 03:11:13,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 03:11:13,539 INFO L93 Difference]: Finished difference Result 63 states and 65 transitions. [2022-07-13 03:11:13,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-07-13 03:11:13,540 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 63 states and 65 transitions. [2022-07-13 03:11:13,541 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-07-13 03:11:13,541 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 63 states to 51 states and 53 transitions. [2022-07-13 03:11:13,542 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2022-07-13 03:11:13,542 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2022-07-13 03:11:13,542 INFO L73 IsDeterministic]: Start isDeterministic. Operand 51 states and 53 transitions. [2022-07-13 03:11:13,542 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-13 03:11:13,542 INFO L369 hiAutomatonCegarLoop]: Abstraction has 51 states and 53 transitions. [2022-07-13 03:11:13,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states and 53 transitions. [2022-07-13 03:11:13,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2022-07-13 03:11:13,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 50 states have (on average 1.04) internal successors, (52), 49 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 03:11:13,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 52 transitions. [2022-07-13 03:11:13,545 INFO L392 hiAutomatonCegarLoop]: Abstraction has 50 states and 52 transitions. [2022-07-13 03:11:13,545 INFO L374 stractBuchiCegarLoop]: Abstraction has 50 states and 52 transitions. [2022-07-13 03:11:13,545 INFO L287 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2022-07-13 03:11:13,546 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 50 states and 52 transitions. [2022-07-13 03:11:13,546 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-07-13 03:11:13,546 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:11:13,546 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:11:13,548 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [24, 22, 1, 1, 1] [2022-07-13 03:11:13,548 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 1, 1] [2022-07-13 03:11:13,548 INFO L752 eck$LassoCheckResult]: Stem: 1337#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 1338#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~i~0#1, main_~j~0#1;havoc main_~i~0#1;havoc main_~j~0#1;main_~j~0#1 := 100;main_~i~0#1 := 0; 1333#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1334#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1339#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1340#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1335#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1336#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1382#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1381#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1380#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1379#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1378#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1377#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1376#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1375#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1374#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1373#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1372#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1371#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1370#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1369#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1368#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1367#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1366#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1365#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1364#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1363#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1362#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1361#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1360#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1359#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1358#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1357#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1356#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1355#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1354#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1353#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1352#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1351#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1350#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1349#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1348#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1347#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1346#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1345#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1344#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1343#L12 assume !(51 < main_~j~0#1);main_~i~0#1 := main_~i~0#1 - 1;main_~j~0#1 := 1 + main_~j~0#1; 1341#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1342#L12 [2022-07-13 03:11:13,548 INFO L754 eck$LassoCheckResult]: Loop: 1342#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1344#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1343#L12 assume !(51 < main_~j~0#1);main_~i~0#1 := main_~i~0#1 - 1;main_~j~0#1 := 1 + main_~j~0#1; 1341#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1342#L12 [2022-07-13 03:11:13,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:11:13,548 INFO L85 PathProgramCache]: Analyzing trace with hash -694298463, now seen corresponding path program 4 times [2022-07-13 03:11:13,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:11:13,549 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194817295] [2022-07-13 03:11:13,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:11:13,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:11:13,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:11:13,869 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 23 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 03:11:13,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 03:11:13,869 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194817295] [2022-07-13 03:11:13,869 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [194817295] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 03:11:13,869 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [842059274] [2022-07-13 03:11:13,870 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-13 03:11:13,870 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 03:11:13,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:11:13,871 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 03:11:13,897 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2022-07-13 03:11:13,918 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-13 03:11:13,918 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 03:11:13,919 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 24 conjunts are in the unsatisfiable core [2022-07-13 03:11:13,921 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 03:11:13,991 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-07-13 03:11:14,017 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 23 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 03:11:14,017 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 03:11:14,642 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 23 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 03:11:14,643 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [842059274] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 03:11:14,643 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 03:11:14,643 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 48 [2022-07-13 03:11:14,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050611431] [2022-07-13 03:11:14,643 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 03:11:14,644 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-13 03:11:14,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:11:14,644 INFO L85 PathProgramCache]: Analyzing trace with hash 1351673, now seen corresponding path program 1 times [2022-07-13 03:11:14,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:11:14,644 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836842142] [2022-07-13 03:11:14,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:11:14,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:11:14,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:11:14,648 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:11:14,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:11:14,650 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:11:14,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 03:11:14,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2022-07-13 03:11:14,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2022-07-13 03:11:14,704 INFO L87 Difference]: Start difference. First operand 50 states and 52 transitions. cyclomatic complexity: 3 Second operand has 48 states, 48 states have (on average 2.0) internal successors, (96), 48 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 03:11:14,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 03:11:14,827 INFO L93 Difference]: Finished difference Result 123 states and 125 transitions. [2022-07-13 03:11:14,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2022-07-13 03:11:14,828 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 123 states and 125 transitions. [2022-07-13 03:11:14,829 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-07-13 03:11:14,830 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 123 states to 99 states and 101 transitions. [2022-07-13 03:11:14,830 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2022-07-13 03:11:14,830 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2022-07-13 03:11:14,830 INFO L73 IsDeterministic]: Start isDeterministic. Operand 99 states and 101 transitions. [2022-07-13 03:11:14,830 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-13 03:11:14,830 INFO L369 hiAutomatonCegarLoop]: Abstraction has 99 states and 101 transitions. [2022-07-13 03:11:14,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states and 101 transitions. [2022-07-13 03:11:14,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 98. [2022-07-13 03:11:14,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 98 states have (on average 1.0204081632653061) internal successors, (100), 97 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 03:11:14,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 100 transitions. [2022-07-13 03:11:14,835 INFO L392 hiAutomatonCegarLoop]: Abstraction has 98 states and 100 transitions. [2022-07-13 03:11:14,835 INFO L374 stractBuchiCegarLoop]: Abstraction has 98 states and 100 transitions. [2022-07-13 03:11:14,835 INFO L287 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2022-07-13 03:11:14,836 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 98 states and 100 transitions. [2022-07-13 03:11:14,836 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-07-13 03:11:14,836 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:11:14,836 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:11:14,839 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [48, 46, 1, 1, 1] [2022-07-13 03:11:14,839 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 1, 1] [2022-07-13 03:11:14,839 INFO L752 eck$LassoCheckResult]: Stem: 1849#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 1850#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~i~0#1, main_~j~0#1;havoc main_~i~0#1;havoc main_~j~0#1;main_~j~0#1 := 100;main_~i~0#1 := 0; 1845#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1846#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1851#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1852#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1847#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1848#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1942#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1941#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1940#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1939#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1938#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1937#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1936#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1935#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1934#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1933#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1932#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1931#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1930#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1929#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1928#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1927#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1926#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1925#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1924#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1923#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1922#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1921#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1920#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1919#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1918#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1917#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1916#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1915#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1914#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1913#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1912#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1911#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1910#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1909#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1908#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1907#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1906#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1905#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1904#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1903#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1902#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1901#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1900#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1899#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1898#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1897#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1896#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1895#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1894#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1893#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1892#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1891#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1890#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1889#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1888#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1887#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1886#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1885#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1884#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1883#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1882#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1881#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1880#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1879#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1878#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1877#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1876#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1875#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1874#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1873#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1872#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1871#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1870#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1869#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1868#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1867#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1866#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1865#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1864#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1863#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1862#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1861#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1860#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1859#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1858#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1857#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1856#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1855#L12 assume !(51 < main_~j~0#1);main_~i~0#1 := main_~i~0#1 - 1;main_~j~0#1 := 1 + main_~j~0#1; 1853#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1854#L12 [2022-07-13 03:11:14,839 INFO L754 eck$LassoCheckResult]: Loop: 1854#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 1856#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1855#L12 assume !(51 < main_~j~0#1);main_~i~0#1 := main_~i~0#1 - 1;main_~j~0#1 := 1 + main_~j~0#1; 1853#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 1854#L12 [2022-07-13 03:11:14,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:11:14,840 INFO L85 PathProgramCache]: Analyzing trace with hash -818401447, now seen corresponding path program 5 times [2022-07-13 03:11:14,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:11:14,840 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452078847] [2022-07-13 03:11:14,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:11:14,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:11:14,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:11:15,722 INFO L134 CoverageAnalysis]: Checked inductivity of 2209 backedges. 47 proven. 2162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 03:11:15,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 03:11:15,723 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452078847] [2022-07-13 03:11:15,723 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [452078847] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 03:11:15,723 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1854156181] [2022-07-13 03:11:15,723 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-13 03:11:15,723 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 03:11:15,723 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:11:15,724 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 03:11:15,754 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Waiting until timeout for monitored process [2022-07-13 03:11:15,812 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 48 check-sat command(s) [2022-07-13 03:11:15,812 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 03:11:15,814 INFO L263 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 48 conjunts are in the unsatisfiable core [2022-07-13 03:11:15,817 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 03:11:15,970 INFO L134 CoverageAnalysis]: Checked inductivity of 2209 backedges. 47 proven. 2162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 03:11:15,970 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 03:11:16,225 INFO L134 CoverageAnalysis]: Checked inductivity of 2209 backedges. 47 proven. 2162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 03:11:16,226 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1854156181] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 03:11:16,226 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 03:11:16,226 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 51 [2022-07-13 03:11:16,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137059346] [2022-07-13 03:11:16,226 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 03:11:16,227 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-13 03:11:16,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:11:16,227 INFO L85 PathProgramCache]: Analyzing trace with hash 1351673, now seen corresponding path program 2 times [2022-07-13 03:11:16,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:11:16,228 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107610960] [2022-07-13 03:11:16,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:11:16,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:11:16,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:11:16,231 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:11:16,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:11:16,233 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:11:16,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 03:11:16,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-07-13 03:11:16,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2022-07-13 03:11:16,269 INFO L87 Difference]: Start difference. First operand 98 states and 100 transitions. cyclomatic complexity: 3 Second operand has 51 states, 51 states have (on average 2.019607843137255) internal successors, (103), 51 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 03:11:16,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 03:11:16,392 INFO L93 Difference]: Finished difference Result 108 states and 110 transitions. [2022-07-13 03:11:16,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2022-07-13 03:11:16,394 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 108 states and 110 transitions. [2022-07-13 03:11:16,394 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-07-13 03:11:16,397 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 108 states to 105 states and 107 transitions. [2022-07-13 03:11:16,397 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2022-07-13 03:11:16,397 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2022-07-13 03:11:16,397 INFO L73 IsDeterministic]: Start isDeterministic. Operand 105 states and 107 transitions. [2022-07-13 03:11:16,398 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-13 03:11:16,398 INFO L369 hiAutomatonCegarLoop]: Abstraction has 105 states and 107 transitions. [2022-07-13 03:11:16,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states and 107 transitions. [2022-07-13 03:11:16,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 104. [2022-07-13 03:11:16,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 104 states have (on average 1.0192307692307692) internal successors, (106), 103 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 03:11:16,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 106 transitions. [2022-07-13 03:11:16,412 INFO L392 hiAutomatonCegarLoop]: Abstraction has 104 states and 106 transitions. [2022-07-13 03:11:16,413 INFO L374 stractBuchiCegarLoop]: Abstraction has 104 states and 106 transitions. [2022-07-13 03:11:16,413 INFO L287 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2022-07-13 03:11:16,413 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 104 states and 106 transitions. [2022-07-13 03:11:16,413 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-07-13 03:11:16,414 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:11:16,414 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:11:16,417 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [51, 49, 1, 1, 1] [2022-07-13 03:11:16,417 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 1, 1] [2022-07-13 03:11:16,419 INFO L752 eck$LassoCheckResult]: Stem: 2685#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 2686#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~i~0#1, main_~j~0#1;havoc main_~i~0#1;havoc main_~j~0#1;main_~j~0#1 := 100;main_~i~0#1 := 0; 2681#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 2682#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 2687#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 2688#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 2683#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 2684#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 2784#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 2783#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 2782#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 2781#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 2780#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 2779#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 2778#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 2777#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 2776#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 2775#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 2774#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 2773#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 2772#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 2771#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 2770#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 2769#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 2768#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 2767#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 2766#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 2765#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 2764#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 2763#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 2762#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 2761#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 2760#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 2759#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 2758#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 2757#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 2756#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 2755#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 2754#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 2753#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 2752#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 2751#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 2750#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 2749#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 2748#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 2747#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 2746#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 2745#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 2744#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 2743#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 2742#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 2741#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 2740#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 2739#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 2738#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 2737#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 2736#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 2735#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 2734#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 2733#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 2732#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 2731#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 2730#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 2729#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 2728#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 2727#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 2726#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 2725#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 2724#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 2723#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 2722#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 2721#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 2720#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 2719#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 2718#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 2717#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 2716#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 2715#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 2714#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 2713#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 2712#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 2711#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 2710#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 2709#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 2708#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 2707#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 2706#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 2705#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 2704#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 2703#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 2702#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 2701#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 2700#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 2699#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 2698#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 2697#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 2696#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 2695#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 2694#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 2693#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 2692#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 2691#L12 assume !(51 < main_~j~0#1);main_~i~0#1 := main_~i~0#1 - 1;main_~j~0#1 := 1 + main_~j~0#1; 2689#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 2690#L12 [2022-07-13 03:11:16,419 INFO L754 eck$LassoCheckResult]: Loop: 2690#L12 assume 51 < main_~j~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~j~0#1 := main_~j~0#1 - 1; 2692#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 2691#L12 assume !(51 < main_~j~0#1);main_~i~0#1 := main_~i~0#1 - 1;main_~j~0#1 := 1 + main_~j~0#1; 2689#L12-2 assume !!(main_~i~0#1 < main_~j~0#1); 2690#L12 [2022-07-13 03:11:16,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:11:16,420 INFO L85 PathProgramCache]: Analyzing trace with hash 1994822288, now seen corresponding path program 6 times [2022-07-13 03:11:16,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:11:16,420 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225725229] [2022-07-13 03:11:16,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:11:16,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:11:16,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:11:16,490 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:11:16,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:11:16,536 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:11:16,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:11:16,536 INFO L85 PathProgramCache]: Analyzing trace with hash 1351673, now seen corresponding path program 3 times [2022-07-13 03:11:16,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:11:16,537 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275705742] [2022-07-13 03:11:16,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:11:16,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:11:16,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:11:16,539 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:11:16,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:11:16,541 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:11:16,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:11:16,541 INFO L85 PathProgramCache]: Analyzing trace with hash -1522445560, now seen corresponding path program 7 times [2022-07-13 03:11:16,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:11:16,541 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123802864] [2022-07-13 03:11:16,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:11:16,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:11:16,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:11:16,577 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:11:16,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:11:16,617 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:11:18,632 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 13.07 03:11:18 BoogieIcfgContainer [2022-07-13 03:11:18,632 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-07-13 03:11:18,633 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-13 03:11:18,633 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-13 03:11:18,633 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-13 03:11:18,634 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 03:11:09" (3/4) ... [2022-07-13 03:11:18,635 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2022-07-13 03:11:18,679 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-13 03:11:18,680 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-13 03:11:18,680 INFO L158 Benchmark]: Toolchain (without parser) took 9614.90ms. Allocated memory was 86.0MB in the beginning and 125.8MB in the end (delta: 39.8MB). Free memory was 53.8MB in the beginning and 40.4MB in the end (delta: 13.4MB). Peak memory consumption was 53.1MB. Max. memory is 16.1GB. [2022-07-13 03:11:18,681 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 86.0MB. Free memory was 44.8MB in the beginning and 44.8MB in the end (delta: 41.2kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 03:11:18,681 INFO L158 Benchmark]: CACSL2BoogieTranslator took 194.78ms. Allocated memory was 86.0MB in the beginning and 104.9MB in the end (delta: 18.9MB). Free memory was 53.5MB in the beginning and 82.3MB in the end (delta: -28.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-13 03:11:18,682 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.56ms. Allocated memory is still 104.9MB. Free memory was 82.3MB in the beginning and 81.1MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 03:11:18,682 INFO L158 Benchmark]: Boogie Preprocessor took 14.30ms. Allocated memory is still 104.9MB. Free memory was 81.1MB in the beginning and 80.3MB in the end (delta: 745.3kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-13 03:11:18,682 INFO L158 Benchmark]: RCFGBuilder took 157.84ms. Allocated memory is still 104.9MB. Free memory was 80.3MB in the beginning and 72.0MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-13 03:11:18,682 INFO L158 Benchmark]: BuchiAutomizer took 9170.78ms. Allocated memory was 104.9MB in the beginning and 125.8MB in the end (delta: 21.0MB). Free memory was 72.0MB in the beginning and 43.6MB in the end (delta: 28.4MB). Peak memory consumption was 68.8MB. Max. memory is 16.1GB. [2022-07-13 03:11:18,683 INFO L158 Benchmark]: Witness Printer took 46.96ms. Allocated memory is still 125.8MB. Free memory was 43.6MB in the beginning and 40.4MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-13 03:11:18,684 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 86.0MB. Free memory was 44.8MB in the beginning and 44.8MB in the end (delta: 41.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 194.78ms. Allocated memory was 86.0MB in the beginning and 104.9MB in the end (delta: 18.9MB). Free memory was 53.5MB in the beginning and 82.3MB in the end (delta: -28.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 24.56ms. Allocated memory is still 104.9MB. Free memory was 82.3MB in the beginning and 81.1MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 14.30ms. Allocated memory is still 104.9MB. Free memory was 81.1MB in the beginning and 80.3MB in the end (delta: 745.3kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 157.84ms. Allocated memory is still 104.9MB. Free memory was 80.3MB in the beginning and 72.0MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * BuchiAutomizer took 9170.78ms. Allocated memory was 104.9MB in the beginning and 125.8MB in the end (delta: 21.0MB). Free memory was 72.0MB in the beginning and 43.6MB in the end (delta: 28.4MB). Peak memory consumption was 68.8MB. Max. memory is 16.1GB. * Witness Printer took 46.96ms. Allocated memory is still 125.8MB. Free memory was 43.6MB in the beginning and 40.4MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 11 terminating modules (6 trivial, 3 deterministic, 2 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function -2 * j + 103 and consists of 4 locations. One deterministic module has affine ranking function -2 * j + 103 and consists of 3 locations. One deterministic module has affine ranking function j and consists of 3 locations. One nondeterministic module has affine ranking function -2 * j + 103 and consists of 3 locations. One nondeterministic module has affine ranking function j and consists of 3 locations. 6 modules have a trivial ranking function, the largest among these consists of 51 locations. The remainder module has 104 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 9.1s and 8 iterations. TraceHistogramMax:51. Analysis of lassos took 7.9s. Construction of modules took 0.2s. Büchi inclusion checks took 0.7s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 9. Automata minimization 0.0s AutomataMinimizationTime, 11 MinimizatonAttempts, 9 StatesRemovedByMinimization, 7 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [3, 0, 2, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 48 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 39 mSDsluCounter, 78 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 24 mSDsCounter, 68 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 348 IncrementalHoareTripleChecker+Invalid, 416 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 68 mSolverCounterUnsat, 54 mSDtfsCounter, 348 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT1 conc0 concLT3 SILN2 SILU0 SILI0 SILT1 lasso0 LassoPreprocessingBenchmarks: Lassos: inital18 mio100 ax164 hnf100 lsp60 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq164 hnf93 smp100 dnf100 smp100 tf106 neg98 sie109 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 41ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 6 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 5 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.5s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 12]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {} State at position 1 is {j=52, i=48, \result=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 12]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L6] int i; [L7] int j; [L8] j = 100 [L9] i = 0 [L11] COND TRUE i < j [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 [L11] COND TRUE i < j [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 [L11] COND TRUE i < j [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 [L11] COND TRUE i < j [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 [L11] COND TRUE i < j [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 [L11] COND TRUE i < j [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 [L11] COND TRUE i < j [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 [L11] COND TRUE i < j [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 [L11] COND TRUE i < j [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 [L11] COND TRUE i < j [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 [L11] COND TRUE i < j [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 [L11] COND TRUE i < j [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 [L11] COND TRUE i < j [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 [L11] COND TRUE i < j [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 [L11] COND TRUE i < j [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 [L11] COND TRUE i < j [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 [L11] COND TRUE i < j [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 [L11] COND TRUE i < j [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 [L11] COND TRUE i < j [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 [L11] COND TRUE i < j [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 [L11] COND TRUE i < j [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 [L11] COND TRUE i < j [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 [L11] COND TRUE i < j [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 [L11] COND TRUE i < j [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 [L11] COND TRUE i < j [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 [L11] COND TRUE i < j [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 [L11] COND TRUE i < j [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 [L11] COND TRUE i < j [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 [L11] COND TRUE i < j [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 [L11] COND TRUE i < j [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 [L11] COND TRUE i < j [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 [L11] COND TRUE i < j [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 [L11] COND TRUE i < j [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 [L11] COND TRUE i < j [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 [L11] COND TRUE i < j [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 [L11] COND TRUE i < j [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 [L11] COND TRUE i < j [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 [L11] COND TRUE i < j [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 [L11] COND TRUE i < j [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 [L11] COND TRUE i < j [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 [L11] COND TRUE i < j [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 [L11] COND TRUE i < j [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 [L11] COND TRUE i < j [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 [L11] COND TRUE i < j [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 [L11] COND TRUE i < j [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 [L11] COND TRUE i < j [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 [L11] COND TRUE i < j [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 [L11] COND TRUE i < j [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 [L11] COND TRUE i < j [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 [L11] COND TRUE i < j [L12] COND FALSE !(51 < j) [L13] i = i-1 [L13] j = j+1 [L11] COND TRUE i < j Loop: [L12] COND TRUE 51 < j [L12] i = i+1 [L12] j = j-1 [L11] COND TRUE i < j [L12] COND FALSE !(51 < j) [L13] i = i-1 [L13] j = j+1 [L11] COND TRUE i < j End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2022-07-13 03:11:18,742 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Forceful destruction successful, exit code 0 [2022-07-13 03:11:18,951 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Ended with exit code 0 [2022-07-13 03:11:19,151 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Ended with exit code 0 [2022-07-13 03:11:19,351 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2022-07-13 03:11:19,551 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-07-13 03:11:19,752 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM)