./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-restricted-15/NO_22.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version ff03de63 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_22.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 2aebec197cf7bd355d2eb5f718c983de149eae8f5ff2da107813d58a220d4744 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-ff03de6 [2021-12-21 21:57:54,845 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-21 21:57:54,846 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-21 21:57:54,885 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-21 21:57:54,886 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-21 21:57:54,887 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-21 21:57:54,888 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-21 21:57:54,888 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-21 21:57:54,889 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-21 21:57:54,890 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-21 21:57:54,890 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-21 21:57:54,891 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-21 21:57:54,891 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-21 21:57:54,892 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-21 21:57:54,893 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-21 21:57:54,893 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-21 21:57:54,894 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-21 21:57:54,894 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-21 21:57:54,895 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-21 21:57:54,896 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-21 21:57:54,897 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-21 21:57:54,897 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-21 21:57:54,898 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-21 21:57:54,898 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-21 21:57:54,900 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-21 21:57:54,900 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-21 21:57:54,900 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-21 21:57:54,901 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-21 21:57:54,901 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-21 21:57:54,901 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-21 21:57:54,902 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-21 21:57:54,902 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-21 21:57:54,902 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-21 21:57:54,903 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-21 21:57:54,903 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-21 21:57:54,904 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-21 21:57:54,904 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-21 21:57:54,904 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-21 21:57:54,904 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-21 21:57:54,905 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-21 21:57:54,905 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-21 21:57:54,906 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2021-12-21 21:57:54,918 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-21 21:57:54,918 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-21 21:57:54,919 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-21 21:57:54,919 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-21 21:57:54,920 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-21 21:57:54,920 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-21 21:57:54,920 INFO L138 SettingsManager]: * Use SBE=true [2021-12-21 21:57:54,920 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-12-21 21:57:54,920 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-12-21 21:57:54,920 INFO L138 SettingsManager]: * Use old map elimination=false [2021-12-21 21:57:54,920 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-12-21 21:57:54,920 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-12-21 21:57:54,921 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-12-21 21:57:54,921 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-21 21:57:54,921 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-21 21:57:54,921 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-21 21:57:54,921 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-21 21:57:54,921 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-12-21 21:57:54,921 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-12-21 21:57:54,922 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-12-21 21:57:54,922 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-21 21:57:54,922 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-12-21 21:57:54,922 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-21 21:57:54,922 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-12-21 21:57:54,922 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-21 21:57:54,922 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-21 21:57:54,922 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-21 21:57:54,923 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-21 21:57:54,923 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-21 21:57:54,923 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-12-21 21:57:54,923 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 -> 2aebec197cf7bd355d2eb5f718c983de149eae8f5ff2da107813d58a220d4744 [2021-12-21 21:57:55,054 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-21 21:57:55,073 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-21 21:57:55,076 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-21 21:57:55,077 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-21 21:57:55,077 INFO L275 PluginConnector]: CDTParser initialized [2021-12-21 21:57:55,078 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-restricted-15/NO_22.c [2021-12-21 21:57:55,136 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5e7ea6462/e31e7a1abade4536bda6d096681f089e/FLAG8a36ce81d [2021-12-21 21:57:55,476 INFO L306 CDTParser]: Found 1 translation units. [2021-12-21 21:57:55,476 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-restricted-15/NO_22.c [2021-12-21 21:57:55,483 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5e7ea6462/e31e7a1abade4536bda6d096681f089e/FLAG8a36ce81d [2021-12-21 21:57:55,915 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5e7ea6462/e31e7a1abade4536bda6d096681f089e [2021-12-21 21:57:55,917 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-21 21:57:55,919 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-21 21:57:55,921 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-21 21:57:55,922 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-21 21:57:55,925 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-21 21:57:55,925 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 09:57:55" (1/1) ... [2021-12-21 21:57:55,926 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1419a6a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 09:57:55, skipping insertion in model container [2021-12-21 21:57:55,926 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 09:57:55" (1/1) ... [2021-12-21 21:57:55,931 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-21 21:57:55,937 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-21 21:57:56,012 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-21 21:57:56,014 INFO L203 MainTranslator]: Completed pre-run [2021-12-21 21:57:56,039 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-21 21:57:56,046 INFO L208 MainTranslator]: Completed translation [2021-12-21 21:57:56,046 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 09:57:56 WrapperNode [2021-12-21 21:57:56,046 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-21 21:57:56,047 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-21 21:57:56,047 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-21 21:57:56,047 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-21 21:57:56,051 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 09:57:56" (1/1) ... [2021-12-21 21:57:56,054 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 09:57:56" (1/1) ... [2021-12-21 21:57:56,064 INFO L137 Inliner]: procedures = 4, calls = 2, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 13 [2021-12-21 21:57:56,065 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-21 21:57:56,066 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-21 21:57:56,066 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-21 21:57:56,066 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-21 21:57:56,074 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 09:57:56" (1/1) ... [2021-12-21 21:57:56,075 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 09:57:56" (1/1) ... [2021-12-21 21:57:56,075 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 09:57:56" (1/1) ... [2021-12-21 21:57:56,076 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 09:57:56" (1/1) ... [2021-12-21 21:57:56,077 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 09:57:56" (1/1) ... [2021-12-21 21:57:56,079 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 09:57:56" (1/1) ... [2021-12-21 21:57:56,079 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 09:57:56" (1/1) ... [2021-12-21 21:57:56,080 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-21 21:57:56,082 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-21 21:57:56,082 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-21 21:57:56,082 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-21 21:57:56,083 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 09:57:56" (1/1) ... [2021-12-21 21:57:56,087 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 21:57:56,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 21:57:56,105 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-21 21:57:56,114 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2021-12-21 21:57:56,132 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-21 21:57:56,132 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-21 21:57:56,166 INFO L234 CfgBuilder]: Building ICFG [2021-12-21 21:57:56,167 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-21 21:57:56,201 INFO L275 CfgBuilder]: Performing block encoding [2021-12-21 21:57:56,205 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-21 21:57:56,205 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2021-12-21 21:57:56,206 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 09:57:56 BoogieIcfgContainer [2021-12-21 21:57:56,206 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-21 21:57:56,207 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-12-21 21:57:56,207 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-12-21 21:57:56,209 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-12-21 21:57:56,209 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-21 21:57:56,209 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 21.12 09:57:55" (1/3) ... [2021-12-21 21:57:56,210 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7671a041 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.12 09:57:56, skipping insertion in model container [2021-12-21 21:57:56,210 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-21 21:57:56,210 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 09:57:56" (2/3) ... [2021-12-21 21:57:56,211 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7671a041 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.12 09:57:56, skipping insertion in model container [2021-12-21 21:57:56,211 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-21 21:57:56,211 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 09:57:56" (3/3) ... [2021-12-21 21:57:56,212 INFO L388 chiAutomizerObserver]: Analyzing ICFG NO_22.c [2021-12-21 21:57:56,237 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-12-21 21:57:56,237 INFO L360 BuchiCegarLoop]: Hoare is false [2021-12-21 21:57:56,237 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-12-21 21:57:56,238 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-12-21 21:57:56,238 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-12-21 21:57:56,238 INFO L364 BuchiCegarLoop]: Difference is false [2021-12-21 21:57:56,238 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-12-21 21:57:56,238 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-12-21 21:57:56,247 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) [2021-12-21 21:57:56,259 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-21 21:57:56,259 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-21 21:57:56,259 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-21 21:57:56,262 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-21 21:57:56,263 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-21 21:57:56,263 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-12-21 21:57:56,263 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) [2021-12-21 21:57:56,263 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-21 21:57:56,263 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-21 21:57:56,263 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-21 21:57:56,264 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-21 21:57:56,264 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-21 21:57:56,267 INFO L791 eck$LassoCheckResult]: Stem: 5#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true; 8#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~i~0#1;havoc main_~i~0#1;main_~i~0#1 := 0; 4#L10-2true [2021-12-21 21:57:56,267 INFO L793 eck$LassoCheckResult]: Loop: 4#L10-2true assume !!(main_~i~0#1 < 100); 6#L10true assume !(main_~i~0#1 < 50);main_~i~0#1 := main_~i~0#1 - 1; 4#L10-2true [2021-12-21 21:57:56,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 21:57:56,271 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2021-12-21 21:57:56,276 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 21:57:56,276 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797266204] [2021-12-21 21:57:56,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 21:57:56,277 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 21:57:56,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 21:57:56,325 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-21 21:57:56,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 21:57:56,347 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-21 21:57:56,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 21:57:56,357 INFO L85 PathProgramCache]: Analyzing trace with hash 1318, now seen corresponding path program 1 times [2021-12-21 21:57:56,357 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 21:57:56,358 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587906811] [2021-12-21 21:57:56,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 21:57:56,359 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 21:57:56,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 21:57:56,371 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-21 21:57:56,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 21:57:56,379 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-21 21:57:56,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 21:57:56,385 INFO L85 PathProgramCache]: Analyzing trace with hash 925800, now seen corresponding path program 1 times [2021-12-21 21:57:56,385 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 21:57:56,386 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084612771] [2021-12-21 21:57:56,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 21:57:56,386 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 21:57:56,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 21:57:56,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 21:57:56,449 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 21:57:56,449 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084612771] [2021-12-21 21:57:56,450 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2084612771] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 21:57:56,450 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 21:57:56,450 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-21 21:57:56,451 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406957795] [2021-12-21 21:57:56,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 21:57:56,504 INFO L210 LassoAnalysis]: Preferences: [2021-12-21 21:57:56,504 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-21 21:57:56,504 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-21 21:57:56,504 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-21 21:57:56,505 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2021-12-21 21:57:56,505 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 21:57:56,505 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-21 21:57:56,505 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-21 21:57:56,505 INFO L133 ssoRankerPreferences]: Filename of dumped script: NO_22.c_Iteration1_Loop [2021-12-21 21:57:56,505 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-21 21:57:56,505 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-21 21:57:56,515 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 21:57:56,520 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 21:57:56,523 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 21:57:56,570 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-21 21:57:56,571 INFO L404 LassoAnalysis]: Checking for nontermination... [2021-12-21 21:57:56,572 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 21:57:56,572 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 21:57:56,575 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-21 21:57:56,576 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2021-12-21 21:57:56,577 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-12-21 21:57:56,577 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-21 21:57:56,630 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-12-21 21:57:56,631 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: [] [2021-12-21 21:57:56,648 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2021-12-21 21:57:56,649 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 21:57:56,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 21:57:56,650 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-21 21:57:56,654 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-12-21 21:57:56,654 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-21 21:57:56,660 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2021-12-21 21:57:56,675 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-12-21 21:57:56,676 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: [] [2021-12-21 21:57:56,690 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2021-12-21 21:57:56,691 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 21:57:56,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 21:57:56,692 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-21 21:57:56,692 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2021-12-21 21:57:56,693 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-12-21 21:57:56,693 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-21 21:57:56,729 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2021-12-21 21:57:56,730 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 21:57:56,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 21:57:56,731 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-21 21:57:56,732 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2021-12-21 21:57:56,733 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2021-12-21 21:57:56,733 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-21 21:57:56,751 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2021-12-21 21:57:56,766 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 [2021-12-21 21:57:56,767 INFO L210 LassoAnalysis]: Preferences: [2021-12-21 21:57:56,767 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-21 21:57:56,767 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-21 21:57:56,767 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-21 21:57:56,767 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-21 21:57:56,767 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 21:57:56,767 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-21 21:57:56,767 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-21 21:57:56,767 INFO L133 ssoRankerPreferences]: Filename of dumped script: NO_22.c_Iteration1_Loop [2021-12-21 21:57:56,767 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-21 21:57:56,767 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-21 21:57:56,769 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 21:57:56,777 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 21:57:56,780 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 21:57:56,812 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-21 21:57:56,815 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-21 21:57:56,816 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 21:57:56,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 21:57:56,817 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-21 21:57:56,818 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2021-12-21 21:57:56,819 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-21 21:57:56,825 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-21 21:57:56,826 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-21 21:57:56,826 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-21 21:57:56,826 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-21 21:57:56,830 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-21 21:57:56,830 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-21 21:57:56,847 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-21 21:57:56,862 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2021-12-21 21:57:56,863 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 21:57:56,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 21:57:56,863 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-21 21:57:56,875 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2021-12-21 21:57:56,876 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-21 21:57:56,882 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-21 21:57:56,883 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-21 21:57:56,883 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-21 21:57:56,883 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-21 21:57:56,889 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-21 21:57:56,889 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-21 21:57:56,917 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-21 21:57:56,932 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2021-12-21 21:57:56,932 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 21:57:56,932 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 21:57:56,933 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-21 21:57:56,934 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2021-12-21 21:57:56,947 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-21 21:57:56,953 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-21 21:57:56,953 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-21 21:57:56,954 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-21 21:57:56,954 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-21 21:57:56,954 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-21 21:57:56,955 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-21 21:57:56,955 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-21 21:57:56,970 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-21 21:57:56,973 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2021-12-21 21:57:56,973 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2021-12-21 21:57:56,974 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 21:57:56,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 21:57:56,975 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-21 21:57:56,976 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2021-12-21 21:57:56,977 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-21 21:57:56,977 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2021-12-21 21:57:56,977 INFO L513 LassoAnalysis]: Proved termination. [2021-12-21 21:57:56,977 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = 1*ULTIMATE.start_main_~i~0#1 Supporting invariants [] [2021-12-21 21:57:56,993 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2021-12-21 21:57:56,995 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2021-12-21 21:57:57,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 21:57:57,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 21:57:57,013 INFO L263 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-21 21:57:57,014 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 21:57:57,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 21:57:57,024 WARN L261 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-21 21:57:57,025 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 21:57:57,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 21:57:57,048 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 [2021-12-21 21:57:57,049 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) [2021-12-21 21:57:57,076 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. [2021-12-21 21:57:57,077 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 [2021-12-21 21:57:57,082 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) [2021-12-21 21:57:57,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2021-12-21 21:57:57,083 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 2 letters. Loop has 2 letters. [2021-12-21 21:57:57,084 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-21 21:57:57,084 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 4 letters. Loop has 2 letters. [2021-12-21 21:57:57,084 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-21 21:57:57,084 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 2 letters. Loop has 4 letters. [2021-12-21 21:57:57,084 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-21 21:57:57,085 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 31 transitions. [2021-12-21 21:57:57,088 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-21 21:57:57,091 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 8 states and 11 transitions. [2021-12-21 21:57:57,091 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2021-12-21 21:57:57,091 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2021-12-21 21:57:57,091 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 11 transitions. [2021-12-21 21:57:57,092 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-21 21:57:57,092 INFO L681 BuchiCegarLoop]: Abstraction has 8 states and 11 transitions. [2021-12-21 21:57:57,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states and 11 transitions. [2021-12-21 21:57:57,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2021-12-21 21:57:57,104 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) [2021-12-21 21:57:57,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 11 transitions. [2021-12-21 21:57:57,105 INFO L704 BuchiCegarLoop]: Abstraction has 8 states and 11 transitions. [2021-12-21 21:57:57,105 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 21:57:57,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-21 21:57:57,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-21 21:57:57,107 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) [2021-12-21 21:57:57,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 21:57:57,113 INFO L93 Difference]: Finished difference Result 7 states and 8 transitions. [2021-12-21 21:57:57,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-21 21:57:57,114 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 7 states and 8 transitions. [2021-12-21 21:57:57,114 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-21 21:57:57,114 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 7 states to 6 states and 7 transitions. [2021-12-21 21:57:57,114 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2021-12-21 21:57:57,114 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2021-12-21 21:57:57,114 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 7 transitions. [2021-12-21 21:57:57,114 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-21 21:57:57,114 INFO L681 BuchiCegarLoop]: Abstraction has 6 states and 7 transitions. [2021-12-21 21:57:57,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states and 7 transitions. [2021-12-21 21:57:57,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2021-12-21 21:57:57,115 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) [2021-12-21 21:57:57,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 7 transitions. [2021-12-21 21:57:57,115 INFO L704 BuchiCegarLoop]: Abstraction has 6 states and 7 transitions. [2021-12-21 21:57:57,115 INFO L587 BuchiCegarLoop]: Abstraction has 6 states and 7 transitions. [2021-12-21 21:57:57,115 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-12-21 21:57:57,117 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6 states and 7 transitions. [2021-12-21 21:57:57,117 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-21 21:57:57,117 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-21 21:57:57,117 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-21 21:57:57,117 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2021-12-21 21:57:57,117 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-21 21:57:57,117 INFO L791 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;havoc main_~i~0#1;main_~i~0#1 := 0; 89#L10-2 assume !!(main_~i~0#1 < 100); 88#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 84#L10-2 [2021-12-21 21:57:57,118 INFO L793 eck$LassoCheckResult]: Loop: 84#L10-2 assume !!(main_~i~0#1 < 100); 85#L10 assume !(main_~i~0#1 < 50);main_~i~0#1 := main_~i~0#1 - 1; 84#L10-2 [2021-12-21 21:57:57,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 21:57:57,119 INFO L85 PathProgramCache]: Analyzing trace with hash 925798, now seen corresponding path program 1 times [2021-12-21 21:57:57,119 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 21:57:57,119 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482290577] [2021-12-21 21:57:57,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 21:57:57,119 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 21:57:57,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 21:57:57,123 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-21 21:57:57,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 21:57:57,125 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-21 21:57:57,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 21:57:57,126 INFO L85 PathProgramCache]: Analyzing trace with hash 1318, now seen corresponding path program 2 times [2021-12-21 21:57:57,126 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 21:57:57,126 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246076434] [2021-12-21 21:57:57,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 21:57:57,126 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 21:57:57,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 21:57:57,128 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-21 21:57:57,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 21:57:57,130 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-21 21:57:57,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 21:57:57,130 INFO L85 PathProgramCache]: Analyzing trace with hash 889692235, now seen corresponding path program 1 times [2021-12-21 21:57:57,130 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 21:57:57,130 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171712135] [2021-12-21 21:57:57,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 21:57:57,130 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 21:57:57,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 21:57:57,149 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 21:57:57,149 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 21:57:57,149 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171712135] [2021-12-21 21:57:57,149 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171712135] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 21:57:57,150 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [385237047] [2021-12-21 21:57:57,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 21:57:57,150 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 21:57:57,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 21:57:57,151 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) [2021-12-21 21:57:57,152 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-12-21 21:57:57,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 21:57:57,202 INFO L263 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-21 21:57:57,202 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 21:57:57,225 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 21:57:57,225 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 21:57:57,243 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 21:57:57,243 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [385237047] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 21:57:57,243 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-21 21:57:57,243 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2021-12-21 21:57:57,243 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828447718] [2021-12-21 21:57:57,243 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-21 21:57:57,256 INFO L210 LassoAnalysis]: Preferences: [2021-12-21 21:57:57,256 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-21 21:57:57,256 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-21 21:57:57,256 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-21 21:57:57,256 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2021-12-21 21:57:57,256 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 21:57:57,256 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-21 21:57:57,256 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-21 21:57:57,256 INFO L133 ssoRankerPreferences]: Filename of dumped script: NO_22.c_Iteration2_Loop [2021-12-21 21:57:57,256 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-21 21:57:57,256 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-21 21:57:57,257 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 21:57:57,259 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 21:57:57,263 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 21:57:57,290 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-21 21:57:57,290 INFO L404 LassoAnalysis]: Checking for nontermination... [2021-12-21 21:57:57,290 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 21:57:57,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 21:57:57,292 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-21 21:57:57,326 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-12-21 21:57:57,326 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-21 21:57:57,326 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2021-12-21 21:57:57,347 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-12-21 21:57:57,347 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: [] [2021-12-21 21:57:57,363 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2021-12-21 21:57:57,363 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 21:57:57,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 21:57:57,364 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-21 21:57:57,365 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2021-12-21 21:57:57,366 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-12-21 21:57:57,366 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-21 21:57:57,388 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2021-12-21 21:57:57,388 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 21:57:57,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 21:57:57,389 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) [2021-12-21 21:57:57,390 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 [2021-12-21 21:57:57,391 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2021-12-21 21:57:57,391 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-21 21:57:57,408 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2021-12-21 21:57:57,423 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 [2021-12-21 21:57:57,424 INFO L210 LassoAnalysis]: Preferences: [2021-12-21 21:57:57,424 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-21 21:57:57,424 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-21 21:57:57,424 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-21 21:57:57,424 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-21 21:57:57,424 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 21:57:57,424 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-21 21:57:57,424 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-21 21:57:57,424 INFO L133 ssoRankerPreferences]: Filename of dumped script: NO_22.c_Iteration2_Loop [2021-12-21 21:57:57,424 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-21 21:57:57,424 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-21 21:57:57,425 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 21:57:57,427 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 21:57:57,432 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 21:57:57,457 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-21 21:57:57,457 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-21 21:57:57,457 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 21:57:57,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 21:57:57,458 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) [2021-12-21 21:57:57,459 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 [2021-12-21 21:57:57,461 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-21 21:57:57,466 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-21 21:57:57,467 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-21 21:57:57,467 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-21 21:57:57,467 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-21 21:57:57,469 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-21 21:57:57,469 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-21 21:57:57,484 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-21 21:57:57,501 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 [2021-12-21 21:57:57,501 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 21:57:57,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 21:57:57,502 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) [2021-12-21 21:57:57,503 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 [2021-12-21 21:57:57,505 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-21 21:57:57,510 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-21 21:57:57,511 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-21 21:57:57,511 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-21 21:57:57,511 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-21 21:57:57,511 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-21 21:57:57,512 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-21 21:57:57,512 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-21 21:57:57,523 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-21 21:57:57,525 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2021-12-21 21:57:57,525 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2021-12-21 21:57:57,526 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 21:57:57,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 21:57:57,528 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) [2021-12-21 21:57:57,528 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 [2021-12-21 21:57:57,529 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-21 21:57:57,529 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2021-12-21 21:57:57,529 INFO L513 LassoAnalysis]: Proved termination. [2021-12-21 21:57:57,529 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = 1*ULTIMATE.start_main_~i~0#1 Supporting invariants [] [2021-12-21 21:57:57,544 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 [2021-12-21 21:57:57,545 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2021-12-21 21:57:57,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 21:57:57,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 21:57:57,560 INFO L263 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-21 21:57:57,560 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 21:57:57,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 21:57:57,575 WARN L261 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-21 21:57:57,575 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 21:57:57,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 21:57:57,589 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 [2021-12-21 21:57:57,589 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) [2021-12-21 21:57:57,594 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. [2021-12-21 21:57:57,594 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 [2021-12-21 21:57:57,595 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) [2021-12-21 21:57:57,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 6 transitions. [2021-12-21 21:57:57,595 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 4 letters. Loop has 2 letters. [2021-12-21 21:57:57,595 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-21 21:57:57,596 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 6 letters. Loop has 2 letters. [2021-12-21 21:57:57,596 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-21 21:57:57,596 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 4 letters. Loop has 4 letters. [2021-12-21 21:57:57,596 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-21 21:57:57,596 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 10 states and 13 transitions. [2021-12-21 21:57:57,596 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-21 21:57:57,597 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 10 states to 10 states and 13 transitions. [2021-12-21 21:57:57,597 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2021-12-21 21:57:57,597 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2021-12-21 21:57:57,597 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 13 transitions. [2021-12-21 21:57:57,597 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-21 21:57:57,597 INFO L681 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2021-12-21 21:57:57,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 13 transitions. [2021-12-21 21:57:57,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2021-12-21 21:57:57,598 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) [2021-12-21 21:57:57,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 13 transitions. [2021-12-21 21:57:57,598 INFO L704 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2021-12-21 21:57:57,598 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 21:57:57,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-21 21:57:57,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-12-21 21:57:57,599 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) [2021-12-21 21:57:57,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 21:57:57,612 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2021-12-21 21:57:57,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-21 21:57:57,612 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 14 transitions. [2021-12-21 21:57:57,613 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-21 21:57:57,613 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 12 states and 13 transitions. [2021-12-21 21:57:57,613 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2021-12-21 21:57:57,613 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2021-12-21 21:57:57,613 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 13 transitions. [2021-12-21 21:57:57,613 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-21 21:57:57,613 INFO L681 BuchiCegarLoop]: Abstraction has 12 states and 13 transitions. [2021-12-21 21:57:57,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 13 transitions. [2021-12-21 21:57:57,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2021-12-21 21:57:57,614 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) [2021-12-21 21:57:57,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 13 transitions. [2021-12-21 21:57:57,615 INFO L704 BuchiCegarLoop]: Abstraction has 12 states and 13 transitions. [2021-12-21 21:57:57,615 INFO L587 BuchiCegarLoop]: Abstraction has 12 states and 13 transitions. [2021-12-21 21:57:57,615 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-12-21 21:57:57,615 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 13 transitions. [2021-12-21 21:57:57,615 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2021-12-21 21:57:57,615 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-21 21:57:57,615 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-21 21:57:57,616 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 1, 1] [2021-12-21 21:57:57,616 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-21 21:57:57,616 INFO L791 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;havoc main_~i~0#1;main_~i~0#1 := 0; 200#L10-2 assume !!(main_~i~0#1 < 100); 199#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 195#L10-2 assume !!(main_~i~0#1 < 100); 196#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 206#L10-2 assume !!(main_~i~0#1 < 100); 205#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 204#L10-2 assume !!(main_~i~0#1 < 100); 203#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 202#L10-2 [2021-12-21 21:57:57,616 INFO L793 eck$LassoCheckResult]: Loop: 202#L10-2 assume !!(main_~i~0#1 < 100); 201#L10 assume !(main_~i~0#1 < 50);main_~i~0#1 := main_~i~0#1 - 1; 202#L10-2 [2021-12-21 21:57:57,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 21:57:57,617 INFO L85 PathProgramCache]: Analyzing trace with hash 742492623, now seen corresponding path program 2 times [2021-12-21 21:57:57,617 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 21:57:57,617 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607936398] [2021-12-21 21:57:57,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 21:57:57,617 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 21:57:57,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 21:57:57,629 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-21 21:57:57,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 21:57:57,634 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-21 21:57:57,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 21:57:57,635 INFO L85 PathProgramCache]: Analyzing trace with hash 1318, now seen corresponding path program 3 times [2021-12-21 21:57:57,635 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 21:57:57,635 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818782266] [2021-12-21 21:57:57,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 21:57:57,635 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 21:57:57,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 21:57:57,646 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-21 21:57:57,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 21:57:57,647 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-21 21:57:57,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 21:57:57,648 INFO L85 PathProgramCache]: Analyzing trace with hash 570839924, now seen corresponding path program 2 times [2021-12-21 21:57:57,648 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 21:57:57,648 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126240884] [2021-12-21 21:57:57,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 21:57:57,648 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 21:57:57,661 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 [2021-12-21 21:57:57,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 21:57:57,693 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2021-12-21 21:57:57,712 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 21:57:57,712 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 21:57:57,713 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126240884] [2021-12-21 21:57:57,713 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1126240884] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 21:57:57,713 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1327283825] [2021-12-21 21:57:57,713 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-21 21:57:57,713 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 21:57:57,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 21:57:57,714 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-21 21:57:57,715 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2021-12-21 21:57:57,732 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-21 21:57:57,733 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-21 21:57:57,733 INFO L263 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-21 21:57:57,734 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 21:57:57,758 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 21:57:57,759 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 21:57:57,812 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 21:57:57,812 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1327283825] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 21:57:57,812 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-21 21:57:57,812 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2021-12-21 21:57:57,813 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294916792] [2021-12-21 21:57:57,813 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-21 21:57:57,824 INFO L210 LassoAnalysis]: Preferences: [2021-12-21 21:57:57,824 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-21 21:57:57,824 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-21 21:57:57,824 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-21 21:57:57,825 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2021-12-21 21:57:57,825 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 21:57:57,825 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-21 21:57:57,825 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-21 21:57:57,825 INFO L133 ssoRankerPreferences]: Filename of dumped script: NO_22.c_Iteration3_Loop [2021-12-21 21:57:57,825 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-21 21:57:57,825 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-21 21:57:57,826 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 21:57:57,831 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 21:57:57,833 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 21:57:57,855 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-21 21:57:57,855 INFO L404 LassoAnalysis]: Checking for nontermination... [2021-12-21 21:57:57,855 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 21:57:57,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 21:57:57,856 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) [2021-12-21 21:57:57,857 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 [2021-12-21 21:57:57,859 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-12-21 21:57:57,859 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-21 21:57:57,894 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 [2021-12-21 21:57:57,894 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 21:57:57,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 21:57:57,895 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-21 21:57:57,896 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2021-12-21 21:57:57,898 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2021-12-21 21:57:57,898 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-21 21:57:57,908 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2021-12-21 21:57:57,922 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2021-12-21 21:57:57,923 INFO L210 LassoAnalysis]: Preferences: [2021-12-21 21:57:57,923 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-21 21:57:57,923 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-21 21:57:57,923 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-21 21:57:57,923 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-21 21:57:57,923 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 21:57:57,923 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-21 21:57:57,923 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-21 21:57:57,923 INFO L133 ssoRankerPreferences]: Filename of dumped script: NO_22.c_Iteration3_Loop [2021-12-21 21:57:57,923 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-21 21:57:57,923 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-21 21:57:57,924 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 21:57:57,936 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 21:57:57,939 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 21:57:57,968 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-21 21:57:57,968 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-21 21:57:57,968 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 21:57:57,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 21:57:57,969 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) [2021-12-21 21:57:57,975 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-21 21:57:57,981 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-21 21:57:57,981 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-21 21:57:57,981 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-21 21:57:57,981 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-21 21:57:57,981 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-21 21:57:57,982 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-21 21:57:57,982 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-21 21:57:57,985 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 [2021-12-21 21:57:57,993 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-21 21:57:57,997 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2021-12-21 21:57:57,997 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2021-12-21 21:57:57,997 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 21:57:57,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 21:57:57,999 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-21 21:57:58,001 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2021-12-21 21:57:58,047 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-21 21:57:58,047 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2021-12-21 21:57:58,047 INFO L513 LassoAnalysis]: Proved termination. [2021-12-21 21:57:58,047 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = 1*ULTIMATE.start_main_~i~0#1 Supporting invariants [] [2021-12-21 21:57:58,062 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 [2021-12-21 21:57:58,063 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2021-12-21 21:57:58,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 21:57:58,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 21:57:58,077 INFO L263 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-21 21:57:58,078 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 21:57:58,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 21:57:58,099 WARN L261 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-21 21:57:58,099 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 21:57:58,102 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 21:57:58,102 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 [2021-12-21 21:57:58,102 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) [2021-12-21 21:57:58,107 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. [2021-12-21 21:57:58,107 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 [2021-12-21 21:57:58,108 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) [2021-12-21 21:57:58,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5 transitions. [2021-12-21 21:57:58,108 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 10 letters. Loop has 2 letters. [2021-12-21 21:57:58,109 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-21 21:57:58,109 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2021-12-21 21:57:58,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 21:57:58,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 21:57:58,129 INFO L263 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-21 21:57:58,129 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 21:57:58,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 21:57:58,150 WARN L261 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-21 21:57:58,150 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 21:57:58,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 21:57:58,153 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 [2021-12-21 21:57:58,154 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) [2021-12-21 21:57:58,159 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. [2021-12-21 21:57:58,159 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 [2021-12-21 21:57:58,161 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) [2021-12-21 21:57:58,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5 transitions. [2021-12-21 21:57:58,161 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 10 letters. Loop has 2 letters. [2021-12-21 21:57:58,161 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-21 21:57:58,161 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2021-12-21 21:57:58,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 21:57:58,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 21:57:58,174 INFO L263 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-21 21:57:58,175 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 21:57:58,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 21:57:58,202 WARN L261 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-21 21:57:58,202 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 21:57:58,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 21:57:58,205 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 [2021-12-21 21:57:58,205 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) [2021-12-21 21:57:58,212 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. [2021-12-21 21:57:58,213 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 [2021-12-21 21:57:58,213 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) [2021-12-21 21:57:58,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 8 transitions. [2021-12-21 21:57:58,214 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 10 letters. Loop has 2 letters. [2021-12-21 21:57:58,214 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-21 21:57:58,214 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 12 letters. Loop has 2 letters. [2021-12-21 21:57:58,214 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-21 21:57:58,214 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 10 letters. Loop has 4 letters. [2021-12-21 21:57:58,214 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-21 21:57:58,215 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 19 transitions. [2021-12-21 21:57:58,215 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2021-12-21 21:57:58,215 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 14 states and 16 transitions. [2021-12-21 21:57:58,216 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2021-12-21 21:57:58,216 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2021-12-21 21:57:58,216 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 16 transitions. [2021-12-21 21:57:58,216 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-21 21:57:58,216 INFO L681 BuchiCegarLoop]: Abstraction has 14 states and 16 transitions. [2021-12-21 21:57:58,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 16 transitions. [2021-12-21 21:57:58,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2021-12-21 21:57:58,217 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) [2021-12-21 21:57:58,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2021-12-21 21:57:58,217 INFO L704 BuchiCegarLoop]: Abstraction has 13 states and 15 transitions. [2021-12-21 21:57:58,217 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 21:57:58,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-12-21 21:57:58,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2021-12-21 21:57:58,218 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) [2021-12-21 21:57:58,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 21:57:58,239 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2021-12-21 21:57:58,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-21 21:57:58,240 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 34 transitions. [2021-12-21 21:57:58,241 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2021-12-21 21:57:58,241 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 26 states and 28 transitions. [2021-12-21 21:57:58,241 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2021-12-21 21:57:58,241 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2021-12-21 21:57:58,241 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 28 transitions. [2021-12-21 21:57:58,241 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-21 21:57:58,242 INFO L681 BuchiCegarLoop]: Abstraction has 26 states and 28 transitions. [2021-12-21 21:57:58,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 28 transitions. [2021-12-21 21:57:58,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2021-12-21 21:57:58,243 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) [2021-12-21 21:57:58,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2021-12-21 21:57:58,243 INFO L704 BuchiCegarLoop]: Abstraction has 25 states and 27 transitions. [2021-12-21 21:57:58,243 INFO L587 BuchiCegarLoop]: Abstraction has 25 states and 27 transitions. [2021-12-21 21:57:58,243 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-12-21 21:57:58,243 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 27 transitions. [2021-12-21 21:57:58,244 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2021-12-21 21:57:58,244 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-21 21:57:58,244 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-21 21:57:58,244 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [10, 9, 1, 1] [2021-12-21 21:57:58,244 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-21 21:57:58,245 INFO L791 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;havoc main_~i~0#1;main_~i~0#1 := 0; 516#L10-2 assume !!(main_~i~0#1 < 100); 515#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 508#L10-2 assume !!(main_~i~0#1 < 100); 509#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 532#L10-2 assume !!(main_~i~0#1 < 100); 531#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 530#L10-2 assume !!(main_~i~0#1 < 100); 529#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 528#L10-2 assume !!(main_~i~0#1 < 100); 527#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 526#L10-2 assume !!(main_~i~0#1 < 100); 525#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 524#L10-2 assume !!(main_~i~0#1 < 100); 523#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 522#L10-2 assume !!(main_~i~0#1 < 100); 521#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 520#L10-2 assume !!(main_~i~0#1 < 100); 519#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 518#L10-2 assume !!(main_~i~0#1 < 100); 512#L10 [2021-12-21 21:57:58,245 INFO L793 eck$LassoCheckResult]: Loop: 512#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 517#L10-2 assume !!(main_~i~0#1 < 100); 512#L10 [2021-12-21 21:57:58,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 21:57:58,245 INFO L85 PathProgramCache]: Analyzing trace with hash -926509747, now seen corresponding path program 3 times [2021-12-21 21:57:58,245 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 21:57:58,245 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132613408] [2021-12-21 21:57:58,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 21:57:58,246 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 21:57:58,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 21:57:58,253 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-21 21:57:58,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 21:57:58,259 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-21 21:57:58,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 21:57:58,259 INFO L85 PathProgramCache]: Analyzing trace with hash 1406, now seen corresponding path program 1 times [2021-12-21 21:57:58,259 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 21:57:58,259 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398533418] [2021-12-21 21:57:58,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 21:57:58,259 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 21:57:58,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 21:57:58,261 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-21 21:57:58,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 21:57:58,262 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-21 21:57:58,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 21:57:58,263 INFO L85 PathProgramCache]: Analyzing trace with hash -1317636150, now seen corresponding path program 4 times [2021-12-21 21:57:58,263 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 21:57:58,263 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287674982] [2021-12-21 21:57:58,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 21:57:58,263 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 21:57:58,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 21:57:58,269 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-21 21:57:58,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 21:57:58,275 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-21 21:57:58,285 INFO L210 LassoAnalysis]: Preferences: [2021-12-21 21:57:58,286 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-21 21:57:58,286 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-21 21:57:58,286 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-21 21:57:58,286 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2021-12-21 21:57:58,286 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 21:57:58,286 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-21 21:57:58,286 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-21 21:57:58,286 INFO L133 ssoRankerPreferences]: Filename of dumped script: NO_22.c_Iteration4_Loop [2021-12-21 21:57:58,286 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-21 21:57:58,286 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-21 21:57:58,287 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 21:57:58,290 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 21:57:58,292 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 21:57:58,310 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-21 21:57:58,311 INFO L404 LassoAnalysis]: Checking for nontermination... [2021-12-21 21:57:58,311 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 21:57:58,311 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 21:57:58,312 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-21 21:57:58,322 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-12-21 21:57:58,322 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-21 21:57:58,330 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2021-12-21 21:57:58,354 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 [2021-12-21 21:57:58,354 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 21:57:58,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 21:57:58,355 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-21 21:57:58,355 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2021-12-21 21:57:58,357 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2021-12-21 21:57:58,357 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-21 21:57:58,383 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2021-12-21 21:57:58,386 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2021-12-21 21:57:58,386 INFO L210 LassoAnalysis]: Preferences: [2021-12-21 21:57:58,386 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-21 21:57:58,386 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-21 21:57:58,386 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-21 21:57:58,386 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-21 21:57:58,386 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 21:57:58,386 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-21 21:57:58,386 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-21 21:57:58,386 INFO L133 ssoRankerPreferences]: Filename of dumped script: NO_22.c_Iteration4_Loop [2021-12-21 21:57:58,386 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-21 21:57:58,386 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-21 21:57:58,387 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 21:57:58,393 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 21:57:58,394 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 21:57:58,432 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2021-12-21 21:57:58,443 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-21 21:57:58,443 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-21 21:57:58,443 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 21:57:58,443 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 21:57:58,444 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-21 21:57:58,445 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2021-12-21 21:57:58,446 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-21 21:57:58,453 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-21 21:57:58,453 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-21 21:57:58,453 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-21 21:57:58,453 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-21 21:57:58,453 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-21 21:57:58,454 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-21 21:57:58,454 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-21 21:57:58,462 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-21 21:57:58,464 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2021-12-21 21:57:58,464 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2021-12-21 21:57:58,464 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 21:57:58,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 21:57:58,468 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-21 21:57:58,468 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2021-12-21 21:57:58,469 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-21 21:57:58,469 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2021-12-21 21:57:58,469 INFO L513 LassoAnalysis]: Proved termination. [2021-12-21 21:57:58,469 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = -2*ULTIMATE.start_main_~i~0#1 + 99 Supporting invariants [] [2021-12-21 21:57:58,485 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 [2021-12-21 21:57:58,485 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2021-12-21 21:57:58,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 21:57:58,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 21:57:58,509 INFO L263 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-21 21:57:58,509 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 21:57:58,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 21:57:58,537 WARN L261 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-21 21:57:58,538 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 21:57:58,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 21:57:58,557 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2021-12-21 21:57:58,557 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) [2021-12-21 21:57:58,565 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. [2021-12-21 21:57:58,565 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 [2021-12-21 21:57:58,566 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) [2021-12-21 21:57:58,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 6 transitions. [2021-12-21 21:57:58,566 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 21 letters. Loop has 2 letters. [2021-12-21 21:57:58,566 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-21 21:57:58,566 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 23 letters. Loop has 2 letters. [2021-12-21 21:57:58,567 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-21 21:57:58,567 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 21 letters. Loop has 4 letters. [2021-12-21 21:57:58,567 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-21 21:57:58,567 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 42 transitions. [2021-12-21 21:57:58,568 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2021-12-21 21:57:58,568 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 28 states and 31 transitions. [2021-12-21 21:57:58,568 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2021-12-21 21:57:58,568 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2021-12-21 21:57:58,568 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 31 transitions. [2021-12-21 21:57:58,569 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-21 21:57:58,569 INFO L681 BuchiCegarLoop]: Abstraction has 28 states and 31 transitions. [2021-12-21 21:57:58,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 31 transitions. [2021-12-21 21:57:58,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2021-12-21 21:57:58,570 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) [2021-12-21 21:57:58,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2021-12-21 21:57:58,570 INFO L704 BuchiCegarLoop]: Abstraction has 27 states and 30 transitions. [2021-12-21 21:57:58,570 INFO L587 BuchiCegarLoop]: Abstraction has 27 states and 30 transitions. [2021-12-21 21:57:58,570 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2021-12-21 21:57:58,570 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 30 transitions. [2021-12-21 21:57:58,571 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2021-12-21 21:57:58,571 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-21 21:57:58,571 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-21 21:57:58,571 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [12, 10, 1, 1, 1] [2021-12-21 21:57:58,572 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-12-21 21:57:58,572 INFO L791 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;havoc main_~i~0#1;main_~i~0#1 := 0; 661#L10-2 assume !!(main_~i~0#1 < 100); 662#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 667#L10-2 assume !!(main_~i~0#1 < 100); 668#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 663#L10-2 assume !!(main_~i~0#1 < 100); 664#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 687#L10-2 assume !!(main_~i~0#1 < 100); 686#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 685#L10-2 assume !!(main_~i~0#1 < 100); 684#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 683#L10-2 assume !!(main_~i~0#1 < 100); 682#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 681#L10-2 assume !!(main_~i~0#1 < 100); 680#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 679#L10-2 assume !!(main_~i~0#1 < 100); 678#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 677#L10-2 assume !!(main_~i~0#1 < 100); 676#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 675#L10-2 assume !!(main_~i~0#1 < 100); 674#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 673#L10-2 assume !!(main_~i~0#1 < 100); 671#L10 assume !(main_~i~0#1 < 50);main_~i~0#1 := main_~i~0#1 - 1; 669#L10-2 assume !!(main_~i~0#1 < 100); 670#L10 [2021-12-21 21:57:58,572 INFO L793 eck$LassoCheckResult]: Loop: 670#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 672#L10-2 assume !!(main_~i~0#1 < 100); 670#L10 [2021-12-21 21:57:58,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 21:57:58,572 INFO L85 PathProgramCache]: Analyzing trace with hash 767012677, now seen corresponding path program 3 times [2021-12-21 21:57:58,572 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 21:57:58,572 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327544450] [2021-12-21 21:57:58,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 21:57:58,573 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 21:57:58,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 21:57:58,644 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 11 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 21:57:58,644 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 21:57:58,645 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327544450] [2021-12-21 21:57:58,645 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [327544450] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 21:57:58,645 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [29953828] [2021-12-21 21:57:58,645 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-21 21:57:58,645 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 21:57:58,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 21:57:58,646 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-21 21:57:58,647 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2021-12-21 21:57:58,667 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2021-12-21 21:57:58,667 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-21 21:57:58,667 INFO L263 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 12 conjunts are in the unsatisfiable core [2021-12-21 21:57:58,668 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 21:57:58,735 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 11 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 21:57:58,735 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 21:57:58,912 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 11 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 21:57:58,912 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [29953828] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 21:57:58,912 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-21 21:57:58,912 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 24 [2021-12-21 21:57:58,912 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810778920] [2021-12-21 21:57:58,912 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-21 21:57:58,912 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-21 21:57:58,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 21:57:58,913 INFO L85 PathProgramCache]: Analyzing trace with hash 1406, now seen corresponding path program 2 times [2021-12-21 21:57:58,913 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 21:57:58,913 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369091034] [2021-12-21 21:57:58,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 21:57:58,913 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 21:57:58,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 21:57:58,915 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-21 21:57:58,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 21:57:58,916 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-21 21:57:58,927 INFO L210 LassoAnalysis]: Preferences: [2021-12-21 21:57:58,927 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-21 21:57:58,927 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-21 21:57:58,927 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-21 21:57:58,927 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2021-12-21 21:57:58,927 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 21:57:58,927 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-21 21:57:58,927 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-21 21:57:58,927 INFO L133 ssoRankerPreferences]: Filename of dumped script: NO_22.c_Iteration5_Loop [2021-12-21 21:57:58,927 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-21 21:57:58,927 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-21 21:57:58,928 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 21:57:58,929 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 21:57:58,931 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 21:57:58,951 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-21 21:57:58,952 INFO L404 LassoAnalysis]: Checking for nontermination... [2021-12-21 21:57:58,952 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 21:57:58,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 21:57:58,953 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-21 21:57:58,954 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2021-12-21 21:57:58,955 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-12-21 21:57:58,955 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-21 21:57:58,983 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-12-21 21:57:58,983 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_9=1} Honda state: {v_rep~unnamed0~0~true_9=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2021-12-21 21:57:58,998 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0 [2021-12-21 21:57:58,999 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 21:57:58,999 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 21:57:58,999 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-21 21:57:59,000 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2021-12-21 21:57:59,002 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-12-21 21:57:59,003 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-21 21:57:59,017 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-12-21 21:57:59,017 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_9=0} Honda state: {v_rep~unnamed0~0~false_9=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2021-12-21 21:57:59,033 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 [2021-12-21 21:57:59,033 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 21:57:59,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 21:57:59,034 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-21 21:57:59,034 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2021-12-21 21:57:59,035 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-12-21 21:57:59,036 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-21 21:57:59,071 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2021-12-21 21:57:59,071 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 21:57:59,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 21:57:59,072 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-21 21:57:59,073 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2021-12-21 21:57:59,074 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2021-12-21 21:57:59,074 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-21 21:57:59,099 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2021-12-21 21:57:59,102 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Ended with exit code 0 [2021-12-21 21:57:59,102 INFO L210 LassoAnalysis]: Preferences: [2021-12-21 21:57:59,102 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-21 21:57:59,102 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-21 21:57:59,102 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-21 21:57:59,102 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-21 21:57:59,103 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 21:57:59,103 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-21 21:57:59,103 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-21 21:57:59,103 INFO L133 ssoRankerPreferences]: Filename of dumped script: NO_22.c_Iteration5_Loop [2021-12-21 21:57:59,103 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-21 21:57:59,103 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-21 21:57:59,103 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 21:57:59,116 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 21:57:59,124 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 21:57:59,153 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-21 21:57:59,153 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-21 21:57:59,153 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 21:57:59,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 21:57:59,154 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-21 21:57:59,155 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2021-12-21 21:57:59,156 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-21 21:57:59,162 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-21 21:57:59,162 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-21 21:57:59,162 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-21 21:57:59,162 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-21 21:57:59,164 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-21 21:57:59,164 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-21 21:57:59,178 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-21 21:57:59,195 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 [2021-12-21 21:57:59,196 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 21:57:59,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 21:57:59,198 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-21 21:57:59,199 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2021-12-21 21:57:59,199 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-21 21:57:59,206 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-21 21:57:59,206 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-21 21:57:59,206 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-21 21:57:59,206 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-21 21:57:59,207 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-21 21:57:59,207 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-21 21:57:59,222 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-21 21:57:59,237 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Forceful destruction successful, exit code 0 [2021-12-21 21:57:59,237 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 21:57:59,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 21:57:59,238 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-21 21:57:59,238 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2021-12-21 21:57:59,239 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-21 21:57:59,245 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-21 21:57:59,245 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-21 21:57:59,246 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-21 21:57:59,246 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-21 21:57:59,246 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-21 21:57:59,246 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-21 21:57:59,246 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-21 21:57:59,259 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-21 21:57:59,261 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2021-12-21 21:57:59,261 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2021-12-21 21:57:59,261 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 21:57:59,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 21:57:59,262 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-21 21:57:59,263 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2021-12-21 21:57:59,264 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-21 21:57:59,264 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2021-12-21 21:57:59,264 INFO L513 LassoAnalysis]: Proved termination. [2021-12-21 21:57:59,264 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = -2*ULTIMATE.start_main_~i~0#1 + 99 Supporting invariants [] [2021-12-21 21:57:59,279 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Ended with exit code 0 [2021-12-21 21:57:59,280 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2021-12-21 21:57:59,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 21:57:59,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 21:57:59,300 INFO L263 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-21 21:57:59,301 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 21:57:59,330 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 [2021-12-21 21:57:59,346 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2021-12-21 21:57:59,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 21:57:59,381 WARN L261 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-21 21:57:59,382 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 21:57:59,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 21:57:59,396 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2021-12-21 21:57:59,396 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) [2021-12-21 21:57:59,401 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. [2021-12-21 21:57:59,402 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 [2021-12-21 21:57:59,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 21:57:59,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 6 transitions. [2021-12-21 21:57:59,402 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 25 letters. Loop has 2 letters. [2021-12-21 21:57:59,402 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-21 21:57:59,402 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2021-12-21 21:57:59,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 21:57:59,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 21:57:59,416 INFO L263 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-21 21:57:59,417 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 21:57:59,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 21:57:59,452 WARN L261 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-21 21:57:59,452 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 21:57:59,465 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 21:57:59,465 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 [2021-12-21 21:57:59,465 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) [2021-12-21 21:57:59,476 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. [2021-12-21 21:57:59,476 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 [2021-12-21 21:57:59,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 21:57:59,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5 transitions. [2021-12-21 21:57:59,476 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 25 letters. Loop has 2 letters. [2021-12-21 21:57:59,476 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-21 21:57:59,476 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2021-12-21 21:57:59,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 21:57:59,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 21:57:59,493 INFO L263 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-21 21:57:59,494 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 21:57:59,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 21:57:59,534 WARN L261 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-21 21:57:59,534 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 21:57:59,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 21:57:59,547 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 [2021-12-21 21:57:59,548 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) [2021-12-21 21:57:59,569 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. [2021-12-21 21:57:59,570 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 [2021-12-21 21:57:59,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 21:57:59,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2021-12-21 21:57:59,571 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 25 letters. Loop has 2 letters. [2021-12-21 21:57:59,573 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-21 21:57:59,573 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 27 letters. Loop has 2 letters. [2021-12-21 21:57:59,573 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-21 21:57:59,573 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 25 letters. Loop has 4 letters. [2021-12-21 21:57:59,574 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-21 21:57:59,574 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 45 transitions. [2021-12-21 21:57:59,578 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2021-12-21 21:57:59,579 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 29 states and 32 transitions. [2021-12-21 21:57:59,579 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2021-12-21 21:57:59,579 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2021-12-21 21:57:59,580 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 32 transitions. [2021-12-21 21:57:59,580 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-21 21:57:59,580 INFO L681 BuchiCegarLoop]: Abstraction has 29 states and 32 transitions. [2021-12-21 21:57:59,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 32 transitions. [2021-12-21 21:57:59,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 26. [2021-12-21 21:57:59,584 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) [2021-12-21 21:57:59,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2021-12-21 21:57:59,585 INFO L704 BuchiCegarLoop]: Abstraction has 26 states and 28 transitions. [2021-12-21 21:57:59,585 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 21:57:59,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-12-21 21:57:59,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2021-12-21 21:57:59,588 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) [2021-12-21 21:57:59,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 21:57:59,640 INFO L93 Difference]: Finished difference Result 63 states and 65 transitions. [2021-12-21 21:57:59,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-12-21 21:57:59,641 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 63 states and 65 transitions. [2021-12-21 21:57:59,643 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2021-12-21 21:57:59,644 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 63 states to 51 states and 53 transitions. [2021-12-21 21:57:59,644 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2021-12-21 21:57:59,644 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2021-12-21 21:57:59,644 INFO L73 IsDeterministic]: Start isDeterministic. Operand 51 states and 53 transitions. [2021-12-21 21:57:59,644 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-21 21:57:59,644 INFO L681 BuchiCegarLoop]: Abstraction has 51 states and 53 transitions. [2021-12-21 21:57:59,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states and 53 transitions. [2021-12-21 21:57:59,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2021-12-21 21:57:59,647 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) [2021-12-21 21:57:59,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 52 transitions. [2021-12-21 21:57:59,647 INFO L704 BuchiCegarLoop]: Abstraction has 50 states and 52 transitions. [2021-12-21 21:57:59,647 INFO L587 BuchiCegarLoop]: Abstraction has 50 states and 52 transitions. [2021-12-21 21:57:59,647 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2021-12-21 21:57:59,647 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 50 states and 52 transitions. [2021-12-21 21:57:59,648 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2021-12-21 21:57:59,648 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-21 21:57:59,648 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-21 21:57:59,649 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [24, 22, 1, 1, 1] [2021-12-21 21:57:59,649 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1] [2021-12-21 21:57:59,649 INFO L791 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;havoc main_~i~0#1;main_~i~0#1 := 0; 1333#L10-2 assume !!(main_~i~0#1 < 100); 1334#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1339#L10-2 assume !!(main_~i~0#1 < 100); 1340#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1335#L10-2 assume !!(main_~i~0#1 < 100); 1336#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1382#L10-2 assume !!(main_~i~0#1 < 100); 1381#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1380#L10-2 assume !!(main_~i~0#1 < 100); 1379#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1378#L10-2 assume !!(main_~i~0#1 < 100); 1377#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1376#L10-2 assume !!(main_~i~0#1 < 100); 1375#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1374#L10-2 assume !!(main_~i~0#1 < 100); 1373#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1372#L10-2 assume !!(main_~i~0#1 < 100); 1371#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1370#L10-2 assume !!(main_~i~0#1 < 100); 1369#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1368#L10-2 assume !!(main_~i~0#1 < 100); 1367#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1366#L10-2 assume !!(main_~i~0#1 < 100); 1365#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1364#L10-2 assume !!(main_~i~0#1 < 100); 1363#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1362#L10-2 assume !!(main_~i~0#1 < 100); 1361#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1360#L10-2 assume !!(main_~i~0#1 < 100); 1359#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1358#L10-2 assume !!(main_~i~0#1 < 100); 1357#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1356#L10-2 assume !!(main_~i~0#1 < 100); 1355#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1354#L10-2 assume !!(main_~i~0#1 < 100); 1353#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1352#L10-2 assume !!(main_~i~0#1 < 100); 1351#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1350#L10-2 assume !!(main_~i~0#1 < 100); 1349#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1348#L10-2 assume !!(main_~i~0#1 < 100); 1347#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1346#L10-2 assume !!(main_~i~0#1 < 100); 1345#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1344#L10-2 assume !!(main_~i~0#1 < 100); 1343#L10 assume !(main_~i~0#1 < 50);main_~i~0#1 := main_~i~0#1 - 1; 1341#L10-2 assume !!(main_~i~0#1 < 100); 1342#L10 [2021-12-21 21:57:59,649 INFO L793 eck$LassoCheckResult]: Loop: 1342#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1344#L10-2 assume !!(main_~i~0#1 < 100); 1343#L10 assume !(main_~i~0#1 < 50);main_~i~0#1 := main_~i~0#1 - 1; 1341#L10-2 assume !!(main_~i~0#1 < 100); 1342#L10 [2021-12-21 21:57:59,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 21:57:59,649 INFO L85 PathProgramCache]: Analyzing trace with hash -694298463, now seen corresponding path program 4 times [2021-12-21 21:57:59,649 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 21:57:59,650 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095302553] [2021-12-21 21:57:59,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 21:57:59,650 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 21:57:59,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 21:57:59,878 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 23 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 21:57:59,879 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 21:57:59,879 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095302553] [2021-12-21 21:57:59,879 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2095302553] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 21:57:59,879 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1996101737] [2021-12-21 21:57:59,879 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-12-21 21:57:59,879 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 21:57:59,879 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 21:57:59,880 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-21 21:57:59,881 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2021-12-21 21:57:59,906 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-12-21 21:57:59,907 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-21 21:57:59,907 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 24 conjunts are in the unsatisfiable core [2021-12-21 21:57:59,908 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 21:58:00,003 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 23 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 21:58:00,003 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 21:58:00,550 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 23 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 21:58:00,551 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1996101737] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 21:58:00,551 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-21 21:58:00,551 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 48 [2021-12-21 21:58:00,551 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539434347] [2021-12-21 21:58:00,551 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-21 21:58:00,552 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-21 21:58:00,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 21:58:00,552 INFO L85 PathProgramCache]: Analyzing trace with hash 1351673, now seen corresponding path program 1 times [2021-12-21 21:58:00,552 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 21:58:00,552 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900743058] [2021-12-21 21:58:00,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 21:58:00,552 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 21:58:00,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 21:58:00,555 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-21 21:58:00,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 21:58:00,556 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-21 21:58:00,575 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 21:58:00,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2021-12-21 21:58:00,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2021-12-21 21:58:00,577 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) [2021-12-21 21:58:00,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 21:58:00,686 INFO L93 Difference]: Finished difference Result 123 states and 125 transitions. [2021-12-21 21:58:00,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2021-12-21 21:58:00,686 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 123 states and 125 transitions. [2021-12-21 21:58:00,687 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2021-12-21 21:58:00,688 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 123 states to 99 states and 101 transitions. [2021-12-21 21:58:00,688 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2021-12-21 21:58:00,688 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2021-12-21 21:58:00,688 INFO L73 IsDeterministic]: Start isDeterministic. Operand 99 states and 101 transitions. [2021-12-21 21:58:00,688 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-21 21:58:00,688 INFO L681 BuchiCegarLoop]: Abstraction has 99 states and 101 transitions. [2021-12-21 21:58:00,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states and 101 transitions. [2021-12-21 21:58:00,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 98. [2021-12-21 21:58:00,691 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) [2021-12-21 21:58:00,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 100 transitions. [2021-12-21 21:58:00,691 INFO L704 BuchiCegarLoop]: Abstraction has 98 states and 100 transitions. [2021-12-21 21:58:00,691 INFO L587 BuchiCegarLoop]: Abstraction has 98 states and 100 transitions. [2021-12-21 21:58:00,691 INFO L425 BuchiCegarLoop]: ======== Iteration 7============ [2021-12-21 21:58:00,691 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 98 states and 100 transitions. [2021-12-21 21:58:00,692 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2021-12-21 21:58:00,692 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-21 21:58:00,692 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-21 21:58:00,694 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [48, 46, 1, 1, 1] [2021-12-21 21:58:00,694 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1] [2021-12-21 21:58:00,694 INFO L791 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;havoc main_~i~0#1;main_~i~0#1 := 0; 1845#L10-2 assume !!(main_~i~0#1 < 100); 1846#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1851#L10-2 assume !!(main_~i~0#1 < 100); 1852#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1847#L10-2 assume !!(main_~i~0#1 < 100); 1848#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1942#L10-2 assume !!(main_~i~0#1 < 100); 1941#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1940#L10-2 assume !!(main_~i~0#1 < 100); 1939#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1938#L10-2 assume !!(main_~i~0#1 < 100); 1937#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1936#L10-2 assume !!(main_~i~0#1 < 100); 1935#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1934#L10-2 assume !!(main_~i~0#1 < 100); 1933#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1932#L10-2 assume !!(main_~i~0#1 < 100); 1931#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1930#L10-2 assume !!(main_~i~0#1 < 100); 1929#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1928#L10-2 assume !!(main_~i~0#1 < 100); 1927#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1926#L10-2 assume !!(main_~i~0#1 < 100); 1925#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1924#L10-2 assume !!(main_~i~0#1 < 100); 1923#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1922#L10-2 assume !!(main_~i~0#1 < 100); 1921#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1920#L10-2 assume !!(main_~i~0#1 < 100); 1919#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1918#L10-2 assume !!(main_~i~0#1 < 100); 1917#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1916#L10-2 assume !!(main_~i~0#1 < 100); 1915#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1914#L10-2 assume !!(main_~i~0#1 < 100); 1913#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1912#L10-2 assume !!(main_~i~0#1 < 100); 1911#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1910#L10-2 assume !!(main_~i~0#1 < 100); 1909#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1908#L10-2 assume !!(main_~i~0#1 < 100); 1907#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1906#L10-2 assume !!(main_~i~0#1 < 100); 1905#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1904#L10-2 assume !!(main_~i~0#1 < 100); 1903#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1902#L10-2 assume !!(main_~i~0#1 < 100); 1901#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1900#L10-2 assume !!(main_~i~0#1 < 100); 1899#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1898#L10-2 assume !!(main_~i~0#1 < 100); 1897#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1896#L10-2 assume !!(main_~i~0#1 < 100); 1895#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1894#L10-2 assume !!(main_~i~0#1 < 100); 1893#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1892#L10-2 assume !!(main_~i~0#1 < 100); 1891#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1890#L10-2 assume !!(main_~i~0#1 < 100); 1889#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1888#L10-2 assume !!(main_~i~0#1 < 100); 1887#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1886#L10-2 assume !!(main_~i~0#1 < 100); 1885#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1884#L10-2 assume !!(main_~i~0#1 < 100); 1883#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1882#L10-2 assume !!(main_~i~0#1 < 100); 1881#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1880#L10-2 assume !!(main_~i~0#1 < 100); 1879#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1878#L10-2 assume !!(main_~i~0#1 < 100); 1877#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1876#L10-2 assume !!(main_~i~0#1 < 100); 1875#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1874#L10-2 assume !!(main_~i~0#1 < 100); 1873#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1872#L10-2 assume !!(main_~i~0#1 < 100); 1871#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1870#L10-2 assume !!(main_~i~0#1 < 100); 1869#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1868#L10-2 assume !!(main_~i~0#1 < 100); 1867#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1866#L10-2 assume !!(main_~i~0#1 < 100); 1865#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1864#L10-2 assume !!(main_~i~0#1 < 100); 1863#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1862#L10-2 assume !!(main_~i~0#1 < 100); 1861#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1860#L10-2 assume !!(main_~i~0#1 < 100); 1859#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1858#L10-2 assume !!(main_~i~0#1 < 100); 1857#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1856#L10-2 assume !!(main_~i~0#1 < 100); 1855#L10 assume !(main_~i~0#1 < 50);main_~i~0#1 := main_~i~0#1 - 1; 1853#L10-2 assume !!(main_~i~0#1 < 100); 1854#L10 [2021-12-21 21:58:00,694 INFO L793 eck$LassoCheckResult]: Loop: 1854#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 1856#L10-2 assume !!(main_~i~0#1 < 100); 1855#L10 assume !(main_~i~0#1 < 50);main_~i~0#1 := main_~i~0#1 - 1; 1853#L10-2 assume !!(main_~i~0#1 < 100); 1854#L10 [2021-12-21 21:58:00,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 21:58:00,694 INFO L85 PathProgramCache]: Analyzing trace with hash -818401447, now seen corresponding path program 5 times [2021-12-21 21:58:00,694 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 21:58:00,695 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733187849] [2021-12-21 21:58:00,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 21:58:00,695 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 21:58:00,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 21:58:01,444 INFO L134 CoverageAnalysis]: Checked inductivity of 2209 backedges. 47 proven. 2162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 21:58:01,444 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 21:58:01,444 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733187849] [2021-12-21 21:58:01,444 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733187849] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 21:58:01,444 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [55475312] [2021-12-21 21:58:01,444 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-12-21 21:58:01,444 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 21:58:01,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 21:58:01,445 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-21 21:58:01,446 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2021-12-21 21:58:01,496 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 48 check-sat command(s) [2021-12-21 21:58:01,496 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-21 21:58:01,504 INFO L263 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 48 conjunts are in the unsatisfiable core [2021-12-21 21:58:01,506 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 21:58:01,658 INFO L134 CoverageAnalysis]: Checked inductivity of 2209 backedges. 47 proven. 2162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 21:58:01,658 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 21:58:01,926 INFO L134 CoverageAnalysis]: Checked inductivity of 2209 backedges. 47 proven. 2162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 21:58:01,926 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [55475312] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 21:58:01,926 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-21 21:58:01,926 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 52 [2021-12-21 21:58:01,926 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961345124] [2021-12-21 21:58:01,926 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-21 21:58:01,926 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-21 21:58:01,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 21:58:01,927 INFO L85 PathProgramCache]: Analyzing trace with hash 1351673, now seen corresponding path program 2 times [2021-12-21 21:58:01,927 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 21:58:01,927 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910971552] [2021-12-21 21:58:01,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 21:58:01,927 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 21:58:01,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 21:58:01,929 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-21 21:58:01,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 21:58:01,930 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-21 21:58:01,948 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 21:58:01,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2021-12-21 21:58:01,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2021-12-21 21:58:01,949 INFO L87 Difference]: Start difference. First operand 98 states and 100 transitions. cyclomatic complexity: 3 Second operand has 52 states, 52 states have (on average 2.019230769230769) internal successors, (105), 52 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 21:58:02,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 21:58:02,034 INFO L93 Difference]: Finished difference Result 111 states and 113 transitions. [2021-12-21 21:58:02,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2021-12-21 21:58:02,035 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 111 states and 113 transitions. [2021-12-21 21:58:02,035 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2021-12-21 21:58:02,036 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 111 states to 107 states and 109 transitions. [2021-12-21 21:58:02,036 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2021-12-21 21:58:02,036 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2021-12-21 21:58:02,036 INFO L73 IsDeterministic]: Start isDeterministic. Operand 107 states and 109 transitions. [2021-12-21 21:58:02,036 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-21 21:58:02,036 INFO L681 BuchiCegarLoop]: Abstraction has 107 states and 109 transitions. [2021-12-21 21:58:02,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states and 109 transitions. [2021-12-21 21:58:02,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 106. [2021-12-21 21:58:02,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 106 states have (on average 1.0188679245283019) internal successors, (108), 105 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 21:58:02,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 108 transitions. [2021-12-21 21:58:02,039 INFO L704 BuchiCegarLoop]: Abstraction has 106 states and 108 transitions. [2021-12-21 21:58:02,039 INFO L587 BuchiCegarLoop]: Abstraction has 106 states and 108 transitions. [2021-12-21 21:58:02,039 INFO L425 BuchiCegarLoop]: ======== Iteration 8============ [2021-12-21 21:58:02,039 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 106 states and 108 transitions. [2021-12-21 21:58:02,040 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2021-12-21 21:58:02,040 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-21 21:58:02,040 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-21 21:58:02,040 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [52, 50, 1, 1, 1] [2021-12-21 21:58:02,040 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1] [2021-12-21 21:58:02,041 INFO L791 eck$LassoCheckResult]: Stem: 2689#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 2690#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~i~0#1;havoc main_~i~0#1;main_~i~0#1 := 0; 2685#L10-2 assume !!(main_~i~0#1 < 100); 2686#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2691#L10-2 assume !!(main_~i~0#1 < 100); 2692#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2687#L10-2 assume !!(main_~i~0#1 < 100); 2688#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2790#L10-2 assume !!(main_~i~0#1 < 100); 2789#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2788#L10-2 assume !!(main_~i~0#1 < 100); 2787#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2786#L10-2 assume !!(main_~i~0#1 < 100); 2785#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2784#L10-2 assume !!(main_~i~0#1 < 100); 2783#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2782#L10-2 assume !!(main_~i~0#1 < 100); 2781#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2780#L10-2 assume !!(main_~i~0#1 < 100); 2779#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2778#L10-2 assume !!(main_~i~0#1 < 100); 2777#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2776#L10-2 assume !!(main_~i~0#1 < 100); 2775#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2774#L10-2 assume !!(main_~i~0#1 < 100); 2773#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2772#L10-2 assume !!(main_~i~0#1 < 100); 2771#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2770#L10-2 assume !!(main_~i~0#1 < 100); 2769#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2768#L10-2 assume !!(main_~i~0#1 < 100); 2767#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2766#L10-2 assume !!(main_~i~0#1 < 100); 2765#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2764#L10-2 assume !!(main_~i~0#1 < 100); 2763#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2762#L10-2 assume !!(main_~i~0#1 < 100); 2761#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2760#L10-2 assume !!(main_~i~0#1 < 100); 2759#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2758#L10-2 assume !!(main_~i~0#1 < 100); 2757#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2756#L10-2 assume !!(main_~i~0#1 < 100); 2755#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2754#L10-2 assume !!(main_~i~0#1 < 100); 2753#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2752#L10-2 assume !!(main_~i~0#1 < 100); 2751#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2750#L10-2 assume !!(main_~i~0#1 < 100); 2749#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2748#L10-2 assume !!(main_~i~0#1 < 100); 2747#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2746#L10-2 assume !!(main_~i~0#1 < 100); 2745#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2744#L10-2 assume !!(main_~i~0#1 < 100); 2743#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2742#L10-2 assume !!(main_~i~0#1 < 100); 2741#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2740#L10-2 assume !!(main_~i~0#1 < 100); 2739#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2738#L10-2 assume !!(main_~i~0#1 < 100); 2737#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2736#L10-2 assume !!(main_~i~0#1 < 100); 2735#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2734#L10-2 assume !!(main_~i~0#1 < 100); 2733#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2732#L10-2 assume !!(main_~i~0#1 < 100); 2731#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2730#L10-2 assume !!(main_~i~0#1 < 100); 2729#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2728#L10-2 assume !!(main_~i~0#1 < 100); 2727#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2726#L10-2 assume !!(main_~i~0#1 < 100); 2725#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2724#L10-2 assume !!(main_~i~0#1 < 100); 2723#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2722#L10-2 assume !!(main_~i~0#1 < 100); 2721#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2720#L10-2 assume !!(main_~i~0#1 < 100); 2719#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2718#L10-2 assume !!(main_~i~0#1 < 100); 2717#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2716#L10-2 assume !!(main_~i~0#1 < 100); 2715#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2714#L10-2 assume !!(main_~i~0#1 < 100); 2713#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2712#L10-2 assume !!(main_~i~0#1 < 100); 2711#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2710#L10-2 assume !!(main_~i~0#1 < 100); 2709#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2708#L10-2 assume !!(main_~i~0#1 < 100); 2707#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2706#L10-2 assume !!(main_~i~0#1 < 100); 2705#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2704#L10-2 assume !!(main_~i~0#1 < 100); 2703#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2702#L10-2 assume !!(main_~i~0#1 < 100); 2701#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2700#L10-2 assume !!(main_~i~0#1 < 100); 2699#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2698#L10-2 assume !!(main_~i~0#1 < 100); 2697#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2696#L10-2 assume !!(main_~i~0#1 < 100); 2695#L10 assume !(main_~i~0#1 < 50);main_~i~0#1 := main_~i~0#1 - 1; 2693#L10-2 assume !!(main_~i~0#1 < 100); 2694#L10 [2021-12-21 21:58:02,041 INFO L793 eck$LassoCheckResult]: Loop: 2694#L10 assume main_~i~0#1 < 50;main_~i~0#1 := 1 + main_~i~0#1; 2696#L10-2 assume !!(main_~i~0#1 < 100); 2695#L10 assume !(main_~i~0#1 < 50);main_~i~0#1 := main_~i~0#1 - 1; 2693#L10-2 assume !!(main_~i~0#1 < 100); 2694#L10 [2021-12-21 21:58:02,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 21:58:02,041 INFO L85 PathProgramCache]: Analyzing trace with hash 1468745677, now seen corresponding path program 6 times [2021-12-21 21:58:02,041 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 21:58:02,041 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207969391] [2021-12-21 21:58:02,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 21:58:02,041 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 21:58:02,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 21:58:02,059 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-21 21:58:02,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 21:58:02,078 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-21 21:58:02,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 21:58:02,078 INFO L85 PathProgramCache]: Analyzing trace with hash 1351673, now seen corresponding path program 3 times [2021-12-21 21:58:02,078 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 21:58:02,078 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353175466] [2021-12-21 21:58:02,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 21:58:02,078 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 21:58:02,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 21:58:02,080 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-21 21:58:02,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 21:58:02,081 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-21 21:58:02,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 21:58:02,081 INFO L85 PathProgramCache]: Analyzing trace with hash -1914756667, now seen corresponding path program 7 times [2021-12-21 21:58:02,081 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 21:58:02,081 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578142721] [2021-12-21 21:58:02,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 21:58:02,081 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 21:58:02,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 21:58:02,102 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-21 21:58:02,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 21:58:02,117 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-21 21:58:02,998 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 21.12 09:58:02 BoogieIcfgContainer [2021-12-21 21:58:02,998 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2021-12-21 21:58:02,999 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-21 21:58:02,999 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-21 21:58:02,999 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-21 21:58:02,999 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 09:57:56" (3/4) ... [2021-12-21 21:58:03,001 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2021-12-21 21:58:03,035 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-12-21 21:58:03,035 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-21 21:58:03,035 INFO L158 Benchmark]: Toolchain (without parser) took 7116.56ms. Allocated memory was 102.8MB in the beginning and 123.7MB in the end (delta: 21.0MB). Free memory was 70.2MB in the beginning and 95.4MB in the end (delta: -25.2MB). Peak memory consumption was 61.3MB. Max. memory is 16.1GB. [2021-12-21 21:58:03,035 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 73.4MB. Free memory is still 33.8MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-21 21:58:03,036 INFO L158 Benchmark]: CACSL2BoogieTranslator took 124.85ms. Allocated memory is still 102.8MB. Free memory was 70.0MB in the beginning and 80.5MB in the end (delta: -10.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-12-21 21:58:03,036 INFO L158 Benchmark]: Boogie Procedure Inliner took 18.34ms. Allocated memory is still 102.8MB. Free memory was 80.5MB in the beginning and 79.1MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-21 21:58:03,036 INFO L158 Benchmark]: Boogie Preprocessor took 15.38ms. Allocated memory is still 102.8MB. Free memory was 79.1MB in the beginning and 78.0MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-21 21:58:03,036 INFO L158 Benchmark]: RCFGBuilder took 124.76ms. Allocated memory is still 102.8MB. Free memory was 78.0MB in the beginning and 70.4MB in the end (delta: 7.6MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2021-12-21 21:58:03,036 INFO L158 Benchmark]: BuchiAutomizer took 6791.51ms. Allocated memory was 102.8MB in the beginning and 123.7MB in the end (delta: 21.0MB). Free memory was 70.4MB in the beginning and 31.0MB in the end (delta: 39.3MB). Peak memory consumption was 62.1MB. Max. memory is 16.1GB. [2021-12-21 21:58:03,036 INFO L158 Benchmark]: Witness Printer took 36.23ms. Allocated memory is still 123.7MB. Free memory was 31.0MB in the beginning and 95.4MB in the end (delta: -64.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-21 21:58:03,037 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 73.4MB. Free memory is still 33.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 124.85ms. Allocated memory is still 102.8MB. Free memory was 70.0MB in the beginning and 80.5MB in the end (delta: -10.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 18.34ms. Allocated memory is still 102.8MB. Free memory was 80.5MB in the beginning and 79.1MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 15.38ms. Allocated memory is still 102.8MB. Free memory was 79.1MB in the beginning and 78.0MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 124.76ms. Allocated memory is still 102.8MB. Free memory was 78.0MB in the beginning and 70.4MB in the end (delta: 7.6MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * BuchiAutomizer took 6791.51ms. Allocated memory was 102.8MB in the beginning and 123.7MB in the end (delta: 21.0MB). Free memory was 70.4MB in the beginning and 31.0MB in the end (delta: 39.3MB). Peak memory consumption was 62.1MB. Max. memory is 16.1GB. * Witness Printer took 36.23ms. Allocated memory is still 123.7MB. Free memory was 31.0MB in the beginning and 95.4MB in the end (delta: -64.3MB). Peak memory consumption was 2.1MB. 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 i and consists of 4 locations. One deterministic module has affine ranking function i and consists of 3 locations. One deterministic module has affine ranking function -2 * i + 99 and consists of 3 locations. One nondeterministic module has affine ranking function i and consists of 3 locations. One nondeterministic module has affine ranking function -2 * i + 99 and consists of 3 locations. 6 modules have a trivial ranking function, the largest among these consists of 52 locations. The remainder module has 106 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 6.7s and 8 iterations. TraceHistogramMax:52. Analysis of lassos took 5.6s. 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 106 states and ocurred in iteration 7. 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, 79 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 25 mSDsCounter, 68 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 351 IncrementalHoareTripleChecker+Invalid, 419 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 68 mSolverCounterUnsat, 54 mSDtfsCounter, 351 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT1 conc0 concLT3 SILN2 SILU0 SILI0 SILT1 lasso0 LassoPreprocessingBenchmarks: Lassos: inital12 mio100 ax199 hnf100 lsp50 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq149 hnf94 smp100 dnf100 smp100 tf111 neg97 sie110 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 31ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 5 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 5 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.4s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 10]: 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 {i=49, \result=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 10]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L6] int i; [L7] i = 0 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND FALSE !(i < 50) [L11] i = i-1 [L9] COND TRUE i < 100 Loop: [L10] COND TRUE i < 50 [L10] i = i+1 [L9] COND TRUE i < 100 [L10] COND FALSE !(i < 50) [L11] i = i-1 [L9] COND TRUE i < 100 End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2021-12-21 21:58:03,077 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Forceful destruction successful, exit code 0 [2021-12-21 21:58:03,287 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Ended with exit code 0 [2021-12-21 21:58:03,486 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2021-12-21 21:58:03,687 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2021-12-21 21:58:03,887 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2021-12-21 21:58:04,088 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM)