./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-restricted-15/Ex08.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version c3fed411 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/Ex08.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 e9f5cf3ddf7f2bce97ea02caa876a19793443837e6b09c62b997f759c9b40cc6 --- Real Ultimate output --- This is Ultimate 0.2.2-tmp.no-commuhash-c3fed41 [2021-12-16 09:21:37,399 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-16 09:21:37,401 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-16 09:21:37,453 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-16 09:21:37,453 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-16 09:21:37,454 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-16 09:21:37,456 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-16 09:21:37,469 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-16 09:21:37,481 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-16 09:21:37,483 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-16 09:21:37,483 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-16 09:21:37,484 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-16 09:21:37,486 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-16 09:21:37,489 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-16 09:21:37,491 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-16 09:21:37,493 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-16 09:21:37,495 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-16 09:21:37,501 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-16 09:21:37,502 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-16 09:21:37,506 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-16 09:21:37,507 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-16 09:21:37,510 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-16 09:21:37,511 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-16 09:21:37,513 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-16 09:21:37,515 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-16 09:21:37,518 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-16 09:21:37,519 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-16 09:21:37,520 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-16 09:21:37,520 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-16 09:21:37,521 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-16 09:21:37,521 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-16 09:21:37,522 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-16 09:21:37,523 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-16 09:21:37,524 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-16 09:21:37,525 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-16 09:21:37,526 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-16 09:21:37,527 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-16 09:21:37,527 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-16 09:21:37,527 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-16 09:21:37,528 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-16 09:21:37,528 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-16 09:21:37,529 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2021-12-16 09:21:37,555 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-16 09:21:37,556 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-16 09:21:37,556 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-16 09:21:37,556 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-16 09:21:37,558 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-16 09:21:37,558 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-16 09:21:37,558 INFO L138 SettingsManager]: * Use SBE=true [2021-12-16 09:21:37,558 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-12-16 09:21:37,558 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-12-16 09:21:37,559 INFO L138 SettingsManager]: * Use old map elimination=false [2021-12-16 09:21:37,559 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-12-16 09:21:37,560 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-12-16 09:21:37,560 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-12-16 09:21:37,560 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-16 09:21:37,560 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-16 09:21:37,560 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-16 09:21:37,560 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-16 09:21:37,561 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-12-16 09:21:37,561 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-12-16 09:21:37,561 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-12-16 09:21:37,561 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-16 09:21:37,561 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-12-16 09:21:37,562 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-16 09:21:37,562 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-12-16 09:21:37,562 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-16 09:21:37,562 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-16 09:21:37,562 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-16 09:21:37,563 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-16 09:21:37,563 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-16 09:21:37,564 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-12-16 09:21:37,564 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 -> e9f5cf3ddf7f2bce97ea02caa876a19793443837e6b09c62b997f759c9b40cc6 [2021-12-16 09:21:37,809 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-16 09:21:37,833 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-16 09:21:37,835 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-16 09:21:37,836 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-16 09:21:37,837 INFO L275 PluginConnector]: CDTParser initialized [2021-12-16 09:21:37,838 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-restricted-15/Ex08.c [2021-12-16 09:21:37,886 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce6b658a6/7b59925edbd042feb3fb397fa7bae4ac/FLAG7f963d2a2 [2021-12-16 09:21:38,271 INFO L306 CDTParser]: Found 1 translation units. [2021-12-16 09:21:38,272 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-restricted-15/Ex08.c [2021-12-16 09:21:38,280 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce6b658a6/7b59925edbd042feb3fb397fa7bae4ac/FLAG7f963d2a2 [2021-12-16 09:21:38,678 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce6b658a6/7b59925edbd042feb3fb397fa7bae4ac [2021-12-16 09:21:38,681 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-16 09:21:38,682 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-16 09:21:38,683 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-16 09:21:38,683 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-16 09:21:38,686 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-16 09:21:38,686 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 09:21:38" (1/1) ... [2021-12-16 09:21:38,687 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b09ac6a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:21:38, skipping insertion in model container [2021-12-16 09:21:38,687 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 09:21:38" (1/1) ... [2021-12-16 09:21:38,692 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-16 09:21:38,701 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-16 09:21:38,812 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-16 09:21:38,814 INFO L203 MainTranslator]: Completed pre-run [2021-12-16 09:21:38,842 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-16 09:21:38,856 INFO L208 MainTranslator]: Completed translation [2021-12-16 09:21:38,857 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:21:38 WrapperNode [2021-12-16 09:21:38,857 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-16 09:21:38,858 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-16 09:21:38,858 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-16 09:21:38,859 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-16 09:21:38,867 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:21:38" (1/1) ... [2021-12-16 09:21:38,870 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:21:38" (1/1) ... [2021-12-16 09:21:38,882 INFO L137 Inliner]: procedures = 4, calls = 2, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 20 [2021-12-16 09:21:38,882 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-16 09:21:38,883 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-16 09:21:38,883 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-16 09:21:38,883 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-16 09:21:38,889 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:21:38" (1/1) ... [2021-12-16 09:21:38,889 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:21:38" (1/1) ... [2021-12-16 09:21:38,890 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:21:38" (1/1) ... [2021-12-16 09:21:38,890 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:21:38" (1/1) ... [2021-12-16 09:21:38,892 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:21:38" (1/1) ... [2021-12-16 09:21:38,895 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:21:38" (1/1) ... [2021-12-16 09:21:38,896 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:21:38" (1/1) ... [2021-12-16 09:21:38,899 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-16 09:21:38,900 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-16 09:21:38,900 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-16 09:21:38,900 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-16 09:21:38,901 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:21:38" (1/1) ... [2021-12-16 09:21:38,907 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:21:38,916 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:21:38,928 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-16 09:21:38,939 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-16 09:21:38,974 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-16 09:21:38,975 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-16 09:21:39,019 INFO L236 CfgBuilder]: Building ICFG [2021-12-16 09:21:39,021 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-16 09:21:39,102 INFO L277 CfgBuilder]: Performing block encoding [2021-12-16 09:21:39,108 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-16 09:21:39,108 INFO L301 CfgBuilder]: Removed 1 assume(true) statements. [2021-12-16 09:21:39,110 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 09:21:39 BoogieIcfgContainer [2021-12-16 09:21:39,110 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-16 09:21:39,111 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-12-16 09:21:39,111 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-12-16 09:21:39,114 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-12-16 09:21:39,114 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-16 09:21:39,115 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 16.12 09:21:38" (1/3) ... [2021-12-16 09:21:39,116 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2852c0bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 16.12 09:21:39, skipping insertion in model container [2021-12-16 09:21:39,116 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-16 09:21:39,116 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:21:38" (2/3) ... [2021-12-16 09:21:39,117 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2852c0bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 16.12 09:21:39, skipping insertion in model container [2021-12-16 09:21:39,117 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-16 09:21:39,117 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 09:21:39" (3/3) ... [2021-12-16 09:21:39,119 INFO L388 chiAutomizerObserver]: Analyzing ICFG Ex08.c [2021-12-16 09:21:39,165 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-12-16 09:21:39,165 INFO L360 BuchiCegarLoop]: Hoare is false [2021-12-16 09:21:39,165 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-12-16 09:21:39,165 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-12-16 09:21:39,165 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-12-16 09:21:39,165 INFO L364 BuchiCegarLoop]: Difference is false [2021-12-16 09:21:39,166 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-12-16 09:21:39,166 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-12-16 09:21:39,174 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 10 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 9 states have internal predecessors, (14), 0 states have call successors, (0), 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-16 09:21:39,186 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2021-12-16 09:21:39,186 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-16 09:21:39,186 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-16 09:21:39,190 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-16 09:21:39,190 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2021-12-16 09:21:39,191 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-12-16 09:21:39,191 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 10 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 9 states have internal predecessors, (14), 0 states have call successors, (0), 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-16 09:21:39,192 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2021-12-16 09:21:39,192 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-16 09:21:39,192 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-16 09:21:39,193 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-16 09:21:39,193 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2021-12-16 09:21:39,198 INFO L791 eck$LassoCheckResult]: Stem: 5#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true; 9#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~up~0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~up~0#1 := 0; 6#L18-1true [2021-12-16 09:21:39,198 INFO L793 eck$LassoCheckResult]: Loop: 6#L18-1true assume !!(main_~i~0#1 > 0); 11#L12true assume !(1 == main_~i~0#1); 3#L12-2true assume 10 == main_~i~0#1;main_~up~0#1 := 0; 8#L15-1true assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 6#L18-1true [2021-12-16 09:21:39,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:21:39,207 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2021-12-16 09:21:39,215 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:21:39,216 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697610299] [2021-12-16 09:21:39,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:21:39,218 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:21:39,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:21:39,281 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 09:21:39,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:21:39,302 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-16 09:21:39,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:21:39,312 INFO L85 PathProgramCache]: Analyzing trace with hash 1267244, now seen corresponding path program 1 times [2021-12-16 09:21:39,312 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:21:39,312 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096917551] [2021-12-16 09:21:39,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:21:39,313 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:21:39,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:21:39,402 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-16 09:21:39,404 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 09:21:39,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096917551] [2021-12-16 09:21:39,405 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1096917551] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 09:21:39,406 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 09:21:39,406 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-16 09:21:39,406 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701119968] [2021-12-16 09:21:39,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 09:21:39,410 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-16 09:21:39,411 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 09:21:39,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-16 09:21:39,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-16 09:21:39,441 INFO L87 Difference]: Start difference. First operand has 10 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 9 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 09:21:39,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 09:21:39,491 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2021-12-16 09:21:39,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-16 09:21:39,496 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 23 transitions. [2021-12-16 09:21:39,498 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2021-12-16 09:21:39,500 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 10 states and 15 transitions. [2021-12-16 09:21:39,501 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2021-12-16 09:21:39,501 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2021-12-16 09:21:39,502 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 15 transitions. [2021-12-16 09:21:39,502 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-16 09:21:39,502 INFO L681 BuchiCegarLoop]: Abstraction has 10 states and 15 transitions. [2021-12-16 09:21:39,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 15 transitions. [2021-12-16 09:21:39,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2021-12-16 09:21:39,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.5) internal successors, (15), 9 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-16 09:21:39,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 15 transitions. [2021-12-16 09:21:39,522 INFO L704 BuchiCegarLoop]: Abstraction has 10 states and 15 transitions. [2021-12-16 09:21:39,523 INFO L587 BuchiCegarLoop]: Abstraction has 10 states and 15 transitions. [2021-12-16 09:21:39,523 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-12-16 09:21:39,523 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 15 transitions. [2021-12-16 09:21:39,524 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2021-12-16 09:21:39,524 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-16 09:21:39,524 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-16 09:21:39,524 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-16 09:21:39,524 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2021-12-16 09:21:39,525 INFO L791 eck$LassoCheckResult]: Stem: 40#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 41#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~up~0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~up~0#1 := 0; 44#L18-1 [2021-12-16 09:21:39,525 INFO L793 eck$LassoCheckResult]: Loop: 44#L18-1 assume !!(main_~i~0#1 > 0); 46#L12 assume 1 == main_~i~0#1;main_~up~0#1 := 1; 37#L12-2 assume 10 == main_~i~0#1;main_~up~0#1 := 0; 38#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 44#L18-1 [2021-12-16 09:21:39,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:21:39,525 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2021-12-16 09:21:39,526 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:21:39,526 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421285647] [2021-12-16 09:21:39,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:21:39,526 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:21:39,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:21:39,530 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 09:21:39,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:21:39,532 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-16 09:21:39,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:21:39,532 INFO L85 PathProgramCache]: Analyzing trace with hash 1265324, now seen corresponding path program 1 times [2021-12-16 09:21:39,532 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:21:39,533 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267317417] [2021-12-16 09:21:39,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:21:39,533 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:21:39,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:21:39,550 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-16 09:21:39,551 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 09:21:39,551 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267317417] [2021-12-16 09:21:39,551 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1267317417] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 09:21:39,551 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 09:21:39,551 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-16 09:21:39,552 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386552487] [2021-12-16 09:21:39,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 09:21:39,552 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-16 09:21:39,553 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 09:21:39,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-16 09:21:39,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-16 09:21:39,554 INFO L87 Difference]: Start difference. First operand 10 states and 15 transitions. cyclomatic complexity: 6 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-16 09:21:39,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 09:21:39,571 INFO L93 Difference]: Finished difference Result 14 states and 21 transitions. [2021-12-16 09:21:39,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-16 09:21:39,573 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 21 transitions. [2021-12-16 09:21:39,574 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2021-12-16 09:21:39,575 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 14 states and 21 transitions. [2021-12-16 09:21:39,575 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2021-12-16 09:21:39,576 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2021-12-16 09:21:39,576 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 21 transitions. [2021-12-16 09:21:39,576 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-16 09:21:39,576 INFO L681 BuchiCegarLoop]: Abstraction has 14 states and 21 transitions. [2021-12-16 09:21:39,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 21 transitions. [2021-12-16 09:21:39,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2021-12-16 09:21:39,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.5) internal successors, (21), 13 states have internal predecessors, (21), 0 states have call successors, (0), 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-16 09:21:39,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 21 transitions. [2021-12-16 09:21:39,579 INFO L704 BuchiCegarLoop]: Abstraction has 14 states and 21 transitions. [2021-12-16 09:21:39,579 INFO L587 BuchiCegarLoop]: Abstraction has 14 states and 21 transitions. [2021-12-16 09:21:39,579 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-12-16 09:21:39,580 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 21 transitions. [2021-12-16 09:21:39,580 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2021-12-16 09:21:39,580 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-16 09:21:39,580 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-16 09:21:39,581 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-16 09:21:39,581 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2021-12-16 09:21:39,581 INFO L791 eck$LassoCheckResult]: Stem: 69#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 70#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~up~0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~up~0#1 := 0; 74#L18-1 [2021-12-16 09:21:39,581 INFO L793 eck$LassoCheckResult]: Loop: 74#L18-1 assume !!(main_~i~0#1 > 0); 80#L12 assume !(1 == main_~i~0#1); 79#L12-2 assume 10 == main_~i~0#1;main_~up~0#1 := 0; 73#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 74#L18-1 [2021-12-16 09:21:39,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:21:39,582 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2021-12-16 09:21:39,582 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:21:39,583 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568533184] [2021-12-16 09:21:39,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:21:39,583 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:21:39,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:21:39,586 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 09:21:39,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:21:39,595 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-16 09:21:39,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:21:39,596 INFO L85 PathProgramCache]: Analyzing trace with hash 1267246, now seen corresponding path program 1 times [2021-12-16 09:21:39,597 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:21:39,597 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402018938] [2021-12-16 09:21:39,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:21:39,597 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:21:39,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:21:39,607 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 09:21:39,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:21:39,615 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-16 09:21:39,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:21:39,617 INFO L85 PathProgramCache]: Analyzing trace with hash 889694448, now seen corresponding path program 1 times [2021-12-16 09:21:39,617 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:21:39,617 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218619392] [2021-12-16 09:21:39,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:21:39,618 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:21:39,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:21:39,625 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 09:21:39,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:21:39,629 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-16 09:21:39,672 INFO L210 LassoAnalysis]: Preferences: [2021-12-16 09:21:39,673 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-16 09:21:39,673 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-16 09:21:39,673 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-16 09:21:39,673 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2021-12-16 09:21:39,674 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:21:39,674 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-16 09:21:39,674 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-16 09:21:39,674 INFO L133 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration3_Loop [2021-12-16 09:21:39,674 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-16 09:21:39,674 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-16 09:21:39,688 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-16 09:21:39,694 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-16 09:21:39,697 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-16 09:21:39,702 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-16 09:21:39,758 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-16 09:21:39,759 INFO L404 LassoAnalysis]: Checking for nontermination... [2021-12-16 09:21:39,761 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:21:39,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:21:39,762 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-16 09:21:39,768 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-12-16 09:21:39,768 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-16 09:21:39,780 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-16 09:21:39,798 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-12-16 09:21:39,798 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-16 09:21:39,823 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-16 09:21:39,823 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:21:39,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:21:39,825 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-16 09:21:39,827 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-16 09:21:39,828 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-12-16 09:21:39,828 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-16 09:21:39,847 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-12-16 09:21:39,848 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-16 09:21:39,875 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-16 09:21:39,875 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:21:39,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:21:39,877 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-16 09:21:39,886 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-12-16 09:21:39,886 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-16 09:21:39,896 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-16 09:21:39,925 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2021-12-16 09:21:39,926 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:21:39,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:21:39,927 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-16 09:21:39,931 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-16 09:21:39,932 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2021-12-16 09:21:39,932 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-16 09:21:39,955 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2021-12-16 09:21:39,979 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2021-12-16 09:21:39,980 INFO L210 LassoAnalysis]: Preferences: [2021-12-16 09:21:39,980 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-16 09:21:39,980 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-16 09:21:39,980 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-16 09:21:39,980 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-16 09:21:39,980 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:21:39,980 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-16 09:21:39,980 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-16 09:21:39,980 INFO L133 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration3_Loop [2021-12-16 09:21:39,980 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-16 09:21:39,980 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-16 09:21:39,982 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-16 09:21:39,987 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-16 09:21:39,992 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-16 09:21:39,996 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-16 09:21:40,064 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-16 09:21:40,069 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-16 09:21:40,070 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:21:40,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:21:40,072 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-16 09:21:40,108 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-16 09:21:40,115 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:21:40,116 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 09:21:40,116 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:21:40,116 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:21:40,116 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 09:21:40,122 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-16 09:21:40,122 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 09:21:40,126 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-16 09:21:40,135 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:21:40,149 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2021-12-16 09:21:40,150 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:21:40,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:21:40,151 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-16 09:21:40,152 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-16 09:21:40,153 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-16 09:21:40,158 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:21:40,158 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:21:40,158 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:21:40,159 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 09:21:40,162 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-16 09:21:40,162 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-16 09:21:40,183 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:21:40,207 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-16 09:21:40,208 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:21:40,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:21:40,209 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-16 09:21:40,218 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-16 09:21:40,225 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:21:40,225 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:21:40,225 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:21:40,225 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 09:21:40,228 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-16 09:21:40,228 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-16 09:21:40,232 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-16 09:21:40,247 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:21:40,272 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-16 09:21:40,272 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:21:40,272 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:21:40,274 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-16 09:21:40,275 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-16 09:21:40,280 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-16 09:21:40,286 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:21:40,286 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 09:21:40,286 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:21:40,286 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:21:40,286 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 09:21:40,289 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-16 09:21:40,289 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 09:21:40,300 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-16 09:21:40,302 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2021-12-16 09:21:40,302 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2021-12-16 09:21:40,303 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:21:40,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:21:40,306 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:21:40,307 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2021-12-16 09:21:40,336 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-16 09:21:40,336 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2021-12-16 09:21:40,336 INFO L513 LassoAnalysis]: Proved termination. [2021-12-16 09:21:40,336 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-16 09:21:40,353 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-16 09:21:40,355 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2021-12-16 09:21:40,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:21:40,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:21:40,377 INFO L263 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-16 09:21:40,377 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 09:21:40,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:21:40,388 INFO L263 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-16 09:21:40,388 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 09:21:40,413 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-16 09:21:40,416 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-16 09:21:40,416 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states and 21 transitions. cyclomatic complexity: 8 Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 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-16 09:21:40,449 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 14 states and 21 transitions. cyclomatic complexity: 8. Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 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 35 states and 51 transitions. Complement of second has 7 states. [2021-12-16 09:21:40,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2021-12-16 09:21:40,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 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-16 09:21:40,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 10 transitions. [2021-12-16 09:21:40,452 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 2 letters. Loop has 4 letters. [2021-12-16 09:21:40,453 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-16 09:21:40,453 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 6 letters. Loop has 4 letters. [2021-12-16 09:21:40,453 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-16 09:21:40,454 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 2 letters. Loop has 8 letters. [2021-12-16 09:21:40,454 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-16 09:21:40,454 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 51 transitions. [2021-12-16 09:21:40,456 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 20 [2021-12-16 09:21:40,456 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 30 states and 44 transitions. [2021-12-16 09:21:40,457 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2021-12-16 09:21:40,457 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2021-12-16 09:21:40,457 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 44 transitions. [2021-12-16 09:21:40,457 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-16 09:21:40,457 INFO L681 BuchiCegarLoop]: Abstraction has 30 states and 44 transitions. [2021-12-16 09:21:40,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 44 transitions. [2021-12-16 09:21:40,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 25. [2021-12-16 09:21:40,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.44) internal successors, (36), 24 states have internal predecessors, (36), 0 states have call successors, (0), 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-16 09:21:40,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 36 transitions. [2021-12-16 09:21:40,460 INFO L704 BuchiCegarLoop]: Abstraction has 25 states and 36 transitions. [2021-12-16 09:21:40,461 INFO L587 BuchiCegarLoop]: Abstraction has 25 states and 36 transitions. [2021-12-16 09:21:40,461 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-12-16 09:21:40,461 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 36 transitions. [2021-12-16 09:21:40,462 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 16 [2021-12-16 09:21:40,462 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-16 09:21:40,462 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-16 09:21:40,462 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2021-12-16 09:21:40,462 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2021-12-16 09:21:40,462 INFO L791 eck$LassoCheckResult]: Stem: 167#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 168#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~up~0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~up~0#1 := 0; 170#L18-1 assume !!(main_~i~0#1 > 0); 164#L12 [2021-12-16 09:21:40,463 INFO L793 eck$LassoCheckResult]: Loop: 164#L12 assume !(1 == main_~i~0#1); 180#L12-2 assume !(10 == main_~i~0#1); 169#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 163#L18-1 assume !!(main_~i~0#1 > 0); 164#L12 [2021-12-16 09:21:40,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:21:40,463 INFO L85 PathProgramCache]: Analyzing trace with hash 29864, now seen corresponding path program 1 times [2021-12-16 09:21:40,463 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:21:40,464 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910239999] [2021-12-16 09:21:40,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:21:40,464 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:21:40,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:21:40,467 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 09:21:40,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:21:40,469 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-16 09:21:40,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:21:40,470 INFO L85 PathProgramCache]: Analyzing trace with hash 1422198, now seen corresponding path program 1 times [2021-12-16 09:21:40,470 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:21:40,470 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434851693] [2021-12-16 09:21:40,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:21:40,470 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:21:40,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:21:40,474 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 09:21:40,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:21:40,477 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-16 09:21:40,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:21:40,477 INFO L85 PathProgramCache]: Analyzing trace with hash 1810726045, now seen corresponding path program 1 times [2021-12-16 09:21:40,478 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:21:40,478 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544416064] [2021-12-16 09:21:40,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:21:40,478 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:21:40,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:21:40,482 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 09:21:40,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:21:40,485 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-16 09:21:40,512 INFO L210 LassoAnalysis]: Preferences: [2021-12-16 09:21:40,513 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-16 09:21:40,513 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-16 09:21:40,513 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-16 09:21:40,513 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2021-12-16 09:21:40,513 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:21:40,513 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-16 09:21:40,513 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-16 09:21:40,513 INFO L133 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration4_Loop [2021-12-16 09:21:40,514 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-16 09:21:40,514 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-16 09:21:40,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-16 09:21:40,517 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-16 09:21:40,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-16 09:21:40,526 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-16 09:21:40,586 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-16 09:21:40,587 INFO L404 LassoAnalysis]: Checking for nontermination... [2021-12-16 09:21:40,587 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:21:40,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:21:40,592 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-16 09:21:40,596 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-12-16 09:21:40,596 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-16 09:21:40,611 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-16 09:21:40,619 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-12-16 09:21:40,619 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-16 09:21:40,645 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-16 09:21:40,645 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:21:40,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:21:40,648 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-16 09:21:40,654 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-12-16 09:21:40,654 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-16 09:21:40,664 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-16 09:21:40,708 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-16 09:21:40,709 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:21:40,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:21:40,710 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-16 09:21:40,713 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2021-12-16 09:21:40,713 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-16 09:21:40,735 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-16 09:21:40,808 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2021-12-16 09:21:40,814 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-16 09:21:40,814 INFO L210 LassoAnalysis]: Preferences: [2021-12-16 09:21:40,814 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-16 09:21:40,814 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-16 09:21:40,814 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-16 09:21:40,814 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-16 09:21:40,814 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:21:40,814 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-16 09:21:40,814 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-16 09:21:40,815 INFO L133 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration4_Loop [2021-12-16 09:21:40,815 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-16 09:21:40,815 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-16 09:21:40,816 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-16 09:21:40,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-16 09:21:40,832 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-16 09:21:40,835 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:21:40,908 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-16 09:21:40,908 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-16 09:21:40,908 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:21:40,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:21:40,909 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-16 09:21:40,911 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-16 09:21:40,912 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-16 09:21:40,919 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:21:40,919 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:21:40,919 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:21:40,919 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 09:21:40,923 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-16 09:21:40,923 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-16 09:21:40,939 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:21:40,964 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-16 09:21:40,964 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:21:40,964 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:21:40,966 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-16 09:21:40,967 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-16 09:21:40,968 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-16 09:21:40,974 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:21:40,975 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 09:21:40,975 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:21:40,975 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2021-12-16 09:21:40,975 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 09:21:40,977 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2021-12-16 09:21:40,977 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 09:21:40,999 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-16 09:21:41,002 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2021-12-16 09:21:41,002 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2021-12-16 09:21:41,002 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:21:41,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:21:41,008 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-16 09:21:41,010 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-16 09:21:41,011 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-16 09:21:41,011 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2021-12-16 09:21:41,011 INFO L513 LassoAnalysis]: Proved termination. [2021-12-16 09:21:41,011 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-16 09:21:41,030 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2021-12-16 09:21:41,031 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2021-12-16 09:21:41,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:21:41,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:21:41,049 INFO L263 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-16 09:21:41,050 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 09:21:41,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:21:41,059 WARN L261 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-16 09:21:41,059 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 09:21:41,103 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-16 09:21:41,104 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-16 09:21:41,104 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 36 transitions. cyclomatic complexity: 14 Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 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-16 09:21:41,136 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 36 transitions. cyclomatic complexity: 14. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 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 41 states and 59 transitions. Complement of second has 7 states. [2021-12-16 09:21:41,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2021-12-16 09:21:41,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 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-16 09:21:41,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 9 transitions. [2021-12-16 09:21:41,139 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 3 letters. Loop has 4 letters. [2021-12-16 09:21:41,139 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-16 09:21:41,139 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 7 letters. Loop has 4 letters. [2021-12-16 09:21:41,140 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-16 09:21:41,140 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 3 letters. Loop has 8 letters. [2021-12-16 09:21:41,141 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-16 09:21:41,142 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 59 transitions. [2021-12-16 09:21:41,145 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2021-12-16 09:21:41,148 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 32 states and 49 transitions. [2021-12-16 09:21:41,148 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2021-12-16 09:21:41,148 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2021-12-16 09:21:41,148 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 49 transitions. [2021-12-16 09:21:41,148 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-16 09:21:41,149 INFO L681 BuchiCegarLoop]: Abstraction has 32 states and 49 transitions. [2021-12-16 09:21:41,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 49 transitions. [2021-12-16 09:21:41,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2021-12-16 09:21:41,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 32 states have (on average 1.53125) internal successors, (49), 31 states have internal predecessors, (49), 0 states have call successors, (0), 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-16 09:21:41,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 49 transitions. [2021-12-16 09:21:41,158 INFO L704 BuchiCegarLoop]: Abstraction has 32 states and 49 transitions. [2021-12-16 09:21:41,158 INFO L587 BuchiCegarLoop]: Abstraction has 32 states and 49 transitions. [2021-12-16 09:21:41,158 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2021-12-16 09:21:41,158 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 49 transitions. [2021-12-16 09:21:41,160 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2021-12-16 09:21:41,160 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-16 09:21:41,160 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-16 09:21:41,160 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2021-12-16 09:21:41,160 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2021-12-16 09:21:41,161 INFO L791 eck$LassoCheckResult]: Stem: 277#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 278#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~up~0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~up~0#1 := 0; 281#L18-1 assume !!(main_~i~0#1 > 0); 284#L12 assume 1 == main_~i~0#1;main_~up~0#1 := 1; 286#L12-2 assume !(10 == main_~i~0#1); 291#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 292#L18-1 [2021-12-16 09:21:41,161 INFO L793 eck$LassoCheckResult]: Loop: 292#L18-1 assume !!(main_~i~0#1 > 0); 299#L12 assume !(1 == main_~i~0#1); 293#L12-2 assume !(10 == main_~i~0#1); 294#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 292#L18-1 [2021-12-16 09:21:41,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:21:41,161 INFO L85 PathProgramCache]: Analyzing trace with hash 889692586, now seen corresponding path program 1 times [2021-12-16 09:21:41,161 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:21:41,161 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901252574] [2021-12-16 09:21:41,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:21:41,162 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:21:41,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:21:41,172 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 09:21:41,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:21:41,182 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-16 09:21:41,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:21:41,183 INFO L85 PathProgramCache]: Analyzing trace with hash 1267306, now seen corresponding path program 1 times [2021-12-16 09:21:41,183 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:21:41,183 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824763656] [2021-12-16 09:21:41,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:21:41,183 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:21:41,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:21:41,191 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 09:21:41,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:21:41,193 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-16 09:21:41,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:21:41,194 INFO L85 PathProgramCache]: Analyzing trace with hash 1068497811, now seen corresponding path program 1 times [2021-12-16 09:21:41,194 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:21:41,194 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654150320] [2021-12-16 09:21:41,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:21:41,194 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:21:41,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:21:41,198 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 09:21:41,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:21:41,210 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-16 09:21:41,238 INFO L210 LassoAnalysis]: Preferences: [2021-12-16 09:21:41,238 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-16 09:21:41,238 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-16 09:21:41,238 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-16 09:21:41,238 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2021-12-16 09:21:41,238 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:21:41,238 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-16 09:21:41,239 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-16 09:21:41,239 INFO L133 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration5_Loop [2021-12-16 09:21:41,239 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-16 09:21:41,239 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-16 09:21:41,242 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-16 09:21:41,245 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-16 09:21:41,247 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-16 09:21:41,254 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-16 09:21:41,350 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-16 09:21:41,350 INFO L404 LassoAnalysis]: Checking for nontermination... [2021-12-16 09:21:41,350 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:21:41,350 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:21:41,351 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:21:41,361 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-12-16 09:21:41,361 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-16 09:21:41,373 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2021-12-16 09:21:41,379 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-12-16 09:21:41,379 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_5=1} Honda state: {v_rep~unnamed0~0~true_5=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2021-12-16 09:21:41,402 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2021-12-16 09:21:41,403 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:21:41,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:21:41,404 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-16 09:21:41,405 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-16 09:21:41,407 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-12-16 09:21:41,407 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-16 09:21:41,414 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-12-16 09:21:41,414 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~up~0#1=1} Honda state: {ULTIMATE.start_main_~up~0#1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2021-12-16 09:21:41,429 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2021-12-16 09:21:41,429 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:21:41,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:21:41,430 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-16 09:21:41,431 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-16 09:21:41,435 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-12-16 09:21:41,435 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-16 09:21:41,455 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-16 09:21:41,456 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:21:41,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:21:41,457 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-16 09:21:41,460 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-16 09:21:41,461 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2021-12-16 09:21:41,463 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-16 09:21:41,488 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-12-16 09:21:41,488 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~i~0#1=11} Honda state: {ULTIMATE.start_main_~i~0#1=11} Generalized eigenvectors: [{ULTIMATE.start_main_~i~0#1=0}, {ULTIMATE.start_main_~i~0#1=0}, {ULTIMATE.start_main_~i~0#1=1}] Lambdas: [0, 0, 1] Nus: [0, 0] [2021-12-16 09:21:41,512 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-16 09:21:41,512 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:21:41,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:21:41,513 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-16 09:21:41,514 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-16 09:21:41,515 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-12-16 09:21:41,515 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-16 09:21:41,533 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-12-16 09:21:41,533 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_5=0} Honda state: {v_rep~unnamed0~0~false_5=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2021-12-16 09:21:41,557 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-16 09:21:41,585 INFO L210 LassoAnalysis]: Preferences: [2021-12-16 09:21:41,585 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-16 09:21:41,585 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-16 09:21:41,586 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-16 09:21:41,586 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2021-12-16 09:21:41,586 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:21:41,586 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-16 09:21:41,586 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-16 09:21:41,586 INFO L133 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration5_Lasso [2021-12-16 09:21:41,586 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-16 09:21:41,587 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-16 09:21:41,588 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:21:41,591 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:21:41,602 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-16 09:21:41,605 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-16 09:21:41,608 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-16 09:21:41,611 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-16 09:21:41,738 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2021-12-16 09:21:41,760 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-16 09:21:41,760 INFO L404 LassoAnalysis]: Checking for nontermination... [2021-12-16 09:21:41,760 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:21:41,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:21:41,772 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2021-12-16 09:21:41,772 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-16 09:21:41,776 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-12-16 09:21:41,776 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-16 09:21:41,779 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-16 09:21:41,783 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-12-16 09:21:41,783 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#res#1=0} Honda state: {ULTIMATE.start_main_#res#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2021-12-16 09:21:41,798 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-16 09:21:41,799 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:21:41,799 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:21:41,799 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-16 09:21:41,800 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-16 09:21:41,802 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-12-16 09:21:41,802 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-16 09:21:41,825 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2021-12-16 09:21:41,825 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:21:41,825 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:21:41,826 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-16 09:21:41,827 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-16 09:21:41,828 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2021-12-16 09:21:41,828 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-16 09:21:41,867 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2021-12-16 09:21:41,870 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-16 09:21:41,870 INFO L210 LassoAnalysis]: Preferences: [2021-12-16 09:21:41,871 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-16 09:21:41,871 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-16 09:21:41,871 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-16 09:21:41,871 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-16 09:21:41,871 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:21:41,871 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-16 09:21:41,871 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-16 09:21:41,871 INFO L133 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration5_Lasso [2021-12-16 09:21:41,871 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-16 09:21:41,871 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-16 09:21:41,872 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-16 09:21:41,875 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-16 09:21:41,884 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-16 09:21:41,889 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-16 09:21:41,892 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-16 09:21:41,894 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-16 09:21:42,029 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-16 09:21:42,029 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-16 09:21:42,029 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:21:42,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:21:42,051 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-16 09:21:42,076 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-16 09:21:42,078 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-16 09:21:42,084 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:21:42,084 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 09:21:42,085 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:21:42,085 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:21:42,085 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 09:21:42,085 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-16 09:21:42,085 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 09:21:42,100 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:21:42,124 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-16 09:21:42,124 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:21:42,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:21:42,125 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:21:42,127 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-16 09:21:42,133 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:21:42,134 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:21:42,134 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2021-12-16 09:21:42,134 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 09:21:42,140 INFO L401 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2021-12-16 09:21:42,140 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2021-12-16 09:21:42,154 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2021-12-16 09:21:42,167 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-16 09:21:42,181 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2021-12-16 09:21:42,181 INFO L444 ModelExtractionUtils]: 2 out of 11 variables were initially zero. Simplification set additionally 4 variables to zero. [2021-12-16 09:21:42,182 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:21:42,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:21:42,183 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-16 09:21:42,183 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-16 09:21:42,185 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-16 09:21:42,194 INFO L438 nArgumentSynthesizer]: Removed 3 redundant supporting invariants from a total of 4. [2021-12-16 09:21:42,194 INFO L513 LassoAnalysis]: Proved termination. [2021-12-16 09:21:42,194 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = -2*ULTIMATE.start_main_~i~0#1 + 21 Supporting invariants [-1*ULTIMATE.start_main_~i~0#1 + 10 >= 0] [2021-12-16 09:21:42,209 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2021-12-16 09:21:42,211 INFO L297 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2021-12-16 09:21:42,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:21:42,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:21:42,240 INFO L263 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-16 09:21:42,240 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 09:21:42,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:21:42,275 WARN L261 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-16 09:21:42,276 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 09:21:42,322 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-16 09:21:42,322 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2021-12-16 09:21:42,322 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 32 states and 49 transitions. cyclomatic complexity: 21 Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 09:21:42,389 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 32 states and 49 transitions. cyclomatic complexity: 21. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 46 states and 68 transitions. Complement of second has 8 states. [2021-12-16 09:21:42,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2021-12-16 09:21:42,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 09:21:42,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 21 transitions. [2021-12-16 09:21:42,391 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 6 letters. Loop has 4 letters. [2021-12-16 09:21:42,391 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-16 09:21:42,391 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 10 letters. Loop has 4 letters. [2021-12-16 09:21:42,392 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-16 09:21:42,392 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 6 letters. Loop has 8 letters. [2021-12-16 09:21:42,392 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-16 09:21:42,392 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 68 transitions. [2021-12-16 09:21:42,393 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2021-12-16 09:21:42,394 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 45 states and 67 transitions. [2021-12-16 09:21:42,394 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2021-12-16 09:21:42,394 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2021-12-16 09:21:42,394 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 67 transitions. [2021-12-16 09:21:42,394 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-16 09:21:42,394 INFO L681 BuchiCegarLoop]: Abstraction has 45 states and 67 transitions. [2021-12-16 09:21:42,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states and 67 transitions. [2021-12-16 09:21:42,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 42. [2021-12-16 09:21:42,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 42 states have (on average 1.5238095238095237) internal successors, (64), 41 states have internal predecessors, (64), 0 states have call successors, (0), 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-16 09:21:42,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 64 transitions. [2021-12-16 09:21:42,397 INFO L704 BuchiCegarLoop]: Abstraction has 42 states and 64 transitions. [2021-12-16 09:21:42,397 INFO L587 BuchiCegarLoop]: Abstraction has 42 states and 64 transitions. [2021-12-16 09:21:42,397 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2021-12-16 09:21:42,397 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 42 states and 64 transitions. [2021-12-16 09:21:42,398 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2021-12-16 09:21:42,398 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-16 09:21:42,398 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-16 09:21:42,398 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 09:21:42,398 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2021-12-16 09:21:42,399 INFO L791 eck$LassoCheckResult]: Stem: 421#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 422#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~up~0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~up~0#1 := 0; 426#L18-1 assume !!(main_~i~0#1 > 0); 435#L12 assume 1 == main_~i~0#1;main_~up~0#1 := 1; 432#L12-2 assume !(10 == main_~i~0#1); 431#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 430#L18-1 assume !!(main_~i~0#1 > 0); 427#L12 assume !(1 == main_~i~0#1); 428#L12-2 assume 10 == main_~i~0#1;main_~up~0#1 := 0; 452#L15-1 [2021-12-16 09:21:42,399 INFO L793 eck$LassoCheckResult]: Loop: 452#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 417#L18-1 assume !!(main_~i~0#1 > 0); 418#L12 assume !(1 == main_~i~0#1); 451#L12-2 assume 10 == main_~i~0#1;main_~up~0#1 := 0; 452#L15-1 [2021-12-16 09:21:42,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:21:42,399 INFO L85 PathProgramCache]: Analyzing trace with hash 588656997, now seen corresponding path program 1 times [2021-12-16 09:21:42,399 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:21:42,399 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104026127] [2021-12-16 09:21:42,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:21:42,400 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:21:42,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:21:42,420 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 09:21:42,420 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 09:21:42,420 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104026127] [2021-12-16 09:21:42,421 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1104026127] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 09:21:42,421 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1077347800] [2021-12-16 09:21:42,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:21:42,421 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 09:21:42,421 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:21:42,422 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-16 09:21:42,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:21:42,444 INFO L263 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-16 09:21:42,445 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 09:21:42,454 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2021-12-16 09:21:42,459 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 09:21:42,460 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 09:21:42,490 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 09:21:42,491 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1077347800] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-16 09:21:42,492 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-16 09:21:42,492 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2021-12-16 09:21:42,492 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846557293] [2021-12-16 09:21:42,492 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-16 09:21:42,492 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-16 09:21:42,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:21:42,493 INFO L85 PathProgramCache]: Analyzing trace with hash 1768756, now seen corresponding path program 2 times [2021-12-16 09:21:42,493 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:21:42,493 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090142719] [2021-12-16 09:21:42,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:21:42,493 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:21:42,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:21:42,503 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 09:21:42,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:21:42,511 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-16 09:21:42,536 INFO L210 LassoAnalysis]: Preferences: [2021-12-16 09:21:42,536 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-16 09:21:42,537 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-16 09:21:42,537 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-16 09:21:42,537 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2021-12-16 09:21:42,537 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:21:42,537 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-16 09:21:42,537 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-16 09:21:42,537 INFO L133 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration6_Loop [2021-12-16 09:21:42,537 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-16 09:21:42,537 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-16 09:21:42,539 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-16 09:21:42,543 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-16 09:21:42,546 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-16 09:21:42,548 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-16 09:21:42,594 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-16 09:21:42,594 INFO L404 LassoAnalysis]: Checking for nontermination... [2021-12-16 09:21:42,594 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:21:42,595 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:21:42,596 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-16 09:21:42,600 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-12-16 09:21:42,600 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-16 09:21:42,603 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-16 09:21:42,620 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-16 09:21:42,620 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:21:42,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:21:42,621 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-16 09:21:42,622 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-16 09:21:42,623 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2021-12-16 09:21:42,623 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-16 09:21:42,731 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2021-12-16 09:21:42,734 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0 [2021-12-16 09:21:42,734 INFO L210 LassoAnalysis]: Preferences: [2021-12-16 09:21:42,734 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-16 09:21:42,734 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-16 09:21:42,734 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-16 09:21:42,734 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-16 09:21:42,734 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:21:42,734 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-16 09:21:42,734 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-16 09:21:42,735 INFO L133 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration6_Loop [2021-12-16 09:21:42,735 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-16 09:21:42,735 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-16 09:21:42,735 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-16 09:21:42,741 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-16 09:21:42,745 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-16 09:21:42,748 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-16 09:21:42,793 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-16 09:21:42,793 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-16 09:21:42,793 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:21:42,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:21:42,796 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-16 09:21:42,804 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-16 09:21:42,810 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:21:42,810 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 09:21:42,810 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:21:42,810 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:21:42,810 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 09:21:42,811 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-16 09:21:42,812 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 09:21:42,819 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-16 09:21:42,826 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-16 09:21:42,828 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2021-12-16 09:21:42,829 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2021-12-16 09:21:42,829 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:21:42,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:21:42,830 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-16 09:21:42,832 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-16 09:21:42,832 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-16 09:21:42,832 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2021-12-16 09:21:42,832 INFO L513 LassoAnalysis]: Proved termination. [2021-12-16 09:21:42,832 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-16 09:21:42,858 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-16 09:21:42,858 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2021-12-16 09:21:42,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:21:42,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:21:42,875 INFO L263 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-16 09:21:42,875 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 09:21:42,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:21:42,896 INFO L263 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-16 09:21:42,897 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 09:21:42,915 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-16 09:21:42,916 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-16 09:21:42,916 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 42 states and 64 transitions. cyclomatic complexity: 27 Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 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-16 09:21:42,947 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 42 states and 64 transitions. cyclomatic complexity: 27. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 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 105 states and 160 transitions. Complement of second has 7 states. [2021-12-16 09:21:42,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2021-12-16 09:21:42,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 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-16 09:21:42,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2021-12-16 09:21:42,949 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 9 letters. Loop has 4 letters. [2021-12-16 09:21:42,949 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-16 09:21:42,949 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 13 letters. Loop has 4 letters. [2021-12-16 09:21:42,949 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-16 09:21:42,949 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 9 letters. Loop has 8 letters. [2021-12-16 09:21:42,951 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-16 09:21:42,952 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 105 states and 160 transitions. [2021-12-16 09:21:42,957 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2021-12-16 09:21:42,960 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 105 states to 87 states and 133 transitions. [2021-12-16 09:21:42,961 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 42 [2021-12-16 09:21:42,961 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 44 [2021-12-16 09:21:42,961 INFO L73 IsDeterministic]: Start isDeterministic. Operand 87 states and 133 transitions. [2021-12-16 09:21:42,962 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-16 09:21:42,962 INFO L681 BuchiCegarLoop]: Abstraction has 87 states and 133 transitions. [2021-12-16 09:21:42,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states and 133 transitions. [2021-12-16 09:21:42,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 82. [2021-12-16 09:21:42,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 82 states have (on average 1.548780487804878) internal successors, (127), 81 states have internal predecessors, (127), 0 states have call successors, (0), 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-16 09:21:42,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 127 transitions. [2021-12-16 09:21:42,968 INFO L704 BuchiCegarLoop]: Abstraction has 82 states and 127 transitions. [2021-12-16 09:21:42,968 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 09:21:42,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-16 09:21:42,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-12-16 09:21:42,969 INFO L87 Difference]: Start difference. First operand 82 states and 127 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 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-16 09:21:43,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 09:21:43,011 INFO L93 Difference]: Finished difference Result 160 states and 239 transitions. [2021-12-16 09:21:43,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-16 09:21:43,012 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 160 states and 239 transitions. [2021-12-16 09:21:43,015 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 52 [2021-12-16 09:21:43,016 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 160 states to 160 states and 239 transitions. [2021-12-16 09:21:43,017 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 94 [2021-12-16 09:21:43,017 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 94 [2021-12-16 09:21:43,018 INFO L73 IsDeterministic]: Start isDeterministic. Operand 160 states and 239 transitions. [2021-12-16 09:21:43,018 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-16 09:21:43,018 INFO L681 BuchiCegarLoop]: Abstraction has 160 states and 239 transitions. [2021-12-16 09:21:43,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states and 239 transitions. [2021-12-16 09:21:43,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 136. [2021-12-16 09:21:43,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 136 states have (on average 1.5220588235294117) internal successors, (207), 135 states have internal predecessors, (207), 0 states have call successors, (0), 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-16 09:21:43,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 207 transitions. [2021-12-16 09:21:43,036 INFO L704 BuchiCegarLoop]: Abstraction has 136 states and 207 transitions. [2021-12-16 09:21:43,036 INFO L587 BuchiCegarLoop]: Abstraction has 136 states and 207 transitions. [2021-12-16 09:21:43,036 INFO L425 BuchiCegarLoop]: ======== Iteration 7============ [2021-12-16 09:21:43,036 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 136 states and 207 transitions. [2021-12-16 09:21:43,037 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 44 [2021-12-16 09:21:43,037 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-16 09:21:43,037 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-16 09:21:43,037 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1] [2021-12-16 09:21:43,037 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2021-12-16 09:21:43,038 INFO L791 eck$LassoCheckResult]: Stem: 924#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 925#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~up~0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~up~0#1 := 0; 928#L18-1 assume !!(main_~i~0#1 > 0); 942#L12 assume 1 == main_~i~0#1;main_~up~0#1 := 1; 938#L12-2 assume !(10 == main_~i~0#1); 933#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 934#L18-1 assume !!(main_~i~0#1 > 0); 1009#L12 assume 1 == main_~i~0#1;main_~up~0#1 := 1; 972#L12-2 assume !(10 == main_~i~0#1); 1014#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 990#L18-1 [2021-12-16 09:21:43,038 INFO L793 eck$LassoCheckResult]: Loop: 990#L18-1 assume !!(main_~i~0#1 > 0); 1000#L12 assume !(1 == main_~i~0#1); 983#L12-2 assume !(10 == main_~i~0#1); 995#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 990#L18-1 [2021-12-16 09:21:43,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:21:43,038 INFO L85 PathProgramCache]: Analyzing trace with hash 1068495891, now seen corresponding path program 1 times [2021-12-16 09:21:43,038 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:21:43,038 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578021976] [2021-12-16 09:21:43,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:21:43,039 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:21:43,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:21:43,067 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 09:21:43,068 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 09:21:43,068 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578021976] [2021-12-16 09:21:43,068 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1578021976] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 09:21:43,068 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 09:21:43,068 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-16 09:21:43,068 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876770248] [2021-12-16 09:21:43,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 09:21:43,068 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-16 09:21:43,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:21:43,069 INFO L85 PathProgramCache]: Analyzing trace with hash 1267308, now seen corresponding path program 2 times [2021-12-16 09:21:43,069 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:21:43,069 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598771387] [2021-12-16 09:21:43,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:21:43,069 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:21:43,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:21:43,072 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 09:21:43,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:21:43,074 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-16 09:21:43,093 INFO L210 LassoAnalysis]: Preferences: [2021-12-16 09:21:43,094 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-16 09:21:43,094 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-16 09:21:43,094 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-16 09:21:43,094 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2021-12-16 09:21:43,094 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:21:43,094 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-16 09:21:43,094 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-16 09:21:43,094 INFO L133 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration7_Loop [2021-12-16 09:21:43,094 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-16 09:21:43,094 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-16 09:21:43,095 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-16 09:21:43,100 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-16 09:21:43,102 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-16 09:21:43,104 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-16 09:21:43,182 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-16 09:21:43,204 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2021-12-16 09:21:43,211 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-16 09:21:43,212 INFO L404 LassoAnalysis]: Checking for nontermination... [2021-12-16 09:21:43,212 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:21:43,212 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:21:43,212 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-16 09:21:43,213 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-16 09:21:43,214 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-12-16 09:21:43,214 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-16 09:21:43,264 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-16 09:21:43,264 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:21:43,265 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:21:43,265 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-16 09:21:43,267 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-16 09:21:43,268 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2021-12-16 09:21:43,268 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-16 09:21:43,298 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2021-12-16 09:21:43,300 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-16 09:21:43,300 INFO L210 LassoAnalysis]: Preferences: [2021-12-16 09:21:43,301 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-16 09:21:43,301 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-16 09:21:43,301 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-16 09:21:43,301 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-16 09:21:43,301 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:21:43,301 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-16 09:21:43,301 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-16 09:21:43,301 INFO L133 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration7_Loop [2021-12-16 09:21:43,301 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-16 09:21:43,301 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-16 09:21:43,302 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-16 09:21:43,311 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-16 09:21:43,313 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-16 09:21:43,315 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-16 09:21:43,393 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-16 09:21:43,393 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-16 09:21:43,393 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:21:43,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:21:43,396 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:21:43,397 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2021-12-16 09:21:43,398 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-16 09:21:43,404 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:21:43,405 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 09:21:43,405 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:21:43,405 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2021-12-16 09:21:43,405 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 09:21:43,406 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2021-12-16 09:21:43,406 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 09:21:43,421 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-16 09:21:43,424 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2021-12-16 09:21:43,424 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2021-12-16 09:21:43,424 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:21:43,424 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:21:43,428 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:21:43,435 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-16 09:21:43,435 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2021-12-16 09:21:43,435 INFO L513 LassoAnalysis]: Proved termination. [2021-12-16 09:21:43,436 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-16 09:21:43,455 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2021-12-16 09:21:43,459 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Forceful destruction successful, exit code 0 [2021-12-16 09:21:43,459 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2021-12-16 09:21:43,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:21:43,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:21:43,474 INFO L263 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-16 09:21:43,475 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 09:21:43,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:21:43,502 WARN L261 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-16 09:21:43,502 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 09:21:43,524 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-16 09:21:43,525 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-16 09:21:43,525 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 136 states and 207 transitions. cyclomatic complexity: 82 Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 09:21:43,547 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 136 states and 207 transitions. cyclomatic complexity: 82. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 248 states and 381 transitions. Complement of second has 5 states. [2021-12-16 09:21:43,547 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-16 09:21:43,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 09:21:43,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 15 transitions. [2021-12-16 09:21:43,552 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 10 letters. Loop has 4 letters. [2021-12-16 09:21:43,552 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-16 09:21:43,552 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 14 letters. Loop has 4 letters. [2021-12-16 09:21:43,553 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-16 09:21:43,553 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 10 letters. Loop has 8 letters. [2021-12-16 09:21:43,553 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-16 09:21:43,553 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 248 states and 381 transitions. [2021-12-16 09:21:43,557 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 44 [2021-12-16 09:21:43,558 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 248 states to 224 states and 333 transitions. [2021-12-16 09:21:43,558 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 101 [2021-12-16 09:21:43,560 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 112 [2021-12-16 09:21:43,560 INFO L73 IsDeterministic]: Start isDeterministic. Operand 224 states and 333 transitions. [2021-12-16 09:21:43,560 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-16 09:21:43,560 INFO L681 BuchiCegarLoop]: Abstraction has 224 states and 333 transitions. [2021-12-16 09:21:43,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states and 333 transitions. [2021-12-16 09:21:43,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 202. [2021-12-16 09:21:43,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 202 states have (on average 1.504950495049505) internal successors, (304), 201 states have internal predecessors, (304), 0 states have call successors, (0), 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-16 09:21:43,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 304 transitions. [2021-12-16 09:21:43,566 INFO L704 BuchiCegarLoop]: Abstraction has 202 states and 304 transitions. [2021-12-16 09:21:43,567 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 09:21:43,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-16 09:21:43,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-16 09:21:43,567 INFO L87 Difference]: Start difference. First operand 202 states and 304 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 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-16 09:21:43,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 09:21:43,584 INFO L93 Difference]: Finished difference Result 230 states and 313 transitions. [2021-12-16 09:21:43,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-16 09:21:43,585 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 230 states and 313 transitions. [2021-12-16 09:21:43,587 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 58 [2021-12-16 09:21:43,588 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 230 states to 230 states and 313 transitions. [2021-12-16 09:21:43,588 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 129 [2021-12-16 09:21:43,589 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 129 [2021-12-16 09:21:43,589 INFO L73 IsDeterministic]: Start isDeterministic. Operand 230 states and 313 transitions. [2021-12-16 09:21:43,589 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-16 09:21:43,589 INFO L681 BuchiCegarLoop]: Abstraction has 230 states and 313 transitions. [2021-12-16 09:21:43,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states and 313 transitions. [2021-12-16 09:21:43,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 201. [2021-12-16 09:21:43,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 201 states have (on average 1.3830845771144278) internal successors, (278), 200 states have internal predecessors, (278), 0 states have call successors, (0), 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-16 09:21:43,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 278 transitions. [2021-12-16 09:21:43,595 INFO L704 BuchiCegarLoop]: Abstraction has 201 states and 278 transitions. [2021-12-16 09:21:43,595 INFO L587 BuchiCegarLoop]: Abstraction has 201 states and 278 transitions. [2021-12-16 09:21:43,595 INFO L425 BuchiCegarLoop]: ======== Iteration 8============ [2021-12-16 09:21:43,595 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 201 states and 278 transitions. [2021-12-16 09:21:43,596 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 52 [2021-12-16 09:21:43,596 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-16 09:21:43,596 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-16 09:21:43,597 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 1, 1, 1, 1] [2021-12-16 09:21:43,597 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2021-12-16 09:21:43,597 INFO L791 eck$LassoCheckResult]: Stem: 1798#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 1799#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~up~0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~up~0#1 := 0; 1808#L18-1 assume !!(main_~i~0#1 > 0); 1828#L12 assume !(1 == main_~i~0#1); 1829#L12-2 assume !(10 == main_~i~0#1); 1845#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 1846#L18-1 assume !!(main_~i~0#1 > 0); 1902#L12 assume 1 == main_~i~0#1;main_~up~0#1 := 1; 1835#L12-2 assume !(10 == main_~i~0#1); 1836#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 1893#L18-1 assume !!(main_~i~0#1 > 0); 1894#L12 assume !(1 == main_~i~0#1); 1949#L12-2 assume !(10 == main_~i~0#1); 1948#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 1929#L18-1 [2021-12-16 09:21:43,597 INFO L793 eck$LassoCheckResult]: Loop: 1929#L18-1 assume !!(main_~i~0#1 > 0); 1944#L12 assume !(1 == main_~i~0#1); 1945#L12-2 assume !(10 == main_~i~0#1); 1947#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 1929#L18-1 [2021-12-16 09:21:43,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:21:43,598 INFO L85 PathProgramCache]: Analyzing trace with hash -1847785984, now seen corresponding path program 1 times [2021-12-16 09:21:43,598 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:21:43,598 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786084903] [2021-12-16 09:21:43,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:21:43,598 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:21:43,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:21:43,611 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-16 09:21:43,611 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 09:21:43,611 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786084903] [2021-12-16 09:21:43,612 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [786084903] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 09:21:43,612 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 09:21:43,612 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-16 09:21:43,612 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532725639] [2021-12-16 09:21:43,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 09:21:43,612 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-16 09:21:43,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:21:43,613 INFO L85 PathProgramCache]: Analyzing trace with hash 1267308, now seen corresponding path program 3 times [2021-12-16 09:21:43,613 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:21:43,613 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964758651] [2021-12-16 09:21:43,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:21:43,613 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:21:43,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:21:43,616 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 09:21:43,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:21:43,617 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-16 09:21:43,636 INFO L210 LassoAnalysis]: Preferences: [2021-12-16 09:21:43,637 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-16 09:21:43,637 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-16 09:21:43,637 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-16 09:21:43,637 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2021-12-16 09:21:43,637 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:21:43,637 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-16 09:21:43,637 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-16 09:21:43,637 INFO L133 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration8_Loop [2021-12-16 09:21:43,637 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-16 09:21:43,638 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-16 09:21:43,638 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-16 09:21:43,640 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-16 09:21:43,642 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-16 09:21:43,644 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-16 09:21:43,718 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-16 09:21:43,718 INFO L404 LassoAnalysis]: Checking for nontermination... [2021-12-16 09:21:43,718 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:21:43,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:21:43,720 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:21:43,732 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-12-16 09:21:43,732 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-16 09:21:43,744 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2021-12-16 09:21:43,757 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-12-16 09:21:43,757 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_12=1} Honda state: {v_rep~unnamed0~0~true_12=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2021-12-16 09:21:43,781 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Forceful destruction successful, exit code 0 [2021-12-16 09:21:43,781 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:21:43,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:21:43,782 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:21:43,788 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-12-16 09:21:43,788 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-16 09:21:43,800 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2021-12-16 09:21:43,815 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-12-16 09:21:43,816 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~up~0#1=4} Honda state: {ULTIMATE.start_main_~up~0#1=4} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2021-12-16 09:21:43,839 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Forceful destruction successful, exit code 0 [2021-12-16 09:21:43,840 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:21:43,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:21:43,840 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:21:43,841 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2021-12-16 09:21:43,843 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-12-16 09:21:43,843 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-16 09:21:43,863 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-12-16 09:21:43,864 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_12=0} Honda state: {v_rep~unnamed0~0~false_12=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2021-12-16 09:21:43,910 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Forceful destruction successful, exit code 0 [2021-12-16 09:21:43,910 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:21:43,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:21:43,911 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:21:43,916 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-12-16 09:21:43,916 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-16 09:21:43,924 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2021-12-16 09:21:43,958 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Ended with exit code 0 [2021-12-16 09:21:43,958 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:21:43,958 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:21:43,959 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:21:43,961 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2021-12-16 09:21:43,962 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2021-12-16 09:21:43,963 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-16 09:21:43,993 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2021-12-16 09:21:43,998 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Forceful destruction successful, exit code 0 [2021-12-16 09:21:43,998 INFO L210 LassoAnalysis]: Preferences: [2021-12-16 09:21:43,998 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-16 09:21:43,998 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-16 09:21:43,998 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-16 09:21:43,999 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-16 09:21:43,999 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:21:43,999 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-16 09:21:43,999 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-16 09:21:43,999 INFO L133 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration8_Loop [2021-12-16 09:21:43,999 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-16 09:21:43,999 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-16 09:21:43,999 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-16 09:21:44,001 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-16 09:21:44,005 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-16 09:21:44,006 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-16 09:21:44,086 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-16 09:21:44,086 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-16 09:21:44,086 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:21:44,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:21:44,088 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:21:44,096 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-16 09:21:44,104 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:21:44,104 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:21:44,104 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:21:44,104 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 09:21:44,109 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-16 09:21:44,109 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-16 09:21:44,112 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2021-12-16 09:21:44,120 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:21:44,135 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Ended with exit code 0 [2021-12-16 09:21:44,135 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:21:44,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:21:44,136 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-16 09:21:44,137 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2021-12-16 09:21:44,138 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-16 09:21:44,144 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:21:44,144 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 09:21:44,144 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:21:44,144 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2021-12-16 09:21:44,144 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 09:21:44,145 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2021-12-16 09:21:44,145 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 09:21:44,148 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:21:44,162 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Forceful destruction successful, exit code 0 [2021-12-16 09:21:44,163 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:21:44,163 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:21:44,163 INFO L229 MonitoredProcess]: Starting monitored process 44 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-16 09:21:44,164 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2021-12-16 09:21:44,165 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-16 09:21:44,171 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:21:44,171 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:21:44,171 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:21:44,171 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 09:21:44,173 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-16 09:21:44,173 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-16 09:21:44,183 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:21:44,197 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Ended with exit code 0 [2021-12-16 09:21:44,198 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:21:44,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:21:44,198 INFO L229 MonitoredProcess]: Starting monitored process 45 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-16 09:21:44,199 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2021-12-16 09:21:44,200 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-16 09:21:44,206 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:21:44,206 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 09:21:44,206 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:21:44,206 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2021-12-16 09:21:44,206 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 09:21:44,208 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2021-12-16 09:21:44,208 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 09:21:44,210 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-16 09:21:44,212 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2021-12-16 09:21:44,212 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2021-12-16 09:21:44,212 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:21:44,212 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:21:44,213 INFO L229 MonitoredProcess]: Starting monitored process 46 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-16 09:21:44,215 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2021-12-16 09:21:44,215 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-16 09:21:44,215 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2021-12-16 09:21:44,215 INFO L513 LassoAnalysis]: Proved termination. [2021-12-16 09:21:44,215 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-16 09:21:44,231 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Forceful destruction successful, exit code 0 [2021-12-16 09:21:44,231 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2021-12-16 09:21:44,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:21:44,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:21:44,258 INFO L263 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-16 09:21:44,259 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 09:21:44,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:21:44,298 WARN L261 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-16 09:21:44,299 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 09:21:44,324 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-16 09:21:44,325 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2021-12-16 09:21:44,325 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 201 states and 278 transitions. cyclomatic complexity: 94 Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 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-16 09:21:44,343 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 201 states and 278 transitions. cyclomatic complexity: 94. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 280 states and 401 transitions. Complement of second has 5 states. [2021-12-16 09:21:44,343 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-16 09:21:44,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 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-16 09:21:44,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 15 transitions. [2021-12-16 09:21:44,344 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 14 letters. Loop has 4 letters. [2021-12-16 09:21:44,344 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-16 09:21:44,344 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2021-12-16 09:21:44,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:21:44,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:21:44,361 INFO L263 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-16 09:21:44,362 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 09:21:44,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:21:44,386 WARN L261 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-16 09:21:44,386 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 09:21:44,409 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-16 09:21:44,410 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-16 09:21:44,410 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 201 states and 278 transitions. cyclomatic complexity: 94 Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 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-16 09:21:44,422 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 201 states and 278 transitions. cyclomatic complexity: 94. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 280 states and 401 transitions. Complement of second has 5 states. [2021-12-16 09:21:44,423 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-16 09:21:44,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 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-16 09:21:44,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 15 transitions. [2021-12-16 09:21:44,423 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 14 letters. Loop has 4 letters. [2021-12-16 09:21:44,424 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-16 09:21:44,424 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2021-12-16 09:21:44,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:21:44,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:21:44,437 INFO L263 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-16 09:21:44,437 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 09:21:44,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:21:44,463 WARN L261 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-16 09:21:44,463 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 09:21:44,489 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-16 09:21:44,490 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-16 09:21:44,490 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 201 states and 278 transitions. cyclomatic complexity: 94 Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 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-16 09:21:44,506 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 201 states and 278 transitions. cyclomatic complexity: 94. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 334 states and 496 transitions. Complement of second has 4 states. [2021-12-16 09:21:44,507 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-16 09:21:44,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 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-16 09:21:44,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 16 transitions. [2021-12-16 09:21:44,508 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 14 letters. Loop has 4 letters. [2021-12-16 09:21:44,509 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-16 09:21:44,510 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 18 letters. Loop has 4 letters. [2021-12-16 09:21:44,510 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-16 09:21:44,510 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 14 letters. Loop has 8 letters. [2021-12-16 09:21:44,511 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-16 09:21:44,511 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 334 states and 496 transitions. [2021-12-16 09:21:44,515 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 87 [2021-12-16 09:21:44,518 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 334 states to 268 states and 378 transitions. [2021-12-16 09:21:44,518 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 111 [2021-12-16 09:21:44,518 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 129 [2021-12-16 09:21:44,518 INFO L73 IsDeterministic]: Start isDeterministic. Operand 268 states and 378 transitions. [2021-12-16 09:21:44,518 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-16 09:21:44,518 INFO L681 BuchiCegarLoop]: Abstraction has 268 states and 378 transitions. [2021-12-16 09:21:44,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states and 378 transitions. [2021-12-16 09:21:44,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 167. [2021-12-16 09:21:44,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 167 states have (on average 1.401197604790419) internal successors, (234), 166 states have internal predecessors, (234), 0 states have call successors, (0), 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-16 09:21:44,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 234 transitions. [2021-12-16 09:21:44,526 INFO L704 BuchiCegarLoop]: Abstraction has 167 states and 234 transitions. [2021-12-16 09:21:44,526 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 09:21:44,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-16 09:21:44,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-16 09:21:44,526 INFO L87 Difference]: Start difference. First operand 167 states and 234 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 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-16 09:21:44,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 09:21:44,537 INFO L93 Difference]: Finished difference Result 101 states and 118 transitions. [2021-12-16 09:21:44,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-16 09:21:44,538 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 101 states and 118 transitions. [2021-12-16 09:21:44,539 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2021-12-16 09:21:44,539 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 101 states to 81 states and 94 transitions. [2021-12-16 09:21:44,539 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 39 [2021-12-16 09:21:44,539 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 39 [2021-12-16 09:21:44,539 INFO L73 IsDeterministic]: Start isDeterministic. Operand 81 states and 94 transitions. [2021-12-16 09:21:44,539 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-16 09:21:44,539 INFO L681 BuchiCegarLoop]: Abstraction has 81 states and 94 transitions. [2021-12-16 09:21:44,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states and 94 transitions. [2021-12-16 09:21:44,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 80. [2021-12-16 09:21:44,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 80 states have (on average 1.1625) internal successors, (93), 79 states have internal predecessors, (93), 0 states have call successors, (0), 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-16 09:21:44,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 93 transitions. [2021-12-16 09:21:44,541 INFO L704 BuchiCegarLoop]: Abstraction has 80 states and 93 transitions. [2021-12-16 09:21:44,541 INFO L587 BuchiCegarLoop]: Abstraction has 80 states and 93 transitions. [2021-12-16 09:21:44,541 INFO L425 BuchiCegarLoop]: ======== Iteration 9============ [2021-12-16 09:21:44,541 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 80 states and 93 transitions. [2021-12-16 09:21:44,541 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 24 [2021-12-16 09:21:44,542 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-16 09:21:44,542 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-16 09:21:44,543 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [6, 4, 4, 4, 1, 1, 1, 1, 1] [2021-12-16 09:21:44,543 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [5, 4, 4, 4, 1, 1, 1] [2021-12-16 09:21:44,543 INFO L791 eck$LassoCheckResult]: Stem: 3358#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 3359#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~up~0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~up~0#1 := 0; 3363#L18-1 assume !!(main_~i~0#1 > 0); 3389#L12 assume 1 == main_~i~0#1;main_~up~0#1 := 1; 3385#L12-2 assume !(10 == main_~i~0#1); 3384#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 3383#L18-1 assume !!(main_~i~0#1 > 0); 3382#L12 assume !(1 == main_~i~0#1); 3381#L12-2 assume !(10 == main_~i~0#1); 3380#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 3379#L18-1 assume !!(main_~i~0#1 > 0); 3378#L12 assume !(1 == main_~i~0#1); 3377#L12-2 assume !(10 == main_~i~0#1); 3376#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 3375#L18-1 assume !!(main_~i~0#1 > 0); 3372#L12 assume !(1 == main_~i~0#1); 3374#L12-2 assume !(10 == main_~i~0#1); 3373#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 3371#L18-1 assume !!(main_~i~0#1 > 0); 3370#L12 assume !(1 == main_~i~0#1); 3369#L12-2 assume 10 == main_~i~0#1;main_~up~0#1 := 0; 3360#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 3361#L18-1 assume !!(main_~i~0#1 > 0); 3422#L12 [2021-12-16 09:21:44,543 INFO L793 eck$LassoCheckResult]: Loop: 3422#L12 assume 1 == main_~i~0#1;main_~up~0#1 := 1; 3350#L12-2 assume !(10 == main_~i~0#1); 3351#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 3354#L18-1 assume !!(main_~i~0#1 > 0); 3355#L12 assume !(1 == main_~i~0#1); 3421#L12-2 assume !(10 == main_~i~0#1); 3420#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 3419#L18-1 assume !!(main_~i~0#1 > 0); 3418#L12 assume !(1 == main_~i~0#1); 3417#L12-2 assume !(10 == main_~i~0#1); 3416#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 3415#L18-1 assume !!(main_~i~0#1 > 0); 3414#L12 assume !(1 == main_~i~0#1); 3413#L12-2 assume !(10 == main_~i~0#1); 3398#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 3394#L18-1 assume !!(main_~i~0#1 > 0); 3387#L12 assume !(1 == main_~i~0#1); 3388#L12-2 assume 10 == main_~i~0#1;main_~up~0#1 := 0; 3366#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 3367#L18-1 assume !!(main_~i~0#1 > 0); 3422#L12 [2021-12-16 09:21:44,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:21:44,544 INFO L85 PathProgramCache]: Analyzing trace with hash 123757625, now seen corresponding path program 1 times [2021-12-16 09:21:44,544 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:21:44,544 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704085340] [2021-12-16 09:21:44,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:21:44,544 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:21:44,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:21:44,604 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 17 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 09:21:44,604 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 09:21:44,604 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704085340] [2021-12-16 09:21:44,604 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1704085340] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 09:21:44,605 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1997423425] [2021-12-16 09:21:44,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:21:44,605 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 09:21:44,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:21:44,606 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-16 09:21:44,632 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Waiting until timeout for monitored process [2021-12-16 09:21:44,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:21:44,637 INFO L263 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-16 09:21:44,638 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 09:21:44,679 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 17 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 09:21:44,679 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 09:21:44,778 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 17 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 09:21:44,778 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1997423425] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-16 09:21:44,778 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-16 09:21:44,778 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2021-12-16 09:21:44,778 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364265843] [2021-12-16 09:21:44,778 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-16 09:21:44,778 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-16 09:21:44,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:21:44,779 INFO L85 PathProgramCache]: Analyzing trace with hash -2141599470, now seen corresponding path program 1 times [2021-12-16 09:21:44,779 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:21:44,779 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710200480] [2021-12-16 09:21:44,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:21:44,779 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:21:44,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:21:44,796 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Forceful destruction successful, exit code 0 [2021-12-16 09:21:44,818 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Forceful destruction successful, exit code 0 [2021-12-16 09:21:44,836 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 12 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 09:21:44,837 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 09:21:44,837 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710200480] [2021-12-16 09:21:44,837 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [710200480] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 09:21:44,837 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1968272186] [2021-12-16 09:21:44,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:21:44,837 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 09:21:44,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:21:44,838 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-16 09:21:44,861 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Waiting until timeout for monitored process [2021-12-16 09:21:44,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:21:44,869 INFO L263 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-16 09:21:44,870 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 09:21:44,907 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 12 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 09:21:44,908 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 09:21:44,971 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 12 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-16 09:21:44,971 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1968272186] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-16 09:21:44,971 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-16 09:21:44,972 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2021-12-16 09:21:44,972 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901868312] [2021-12-16 09:21:44,972 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-16 09:21:44,972 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-16 09:21:44,972 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 09:21:44,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-16 09:21:44,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2021-12-16 09:21:44,973 INFO L87 Difference]: Start difference. First operand 80 states and 93 transitions. cyclomatic complexity: 19 Second operand has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 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-16 09:21:45,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 09:21:45,012 INFO L93 Difference]: Finished difference Result 167 states and 180 transitions. [2021-12-16 09:21:45,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-16 09:21:45,013 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 167 states and 180 transitions. [2021-12-16 09:21:45,014 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 45 [2021-12-16 09:21:45,015 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 167 states to 147 states and 160 transitions. [2021-12-16 09:21:45,015 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 59 [2021-12-16 09:21:45,015 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 59 [2021-12-16 09:21:45,015 INFO L73 IsDeterministic]: Start isDeterministic. Operand 147 states and 160 transitions. [2021-12-16 09:21:45,015 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-16 09:21:45,015 INFO L681 BuchiCegarLoop]: Abstraction has 147 states and 160 transitions. [2021-12-16 09:21:45,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states and 160 transitions. [2021-12-16 09:21:45,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 140. [2021-12-16 09:21:45,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 140 states have (on average 1.0928571428571427) internal successors, (153), 139 states have internal predecessors, (153), 0 states have call successors, (0), 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-16 09:21:45,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 153 transitions. [2021-12-16 09:21:45,017 INFO L704 BuchiCegarLoop]: Abstraction has 140 states and 153 transitions. [2021-12-16 09:21:45,017 INFO L587 BuchiCegarLoop]: Abstraction has 140 states and 153 transitions. [2021-12-16 09:21:45,017 INFO L425 BuchiCegarLoop]: ======== Iteration 10============ [2021-12-16 09:21:45,017 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 140 states and 153 transitions. [2021-12-16 09:21:45,018 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 44 [2021-12-16 09:21:45,018 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-16 09:21:45,018 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-16 09:21:45,019 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [11, 9, 9, 9, 1, 1, 1, 1, 1] [2021-12-16 09:21:45,019 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [10, 9, 9, 9, 1, 1, 1] [2021-12-16 09:21:45,019 INFO L791 eck$LassoCheckResult]: Stem: 3875#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 3876#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~up~0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~up~0#1 := 0; 3879#L18-1 assume !!(main_~i~0#1 > 0); 3950#L12 assume 1 == main_~i~0#1;main_~up~0#1 := 1; 3866#L12-2 assume !(10 == main_~i~0#1); 3867#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 3882#L18-1 assume !!(main_~i~0#1 > 0); 3973#L12 assume !(1 == main_~i~0#1); 3972#L12-2 assume !(10 == main_~i~0#1); 3971#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 3970#L18-1 assume !!(main_~i~0#1 > 0); 3969#L12 assume !(1 == main_~i~0#1); 3968#L12-2 assume !(10 == main_~i~0#1); 3967#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 3966#L18-1 assume !!(main_~i~0#1 > 0); 3965#L12 assume !(1 == main_~i~0#1); 3964#L12-2 assume !(10 == main_~i~0#1); 3963#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 3962#L18-1 assume !!(main_~i~0#1 > 0); 3961#L12 assume !(1 == main_~i~0#1); 3960#L12-2 assume !(10 == main_~i~0#1); 3959#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 3958#L18-1 assume !!(main_~i~0#1 > 0); 3957#L12 assume !(1 == main_~i~0#1); 3956#L12-2 assume !(10 == main_~i~0#1); 3955#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 3954#L18-1 assume !!(main_~i~0#1 > 0); 3953#L12 assume !(1 == main_~i~0#1); 3952#L12-2 assume !(10 == main_~i~0#1); 3951#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 3948#L18-1 assume !!(main_~i~0#1 > 0); 3947#L12 assume !(1 == main_~i~0#1); 3944#L12-2 assume !(10 == main_~i~0#1); 3942#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 3938#L18-1 assume !!(main_~i~0#1 > 0); 3889#L12 assume !(1 == main_~i~0#1); 3893#L12-2 assume !(10 == main_~i~0#1); 3890#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 3888#L18-1 assume !!(main_~i~0#1 > 0); 3887#L12 assume !(1 == main_~i~0#1); 3886#L12-2 assume 10 == main_~i~0#1;main_~up~0#1 := 0; 3877#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 3878#L18-1 assume !!(main_~i~0#1 > 0); 3933#L12 [2021-12-16 09:21:45,020 INFO L793 eck$LassoCheckResult]: Loop: 3933#L12 assume 1 == main_~i~0#1;main_~up~0#1 := 1; 3932#L12-2 assume !(10 == main_~i~0#1); 3931#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 3930#L18-1 assume !!(main_~i~0#1 > 0); 3929#L12 assume !(1 == main_~i~0#1); 3928#L12-2 assume !(10 == main_~i~0#1); 3927#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 3926#L18-1 assume !!(main_~i~0#1 > 0); 3925#L12 assume !(1 == main_~i~0#1); 3924#L12-2 assume !(10 == main_~i~0#1); 3923#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 3922#L18-1 assume !!(main_~i~0#1 > 0); 3921#L12 assume !(1 == main_~i~0#1); 3920#L12-2 assume !(10 == main_~i~0#1); 3919#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 3918#L18-1 assume !!(main_~i~0#1 > 0); 3917#L12 assume !(1 == main_~i~0#1); 3916#L12-2 assume !(10 == main_~i~0#1); 3915#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 3914#L18-1 assume !!(main_~i~0#1 > 0); 3913#L12 assume !(1 == main_~i~0#1); 3912#L12-2 assume !(10 == main_~i~0#1); 3911#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 3910#L18-1 assume !!(main_~i~0#1 > 0); 3909#L12 assume !(1 == main_~i~0#1); 3908#L12-2 assume !(10 == main_~i~0#1); 3907#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 3906#L18-1 assume !!(main_~i~0#1 > 0); 3905#L12 assume !(1 == main_~i~0#1); 3904#L12-2 assume !(10 == main_~i~0#1); 3903#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 3902#L18-1 assume !!(main_~i~0#1 > 0); 3901#L12 assume !(1 == main_~i~0#1); 3900#L12-2 assume !(10 == main_~i~0#1); 3898#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 3894#L18-1 assume !!(main_~i~0#1 > 0); 3891#L12 assume !(1 == main_~i~0#1); 3892#L12-2 assume 10 == main_~i~0#1;main_~up~0#1 := 0; 3883#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 3884#L18-1 assume !!(main_~i~0#1 > 0); 3933#L12 [2021-12-16 09:21:45,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:21:45,020 INFO L85 PathProgramCache]: Analyzing trace with hash -273593524, now seen corresponding path program 2 times [2021-12-16 09:21:45,020 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:21:45,020 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217697371] [2021-12-16 09:21:45,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:21:45,020 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:21:45,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:21:45,028 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 09:21:45,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:21:45,034 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-16 09:21:45,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:21:45,034 INFO L85 PathProgramCache]: Analyzing trace with hash -1615279707, now seen corresponding path program 2 times [2021-12-16 09:21:45,034 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:21:45,035 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646912236] [2021-12-16 09:21:45,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:21:45,035 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:21:45,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:21:45,048 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 09:21:45,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:21:45,058 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-16 09:21:45,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:21:45,060 INFO L85 PathProgramCache]: Analyzing trace with hash 1777315312, now seen corresponding path program 3 times [2021-12-16 09:21:45,060 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:21:45,060 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817961733] [2021-12-16 09:21:45,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:21:45,061 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:21:45,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:21:45,105 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 438 proven. 0 refuted. 0 times theorem prover too weak. 342 trivial. 0 not checked. [2021-12-16 09:21:45,106 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 09:21:45,106 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817961733] [2021-12-16 09:21:45,108 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1817961733] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 09:21:45,108 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 09:21:45,108 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-16 09:21:45,108 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47434581] [2021-12-16 09:21:45,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 09:21:45,228 INFO L210 LassoAnalysis]: Preferences: [2021-12-16 09:21:45,228 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-16 09:21:45,228 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-16 09:21:45,228 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-16 09:21:45,228 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2021-12-16 09:21:45,228 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:21:45,228 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-16 09:21:45,228 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-16 09:21:45,228 INFO L133 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration10_Loop [2021-12-16 09:21:45,228 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-16 09:21:45,228 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-16 09:21:45,229 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-16 09:21:45,233 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-16 09:21:45,235 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-16 09:21:45,237 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-16 09:21:45,268 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-16 09:21:45,268 INFO L404 LassoAnalysis]: Checking for nontermination... [2021-12-16 09:21:45,268 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:21:45,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:21:45,269 INFO L229 MonitoredProcess]: Starting monitored process 49 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-16 09:21:45,276 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-12-16 09:21:45,276 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-16 09:21:45,289 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Waiting until timeout for monitored process [2021-12-16 09:21:45,325 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Forceful destruction successful, exit code 0 [2021-12-16 09:21:45,325 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:21:45,326 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:21:45,326 INFO L229 MonitoredProcess]: Starting monitored process 50 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-16 09:21:45,327 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Waiting until timeout for monitored process [2021-12-16 09:21:45,329 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2021-12-16 09:21:45,329 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-16 09:21:45,348 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2021-12-16 09:21:45,364 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Forceful destruction successful, exit code 0 [2021-12-16 09:21:45,364 INFO L210 LassoAnalysis]: Preferences: [2021-12-16 09:21:45,365 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-16 09:21:45,365 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-16 09:21:45,365 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-16 09:21:45,365 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-16 09:21:45,365 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:21:45,365 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-16 09:21:45,365 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-16 09:21:45,365 INFO L133 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration10_Loop [2021-12-16 09:21:45,365 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-16 09:21:45,365 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-16 09:21:45,366 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-16 09:21:45,368 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:21:45,371 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:21:45,372 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:21:45,407 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-16 09:21:45,407 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-16 09:21:45,407 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:21:45,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:21:45,408 INFO L229 MonitoredProcess]: Starting monitored process 51 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-16 09:21:45,409 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Waiting until timeout for monitored process [2021-12-16 09:21:45,410 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-16 09:21:45,418 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:21:45,418 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:21:45,418 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:21:45,418 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 09:21:45,420 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-16 09:21:45,420 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-16 09:21:45,431 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:21:45,450 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Ended with exit code 0 [2021-12-16 09:21:45,451 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:21:45,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:21:45,452 INFO L229 MonitoredProcess]: Starting monitored process 52 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-16 09:21:45,452 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Waiting until timeout for monitored process [2021-12-16 09:21:45,454 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-16 09:21:45,461 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:21:45,461 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 09:21:45,461 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:21:45,461 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:21:45,461 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 09:21:45,462 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-16 09:21:45,462 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 09:21:45,471 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-16 09:21:45,473 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2021-12-16 09:21:45,473 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2021-12-16 09:21:45,473 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:21:45,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:21:45,474 INFO L229 MonitoredProcess]: Starting monitored process 53 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-16 09:21:45,477 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Waiting until timeout for monitored process [2021-12-16 09:21:45,477 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-16 09:21:45,477 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2021-12-16 09:21:45,477 INFO L513 LassoAnalysis]: Proved termination. [2021-12-16 09:21:45,477 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = -1*ULTIMATE.start_main_~i~0#1 + 5 Supporting invariants [] [2021-12-16 09:21:45,492 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Forceful destruction successful, exit code 0 [2021-12-16 09:21:45,493 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2021-12-16 09:21:45,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:21:45,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:21:45,515 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-16 09:21:45,515 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 09:21:45,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:21:45,610 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-16 09:21:45,611 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 09:21:45,721 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 18 proven. 9 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2021-12-16 09:21:45,721 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2021-12-16 09:21:45,721 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 140 states and 153 transitions. cyclomatic complexity: 19 Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 09:21:45,753 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 140 states and 153 transitions. cyclomatic complexity: 19. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 226 states and 242 transitions. Complement of second has 7 states. [2021-12-16 09:21:45,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2021-12-16 09:21:45,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 09:21:45,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 13 transitions. [2021-12-16 09:21:45,758 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 43 letters. Loop has 40 letters. [2021-12-16 09:21:45,758 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-16 09:21:45,758 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2021-12-16 09:21:45,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:21:45,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:21:45,777 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-16 09:21:45,778 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 09:21:45,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:21:45,870 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-16 09:21:45,871 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 09:21:45,980 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 18 proven. 9 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2021-12-16 09:21:45,981 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 4 loop predicates [2021-12-16 09:21:45,981 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 140 states and 153 transitions. cyclomatic complexity: 19 Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 09:21:46,045 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 140 states and 153 transitions. cyclomatic complexity: 19. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 313 states and 335 transitions. Complement of second has 11 states. [2021-12-16 09:21:46,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2021-12-16 09:21:46,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 09:21:46,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 14 transitions. [2021-12-16 09:21:46,046 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 14 transitions. Stem has 43 letters. Loop has 40 letters. [2021-12-16 09:21:46,046 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-16 09:21:46,046 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 14 transitions. Stem has 83 letters. Loop has 40 letters. [2021-12-16 09:21:46,047 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-16 09:21:46,047 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 14 transitions. Stem has 43 letters. Loop has 80 letters. [2021-12-16 09:21:46,047 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-16 09:21:46,047 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 313 states and 335 transitions. [2021-12-16 09:21:46,050 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 48 [2021-12-16 09:21:46,051 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 313 states to 265 states and 285 transitions. [2021-12-16 09:21:46,051 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 94 [2021-12-16 09:21:46,051 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 95 [2021-12-16 09:21:46,051 INFO L73 IsDeterministic]: Start isDeterministic. Operand 265 states and 285 transitions. [2021-12-16 09:21:46,051 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-16 09:21:46,051 INFO L681 BuchiCegarLoop]: Abstraction has 265 states and 285 transitions. [2021-12-16 09:21:46,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states and 285 transitions. [2021-12-16 09:21:46,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 221. [2021-12-16 09:21:46,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 221 states have (on average 1.0769230769230769) internal successors, (238), 220 states have internal predecessors, (238), 0 states have call successors, (0), 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-16 09:21:46,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 238 transitions. [2021-12-16 09:21:46,055 INFO L704 BuchiCegarLoop]: Abstraction has 221 states and 238 transitions. [2021-12-16 09:21:46,055 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 09:21:46,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-16 09:21:46,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-16 09:21:46,056 INFO L87 Difference]: Start difference. First operand 221 states and 238 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 09:21:46,061 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Forceful destruction successful, exit code 0 [2021-12-16 09:21:46,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 09:21:46,076 INFO L93 Difference]: Finished difference Result 192 states and 207 transitions. [2021-12-16 09:21:46,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-16 09:21:46,076 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 192 states and 207 transitions. [2021-12-16 09:21:46,078 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 49 [2021-12-16 09:21:46,079 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 192 states to 189 states and 203 transitions. [2021-12-16 09:21:46,079 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 58 [2021-12-16 09:21:46,079 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 58 [2021-12-16 09:21:46,079 INFO L73 IsDeterministic]: Start isDeterministic. Operand 189 states and 203 transitions. [2021-12-16 09:21:46,079 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-16 09:21:46,079 INFO L681 BuchiCegarLoop]: Abstraction has 189 states and 203 transitions. [2021-12-16 09:21:46,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states and 203 transitions. [2021-12-16 09:21:46,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 179. [2021-12-16 09:21:46,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 179 states have (on average 1.0670391061452513) internal successors, (191), 178 states have internal predecessors, (191), 0 states have call successors, (0), 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-16 09:21:46,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 191 transitions. [2021-12-16 09:21:46,082 INFO L704 BuchiCegarLoop]: Abstraction has 179 states and 191 transitions. [2021-12-16 09:21:46,082 INFO L587 BuchiCegarLoop]: Abstraction has 179 states and 191 transitions. [2021-12-16 09:21:46,082 INFO L425 BuchiCegarLoop]: ======== Iteration 11============ [2021-12-16 09:21:46,082 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 179 states and 191 transitions. [2021-12-16 09:21:46,083 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 46 [2021-12-16 09:21:46,083 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-16 09:21:46,084 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-16 09:21:46,085 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [12, 10, 10, 9, 2, 1, 1, 1, 1] [2021-12-16 09:21:46,085 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [11, 10, 10, 9, 2, 1, 1] [2021-12-16 09:21:46,085 INFO L791 eck$LassoCheckResult]: Stem: 5511#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 5512#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~up~0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~up~0#1 := 0; 5515#L18-1 assume !!(main_~i~0#1 > 0); 5565#L12 assume 1 == main_~i~0#1;main_~up~0#1 := 1; 5505#L12-2 assume !(10 == main_~i~0#1); 5506#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 5509#L18-1 assume !!(main_~i~0#1 > 0); 5510#L12 assume !(1 == main_~i~0#1); 5518#L12-2 assume !(10 == main_~i~0#1); 5681#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 5680#L18-1 assume !!(main_~i~0#1 > 0); 5679#L12 assume !(1 == main_~i~0#1); 5678#L12-2 assume !(10 == main_~i~0#1); 5677#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 5676#L18-1 assume !!(main_~i~0#1 > 0); 5675#L12 assume !(1 == main_~i~0#1); 5674#L12-2 assume !(10 == main_~i~0#1); 5673#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 5672#L18-1 assume !!(main_~i~0#1 > 0); 5671#L12 assume !(1 == main_~i~0#1); 5670#L12-2 assume !(10 == main_~i~0#1); 5669#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 5668#L18-1 assume !!(main_~i~0#1 > 0); 5667#L12 assume !(1 == main_~i~0#1); 5666#L12-2 assume !(10 == main_~i~0#1); 5665#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 5664#L18-1 assume !!(main_~i~0#1 > 0); 5663#L12 assume !(1 == main_~i~0#1); 5662#L12-2 assume !(10 == main_~i~0#1); 5661#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 5660#L18-1 assume !!(main_~i~0#1 > 0); 5659#L12 assume !(1 == main_~i~0#1); 5658#L12-2 assume !(10 == main_~i~0#1); 5657#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 5656#L18-1 assume !!(main_~i~0#1 > 0); 5653#L12 assume !(1 == main_~i~0#1); 5655#L12-2 assume !(10 == main_~i~0#1); 5654#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 5652#L18-1 assume !!(main_~i~0#1 > 0); 5651#L12 assume !(1 == main_~i~0#1); 5650#L12-2 assume 10 == main_~i~0#1;main_~up~0#1 := 0; 5648#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 5514#L18-1 assume !!(main_~i~0#1 > 0); 5508#L12 assume !(1 == main_~i~0#1); 5647#L12-2 assume !(10 == main_~i~0#1); 5641#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 5639#L18-1 assume !!(main_~i~0#1 > 0); 5636#L12 [2021-12-16 09:21:46,085 INFO L793 eck$LassoCheckResult]: Loop: 5636#L12 assume 1 == main_~i~0#1;main_~up~0#1 := 1; 5503#L12-2 assume !(10 == main_~i~0#1); 5504#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 5630#L18-1 assume !!(main_~i~0#1 > 0); 5628#L12 assume !(1 == main_~i~0#1); 5626#L12-2 assume !(10 == main_~i~0#1); 5624#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 5622#L18-1 assume !!(main_~i~0#1 > 0); 5620#L12 assume !(1 == main_~i~0#1); 5618#L12-2 assume !(10 == main_~i~0#1); 5616#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 5614#L18-1 assume !!(main_~i~0#1 > 0); 5612#L12 assume !(1 == main_~i~0#1); 5610#L12-2 assume !(10 == main_~i~0#1); 5608#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 5606#L18-1 assume !!(main_~i~0#1 > 0); 5604#L12 assume !(1 == main_~i~0#1); 5602#L12-2 assume !(10 == main_~i~0#1); 5600#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 5598#L18-1 assume !!(main_~i~0#1 > 0); 5596#L12 assume !(1 == main_~i~0#1); 5594#L12-2 assume !(10 == main_~i~0#1); 5592#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 5590#L18-1 assume !!(main_~i~0#1 > 0); 5588#L12 assume !(1 == main_~i~0#1); 5586#L12-2 assume !(10 == main_~i~0#1); 5584#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 5582#L18-1 assume !!(main_~i~0#1 > 0); 5581#L12 assume !(1 == main_~i~0#1); 5580#L12-2 assume !(10 == main_~i~0#1); 5579#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 5578#L18-1 assume !!(main_~i~0#1 > 0); 5577#L12 assume !(1 == main_~i~0#1); 5575#L12-2 assume !(10 == main_~i~0#1); 5573#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 5569#L18-1 assume !!(main_~i~0#1 > 0); 5567#L12 assume !(1 == main_~i~0#1); 5568#L12-2 assume 10 == main_~i~0#1;main_~up~0#1 := 0; 5521#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 5507#L18-1 assume !!(main_~i~0#1 > 0); 5508#L12 assume !(1 == main_~i~0#1); 5647#L12-2 assume !(10 == main_~i~0#1); 5641#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 5639#L18-1 assume !!(main_~i~0#1 > 0); 5636#L12 [2021-12-16 09:21:46,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:21:46,085 INFO L85 PathProgramCache]: Analyzing trace with hash -733322943, now seen corresponding path program 4 times [2021-12-16 09:21:46,086 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:21:46,086 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81629206] [2021-12-16 09:21:46,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:21:46,086 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:21:46,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:21:46,093 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 09:21:46,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:21:46,099 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-16 09:21:46,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:21:46,099 INFO L85 PathProgramCache]: Analyzing trace with hash 491326234, now seen corresponding path program 3 times [2021-12-16 09:21:46,100 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:21:46,100 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680307613] [2021-12-16 09:21:46,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:21:46,100 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:21:46,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:21:46,105 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 09:21:46,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:21:46,110 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-16 09:21:46,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:21:46,111 INFO L85 PathProgramCache]: Analyzing trace with hash -1133081510, now seen corresponding path program 5 times [2021-12-16 09:21:46,111 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:21:46,111 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85505589] [2021-12-16 09:21:46,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:21:46,111 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:21:46,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:21:46,148 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 562 proven. 3 refuted. 0 times theorem prover too weak. 381 trivial. 0 not checked. [2021-12-16 09:21:46,148 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 09:21:46,148 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85505589] [2021-12-16 09:21:46,148 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [85505589] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 09:21:46,149 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [847148880] [2021-12-16 09:21:46,149 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-12-16 09:21:46,149 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 09:21:46,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:21:46,150 INFO L229 MonitoredProcess]: Starting monitored process 54 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-16 09:21:46,151 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (54)] Waiting until timeout for monitored process [2021-12-16 09:21:46,177 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2021-12-16 09:21:46,177 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-16 09:21:46,178 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-16 09:21:46,179 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 09:21:46,297 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 562 proven. 3 refuted. 0 times theorem prover too weak. 381 trivial. 0 not checked. [2021-12-16 09:21:46,297 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 09:21:46,416 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 562 proven. 3 refuted. 0 times theorem prover too weak. 381 trivial. 0 not checked. [2021-12-16 09:21:46,416 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [847148880] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-16 09:21:46,416 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-16 09:21:46,416 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2021-12-16 09:21:46,417 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560533951] [2021-12-16 09:21:46,417 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-16 09:21:46,552 INFO L210 LassoAnalysis]: Preferences: [2021-12-16 09:21:46,552 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-16 09:21:46,552 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-16 09:21:46,553 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-16 09:21:46,553 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2021-12-16 09:21:46,553 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:21:46,553 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-16 09:21:46,553 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-16 09:21:46,553 INFO L133 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration11_Loop [2021-12-16 09:21:46,553 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-16 09:21:46,553 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-16 09:21:46,553 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-16 09:21:46,556 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-16 09:21:46,557 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-16 09:21:46,560 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-16 09:21:46,588 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-16 09:21:46,588 INFO L404 LassoAnalysis]: Checking for nontermination... [2021-12-16 09:21:46,588 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:21:46,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:21:46,589 INFO L229 MonitoredProcess]: Starting monitored process 55 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-16 09:21:46,590 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Waiting until timeout for monitored process [2021-12-16 09:21:46,591 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-12-16 09:21:46,591 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-16 09:21:46,603 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-12-16 09:21:46,603 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_16=1} Honda state: {v_rep~unnamed0~0~true_16=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2021-12-16 09:21:46,618 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Forceful destruction successful, exit code 0 [2021-12-16 09:21:46,619 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:21:46,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:21:46,619 INFO L229 MonitoredProcess]: Starting monitored process 56 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-16 09:21:46,620 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Waiting until timeout for monitored process [2021-12-16 09:21:46,621 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-12-16 09:21:46,621 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-16 09:21:46,628 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-12-16 09:21:46,628 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~up~0#1=0} Honda state: {ULTIMATE.start_main_~up~0#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2021-12-16 09:21:46,643 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Forceful destruction successful, exit code 0 [2021-12-16 09:21:46,644 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:21:46,644 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:21:46,645 INFO L229 MonitoredProcess]: Starting monitored process 57 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-16 09:21:46,645 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Waiting until timeout for monitored process [2021-12-16 09:21:46,646 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-12-16 09:21:46,646 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-16 09:21:46,668 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Forceful destruction successful, exit code 0 [2021-12-16 09:21:46,668 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:21:46,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:21:46,669 INFO L229 MonitoredProcess]: Starting monitored process 58 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-16 09:21:46,670 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Waiting until timeout for monitored process [2021-12-16 09:21:46,671 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2021-12-16 09:21:46,671 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-16 09:21:46,679 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2021-12-16 09:21:46,694 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Ended with exit code 0 [2021-12-16 09:21:46,694 INFO L210 LassoAnalysis]: Preferences: [2021-12-16 09:21:46,695 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-16 09:21:46,695 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-16 09:21:46,695 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-16 09:21:46,695 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-16 09:21:46,695 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:21:46,695 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-16 09:21:46,695 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-16 09:21:46,695 INFO L133 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration11_Loop [2021-12-16 09:21:46,695 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-16 09:21:46,695 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-16 09:21:46,696 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-16 09:21:46,706 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-16 09:21:46,708 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-16 09:21:46,709 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-16 09:21:46,740 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-16 09:21:46,740 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-16 09:21:46,741 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:21:46,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:21:46,741 INFO L229 MonitoredProcess]: Starting monitored process 59 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-16 09:21:46,742 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Waiting until timeout for monitored process [2021-12-16 09:21:46,743 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-16 09:21:46,749 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:21:46,749 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:21:46,749 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:21:46,749 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 09:21:46,750 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-16 09:21:46,750 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-16 09:21:46,752 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:21:46,766 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Forceful destruction successful, exit code 0 [2021-12-16 09:21:46,767 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:21:46,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:21:46,768 INFO L229 MonitoredProcess]: Starting monitored process 60 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-16 09:21:46,768 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Waiting until timeout for monitored process [2021-12-16 09:21:46,769 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-16 09:21:46,774 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:21:46,774 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 09:21:46,775 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:21:46,775 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:21:46,775 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 09:21:46,775 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-16 09:21:46,775 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 09:21:46,787 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:21:46,804 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Forceful destruction successful, exit code 0 [2021-12-16 09:21:46,805 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:21:46,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:21:46,806 INFO L229 MonitoredProcess]: Starting monitored process 61 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-16 09:21:46,806 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Waiting until timeout for monitored process [2021-12-16 09:21:46,809 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-16 09:21:46,814 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:21:46,814 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:21:46,814 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:21:46,814 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 09:21:46,816 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-16 09:21:46,816 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-12-16 09:21:46,817 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:21:46,832 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Ended with exit code 0 [2021-12-16 09:21:46,832 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:21:46,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:21:46,833 INFO L229 MonitoredProcess]: Starting monitored process 62 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-16 09:21:46,834 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Waiting until timeout for monitored process [2021-12-16 09:21:46,835 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-16 09:21:46,841 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:21:46,841 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 09:21:46,841 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:21:46,841 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:21:46,841 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 09:21:46,842 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-16 09:21:46,842 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 09:21:46,843 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-16 09:21:46,845 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2021-12-16 09:21:46,845 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2021-12-16 09:21:46,845 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:21:46,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:21:46,846 INFO L229 MonitoredProcess]: Starting monitored process 63 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-16 09:21:46,848 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Waiting until timeout for monitored process [2021-12-16 09:21:46,849 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-16 09:21:46,849 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2021-12-16 09:21:46,849 INFO L513 LassoAnalysis]: Proved termination. [2021-12-16 09:21:46,849 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = -2*ULTIMATE.start_main_~i~0#1 + 9 Supporting invariants [] [2021-12-16 09:21:46,864 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Forceful destruction successful, exit code 0 [2021-12-16 09:21:46,864 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2021-12-16 09:21:46,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:21:46,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:21:46,891 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-16 09:21:46,892 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 09:21:46,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:21:46,975 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-16 09:21:46,976 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 09:21:47,115 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 56 proven. 11 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2021-12-16 09:21:47,115 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates [2021-12-16 09:21:47,116 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 179 states and 191 transitions. cyclomatic complexity: 19 Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 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-16 09:21:47,141 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 179 states and 191 transitions. cyclomatic complexity: 19. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 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 228 states and 242 transitions. Complement of second has 7 states. [2021-12-16 09:21:47,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2021-12-16 09:21:47,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 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-16 09:21:47,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 13 transitions. [2021-12-16 09:21:47,142 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 47 letters. Loop has 44 letters. [2021-12-16 09:21:47,142 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-16 09:21:47,142 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2021-12-16 09:21:47,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:21:47,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:21:47,162 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-16 09:21:47,162 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 09:21:47,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:21:47,241 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-16 09:21:47,241 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 09:21:47,348 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Forceful destruction successful, exit code 0 [2021-12-16 09:21:47,413 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 56 proven. 11 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2021-12-16 09:21:47,413 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 5 loop predicates [2021-12-16 09:21:47,413 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 179 states and 191 transitions. cyclomatic complexity: 19 Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 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-16 09:21:47,461 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 179 states and 191 transitions. cyclomatic complexity: 19. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 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 238 states and 253 transitions. Complement of second has 11 states. [2021-12-16 09:21:47,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2021-12-16 09:21:47,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 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-16 09:21:47,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 14 transitions. [2021-12-16 09:21:47,462 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 14 transitions. Stem has 47 letters. Loop has 44 letters. [2021-12-16 09:21:47,462 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-16 09:21:47,462 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2021-12-16 09:21:47,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:21:47,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:21:47,482 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-16 09:21:47,483 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 09:21:47,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:21:47,560 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-16 09:21:47,560 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 09:21:47,695 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 56 proven. 11 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2021-12-16 09:21:47,696 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 5 loop predicates [2021-12-16 09:21:47,696 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 179 states and 191 transitions. cyclomatic complexity: 19 Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 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-16 09:21:47,720 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 179 states and 191 transitions. cyclomatic complexity: 19. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 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 342 states and 359 transitions. Complement of second has 9 states. [2021-12-16 09:21:47,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2021-12-16 09:21:47,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 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-16 09:21:47,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 20 transitions. [2021-12-16 09:21:47,722 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 20 transitions. Stem has 47 letters. Loop has 44 letters. [2021-12-16 09:21:47,723 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-16 09:21:47,723 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2021-12-16 09:21:47,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:21:47,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:21:47,744 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-16 09:21:47,744 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 09:21:47,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:21:47,827 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-16 09:21:47,827 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 09:21:47,953 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 56 proven. 11 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2021-12-16 09:21:47,954 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and with honda bouncer for loop.1 stem predicates 5 loop predicates [2021-12-16 09:21:47,954 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 179 states and 191 transitions. cyclomatic complexity: 19 Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 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-16 09:21:48,000 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 179 states and 191 transitions. cyclomatic complexity: 19. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 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 490 states and 514 transitions. Complement of second has 19 states. [2021-12-16 09:21:48,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2021-12-16 09:21:48,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 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-16 09:21:48,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 24 transitions. [2021-12-16 09:21:48,003 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 24 transitions. Stem has 47 letters. Loop has 44 letters. [2021-12-16 09:21:48,005 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-16 09:21:48,005 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2021-12-16 09:21:48,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:21:48,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:21:48,024 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-16 09:21:48,025 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 09:21:48,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:21:48,109 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-16 09:21:48,110 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 09:21:48,242 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 56 proven. 11 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2021-12-16 09:21:48,243 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemin loopwithout honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates [2021-12-16 09:21:48,243 INFO L104 BuchiDifferenceFKV]: Start buchiDifferenceFKV. First operand 179 states and 191 transitions. cyclomatic complexity: 19 Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 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-16 09:21:48,460 INFO L108 BuchiDifferenceFKV]: Finished buchiDifferenceFKV. First operand 179 states and 191 transitions. cyclomatic complexity: 19 Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 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 2294 states and 2963 transitions. Complement of second has 166 states 20 powerset states146 rank states. The highest rank that occured is 5 [2021-12-16 09:21:48,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 1 stem states 6 non-accepting loop states 1 accepting loop states [2021-12-16 09:21:48,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 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-16 09:21:48,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 70 transitions. [2021-12-16 09:21:48,461 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 70 transitions. Stem has 47 letters. Loop has 44 letters. [2021-12-16 09:21:48,464 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-16 09:21:48,464 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 70 transitions. Stem has 91 letters. Loop has 44 letters. [2021-12-16 09:21:48,469 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-16 09:21:48,469 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 70 transitions. Stem has 47 letters. Loop has 88 letters. [2021-12-16 09:21:48,476 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-16 09:21:48,477 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2294 states and 2963 transitions. [2021-12-16 09:21:48,490 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 96 [2021-12-16 09:21:48,496 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2294 states to 1175 states and 1510 transitions. [2021-12-16 09:21:48,496 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 100 [2021-12-16 09:21:48,496 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 223 [2021-12-16 09:21:48,496 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1175 states and 1510 transitions. [2021-12-16 09:21:48,496 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-16 09:21:48,496 INFO L681 BuchiCegarLoop]: Abstraction has 1175 states and 1510 transitions. [2021-12-16 09:21:48,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1175 states and 1510 transitions. [2021-12-16 09:21:48,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1175 to 674. [2021-12-16 09:21:48,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 674 states, 674 states have (on average 1.3902077151335313) internal successors, (937), 673 states have internal predecessors, (937), 0 states have call successors, (0), 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-16 09:21:48,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 674 states to 674 states and 937 transitions. [2021-12-16 09:21:48,507 INFO L704 BuchiCegarLoop]: Abstraction has 674 states and 937 transitions. [2021-12-16 09:21:48,507 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 09:21:48,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-16 09:21:48,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2021-12-16 09:21:48,508 INFO L87 Difference]: Start difference. First operand 674 states and 937 transitions. Second operand has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 09:21:48,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 09:21:48,541 INFO L93 Difference]: Finished difference Result 802 states and 1128 transitions. [2021-12-16 09:21:48,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-16 09:21:48,541 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 802 states and 1128 transitions. [2021-12-16 09:21:48,546 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 98 [2021-12-16 09:21:48,549 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 802 states to 785 states and 1104 transitions. [2021-12-16 09:21:48,550 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 104 [2021-12-16 09:21:48,550 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 104 [2021-12-16 09:21:48,550 INFO L73 IsDeterministic]: Start isDeterministic. Operand 785 states and 1104 transitions. [2021-12-16 09:21:48,550 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-16 09:21:48,550 INFO L681 BuchiCegarLoop]: Abstraction has 785 states and 1104 transitions. [2021-12-16 09:21:48,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 785 states and 1104 transitions. [2021-12-16 09:21:48,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 785 to 744. [2021-12-16 09:21:48,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 744 states, 744 states have (on average 1.4045698924731183) internal successors, (1045), 743 states have internal predecessors, (1045), 0 states have call successors, (0), 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-16 09:21:48,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 744 states to 744 states and 1045 transitions. [2021-12-16 09:21:48,559 INFO L704 BuchiCegarLoop]: Abstraction has 744 states and 1045 transitions. [2021-12-16 09:21:48,559 INFO L587 BuchiCegarLoop]: Abstraction has 744 states and 1045 transitions. [2021-12-16 09:21:48,559 INFO L425 BuchiCegarLoop]: ======== Iteration 12============ [2021-12-16 09:21:48,560 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 744 states and 1045 transitions. [2021-12-16 09:21:48,563 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 90 [2021-12-16 09:21:48,563 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-16 09:21:48,563 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-16 09:21:48,564 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [16, 14, 14, 9, 6, 1, 1, 1, 1] [2021-12-16 09:21:48,564 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [15, 14, 14, 9, 6, 1, 1] [2021-12-16 09:21:48,564 INFO L791 eck$LassoCheckResult]: Stem: 12934#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 12935#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~up~0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~up~0#1 := 0; 12939#L18-1 assume !!(main_~i~0#1 > 0); 13270#L12 assume 1 == main_~i~0#1;main_~up~0#1 := 1; 13120#L12-2 assume !(10 == main_~i~0#1); 13258#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 13256#L18-1 assume !!(main_~i~0#1 > 0); 13254#L12 assume !(1 == main_~i~0#1); 13252#L12-2 assume !(10 == main_~i~0#1); 13250#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 13248#L18-1 assume !!(main_~i~0#1 > 0); 13246#L12 assume !(1 == main_~i~0#1); 13244#L12-2 assume !(10 == main_~i~0#1); 13242#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 13240#L18-1 assume !!(main_~i~0#1 > 0); 13238#L12 assume !(1 == main_~i~0#1); 13236#L12-2 assume !(10 == main_~i~0#1); 13234#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 13232#L18-1 assume !!(main_~i~0#1 > 0); 13230#L12 assume !(1 == main_~i~0#1); 13228#L12-2 assume !(10 == main_~i~0#1); 13226#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 13224#L18-1 assume !!(main_~i~0#1 > 0); 13222#L12 assume !(1 == main_~i~0#1); 13220#L12-2 assume !(10 == main_~i~0#1); 13218#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 13216#L18-1 assume !!(main_~i~0#1 > 0); 13214#L12 assume !(1 == main_~i~0#1); 13212#L12-2 assume !(10 == main_~i~0#1); 13210#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 13208#L18-1 assume !!(main_~i~0#1 > 0); 13206#L12 assume !(1 == main_~i~0#1); 13204#L12-2 assume !(10 == main_~i~0#1); 13203#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 13202#L18-1 assume !!(main_~i~0#1 > 0); 13190#L12 assume !(1 == main_~i~0#1); 13198#L12-2 assume !(10 == main_~i~0#1); 13194#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 13189#L18-1 assume !!(main_~i~0#1 > 0); 13188#L12 assume !(1 == main_~i~0#1); 13187#L12-2 assume 10 == main_~i~0#1;main_~up~0#1 := 0; 13146#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 13185#L18-1 assume !!(main_~i~0#1 > 0); 13184#L12 assume !(1 == main_~i~0#1); 13183#L12-2 assume !(10 == main_~i~0#1); 13181#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 13180#L18-1 assume !!(main_~i~0#1 > 0); 13179#L12 assume !(1 == main_~i~0#1); 13178#L12-2 assume !(10 == main_~i~0#1); 13176#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 13175#L18-1 assume !!(main_~i~0#1 > 0); 13174#L12 assume !(1 == main_~i~0#1); 13173#L12-2 assume !(10 == main_~i~0#1); 13171#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 13170#L18-1 assume !!(main_~i~0#1 > 0); 13169#L12 assume !(1 == main_~i~0#1); 13168#L12-2 assume !(10 == main_~i~0#1); 13166#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 13165#L18-1 assume !!(main_~i~0#1 > 0); 13118#L12 assume !(1 == main_~i~0#1); 13145#L12-2 assume !(10 == main_~i~0#1); 13121#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 13122#L18-1 assume !!(main_~i~0#1 > 0); 13266#L12 [2021-12-16 09:21:48,564 INFO L793 eck$LassoCheckResult]: Loop: 13266#L12 assume 1 == main_~i~0#1;main_~up~0#1 := 1; 13265#L12-2 assume !(10 == main_~i~0#1); 12946#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 12930#L18-1 assume !!(main_~i~0#1 > 0); 12931#L12 assume !(1 == main_~i~0#1); 12941#L12-2 assume !(10 == main_~i~0#1); 13665#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 13663#L18-1 assume !!(main_~i~0#1 > 0); 13661#L12 assume !(1 == main_~i~0#1); 13659#L12-2 assume !(10 == main_~i~0#1); 13657#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 13655#L18-1 assume !!(main_~i~0#1 > 0); 13653#L12 assume !(1 == main_~i~0#1); 13651#L12-2 assume !(10 == main_~i~0#1); 13649#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 13647#L18-1 assume !!(main_~i~0#1 > 0); 13645#L12 assume !(1 == main_~i~0#1); 13643#L12-2 assume !(10 == main_~i~0#1); 13641#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 13639#L18-1 assume !!(main_~i~0#1 > 0); 13637#L12 assume !(1 == main_~i~0#1); 13635#L12-2 assume !(10 == main_~i~0#1); 13633#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 13631#L18-1 assume !!(main_~i~0#1 > 0); 13629#L12 assume !(1 == main_~i~0#1); 13627#L12-2 assume !(10 == main_~i~0#1); 13625#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 13623#L18-1 assume !!(main_~i~0#1 > 0); 13621#L12 assume !(1 == main_~i~0#1); 13619#L12-2 assume !(10 == main_~i~0#1); 13617#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 13615#L18-1 assume !!(main_~i~0#1 > 0); 13614#L12 assume !(1 == main_~i~0#1); 13613#L12-2 assume !(10 == main_~i~0#1); 13609#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 13610#L18-1 assume !!(main_~i~0#1 > 0); 13586#L12 assume !(1 == main_~i~0#1); 13587#L12-2 assume 10 == main_~i~0#1;main_~up~0#1 := 0; 13429#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 13510#L18-1 assume !!(main_~i~0#1 > 0); 13506#L12 assume !(1 == main_~i~0#1); 13503#L12-2 assume !(10 == main_~i~0#1); 13496#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 13493#L18-1 assume !!(main_~i~0#1 > 0); 13491#L12 assume !(1 == main_~i~0#1); 13490#L12-2 assume !(10 == main_~i~0#1); 13489#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 13488#L18-1 assume !!(main_~i~0#1 > 0); 13486#L12 assume !(1 == main_~i~0#1); 13445#L12-2 assume !(10 == main_~i~0#1); 13446#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 13487#L18-1 assume !!(main_~i~0#1 > 0); 13484#L12 assume !(1 == main_~i~0#1); 13450#L12-2 assume !(10 == main_~i~0#1); 13448#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 13449#L18-1 assume !!(main_~i~0#1 > 0); 13434#L12 assume !(1 == main_~i~0#1); 13430#L12-2 assume !(10 == main_~i~0#1); 13272#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 13273#L18-1 assume !!(main_~i~0#1 > 0); 13266#L12 [2021-12-16 09:21:48,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:21:48,565 INFO L85 PathProgramCache]: Analyzing trace with hash 912728085, now seen corresponding path program 6 times [2021-12-16 09:21:48,565 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:21:48,565 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405772213] [2021-12-16 09:21:48,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:21:48,565 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:21:48,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:21:48,571 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 09:21:48,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:21:48,577 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-16 09:21:48,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:21:48,578 INFO L85 PathProgramCache]: Analyzing trace with hash 1190197230, now seen corresponding path program 4 times [2021-12-16 09:21:48,578 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:21:48,578 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107317254] [2021-12-16 09:21:48,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:21:48,578 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:21:48,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:21:48,583 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 09:21:48,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:21:48,588 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-16 09:21:48,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:21:48,588 INFO L85 PathProgramCache]: Analyzing trace with hash 1444454914, now seen corresponding path program 7 times [2021-12-16 09:21:48,588 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:21:48,588 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757134576] [2021-12-16 09:21:48,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:21:48,589 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:21:48,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:21:48,647 INFO L134 CoverageAnalysis]: Checked inductivity of 1770 backedges. 1138 proven. 55 refuted. 0 times theorem prover too weak. 577 trivial. 0 not checked. [2021-12-16 09:21:48,648 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 09:21:48,648 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757134576] [2021-12-16 09:21:48,648 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [757134576] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-16 09:21:48,648 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1768253793] [2021-12-16 09:21:48,648 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-12-16 09:21:48,648 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 09:21:48,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:21:48,652 INFO L229 MonitoredProcess]: Starting monitored process 64 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-16 09:21:48,656 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (64)] Waiting until timeout for monitored process [2021-12-16 09:21:48,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:21:48,690 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-16 09:21:48,691 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 09:21:48,867 INFO L134 CoverageAnalysis]: Checked inductivity of 1770 backedges. 1138 proven. 55 refuted. 0 times theorem prover too weak. 577 trivial. 0 not checked. [2021-12-16 09:21:48,867 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 09:21:49,036 INFO L134 CoverageAnalysis]: Checked inductivity of 1770 backedges. 1138 proven. 55 refuted. 0 times theorem prover too weak. 577 trivial. 0 not checked. [2021-12-16 09:21:49,036 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1768253793] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-16 09:21:49,036 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-16 09:21:49,036 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 11 [2021-12-16 09:21:49,037 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330358587] [2021-12-16 09:21:49,037 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-16 09:21:49,234 INFO L210 LassoAnalysis]: Preferences: [2021-12-16 09:21:49,235 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-16 09:21:49,235 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-16 09:21:49,235 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-16 09:21:49,235 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2021-12-16 09:21:49,235 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:21:49,235 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-16 09:21:49,235 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-16 09:21:49,235 INFO L133 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration12_Loop [2021-12-16 09:21:49,235 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-16 09:21:49,235 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-16 09:21:49,235 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-16 09:21:49,239 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-16 09:21:49,243 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-16 09:21:49,246 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-16 09:21:49,280 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-16 09:21:49,280 INFO L404 LassoAnalysis]: Checking for nontermination... [2021-12-16 09:21:49,280 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:21:49,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:21:49,282 INFO L229 MonitoredProcess]: Starting monitored process 65 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-16 09:21:49,283 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Waiting until timeout for monitored process [2021-12-16 09:21:49,284 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-12-16 09:21:49,284 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-16 09:21:49,294 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-12-16 09:21:49,294 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_18=1} Honda state: {v_rep~unnamed0~0~true_18=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2021-12-16 09:21:49,309 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Ended with exit code 0 [2021-12-16 09:21:49,309 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:21:49,309 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:21:49,310 INFO L229 MonitoredProcess]: Starting monitored process 66 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-16 09:21:49,312 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Waiting until timeout for monitored process [2021-12-16 09:21:49,312 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-12-16 09:21:49,312 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-16 09:21:49,356 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Forceful destruction successful, exit code 0 [2021-12-16 09:21:49,357 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:21:49,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:21:49,358 INFO L229 MonitoredProcess]: Starting monitored process 67 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-16 09:21:49,361 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Waiting until timeout for monitored process [2021-12-16 09:21:49,362 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2021-12-16 09:21:49,362 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-16 09:21:49,369 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2021-12-16 09:21:49,384 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Forceful destruction successful, exit code 0 [2021-12-16 09:21:49,385 INFO L210 LassoAnalysis]: Preferences: [2021-12-16 09:21:49,385 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-16 09:21:49,385 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-16 09:21:49,385 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-16 09:21:49,385 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-16 09:21:49,385 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:21:49,385 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-16 09:21:49,385 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-16 09:21:49,385 INFO L133 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration12_Loop [2021-12-16 09:21:49,385 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-16 09:21:49,385 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-16 09:21:49,386 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-16 09:21:49,390 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-16 09:21:49,392 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-16 09:21:49,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-16 09:21:49,430 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-16 09:21:49,430 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-16 09:21:49,431 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:21:49,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:21:49,432 INFO L229 MonitoredProcess]: Starting monitored process 68 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-16 09:21:49,443 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-16 09:21:49,450 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:21:49,451 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 09:21:49,451 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:21:49,451 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:21:49,451 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 09:21:49,452 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-16 09:21:49,452 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 09:21:49,453 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Waiting until timeout for monitored process [2021-12-16 09:21:49,463 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-16 09:21:49,465 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2021-12-16 09:21:49,465 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2021-12-16 09:21:49,465 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:21:49,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:21:49,467 INFO L229 MonitoredProcess]: Starting monitored process 69 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-16 09:21:49,468 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Waiting until timeout for monitored process [2021-12-16 09:21:49,469 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-16 09:21:49,469 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2021-12-16 09:21:49,469 INFO L513 LassoAnalysis]: Proved termination. [2021-12-16 09:21:49,469 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = -2*ULTIMATE.start_main_~i~0#1 + 5 Supporting invariants [] [2021-12-16 09:21:49,491 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Forceful destruction successful, exit code 0 [2021-12-16 09:21:49,492 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2021-12-16 09:21:49,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:21:49,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:21:49,513 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-16 09:21:49,514 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 09:21:49,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:21:49,617 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 10 conjunts are in the unsatisfiable core [2021-12-16 09:21:49,618 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 09:21:49,856 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 208 proven. 59 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2021-12-16 09:21:49,856 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 9 loop predicates [2021-12-16 09:21:49,857 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 744 states and 1045 transitions. cyclomatic complexity: 322 Second operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 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-16 09:21:49,887 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 744 states and 1045 transitions. cyclomatic complexity: 322. Second operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 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 1013 states and 1361 transitions. Complement of second has 7 states. [2021-12-16 09:21:49,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2021-12-16 09:21:49,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 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-16 09:21:49,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 13 transitions. [2021-12-16 09:21:49,888 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 63 letters. Loop has 60 letters. [2021-12-16 09:21:49,888 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-16 09:21:49,888 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2021-12-16 09:21:49,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:21:49,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:21:49,913 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-16 09:21:49,913 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 09:21:50,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:21:50,041 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 10 conjunts are in the unsatisfiable core [2021-12-16 09:21:50,042 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 09:21:50,326 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 208 proven. 59 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2021-12-16 09:21:50,326 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 9 loop predicates [2021-12-16 09:21:50,327 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 744 states and 1045 transitions. cyclomatic complexity: 322 Second operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 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-16 09:21:50,385 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 744 states and 1045 transitions. cyclomatic complexity: 322. Second operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 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 1057 states and 1423 transitions. Complement of second has 11 states. [2021-12-16 09:21:50,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2021-12-16 09:21:50,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 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-16 09:21:50,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 14 transitions. [2021-12-16 09:21:50,386 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 14 transitions. Stem has 63 letters. Loop has 60 letters. [2021-12-16 09:21:50,386 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-16 09:21:50,386 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2021-12-16 09:21:50,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:21:50,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:21:50,411 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-16 09:21:50,412 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 09:21:50,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:21:50,527 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 10 conjunts are in the unsatisfiable core [2021-12-16 09:21:50,528 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 09:21:50,655 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Forceful destruction successful, exit code 0 [2021-12-16 09:21:50,803 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 208 proven. 59 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2021-12-16 09:21:50,804 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 9 loop predicates [2021-12-16 09:21:50,804 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 744 states and 1045 transitions. cyclomatic complexity: 322 Second operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 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-16 09:21:50,847 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 744 states and 1045 transitions. cyclomatic complexity: 322. Second operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 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 1553 states and 2121 transitions. Complement of second has 9 states. [2021-12-16 09:21:50,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2021-12-16 09:21:50,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 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-16 09:21:50,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 20 transitions. [2021-12-16 09:21:50,848 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 20 transitions. Stem has 63 letters. Loop has 60 letters. [2021-12-16 09:21:50,849 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-16 09:21:50,849 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2021-12-16 09:21:50,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:21:50,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:21:50,873 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-16 09:21:50,873 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 09:21:50,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:21:50,986 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 10 conjunts are in the unsatisfiable core [2021-12-16 09:21:50,987 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 09:21:51,250 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 208 proven. 59 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2021-12-16 09:21:51,251 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and with honda bouncer for loop.1 stem predicates 9 loop predicates [2021-12-16 09:21:51,251 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 744 states and 1045 transitions. cyclomatic complexity: 322 Second operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 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-16 09:21:51,319 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 744 states and 1045 transitions. cyclomatic complexity: 322. Second operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 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 2220 states and 3011 transitions. Complement of second has 19 states. [2021-12-16 09:21:51,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2021-12-16 09:21:51,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 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-16 09:21:51,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 24 transitions. [2021-12-16 09:21:51,321 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 24 transitions. Stem has 63 letters. Loop has 60 letters. [2021-12-16 09:21:51,322 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-16 09:21:51,322 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2021-12-16 09:21:51,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:21:51,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:21:51,345 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-16 09:21:51,346 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 09:21:51,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:21:51,454 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 10 conjunts are in the unsatisfiable core [2021-12-16 09:21:51,455 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 09:21:51,715 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 208 proven. 59 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2021-12-16 09:21:51,716 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemin loopwithout honda bouncer for stem and without honda bouncer for loop.1 stem predicates 9 loop predicates [2021-12-16 09:21:51,716 INFO L104 BuchiDifferenceFKV]: Start buchiDifferenceFKV. First operand 744 states and 1045 transitions. cyclomatic complexity: 322 Second operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 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-16 09:21:52,288 INFO L108 BuchiDifferenceFKV]: Finished buchiDifferenceFKV. First operand 744 states and 1045 transitions. cyclomatic complexity: 322 Second operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 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 12508 states and 21932 transitions. Complement of second has 282 states 36 powerset states246 rank states. The highest rank that occured is 5 [2021-12-16 09:21:52,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 13 states 1 stem states 10 non-accepting loop states 1 accepting loop states [2021-12-16 09:21:52,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 0 states have call successors, (0), 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-16 09:21:52,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 110 transitions. [2021-12-16 09:21:52,289 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 110 transitions. Stem has 63 letters. Loop has 60 letters. [2021-12-16 09:21:52,291 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-16 09:21:52,291 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 110 transitions. Stem has 123 letters. Loop has 60 letters. [2021-12-16 09:21:52,293 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-16 09:21:52,294 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 110 transitions. Stem has 63 letters. Loop has 120 letters. [2021-12-16 09:21:52,298 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-16 09:21:52,298 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12508 states and 21932 transitions. [2021-12-16 09:21:52,383 INFO L131 ngComponentsAnalysis]: Automaton has 13 accepting balls. 248 [2021-12-16 09:21:52,415 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12508 states to 5535 states and 9788 transitions. [2021-12-16 09:21:52,415 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 330 [2021-12-16 09:21:52,417 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 575 [2021-12-16 09:21:52,417 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5535 states and 9788 transitions. [2021-12-16 09:21:52,417 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-16 09:21:52,417 INFO L681 BuchiCegarLoop]: Abstraction has 5535 states and 9788 transitions. [2021-12-16 09:21:52,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5535 states and 9788 transitions. [2021-12-16 09:21:52,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5535 to 3406. [2021-12-16 09:21:52,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3406 states, 3406 states have (on average 1.8094539048737521) internal successors, (6163), 3405 states have internal predecessors, (6163), 0 states have call successors, (0), 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-16 09:21:52,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3406 states to 3406 states and 6163 transitions. [2021-12-16 09:21:52,481 INFO L704 BuchiCegarLoop]: Abstraction has 3406 states and 6163 transitions. [2021-12-16 09:21:52,481 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 09:21:52,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-16 09:21:52,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2021-12-16 09:21:52,482 INFO L87 Difference]: Start difference. First operand 3406 states and 6163 transitions. Second operand has 11 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 11 states have internal predecessors, (47), 0 states have call successors, (0), 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-16 09:21:52,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 09:21:52,536 INFO L93 Difference]: Finished difference Result 3793 states and 7008 transitions. [2021-12-16 09:21:52,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-16 09:21:52,538 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3793 states and 7008 transitions. [2021-12-16 09:21:52,561 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 168 [2021-12-16 09:21:52,580 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3793 states to 3761 states and 6917 transitions. [2021-12-16 09:21:52,580 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 238 [2021-12-16 09:21:52,581 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 238 [2021-12-16 09:21:52,581 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3761 states and 6917 transitions. [2021-12-16 09:21:52,581 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-16 09:21:52,581 INFO L681 BuchiCegarLoop]: Abstraction has 3761 states and 6917 transitions. [2021-12-16 09:21:52,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3761 states and 6917 transitions. [2021-12-16 09:21:52,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3761 to 3614. [2021-12-16 09:21:52,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3614 states, 3614 states have (on average 1.832595462091865) internal successors, (6623), 3613 states have internal predecessors, (6623), 0 states have call successors, (0), 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-16 09:21:52,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3614 states to 3614 states and 6623 transitions. [2021-12-16 09:21:52,676 INFO L704 BuchiCegarLoop]: Abstraction has 3614 states and 6623 transitions. [2021-12-16 09:21:52,676 INFO L587 BuchiCegarLoop]: Abstraction has 3614 states and 6623 transitions. [2021-12-16 09:21:52,676 INFO L425 BuchiCegarLoop]: ======== Iteration 13============ [2021-12-16 09:21:52,676 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3614 states and 6623 transitions. [2021-12-16 09:21:52,693 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 152 [2021-12-16 09:21:52,693 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-16 09:21:52,693 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-16 09:21:52,699 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [19, 17, 17, 9, 9, 1, 1, 1, 1] [2021-12-16 09:21:52,699 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [18, 17, 17, 9, 9, 1, 1] [2021-12-16 09:21:52,699 INFO L791 eck$LassoCheckResult]: Stem: 42219#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 42220#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~up~0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~up~0#1 := 0; 42223#L18-1 assume !!(main_~i~0#1 > 0); 42475#L12 assume 1 == main_~i~0#1;main_~up~0#1 := 1; 43049#L12-2 assume !(10 == main_~i~0#1); 44280#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 44278#L18-1 assume !!(main_~i~0#1 > 0); 44276#L12 assume !(1 == main_~i~0#1); 44274#L12-2 assume !(10 == main_~i~0#1); 44272#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 44270#L18-1 assume !!(main_~i~0#1 > 0); 44268#L12 assume !(1 == main_~i~0#1); 44266#L12-2 assume !(10 == main_~i~0#1); 44264#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 44262#L18-1 assume !!(main_~i~0#1 > 0); 44260#L12 assume !(1 == main_~i~0#1); 44258#L12-2 assume !(10 == main_~i~0#1); 44256#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 44254#L18-1 assume !!(main_~i~0#1 > 0); 44252#L12 assume !(1 == main_~i~0#1); 44250#L12-2 assume !(10 == main_~i~0#1); 44248#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 44246#L18-1 assume !!(main_~i~0#1 > 0); 44244#L12 assume !(1 == main_~i~0#1); 44242#L12-2 assume !(10 == main_~i~0#1); 44240#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 44238#L18-1 assume !!(main_~i~0#1 > 0); 44236#L12 assume !(1 == main_~i~0#1); 44234#L12-2 assume !(10 == main_~i~0#1); 44232#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 44230#L18-1 assume !!(main_~i~0#1 > 0); 44228#L12 assume !(1 == main_~i~0#1); 44226#L12-2 assume !(10 == main_~i~0#1); 44224#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 44222#L18-1 assume !!(main_~i~0#1 > 0); 44219#L12 assume !(1 == main_~i~0#1); 44220#L12-2 assume !(10 == main_~i~0#1); 44213#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 44214#L18-1 assume !!(main_~i~0#1 > 0); 43809#L12 assume !(1 == main_~i~0#1); 43810#L12-2 assume 10 == main_~i~0#1;main_~up~0#1 := 0; 43752#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 43805#L18-1 assume !!(main_~i~0#1 > 0); 43806#L12 assume !(1 == main_~i~0#1); 43801#L12-2 assume !(10 == main_~i~0#1); 43802#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 43796#L18-1 assume !!(main_~i~0#1 > 0); 43797#L12 assume !(1 == main_~i~0#1); 44090#L12-2 assume !(10 == main_~i~0#1); 44088#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 44087#L18-1 assume !!(main_~i~0#1 > 0); 44086#L12 assume !(1 == main_~i~0#1); 43783#L12-2 assume !(10 == main_~i~0#1); 43784#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 44081#L18-1 assume !!(main_~i~0#1 > 0); 45435#L12 assume !(1 == main_~i~0#1); 45431#L12-2 assume !(10 == main_~i~0#1); 45426#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 44073#L18-1 assume !!(main_~i~0#1 > 0); 45389#L12 assume !(1 == main_~i~0#1); 45390#L12-2 assume !(10 == main_~i~0#1); 45485#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 44067#L18-1 assume !!(main_~i~0#1 > 0); 45499#L12 assume !(1 == main_~i~0#1); 45498#L12-2 assume !(10 == main_~i~0#1); 45488#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 45496#L18-1 assume !!(main_~i~0#1 > 0); 45493#L12 assume !(1 == main_~i~0#1); 45491#L12-2 assume !(10 == main_~i~0#1); 45490#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 44195#L18-1 assume !!(main_~i~0#1 > 0); 42948#L12 assume !(1 == main_~i~0#1); 44297#L12-2 assume !(10 == main_~i~0#1); 45482#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 42947#L18-1 assume !!(main_~i~0#1 > 0); 42946#L12 [2021-12-16 09:21:52,699 INFO L793 eck$LassoCheckResult]: Loop: 42946#L12 assume 1 == main_~i~0#1;main_~up~0#1 := 1; 42945#L12-2 assume !(10 == main_~i~0#1); 43888#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 42216#L18-1 assume !!(main_~i~0#1 > 0); 42217#L12 assume !(1 == main_~i~0#1); 42225#L12-2 assume !(10 == main_~i~0#1); 45821#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 45819#L18-1 assume !!(main_~i~0#1 > 0); 45817#L12 assume !(1 == main_~i~0#1); 45815#L12-2 assume !(10 == main_~i~0#1); 45813#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 45811#L18-1 assume !!(main_~i~0#1 > 0); 45809#L12 assume !(1 == main_~i~0#1); 45807#L12-2 assume !(10 == main_~i~0#1); 45805#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 45803#L18-1 assume !!(main_~i~0#1 > 0); 45801#L12 assume !(1 == main_~i~0#1); 45799#L12-2 assume !(10 == main_~i~0#1); 45797#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 45795#L18-1 assume !!(main_~i~0#1 > 0); 45793#L12 assume !(1 == main_~i~0#1); 45791#L12-2 assume !(10 == main_~i~0#1); 45789#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 45787#L18-1 assume !!(main_~i~0#1 > 0); 45785#L12 assume !(1 == main_~i~0#1); 45783#L12-2 assume !(10 == main_~i~0#1); 45781#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 45779#L18-1 assume !!(main_~i~0#1 > 0); 45777#L12 assume !(1 == main_~i~0#1); 45775#L12-2 assume !(10 == main_~i~0#1); 45773#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 45771#L18-1 assume !!(main_~i~0#1 > 0); 45769#L12 assume !(1 == main_~i~0#1); 45763#L12-2 assume !(10 == main_~i~0#1); 45762#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 45761#L18-1 assume !!(main_~i~0#1 > 0); 45725#L12 assume !(1 == main_~i~0#1); 45726#L12-2 assume 10 == main_~i~0#1;main_~up~0#1 := 0; 44284#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 45516#L18-1 assume !!(main_~i~0#1 > 0); 45479#L12 assume !(1 == main_~i~0#1); 45478#L12-2 assume !(10 == main_~i~0#1); 45476#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 45472#L18-1 assume !!(main_~i~0#1 > 0); 45468#L12 assume !(1 == main_~i~0#1); 45465#L12-2 assume !(10 == main_~i~0#1); 45463#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 45458#L18-1 assume !!(main_~i~0#1 > 0); 45459#L12 assume !(1 == main_~i~0#1); 45505#L12-2 assume !(10 == main_~i~0#1); 45449#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 45450#L18-1 assume !!(main_~i~0#1 > 0); 45495#L12 assume !(1 == main_~i~0#1); 45440#L12-2 assume !(10 == main_~i~0#1); 45428#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 45427#L18-1 assume !!(main_~i~0#1 > 0); 45396#L12 assume !(1 == main_~i~0#1); 45354#L12-2 assume !(10 == main_~i~0#1); 45348#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 45344#L18-1 assume !!(main_~i~0#1 > 0); 45345#L12 assume !(1 == main_~i~0#1); 45341#L12-2 assume !(10 == main_~i~0#1); 45339#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 45336#L18-1 assume !!(main_~i~0#1 > 0); 44368#L12 assume !(1 == main_~i~0#1); 44307#L12-2 assume !(10 == main_~i~0#1); 44308#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 44323#L18-1 assume !!(main_~i~0#1 > 0); 43934#L12 assume !(1 == main_~i~0#1); 44288#L12-2 assume !(10 == main_~i~0#1); 43293#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 43294#L18-1 assume !!(main_~i~0#1 > 0); 42946#L12 [2021-12-16 09:21:52,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:21:52,700 INFO L85 PathProgramCache]: Analyzing trace with hash 1568126196, now seen corresponding path program 8 times [2021-12-16 09:21:52,700 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:21:52,700 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289504909] [2021-12-16 09:21:52,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:21:52,700 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:21:52,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:21:52,710 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 09:21:52,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:21:52,719 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-16 09:21:52,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:21:52,720 INFO L85 PathProgramCache]: Analyzing trace with hash 537366349, now seen corresponding path program 5 times [2021-12-16 09:21:52,720 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:21:52,720 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193121747] [2021-12-16 09:21:52,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:21:52,720 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:21:52,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:21:52,730 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 09:21:52,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:21:52,771 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-16 09:21:52,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:21:52,771 INFO L85 PathProgramCache]: Analyzing trace with hash 758614336, now seen corresponding path program 9 times [2021-12-16 09:21:52,771 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:21:52,771 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260385929] [2021-12-16 09:21:52,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:21:52,771 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:21:52,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:21:52,796 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 09:21:52,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:21:52,806 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-16 09:21:53,396 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 16.12 09:21:53 BoogieIcfgContainer [2021-12-16 09:21:53,396 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2021-12-16 09:21:53,397 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-16 09:21:53,397 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-16 09:21:53,397 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-16 09:21:53,397 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 09:21:39" (3/4) ... [2021-12-16 09:21:53,399 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2021-12-16 09:21:53,442 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-12-16 09:21:53,443 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-16 09:21:53,443 INFO L158 Benchmark]: Toolchain (without parser) took 14761.20ms. Allocated memory was 119.5MB in the beginning and 234.9MB in the end (delta: 115.3MB). Free memory was 93.5MB in the beginning and 136.9MB in the end (delta: -43.4MB). Peak memory consumption was 72.5MB. Max. memory is 16.1GB. [2021-12-16 09:21:53,443 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 119.5MB. Free memory is still 78.1MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-16 09:21:53,444 INFO L158 Benchmark]: CACSL2BoogieTranslator took 174.35ms. Allocated memory is still 119.5MB. Free memory was 93.2MB in the beginning and 96.7MB in the end (delta: -3.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-12-16 09:21:53,444 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.35ms. Allocated memory is still 119.5MB. Free memory was 96.7MB in the beginning and 95.4MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-16 09:21:53,444 INFO L158 Benchmark]: Boogie Preprocessor took 16.12ms. Allocated memory is still 119.5MB. Free memory was 95.4MB in the beginning and 94.5MB in the end (delta: 944.0kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-16 09:21:53,445 INFO L158 Benchmark]: RCFGBuilder took 210.18ms. Allocated memory is still 119.5MB. Free memory was 94.5MB in the beginning and 86.2MB in the end (delta: 8.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2021-12-16 09:21:53,445 INFO L158 Benchmark]: BuchiAutomizer took 14285.08ms. Allocated memory was 119.5MB in the beginning and 234.9MB in the end (delta: 115.3MB). Free memory was 86.2MB in the beginning and 141.1MB in the end (delta: -54.9MB). Peak memory consumption was 63.6MB. Max. memory is 16.1GB. [2021-12-16 09:21:53,445 INFO L158 Benchmark]: Witness Printer took 45.94ms. Allocated memory is still 234.9MB. Free memory was 141.1MB in the beginning and 136.9MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2021-12-16 09:21:53,446 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 119.5MB. Free memory is still 78.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 174.35ms. Allocated memory is still 119.5MB. Free memory was 93.2MB in the beginning and 96.7MB in the end (delta: -3.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 24.35ms. Allocated memory is still 119.5MB. Free memory was 96.7MB in the beginning and 95.4MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 16.12ms. Allocated memory is still 119.5MB. Free memory was 95.4MB in the beginning and 94.5MB in the end (delta: 944.0kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 210.18ms. Allocated memory is still 119.5MB. Free memory was 94.5MB in the beginning and 86.2MB in the end (delta: 8.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * BuchiAutomizer took 14285.08ms. Allocated memory was 119.5MB in the beginning and 234.9MB in the end (delta: 115.3MB). Free memory was 86.2MB in the beginning and 141.1MB in the end (delta: -54.9MB). Peak memory consumption was 63.6MB. Max. memory is 16.1GB. * Witness Printer took 45.94ms. Allocated memory is still 234.9MB. Free memory was 141.1MB in the beginning and 136.9MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 18 terminating modules (9 trivial, 6 deterministic, 3 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 4 locations. One deterministic module has affine ranking function -2 * i + 21 and consists of 5 locations. 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 -1 * i + 5 and consists of 6 locations. One nondeterministic module has affine ranking function i and consists of 3 locations. One nondeterministic module has affine ranking function -2 * i + 9 and consists of 9 locations. One nondeterministic module has affine ranking function -2 * i + 5 and consists of 13 locations. 9 modules have a trivial ranking function, the largest among these consists of 11 locations. The remainder module has 3614 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 14.2s and 13 iterations. TraceHistogramMax:19. Analysis of lassos took 7.4s. Construction of modules took 0.5s. Büchi inclusion checks took 5.6s. Highest rank in rank-based complementation 5. Minimization of det autom 2. Minimization of nondet autom 16. Automata minimization 0.3s AutomataMinimizationTime, 18 MinimizatonAttempts, 3069 StatesRemovedByMinimization, 15 NontrivialMinimizations. Non-live state removal took 0.2s Buchi closure took 0.0s. Biggest automaton had 3614 states and ocurred in iteration 12. Nontrivial modules had stage [5, 1, 1, 0, 2]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 741/820 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 426 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 391 mSDsluCounter, 237 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 30 mSDsCounter, 155 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 775 IncrementalHoareTripleChecker+Invalid, 930 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 155 mSolverCounterUnsat, 207 mSDtfsCounter, 775 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI2 SFLT2 conc0 concLT3 SILN0 SILU0 SILI1 SILT3 lasso1 LassoPreprocessingBenchmarks: Lassos: inital17 mio100 ax176 hnf100 lsp43 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq190 hnf92 smp92 dnf133 smp95 tf108 neg95 sie109 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 70ms VariablesStem: 1 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 16 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 13 LassoNonterminationAnalysisSatUnbounded: 1 LassoNonterminationAnalysisUnsat: 9 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 1.1s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 12]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {} State at position 1 is {i=1, \result=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2336fc63=0, up=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 12]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L6] int i; [L7] int up; [L8] i = __VERIFIER_nondet_int() [L9] up = 0 [L11] COND TRUE i > 0 [L12] COND TRUE i == 1 [L13] up = 1 [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND TRUE i == 10 [L16] up = 0 [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 Loop: [L12] COND TRUE i == 1 [L13] up = 1 [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND TRUE i == 10 [L16] up = 0 [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2021-12-16 09:21:53,481 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (64)] Ended with exit code 0 [2021-12-16 09:21:53,687 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (54)] Ended with exit code 0 [2021-12-16 09:21:53,887 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Ended with exit code 0 [2021-12-16 09:21:54,087 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Forceful destruction successful, exit code 0 [2021-12-16 09:21:54,287 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2021-12-16 09:21:54,504 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)