./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-crafted/NestedRecursion_2b.c --full-output -ea --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/termination-crafted/NestedRecursion_2b.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 422ea435de955cc6e58e578076c5ef733a2456157ad413df035d109cb231427a --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-21 03:23:44,875 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-21 03:23:44,877 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-21 03:23:44,911 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-21 03:23:44,911 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-21 03:23:44,913 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-21 03:23:44,914 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-21 03:23:44,916 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-21 03:23:44,917 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-21 03:23:44,921 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-21 03:23:44,921 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-21 03:23:44,922 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-21 03:23:44,922 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-21 03:23:44,924 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-21 03:23:44,925 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-21 03:23:44,927 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-21 03:23:44,928 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-21 03:23:44,929 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-21 03:23:44,930 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-21 03:23:44,934 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-21 03:23:44,935 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-21 03:23:44,936 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-21 03:23:44,937 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-21 03:23:44,938 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-21 03:23:44,942 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-21 03:23:44,943 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-21 03:23:44,943 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-21 03:23:44,944 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-21 03:23:44,944 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-21 03:23:44,945 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-21 03:23:44,945 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-21 03:23:44,946 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-21 03:23:44,947 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-21 03:23:44,948 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-21 03:23:44,948 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-21 03:23:44,949 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-21 03:23:44,950 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-21 03:23:44,950 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-21 03:23:44,950 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-21 03:23:44,951 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-21 03:23:44,951 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-21 03:23:44,952 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2022-02-21 03:23:44,976 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-21 03:23:44,976 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-21 03:23:44,976 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-21 03:23:44,977 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-21 03:23:44,978 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-21 03:23:44,978 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-21 03:23:44,978 INFO L138 SettingsManager]: * Use SBE=true [2022-02-21 03:23:44,978 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-02-21 03:23:44,978 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-02-21 03:23:44,978 INFO L138 SettingsManager]: * Use old map elimination=false [2022-02-21 03:23:44,979 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-02-21 03:23:44,979 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-02-21 03:23:44,979 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-02-21 03:23:44,980 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-21 03:23:44,980 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-21 03:23:44,980 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-21 03:23:44,980 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-21 03:23:44,980 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-02-21 03:23:44,980 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-02-21 03:23:44,980 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-02-21 03:23:44,981 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-21 03:23:44,981 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-02-21 03:23:44,981 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-21 03:23:44,981 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-02-21 03:23:44,981 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-21 03:23:44,981 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-21 03:23:44,982 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-21 03:23:44,982 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-21 03:23:44,983 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-02-21 03:23:44,983 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 -> 422ea435de955cc6e58e578076c5ef733a2456157ad413df035d109cb231427a [2022-02-21 03:23:45,202 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-21 03:23:45,234 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-21 03:23:45,236 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-21 03:23:45,238 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-21 03:23:45,239 INFO L275 PluginConnector]: CDTParser initialized [2022-02-21 03:23:45,240 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-crafted/NestedRecursion_2b.c [2022-02-21 03:23:45,318 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/25c8e477a/a7deb43a2e214154993def94d2679bb9/FLAG123e6c703 [2022-02-21 03:23:45,745 INFO L306 CDTParser]: Found 1 translation units. [2022-02-21 03:23:45,746 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-crafted/NestedRecursion_2b.c [2022-02-21 03:23:45,765 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/25c8e477a/a7deb43a2e214154993def94d2679bb9/FLAG123e6c703 [2022-02-21 03:23:46,272 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/25c8e477a/a7deb43a2e214154993def94d2679bb9 [2022-02-21 03:23:46,274 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-21 03:23:46,274 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-21 03:23:46,275 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-21 03:23:46,276 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-21 03:23:46,278 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-21 03:23:46,279 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:23:46" (1/1) ... [2022-02-21 03:23:46,279 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1dff7696 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:23:46, skipping insertion in model container [2022-02-21 03:23:46,280 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:23:46" (1/1) ... [2022-02-21 03:23:46,284 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-21 03:23:46,292 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 03:23:46,383 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:23:46,386 INFO L203 MainTranslator]: Completed pre-run [2022-02-21 03:23:46,401 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:23:46,410 INFO L208 MainTranslator]: Completed translation [2022-02-21 03:23:46,411 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:23:46 WrapperNode [2022-02-21 03:23:46,412 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-21 03:23:46,412 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-21 03:23:46,413 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-21 03:23:46,413 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-21 03:23:46,417 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:23:46" (1/1) ... [2022-02-21 03:23:46,423 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:23:46" (1/1) ... [2022-02-21 03:23:46,443 INFO L137 Inliner]: procedures = 5, calls = 5, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 9 [2022-02-21 03:23:46,444 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-21 03:23:46,444 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-21 03:23:46,444 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-21 03:23:46,445 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-21 03:23:46,452 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:23:46" (1/1) ... [2022-02-21 03:23:46,452 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:23:46" (1/1) ... [2022-02-21 03:23:46,452 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:23:46" (1/1) ... [2022-02-21 03:23:46,452 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:23:46" (1/1) ... [2022-02-21 03:23:46,454 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:23:46" (1/1) ... [2022-02-21 03:23:46,455 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:23:46" (1/1) ... [2022-02-21 03:23:46,455 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:23:46" (1/1) ... [2022-02-21 03:23:46,456 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-21 03:23:46,457 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-21 03:23:46,457 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-21 03:23:46,457 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-21 03:23:46,459 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:23:46" (1/1) ... [2022-02-21 03:23:46,465 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:23:46,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:23:46,487 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:23:46,489 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2022-02-21 03:23:46,523 INFO L130 BoogieDeclarations]: Found specification of procedure g [2022-02-21 03:23:46,523 INFO L138 BoogieDeclarations]: Found implementation of procedure g [2022-02-21 03:23:46,523 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-21 03:23:46,535 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-21 03:23:46,566 INFO L234 CfgBuilder]: Building ICFG [2022-02-21 03:23:46,567 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-21 03:23:46,654 INFO L275 CfgBuilder]: Performing block encoding [2022-02-21 03:23:46,659 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-21 03:23:46,659 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-02-21 03:23:46,661 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:23:46 BoogieIcfgContainer [2022-02-21 03:23:46,661 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-21 03:23:46,661 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-02-21 03:23:46,662 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-02-21 03:23:46,666 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-02-21 03:23:46,666 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:23:46,666 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 21.02 03:23:46" (1/3) ... [2022-02-21 03:23:46,667 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5fcf2753 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 03:23:46, skipping insertion in model container [2022-02-21 03:23:46,667 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:23:46,670 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:23:46" (2/3) ... [2022-02-21 03:23:46,671 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5fcf2753 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 03:23:46, skipping insertion in model container [2022-02-21 03:23:46,671 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:23:46,671 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:23:46" (3/3) ... [2022-02-21 03:23:46,672 INFO L388 chiAutomizerObserver]: Analyzing ICFG NestedRecursion_2b.c [2022-02-21 03:23:46,722 INFO L359 BuchiCegarLoop]: Interprodecural is true [2022-02-21 03:23:46,735 INFO L360 BuchiCegarLoop]: Hoare is false [2022-02-21 03:23:46,735 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-02-21 03:23:46,735 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-02-21 03:23:46,736 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-02-21 03:23:46,736 INFO L364 BuchiCegarLoop]: Difference is false [2022-02-21 03:23:46,736 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-02-21 03:23:46,736 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2022-02-21 03:23:46,761 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-21 03:23:46,807 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-02-21 03:23:46,807 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:23:46,807 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:23:46,811 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2022-02-21 03:23:46,811 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-02-21 03:23:46,811 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2022-02-21 03:23:46,811 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-21 03:23:46,814 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-02-21 03:23:46,814 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:23:46,814 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:23:46,815 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2022-02-21 03:23:46,815 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-02-21 03:23:46,822 INFO L791 eck$LassoCheckResult]: Stem: 4#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true; 7#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~ret3#1, main_~x~0#1;main_~x~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; 13#L20true assume !(main_~x~0#1 < 0); 12#L21true call main_#t~ret3#1 := g(main_~x~0#1);< 8#gENTRYtrue [2022-02-21 03:23:46,823 INFO L793 eck$LassoCheckResult]: Loop: 8#gENTRYtrue ~x := #in~x; 9#L12true assume !(0 == ~x); 6#L15true call #t~ret0 := g(~x - 1);< 8#gENTRYtrue [2022-02-21 03:23:46,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:23:46,832 INFO L85 PathProgramCache]: Analyzing trace with hash 1202733, now seen corresponding path program 1 times [2022-02-21 03:23:46,838 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:23:46,839 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073128944] [2022-02-21 03:23:46,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:23:46,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:23:46,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:23:46,902 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:23:46,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:23:46,929 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:23:46,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:23:46,932 INFO L85 PathProgramCache]: Analyzing trace with hash 29937, now seen corresponding path program 1 times [2022-02-21 03:23:46,933 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:23:46,934 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294248736] [2022-02-21 03:23:46,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:23:46,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:23:46,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:23:46,953 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:23:46,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:23:46,961 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:23:46,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:23:46,963 INFO L85 PathProgramCache]: Analyzing trace with hash 1470880581, now seen corresponding path program 1 times [2022-02-21 03:23:46,963 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:23:46,964 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054857334] [2022-02-21 03:23:46,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:23:46,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:23:46,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:23:46,980 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:23:46,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:23:46,994 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:23:47,119 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:23:47,120 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:23:47,120 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:23:47,120 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:23:47,120 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-02-21 03:23:47,120 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:23:47,120 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:23:47,121 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:23:47,121 INFO L133 ssoRankerPreferences]: Filename of dumped script: NestedRecursion_2b.c_Iteration1_Loop [2022-02-21 03:23:47,121 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:23:47,121 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:23:47,130 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:23:47,136 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:23:47,140 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:23:47,142 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:23:47,146 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:23:47,236 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:23:47,236 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-02-21 03:23:47,237 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:23:47,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:23:47,239 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:23:47,242 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2022-02-21 03:23:47,245 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:23:47,245 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:23:47,256 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:23:47,256 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {g_~x=0} Honda state: {g_~x=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 03:23:47,274 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 [2022-02-21 03:23:47,275 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:23:47,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:23:47,276 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:23:47,277 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2022-02-21 03:23:47,279 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:23:47,279 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:23:47,285 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:23:47,285 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {g_#t~ret1=0} Honda state: {g_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 03:23:47,301 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2022-02-21 03:23:47,302 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:23:47,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:23:47,312 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:23:47,313 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2022-02-21 03:23:47,316 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:23:47,316 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:23:47,339 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:23:47,340 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {g_#res=0} Honda state: {g_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 03:23:47,357 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2022-02-21 03:23:47,358 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:23:47,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:23:47,360 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:23:47,361 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2022-02-21 03:23:47,363 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:23:47,363 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:23:47,369 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:23:47,369 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {g_#t~ret0=0} Honda state: {g_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 03:23:47,385 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2022-02-21 03:23:47,385 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:23:47,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:23:47,386 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:23:47,388 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2022-02-21 03:23:47,390 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:23:47,390 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:23:47,419 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 [2022-02-21 03:23:47,420 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:23:47,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:23:47,421 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:23:47,422 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2022-02-21 03:23:47,423 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-02-21 03:23:47,423 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:23:47,448 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:23:47,448 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {g_#in~x=-4} Honda state: {g_#in~x=-4} Generalized eigenvectors: [{g_#in~x=0}, {g_#in~x=0}, {g_#in~x=-1}] Lambdas: [0, 5, 1] Nus: [0, 0] [2022-02-21 03:23:47,464 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2022-02-21 03:23:47,508 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:23:47,508 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:23:47,509 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:23:47,509 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:23:47,509 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-02-21 03:23:47,509 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:23:47,509 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:23:47,509 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:23:47,509 INFO L133 ssoRankerPreferences]: Filename of dumped script: NestedRecursion_2b.c_Iteration1_Lasso [2022-02-21 03:23:47,509 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:23:47,509 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:23:47,511 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:23:47,513 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:23:47,517 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:23:47,520 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:23:47,523 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:23:47,525 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:23:47,528 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:23:47,530 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:23:47,533 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:23:47,535 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:23:47,624 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:23:47,624 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-02-21 03:23:47,624 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:23:47,624 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:23:47,641 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:23:47,671 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2022-02-21 03:23:47,672 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:23:47,672 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:23:47,679 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:23:47,679 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {g_#t~ret1=0} Honda state: {g_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 03:23:47,696 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2022-02-21 03:23:47,697 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:23:47,697 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:23:47,698 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:23:47,699 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2022-02-21 03:23:47,700 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:23:47,701 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:23:47,721 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:23:47,722 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {g_#res=0} Honda state: {g_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 03:23:47,739 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2022-02-21 03:23:47,739 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:23:47,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:23:47,741 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:23:47,742 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2022-02-21 03:23:47,743 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:23:47,743 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:23:47,763 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:23:47,763 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {g_#t~ret0=0} Honda state: {g_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 03:23:47,781 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2022-02-21 03:23:47,782 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:23:47,782 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:23:47,783 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:23:47,784 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2022-02-21 03:23:47,785 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:23:47,785 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:23:47,806 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:23:47,806 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~x~0#1=0} Honda state: {ULTIMATE.start_main_~x~0#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 03:23:47,824 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2022-02-21 03:23:47,824 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:23:47,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:23:47,825 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:23:47,826 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2022-02-21 03:23:47,828 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:23:47,828 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:23:47,849 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:23:47,849 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: [] [2022-02-21 03:23:47,867 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2022-02-21 03:23:47,868 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:23:47,868 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:23:47,869 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:23:47,870 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2022-02-21 03:23:47,872 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:23:47,872 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:23:47,893 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:23:47,893 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~ret3#1=0} Honda state: {ULTIMATE.start_main_#t~ret3#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 03:23:47,910 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2022-02-21 03:23:47,911 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:23:47,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:23:47,912 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:23:47,913 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2022-02-21 03:23:47,915 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:23:47,915 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:23:47,929 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:23:47,929 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet2#1=0} Honda state: {ULTIMATE.start_main_#t~nondet2#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 03:23:47,946 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2022-02-21 03:23:47,947 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:23:47,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:23:47,948 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:23:47,949 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2022-02-21 03:23:47,950 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:23:47,950 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:23:47,971 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:23:47,972 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {g_~x=0} Honda state: {g_~x=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 03:23:47,994 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2022-02-21 03:23:47,994 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:23:47,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:23:47,996 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:23:47,997 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2022-02-21 03:23:47,998 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:23:47,999 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:23:48,020 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:23:48,020 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_#t~ret4#1=0} Honda state: {ULTIMATE.start_#t~ret4#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 03:23:48,038 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2022-02-21 03:23:48,039 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:23:48,039 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:23:48,042 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:23:48,042 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2022-02-21 03:23:48,044 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:23:48,044 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:23:48,076 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2022-02-21 03:23:48,076 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:23:48,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:23:48,077 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:23:48,078 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2022-02-21 03:23:48,081 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-02-21 03:23:48,081 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:23:48,112 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-02-21 03:23:48,115 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2022-02-21 03:23:48,116 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:23:48,116 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:23:48,116 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:23:48,116 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:23:48,116 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:23:48,116 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:23:48,116 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:23:48,116 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:23:48,116 INFO L133 ssoRankerPreferences]: Filename of dumped script: NestedRecursion_2b.c_Iteration1_Lasso [2022-02-21 03:23:48,116 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:23:48,116 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:23:48,117 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:23:48,121 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:23:48,123 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:23:48,131 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:23:48,138 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:23:48,141 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:23:48,143 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:23:48,145 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:23:48,147 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:23:48,149 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:23:48,237 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:23:48,240 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:23:48,241 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:23:48,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:23:48,242 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) [2022-02-21 03:23:48,243 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 [2022-02-21 03:23:48,245 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:23:48,251 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:23:48,252 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:23:48,252 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:23:48,252 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:23:48,252 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:23:48,253 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:23:48,253 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:23:48,255 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:23:48,273 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2022-02-21 03:23:48,273 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:23:48,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:23:48,274 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:23:48,276 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2022-02-21 03:23:48,277 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:23:48,284 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:23:48,284 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:23:48,284 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:23:48,284 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:23:48,284 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:23:48,287 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:23:48,287 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:23:48,288 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:23:48,304 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2022-02-21 03:23:48,304 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:23:48,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:23:48,305 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:23:48,306 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2022-02-21 03:23:48,308 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:23:48,314 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:23:48,314 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:23:48,314 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:23:48,314 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:23:48,314 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:23:48,315 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:23:48,315 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:23:48,330 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:23:48,346 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2022-02-21 03:23:48,347 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:23:48,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:23:48,348 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:23:48,349 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2022-02-21 03:23:48,351 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:23:48,357 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:23:48,357 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:23:48,357 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2022-02-21 03:23:48,357 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:23:48,364 INFO L401 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2022-02-21 03:23:48,364 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2022-02-21 03:23:48,415 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:23:48,429 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2022-02-21 03:23:48,430 INFO L444 ModelExtractionUtils]: 2 out of 11 variables were initially zero. Simplification set additionally 6 variables to zero. [2022-02-21 03:23:48,431 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:23:48,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:23:48,433 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:23:48,433 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2022-02-21 03:23:48,434 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:23:48,457 INFO L438 nArgumentSynthesizer]: Removed 3 redundant supporting invariants from a total of 4. [2022-02-21 03:23:48,457 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:23:48,458 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(g_#in~x) = 1*g_#in~x Supporting invariants [1*g_#in~x >= 0] [2022-02-21 03:23:48,499 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2022-02-21 03:23:48,519 INFO L297 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2022-02-21 03:23:48,531 INFO L390 LassoCheck]: Loop: "~x := #in~x;" "assume !(0 == ~x);" "call #t~ret0 := g(~x - 1);"< [2022-02-21 03:23:48,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:23:48,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:23:48,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:23:48,609 INFO L263 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-21 03:23:48,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:23:48,634 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:23:48,684 INFO L290 TraceCheckUtils]: 0: Hoare triple {25#unseeded} assume { :begin_inline_ULTIMATE.init } true; {25#unseeded} is VALID [2022-02-21 03:23:48,685 INFO L290 TraceCheckUtils]: 1: Hoare triple {25#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~ret3#1, main_~x~0#1;main_~x~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; {25#unseeded} is VALID [2022-02-21 03:23:48,685 INFO L290 TraceCheckUtils]: 2: Hoare triple {25#unseeded} assume !(main_~x~0#1 < 0); {59#(and (not (< |ULTIMATE.start_main_~x~0#1| 0)) unseeded)} is VALID [2022-02-21 03:23:48,686 INFO L272 TraceCheckUtils]: 3: Hoare triple {59#(and (not (< |ULTIMATE.start_main_~x~0#1| 0)) unseeded)} call main_#t~ret3#1 := g(main_~x~0#1); {44#(and (>= |g_#in~x| 0) unseeded)} is VALID [2022-02-21 03:23:48,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:23:48,704 INFO L263 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 10 conjunts are in the unsatisfiable core [2022-02-21 03:23:48,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:23:48,708 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:23:48,749 INFO L290 TraceCheckUtils]: 0: Hoare triple {45#(and (>= |g_#in~x| 0) (>= oldRank0 |g_#in~x|))} ~x := #in~x; {63#(and (<= 0 g_~x) (<= g_~x oldRank0))} is VALID [2022-02-21 03:23:48,749 INFO L290 TraceCheckUtils]: 1: Hoare triple {63#(and (<= 0 g_~x) (<= g_~x oldRank0))} assume !(0 == ~x); {67#(and (<= 0 g_~x) (<= g_~x oldRank0) (not (= g_~x 0)))} is VALID [2022-02-21 03:23:48,750 INFO L272 TraceCheckUtils]: 2: Hoare triple {67#(and (<= 0 g_~x) (<= g_~x oldRank0) (not (= g_~x 0)))} call #t~ret0 := g(~x - 1); {47#(and (or (and (>= oldRank0 0) (> oldRank0 |g_#in~x|)) unseeded) (>= |g_#in~x| 0))} is VALID [2022-02-21 03:23:48,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:23:48,766 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:23:48,774 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:23:48,775 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 3 letters. [2022-02-21 03:23:48,777 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:48,779 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2022-02-21 03:23:48,780 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 5 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:23:48,893 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3). Second operand has 5 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 36 states and 43 transitions. Complement of second has 13 states. [2022-02-21 03:23:48,893 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 [2022-02-21 03:23:48,894 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:23:48,894 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-21 03:23:48,896 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-02-21 03:23:48,896 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:23:48,896 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:23:48,896 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 5 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:23:48,898 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:23:48,898 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:23:48,898 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:23:48,898 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 43 transitions. [2022-02-21 03:23:48,899 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-02-21 03:23:48,899 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:23:48,899 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:23:48,908 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-21 03:23:48,910 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-02-21 03:23:48,912 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 5 examples of accepted words. [2022-02-21 03:23:48,912 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 5 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:23:48,912 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:23:48,913 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:23:48,913 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 36 states and 43 transitions. cyclomatic complexity: 9 [2022-02-21 03:23:48,915 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 5 examples of accepted words. [2022-02-21 03:23:48,917 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Stem has 4 letters. Loop has 3 letters. [2022-02-21 03:23:48,917 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:48,917 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 3 letters. [2022-02-21 03:23:48,918 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:48,918 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 43 transitions. cyclomatic complexity: 9 Stem has 4 letters. Loop has 3 letters. [2022-02-21 03:23:48,918 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:48,918 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Stem has 2 letters. Loop has 3 letters. [2022-02-21 03:23:48,918 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:48,918 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 2 letters. Loop has 3 letters. [2022-02-21 03:23:48,919 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:48,919 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 43 transitions. cyclomatic complexity: 9 Stem has 2 letters. Loop has 3 letters. [2022-02-21 03:23:48,919 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:48,919 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Stem has 11 letters. Loop has 8 letters. [2022-02-21 03:23:48,920 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:48,920 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 11 letters. Loop has 8 letters. [2022-02-21 03:23:48,921 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:48,921 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 43 transitions. cyclomatic complexity: 9 Stem has 11 letters. Loop has 8 letters. [2022-02-21 03:23:48,921 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:48,922 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Stem has 36 letters. Loop has 36 letters. [2022-02-21 03:23:48,922 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:48,922 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 36 letters. Loop has 36 letters. [2022-02-21 03:23:48,923 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:48,923 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 43 transitions. cyclomatic complexity: 9 Stem has 36 letters. Loop has 36 letters. [2022-02-21 03:23:48,923 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:48,924 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Stem has 15 letters. Loop has 15 letters. [2022-02-21 03:23:48,924 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:48,924 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 15 letters. [2022-02-21 03:23:48,924 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:48,924 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 43 transitions. cyclomatic complexity: 9 Stem has 15 letters. Loop has 15 letters. [2022-02-21 03:23:48,924 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:48,925 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:23:48,925 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:48,925 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:23:48,925 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:48,925 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 43 transitions. cyclomatic complexity: 9 Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:23:48,925 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:48,926 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Stem has 11 letters. Loop has 8 letters. [2022-02-21 03:23:48,926 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:48,926 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 11 letters. Loop has 8 letters. [2022-02-21 03:23:48,926 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:48,926 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 43 transitions. cyclomatic complexity: 9 Stem has 11 letters. Loop has 8 letters. [2022-02-21 03:23:48,927 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:48,927 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Stem has 5 letters. Loop has 3 letters. [2022-02-21 03:23:48,928 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:48,928 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 3 letters. [2022-02-21 03:23:48,928 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:48,928 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 43 transitions. cyclomatic complexity: 9 Stem has 5 letters. Loop has 3 letters. [2022-02-21 03:23:48,928 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:48,929 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Stem has 4 letters. Loop has 3 letters. [2022-02-21 03:23:48,929 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:48,929 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 3 letters. [2022-02-21 03:23:48,929 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:48,929 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 43 transitions. cyclomatic complexity: 9 Stem has 4 letters. Loop has 3 letters. [2022-02-21 03:23:48,930 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:48,931 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Stem has 6 letters. Loop has 3 letters. [2022-02-21 03:23:48,932 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:48,932 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 3 letters. [2022-02-21 03:23:48,932 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:48,932 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 43 transitions. cyclomatic complexity: 9 Stem has 6 letters. Loop has 3 letters. [2022-02-21 03:23:48,932 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:48,933 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Stem has 11 letters. Loop has 8 letters. [2022-02-21 03:23:48,933 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:48,933 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 11 letters. Loop has 8 letters. [2022-02-21 03:23:48,933 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:48,933 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 43 transitions. cyclomatic complexity: 9 Stem has 11 letters. Loop has 8 letters. [2022-02-21 03:23:48,933 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:48,934 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Stem has 2 letters. Loop has 3 letters. [2022-02-21 03:23:48,934 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:48,934 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 2 letters. Loop has 3 letters. [2022-02-21 03:23:48,934 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:48,934 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 43 transitions. cyclomatic complexity: 9 Stem has 2 letters. Loop has 3 letters. [2022-02-21 03:23:48,934 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:48,935 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Stem has 11 letters. Loop has 8 letters. [2022-02-21 03:23:48,935 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:48,935 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 11 letters. Loop has 8 letters. [2022-02-21 03:23:48,936 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:48,936 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 43 transitions. cyclomatic complexity: 9 Stem has 11 letters. Loop has 8 letters. [2022-02-21 03:23:48,936 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:48,937 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:23:48,937 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:48,937 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:23:48,937 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:48,937 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 43 transitions. cyclomatic complexity: 9 Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:23:48,937 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:48,938 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Stem has 13 letters. Loop has 3 letters. [2022-02-21 03:23:48,938 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:48,939 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 13 letters. Loop has 3 letters. [2022-02-21 03:23:48,939 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:48,939 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 43 transitions. cyclomatic complexity: 9 Stem has 13 letters. Loop has 3 letters. [2022-02-21 03:23:48,939 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:48,940 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Stem has 14 letters. Loop has 3 letters. [2022-02-21 03:23:48,940 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:48,940 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 14 letters. Loop has 3 letters. [2022-02-21 03:23:48,940 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:48,940 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 43 transitions. cyclomatic complexity: 9 Stem has 14 letters. Loop has 3 letters. [2022-02-21 03:23:48,940 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:48,941 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Stem has 11 letters. Loop has 8 letters. [2022-02-21 03:23:48,941 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:48,941 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 11 letters. Loop has 8 letters. [2022-02-21 03:23:48,941 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:48,942 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 43 transitions. cyclomatic complexity: 9 Stem has 11 letters. Loop has 8 letters. [2022-02-21 03:23:48,942 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:48,942 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:23:48,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:23:48,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 12 transitions. [2022-02-21 03:23:48,949 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 4 letters. Loop has 3 letters. [2022-02-21 03:23:48,949 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:48,950 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:23:48,950 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:48,950 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 4 letters. Loop has 6 letters. [2022-02-21 03:23:48,950 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:48,950 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 43 transitions. cyclomatic complexity: 9 [2022-02-21 03:23:48,964 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-02-21 03:23:48,970 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 20 states and 26 transitions. [2022-02-21 03:23:48,971 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2022-02-21 03:23:48,972 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2022-02-21 03:23:48,972 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 26 transitions. [2022-02-21 03:23:48,972 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:23:48,972 INFO L681 BuchiCegarLoop]: Abstraction has 20 states and 26 transitions. [2022-02-21 03:23:48,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 26 transitions. [2022-02-21 03:23:48,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 18. [2022-02-21 03:23:48,992 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:23:48,992 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states and 26 transitions. Second operand has 18 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-02-21 03:23:48,993 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states and 26 transitions. Second operand has 18 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-02-21 03:23:48,994 INFO L87 Difference]: Start difference. First operand 20 states and 26 transitions. Second operand has 18 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-02-21 03:23:48,996 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:23:49,003 INFO L93 Difference]: Finished difference Result 35 states and 43 transitions. [2022-02-21 03:23:49,004 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 43 transitions. [2022-02-21 03:23:49,006 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:23:49,006 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:23:49,006 INFO L74 IsIncluded]: Start isIncluded. First operand has 18 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Second operand 20 states and 26 transitions. [2022-02-21 03:23:49,007 INFO L87 Difference]: Start difference. First operand has 18 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Second operand 20 states and 26 transitions. [2022-02-21 03:23:49,007 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:23:49,016 INFO L93 Difference]: Finished difference Result 45 states and 55 transitions. [2022-02-21 03:23:49,016 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 55 transitions. [2022-02-21 03:23:49,018 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:23:49,018 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:23:49,019 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:23:49,019 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:23:49,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-02-21 03:23:49,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2022-02-21 03:23:49,022 INFO L704 BuchiCegarLoop]: Abstraction has 18 states and 22 transitions. [2022-02-21 03:23:49,022 INFO L587 BuchiCegarLoop]: Abstraction has 18 states and 22 transitions. [2022-02-21 03:23:49,022 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2022-02-21 03:23:49,022 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 22 transitions. [2022-02-21 03:23:49,023 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-02-21 03:23:49,024 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:23:49,024 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:23:49,025 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:23:49,025 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1] [2022-02-21 03:23:49,025 INFO L791 eck$LassoCheckResult]: Stem: 127#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 128#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~ret3#1, main_~x~0#1;main_~x~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; 138#L20 assume !(main_~x~0#1 < 0); 136#L21 call main_#t~ret3#1 := g(main_~x~0#1);< 137#gENTRY ~x := #in~x; 139#L12 assume !(0 == ~x); 130#L15 call #t~ret0 := g(~x - 1);< 135#gENTRY ~x := #in~x; 140#L12 assume 0 == ~x;#res := 1; 129#gFINAL assume true; 131#gEXIT >#23#return; 133#L15-1 [2022-02-21 03:23:49,025 INFO L793 eck$LassoCheckResult]: Loop: 133#L15-1 call #t~ret1 := g(1 + #t~ret0);< 134#gENTRY ~x := #in~x; 144#L12 assume !(0 == ~x); 132#L15 call #t~ret0 := g(~x - 1);< 134#gENTRY ~x := #in~x; 144#L12 assume 0 == ~x;#res := 1; 142#gFINAL assume true; 143#gEXIT >#23#return; 133#L15-1 [2022-02-21 03:23:49,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:23:49,025 INFO L85 PathProgramCache]: Analyzing trace with hash -1676493545, now seen corresponding path program 1 times [2022-02-21 03:23:49,026 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:23:49,027 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873344747] [2022-02-21 03:23:49,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:23:49,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:23:49,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:23:49,039 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:23:49,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:23:49,044 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:23:49,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:23:49,044 INFO L85 PathProgramCache]: Analyzing trace with hash 1500125133, now seen corresponding path program 1 times [2022-02-21 03:23:49,044 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:23:49,044 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314708816] [2022-02-21 03:23:49,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:23:49,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:23:49,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:23:49,049 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:23:49,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:23:49,053 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:23:49,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:23:49,054 INFO L85 PathProgramCache]: Analyzing trace with hash 122773219, now seen corresponding path program 1 times [2022-02-21 03:23:49,054 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:23:49,054 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240586983] [2022-02-21 03:23:49,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:23:49,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:23:49,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:23:49,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-21 03:23:49,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:23:49,108 INFO L290 TraceCheckUtils]: 0: Hoare triple {329#true} ~x := #in~x; {329#true} is VALID [2022-02-21 03:23:49,108 INFO L290 TraceCheckUtils]: 1: Hoare triple {329#true} assume 0 == ~x;#res := 1; {342#(<= 1 |g_#res|)} is VALID [2022-02-21 03:23:49,109 INFO L290 TraceCheckUtils]: 2: Hoare triple {342#(<= 1 |g_#res|)} assume true; {342#(<= 1 |g_#res|)} is VALID [2022-02-21 03:23:49,109 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {342#(<= 1 |g_#res|)} {329#true} #23#return; {335#(<= 1 |g_#t~ret0|)} is VALID [2022-02-21 03:23:49,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-02-21 03:23:49,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:23:49,134 INFO L290 TraceCheckUtils]: 0: Hoare triple {329#true} ~x := #in~x; {343#(= |g_#in~x| g_~x)} is VALID [2022-02-21 03:23:49,134 INFO L290 TraceCheckUtils]: 1: Hoare triple {343#(= |g_#in~x| g_~x)} assume 0 == ~x;#res := 1; {344#(= |g_#in~x| 0)} is VALID [2022-02-21 03:23:49,135 INFO L290 TraceCheckUtils]: 2: Hoare triple {344#(= |g_#in~x| 0)} assume true; {344#(= |g_#in~x| 0)} is VALID [2022-02-21 03:23:49,135 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {344#(= |g_#in~x| 0)} {337#(<= 2 g_~x)} #23#return; {330#false} is VALID [2022-02-21 03:23:49,136 INFO L290 TraceCheckUtils]: 0: Hoare triple {329#true} assume { :begin_inline_ULTIMATE.init } true; {329#true} is VALID [2022-02-21 03:23:49,136 INFO L290 TraceCheckUtils]: 1: Hoare triple {329#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~ret3#1, main_~x~0#1;main_~x~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; {329#true} is VALID [2022-02-21 03:23:49,136 INFO L290 TraceCheckUtils]: 2: Hoare triple {329#true} assume !(main_~x~0#1 < 0); {329#true} is VALID [2022-02-21 03:23:49,136 INFO L272 TraceCheckUtils]: 3: Hoare triple {329#true} call main_#t~ret3#1 := g(main_~x~0#1); {329#true} is VALID [2022-02-21 03:23:49,136 INFO L290 TraceCheckUtils]: 4: Hoare triple {329#true} ~x := #in~x; {329#true} is VALID [2022-02-21 03:23:49,136 INFO L290 TraceCheckUtils]: 5: Hoare triple {329#true} assume !(0 == ~x); {329#true} is VALID [2022-02-21 03:23:49,137 INFO L272 TraceCheckUtils]: 6: Hoare triple {329#true} call #t~ret0 := g(~x - 1); {329#true} is VALID [2022-02-21 03:23:49,137 INFO L290 TraceCheckUtils]: 7: Hoare triple {329#true} ~x := #in~x; {329#true} is VALID [2022-02-21 03:23:49,137 INFO L290 TraceCheckUtils]: 8: Hoare triple {329#true} assume 0 == ~x;#res := 1; {342#(<= 1 |g_#res|)} is VALID [2022-02-21 03:23:49,137 INFO L290 TraceCheckUtils]: 9: Hoare triple {342#(<= 1 |g_#res|)} assume true; {342#(<= 1 |g_#res|)} is VALID [2022-02-21 03:23:49,138 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {342#(<= 1 |g_#res|)} {329#true} #23#return; {335#(<= 1 |g_#t~ret0|)} is VALID [2022-02-21 03:23:49,139 INFO L272 TraceCheckUtils]: 11: Hoare triple {335#(<= 1 |g_#t~ret0|)} call #t~ret1 := g(1 + #t~ret0); {336#(<= 2 |g_#in~x|)} is VALID [2022-02-21 03:23:49,139 INFO L290 TraceCheckUtils]: 12: Hoare triple {336#(<= 2 |g_#in~x|)} ~x := #in~x; {337#(<= 2 g_~x)} is VALID [2022-02-21 03:23:49,139 INFO L290 TraceCheckUtils]: 13: Hoare triple {337#(<= 2 g_~x)} assume !(0 == ~x); {337#(<= 2 g_~x)} is VALID [2022-02-21 03:23:49,139 INFO L272 TraceCheckUtils]: 14: Hoare triple {337#(<= 2 g_~x)} call #t~ret0 := g(~x - 1); {329#true} is VALID [2022-02-21 03:23:49,140 INFO L290 TraceCheckUtils]: 15: Hoare triple {329#true} ~x := #in~x; {343#(= |g_#in~x| g_~x)} is VALID [2022-02-21 03:23:49,140 INFO L290 TraceCheckUtils]: 16: Hoare triple {343#(= |g_#in~x| g_~x)} assume 0 == ~x;#res := 1; {344#(= |g_#in~x| 0)} is VALID [2022-02-21 03:23:49,140 INFO L290 TraceCheckUtils]: 17: Hoare triple {344#(= |g_#in~x| 0)} assume true; {344#(= |g_#in~x| 0)} is VALID [2022-02-21 03:23:49,141 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {344#(= |g_#in~x| 0)} {337#(<= 2 g_~x)} #23#return; {330#false} is VALID [2022-02-21 03:23:49,141 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-21 03:23:49,142 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:23:49,142 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240586983] [2022-02-21 03:23:49,142 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [240586983] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:23:49,142 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [88944334] [2022-02-21 03:23:49,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:23:49,143 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:23:49,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:23:49,144 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:23:49,145 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-02-21 03:23:49,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:23:49,165 INFO L263 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-21 03:23:49,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:23:49,176 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:23:49,293 INFO L290 TraceCheckUtils]: 0: Hoare triple {329#true} assume { :begin_inline_ULTIMATE.init } true; {329#true} is VALID [2022-02-21 03:23:49,294 INFO L290 TraceCheckUtils]: 1: Hoare triple {329#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~ret3#1, main_~x~0#1;main_~x~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; {329#true} is VALID [2022-02-21 03:23:49,308 INFO L290 TraceCheckUtils]: 2: Hoare triple {329#true} assume !(main_~x~0#1 < 0); {329#true} is VALID [2022-02-21 03:23:49,308 INFO L272 TraceCheckUtils]: 3: Hoare triple {329#true} call main_#t~ret3#1 := g(main_~x~0#1); {329#true} is VALID [2022-02-21 03:23:49,308 INFO L290 TraceCheckUtils]: 4: Hoare triple {329#true} ~x := #in~x; {329#true} is VALID [2022-02-21 03:23:49,308 INFO L290 TraceCheckUtils]: 5: Hoare triple {329#true} assume !(0 == ~x); {329#true} is VALID [2022-02-21 03:23:49,308 INFO L272 TraceCheckUtils]: 6: Hoare triple {329#true} call #t~ret0 := g(~x - 1); {329#true} is VALID [2022-02-21 03:23:49,308 INFO L290 TraceCheckUtils]: 7: Hoare triple {329#true} ~x := #in~x; {329#true} is VALID [2022-02-21 03:23:49,319 INFO L290 TraceCheckUtils]: 8: Hoare triple {329#true} assume 0 == ~x;#res := 1; {342#(<= 1 |g_#res|)} is VALID [2022-02-21 03:23:49,320 INFO L290 TraceCheckUtils]: 9: Hoare triple {342#(<= 1 |g_#res|)} assume true; {342#(<= 1 |g_#res|)} is VALID [2022-02-21 03:23:49,321 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {342#(<= 1 |g_#res|)} {329#true} #23#return; {335#(<= 1 |g_#t~ret0|)} is VALID [2022-02-21 03:23:49,322 INFO L272 TraceCheckUtils]: 11: Hoare triple {335#(<= 1 |g_#t~ret0|)} call #t~ret1 := g(1 + #t~ret0); {336#(<= 2 |g_#in~x|)} is VALID [2022-02-21 03:23:49,323 INFO L290 TraceCheckUtils]: 12: Hoare triple {336#(<= 2 |g_#in~x|)} ~x := #in~x; {337#(<= 2 g_~x)} is VALID [2022-02-21 03:23:49,323 INFO L290 TraceCheckUtils]: 13: Hoare triple {337#(<= 2 g_~x)} assume !(0 == ~x); {337#(<= 2 g_~x)} is VALID [2022-02-21 03:23:49,326 INFO L272 TraceCheckUtils]: 14: Hoare triple {337#(<= 2 g_~x)} call #t~ret0 := g(~x - 1); {329#true} is VALID [2022-02-21 03:23:49,327 INFO L290 TraceCheckUtils]: 15: Hoare triple {329#true} ~x := #in~x; {393#(<= |g_#in~x| g_~x)} is VALID [2022-02-21 03:23:49,328 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2022-02-21 03:23:49,328 INFO L290 TraceCheckUtils]: 16: Hoare triple {393#(<= |g_#in~x| g_~x)} assume 0 == ~x;#res := 1; {397#(<= |g_#in~x| 0)} is VALID [2022-02-21 03:23:49,329 INFO L290 TraceCheckUtils]: 17: Hoare triple {397#(<= |g_#in~x| 0)} assume true; {397#(<= |g_#in~x| 0)} is VALID [2022-02-21 03:23:49,329 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {397#(<= |g_#in~x| 0)} {337#(<= 2 g_~x)} #23#return; {330#false} is VALID [2022-02-21 03:23:49,330 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-21 03:23:49,330 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:23:49,548 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {397#(<= |g_#in~x| 0)} {337#(<= 2 g_~x)} #23#return; {330#false} is VALID [2022-02-21 03:23:49,548 INFO L290 TraceCheckUtils]: 17: Hoare triple {397#(<= |g_#in~x| 0)} assume true; {397#(<= |g_#in~x| 0)} is VALID [2022-02-21 03:23:49,549 INFO L290 TraceCheckUtils]: 16: Hoare triple {413#(or (not (<= g_~x 0)) (<= |g_#in~x| 0))} assume 0 == ~x;#res := 1; {397#(<= |g_#in~x| 0)} is VALID [2022-02-21 03:23:49,549 INFO L290 TraceCheckUtils]: 15: Hoare triple {329#true} ~x := #in~x; {413#(or (not (<= g_~x 0)) (<= |g_#in~x| 0))} is VALID [2022-02-21 03:23:49,549 INFO L272 TraceCheckUtils]: 14: Hoare triple {337#(<= 2 g_~x)} call #t~ret0 := g(~x - 1); {329#true} is VALID [2022-02-21 03:23:49,549 INFO L290 TraceCheckUtils]: 13: Hoare triple {337#(<= 2 g_~x)} assume !(0 == ~x); {337#(<= 2 g_~x)} is VALID [2022-02-21 03:23:49,550 INFO L290 TraceCheckUtils]: 12: Hoare triple {336#(<= 2 |g_#in~x|)} ~x := #in~x; {337#(<= 2 g_~x)} is VALID [2022-02-21 03:23:49,550 INFO L272 TraceCheckUtils]: 11: Hoare triple {335#(<= 1 |g_#t~ret0|)} call #t~ret1 := g(1 + #t~ret0); {336#(<= 2 |g_#in~x|)} is VALID [2022-02-21 03:23:49,551 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {342#(<= 1 |g_#res|)} {329#true} #23#return; {335#(<= 1 |g_#t~ret0|)} is VALID [2022-02-21 03:23:49,551 INFO L290 TraceCheckUtils]: 9: Hoare triple {342#(<= 1 |g_#res|)} assume true; {342#(<= 1 |g_#res|)} is VALID [2022-02-21 03:23:49,552 INFO L290 TraceCheckUtils]: 8: Hoare triple {329#true} assume 0 == ~x;#res := 1; {342#(<= 1 |g_#res|)} is VALID [2022-02-21 03:23:49,552 INFO L290 TraceCheckUtils]: 7: Hoare triple {329#true} ~x := #in~x; {329#true} is VALID [2022-02-21 03:23:49,552 INFO L272 TraceCheckUtils]: 6: Hoare triple {329#true} call #t~ret0 := g(~x - 1); {329#true} is VALID [2022-02-21 03:23:49,552 INFO L290 TraceCheckUtils]: 5: Hoare triple {329#true} assume !(0 == ~x); {329#true} is VALID [2022-02-21 03:23:49,552 INFO L290 TraceCheckUtils]: 4: Hoare triple {329#true} ~x := #in~x; {329#true} is VALID [2022-02-21 03:23:49,552 INFO L272 TraceCheckUtils]: 3: Hoare triple {329#true} call main_#t~ret3#1 := g(main_~x~0#1); {329#true} is VALID [2022-02-21 03:23:49,552 INFO L290 TraceCheckUtils]: 2: Hoare triple {329#true} assume !(main_~x~0#1 < 0); {329#true} is VALID [2022-02-21 03:23:49,552 INFO L290 TraceCheckUtils]: 1: Hoare triple {329#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~ret3#1, main_~x~0#1;main_~x~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; {329#true} is VALID [2022-02-21 03:23:49,552 INFO L290 TraceCheckUtils]: 0: Hoare triple {329#true} assume { :begin_inline_ULTIMATE.init } true; {329#true} is VALID [2022-02-21 03:23:49,552 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-21 03:23:49,553 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [88944334] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:23:49,553 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:23:49,553 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 10 [2022-02-21 03:23:49,553 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861889734] [2022-02-21 03:23:49,553 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:23:49,658 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:23:49,659 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:23:49,659 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:23:49,659 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:23:49,659 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-02-21 03:23:49,659 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:23:49,659 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:23:49,659 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:23:49,659 INFO L133 ssoRankerPreferences]: Filename of dumped script: NestedRecursion_2b.c_Iteration2_Loop [2022-02-21 03:23:49,659 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:23:49,659 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:23:49,659 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:23:49,665 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:23:49,666 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:23:49,700 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:23:49,700 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-02-21 03:23:49,700 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:23:49,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:23:49,701 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:23:49,703 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2022-02-21 03:23:49,704 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:23:49,704 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:23:49,774 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2022-02-21 03:23:49,774 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:23:49,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:23:49,776 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:23:49,777 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2022-02-21 03:23:49,778 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-02-21 03:23:49,778 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:23:51,275 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-02-21 03:23:51,280 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2022-02-21 03:23:51,280 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:23:51,280 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:23:51,280 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:23:51,280 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:23:51,280 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:23:51,280 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:23:51,280 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:23:51,280 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:23:51,280 INFO L133 ssoRankerPreferences]: Filename of dumped script: NestedRecursion_2b.c_Iteration2_Loop [2022-02-21 03:23:51,280 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:23:51,280 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:23:51,281 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:23:51,300 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:23:51,302 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:23:51,345 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:23:51,345 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:23:51,345 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:23:51,346 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:23:51,347 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:23:51,348 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2022-02-21 03:23:51,350 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:23:51,356 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:23:51,356 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:23:51,356 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:23:51,356 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:23:51,356 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:23:51,358 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:23:51,358 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:23:51,371 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:23:51,374 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-02-21 03:23:51,375 INFO L444 ModelExtractionUtils]: 2 out of 5 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-02-21 03:23:51,375 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:23:51,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:23:51,420 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:23:51,423 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:23:51,423 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-02-21 03:23:51,423 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:23:51,423 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(g_#t~ret0) = -2*g_#t~ret0 + 1 Supporting invariants [] [2022-02-21 03:23:51,438 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2022-02-21 03:23:51,448 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2022-02-21 03:23:51,456 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-02-21 03:23:51,459 INFO L390 LassoCheck]: Loop: "call #t~ret1 := g(1 + #t~ret0);"< "~x := #in~x;" "assume !(0 == ~x);" "call #t~ret0 := g(~x - 1);"< "~x := #in~x;" "assume 0 == ~x;#res := 1;" "assume true;" >"#23#return;" [2022-02-21 03:23:51,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:23:51,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:23:51,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:23:51,492 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-21 03:23:51,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:23:51,499 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:23:51,554 INFO L290 TraceCheckUtils]: 0: Hoare triple {456#unseeded} assume { :begin_inline_ULTIMATE.init } true; {456#unseeded} is VALID [2022-02-21 03:23:51,555 INFO L290 TraceCheckUtils]: 1: Hoare triple {456#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~ret3#1, main_~x~0#1;main_~x~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; {456#unseeded} is VALID [2022-02-21 03:23:51,555 INFO L290 TraceCheckUtils]: 2: Hoare triple {456#unseeded} assume !(main_~x~0#1 < 0); {456#unseeded} is VALID [2022-02-21 03:23:51,556 INFO L272 TraceCheckUtils]: 3: Hoare triple {456#unseeded} call main_#t~ret3#1 := g(main_~x~0#1); {456#unseeded} is VALID [2022-02-21 03:23:51,556 INFO L290 TraceCheckUtils]: 4: Hoare triple {456#unseeded} ~x := #in~x; {456#unseeded} is VALID [2022-02-21 03:23:51,556 INFO L290 TraceCheckUtils]: 5: Hoare triple {456#unseeded} assume !(0 == ~x); {456#unseeded} is VALID [2022-02-21 03:23:51,557 INFO L272 TraceCheckUtils]: 6: Hoare triple {456#unseeded} call #t~ret0 := g(~x - 1); {492#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:23:51,557 INFO L290 TraceCheckUtils]: 7: Hoare triple {492#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~x := #in~x; {492#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:23:51,558 INFO L290 TraceCheckUtils]: 8: Hoare triple {492#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume 0 == ~x;#res := 1; {492#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:23:51,558 INFO L290 TraceCheckUtils]: 9: Hoare triple {492#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {492#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2022-02-21 03:23:51,559 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {492#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {456#unseeded} #23#return; {456#unseeded} is VALID [2022-02-21 03:23:51,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:23:51,572 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 13 conjunts are in the unsatisfiable core [2022-02-21 03:23:51,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:23:51,579 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:23:51,607 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2022-02-21 03:23:51,857 INFO L272 TraceCheckUtils]: 0: Hoare triple {459#(>= oldRank0 (+ (* (- 2) |g_#t~ret0|) 1))} call #t~ret1 := g(1 + #t~ret0); {505#(<= (+ (div (+ (- 1) oldRank0) (- 2)) 1) |g_#in~x|)} is VALID [2022-02-21 03:23:51,858 INFO L290 TraceCheckUtils]: 1: Hoare triple {505#(<= (+ (div (+ (- 1) oldRank0) (- 2)) 1) |g_#in~x|)} ~x := #in~x; {509#(<= (+ (div (+ (- 1) oldRank0) (- 2)) 1) g_~x)} is VALID [2022-02-21 03:23:51,859 INFO L290 TraceCheckUtils]: 2: Hoare triple {509#(<= (+ (div (+ (- 1) oldRank0) (- 2)) 1) g_~x)} assume !(0 == ~x); {509#(<= (+ (div (+ (- 1) oldRank0) (- 2)) 1) g_~x)} is VALID [2022-02-21 03:23:51,859 INFO L272 TraceCheckUtils]: 3: Hoare triple {509#(<= (+ (div (+ (- 1) oldRank0) (- 2)) 1) g_~x)} call #t~ret0 := g(~x - 1); {516#(<= |old(oldRank0)| oldRank0)} is VALID [2022-02-21 03:23:51,859 INFO L290 TraceCheckUtils]: 4: Hoare triple {516#(<= |old(oldRank0)| oldRank0)} ~x := #in~x; {520#(and (<= |g_#in~x| g_~x) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:23:51,860 INFO L290 TraceCheckUtils]: 5: Hoare triple {520#(and (<= |g_#in~x| g_~x) (<= |old(oldRank0)| oldRank0))} assume 0 == ~x;#res := 1; {524#(and (<= 1 |g_#res|) (<= |g_#in~x| 0) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:23:51,860 INFO L290 TraceCheckUtils]: 6: Hoare triple {524#(and (<= 1 |g_#res|) (<= |g_#in~x| 0) (<= |old(oldRank0)| oldRank0))} assume true; {524#(and (<= 1 |g_#res|) (<= |g_#in~x| 0) (<= |old(oldRank0)| oldRank0))} is VALID [2022-02-21 03:23:51,861 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {524#(and (<= 1 |g_#res|) (<= |g_#in~x| 0) (<= |old(oldRank0)| oldRank0))} {509#(<= (+ (div (+ (- 1) oldRank0) (- 2)) 1) g_~x)} #23#return; {469#(or unseeded (and (>= oldRank0 0) (> oldRank0 (+ (* (- 2) |g_#t~ret0|) 1))))} is VALID [2022-02-21 03:23:51,862 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:23:51,862 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 5 states have internal predecessors, (13), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-21 03:23:51,879 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:23:51,879 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 5 states have internal predecessors, (13), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Stem has 11 letters. Loop has 8 letters. [2022-02-21 03:23:51,880 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:51,880 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 6 loop predicates [2022-02-21 03:23:51,880 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 22 transitions. cyclomatic complexity: 6 Second operand has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 5 states have internal predecessors, (13), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-21 03:23:52,286 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 22 transitions. cyclomatic complexity: 6. Second operand has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 5 states have internal predecessors, (13), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Result 83 states and 121 transitions. Complement of second has 31 states. [2022-02-21 03:23:52,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 10 states 2 stem states 7 non-accepting loop states 1 accepting loop states [2022-02-21 03:23:52,287 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:23:52,287 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 22 transitions. cyclomatic complexity: 6 [2022-02-21 03:23:52,287 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:23:52,287 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:23:52,287 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 5 states have internal predecessors, (13), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-21 03:23:52,291 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:23:52,291 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:23:52,291 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:23:52,292 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 83 states and 121 transitions. [2022-02-21 03:23:52,296 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2022-02-21 03:23:52,296 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:23:52,296 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:23:52,298 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 18 states and 22 transitions. cyclomatic complexity: 6 [2022-02-21 03:23:52,300 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 5 examples of accepted words. [2022-02-21 03:23:52,301 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 5 states have internal predecessors, (13), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-21 03:23:52,305 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:23:52,306 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:23:52,306 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 83 states and 121 transitions. cyclomatic complexity: 43 [2022-02-21 03:23:52,313 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 11 examples of accepted words. [2022-02-21 03:23:52,313 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 22 transitions. cyclomatic complexity: 6 Stem has 11 letters. Loop has 8 letters. [2022-02-21 03:23:52,314 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:52,314 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 5 states have internal predecessors, (13), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Stem has 11 letters. Loop has 8 letters. [2022-02-21 03:23:52,314 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:52,314 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 83 states and 121 transitions. cyclomatic complexity: 43 Stem has 11 letters. Loop has 8 letters. [2022-02-21 03:23:52,315 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:52,315 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 22 transitions. cyclomatic complexity: 6 Stem has 3 letters. Loop has 6 letters. [2022-02-21 03:23:52,315 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:52,315 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 5 states have internal predecessors, (13), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Stem has 3 letters. Loop has 6 letters. [2022-02-21 03:23:52,316 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:52,316 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 83 states and 121 transitions. cyclomatic complexity: 43 Stem has 3 letters. Loop has 6 letters. [2022-02-21 03:23:52,316 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:52,316 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 22 transitions. cyclomatic complexity: 6 Stem has 18 letters. Loop has 3 letters. [2022-02-21 03:23:52,316 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:52,316 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 5 states have internal predecessors, (13), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Stem has 18 letters. Loop has 3 letters. [2022-02-21 03:23:52,316 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:52,316 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 83 states and 121 transitions. cyclomatic complexity: 43 Stem has 18 letters. Loop has 3 letters. [2022-02-21 03:23:52,317 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:52,317 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 22 transitions. cyclomatic complexity: 6 Stem has 83 letters. Loop has 83 letters. [2022-02-21 03:23:52,317 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:52,317 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 5 states have internal predecessors, (13), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Stem has 83 letters. Loop has 83 letters. [2022-02-21 03:23:52,317 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:52,317 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 83 states and 121 transitions. cyclomatic complexity: 43 Stem has 83 letters. Loop has 83 letters. [2022-02-21 03:23:52,317 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:52,317 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 22 transitions. cyclomatic complexity: 6 Stem has 18 letters. Loop has 18 letters. [2022-02-21 03:23:52,317 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:52,319 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 5 states have internal predecessors, (13), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Stem has 18 letters. Loop has 18 letters. [2022-02-21 03:23:52,319 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:52,319 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 83 states and 121 transitions. cyclomatic complexity: 43 Stem has 18 letters. Loop has 18 letters. [2022-02-21 03:23:52,319 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:52,319 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 22 transitions. cyclomatic complexity: 6 Stem has 10 letters. Loop has 10 letters. [2022-02-21 03:23:52,319 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:52,320 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 5 states have internal predecessors, (13), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Stem has 10 letters. Loop has 10 letters. [2022-02-21 03:23:52,320 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:52,320 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 83 states and 121 transitions. cyclomatic complexity: 43 Stem has 10 letters. Loop has 10 letters. [2022-02-21 03:23:52,320 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:52,320 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 22 transitions. cyclomatic complexity: 6 Stem has 13 letters. Loop has 3 letters. [2022-02-21 03:23:52,321 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:52,321 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 5 states have internal predecessors, (13), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Stem has 13 letters. Loop has 3 letters. [2022-02-21 03:23:52,322 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:52,322 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 83 states and 121 transitions. cyclomatic complexity: 43 Stem has 13 letters. Loop has 3 letters. [2022-02-21 03:23:52,322 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:52,322 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 22 transitions. cyclomatic complexity: 6 Stem has 14 letters. Loop has 3 letters. [2022-02-21 03:23:52,323 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:52,323 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 5 states have internal predecessors, (13), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Stem has 14 letters. Loop has 3 letters. [2022-02-21 03:23:52,323 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:52,323 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 83 states and 121 transitions. cyclomatic complexity: 43 Stem has 14 letters. Loop has 3 letters. [2022-02-21 03:23:52,323 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:52,323 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 22 transitions. cyclomatic complexity: 6 Stem has 11 letters. Loop has 8 letters. [2022-02-21 03:23:52,323 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:52,324 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 5 states have internal predecessors, (13), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Stem has 11 letters. Loop has 8 letters. [2022-02-21 03:23:52,324 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:52,324 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 83 states and 121 transitions. cyclomatic complexity: 43 Stem has 11 letters. Loop has 8 letters. [2022-02-21 03:23:52,324 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:52,324 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 22 transitions. cyclomatic complexity: 6 Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:23:52,325 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:52,325 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 5 states have internal predecessors, (13), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:23:52,325 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:52,325 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 83 states and 121 transitions. cyclomatic complexity: 43 Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:23:52,326 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:52,326 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 22 transitions. cyclomatic complexity: 6 Stem has 11 letters. Loop has 8 letters. [2022-02-21 03:23:52,326 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:52,326 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 5 states have internal predecessors, (13), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Stem has 11 letters. Loop has 8 letters. [2022-02-21 03:23:52,326 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:52,326 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 83 states and 121 transitions. cyclomatic complexity: 43 Stem has 11 letters. Loop has 8 letters. [2022-02-21 03:23:52,326 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:52,327 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 22 transitions. cyclomatic complexity: 6 Stem has 3 letters. Loop has 6 letters. [2022-02-21 03:23:52,327 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:52,327 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 5 states have internal predecessors, (13), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Stem has 3 letters. Loop has 6 letters. [2022-02-21 03:23:52,327 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:52,327 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 83 states and 121 transitions. cyclomatic complexity: 43 Stem has 3 letters. Loop has 6 letters. [2022-02-21 03:23:52,327 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:52,327 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 22 transitions. cyclomatic complexity: 6 Stem has 34 letters. Loop has 3 letters. [2022-02-21 03:23:52,328 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:52,328 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 5 states have internal predecessors, (13), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Stem has 34 letters. Loop has 3 letters. [2022-02-21 03:23:52,328 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:52,329 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 83 states and 121 transitions. cyclomatic complexity: 43 Stem has 34 letters. Loop has 3 letters. [2022-02-21 03:23:52,329 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:52,329 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 22 transitions. cyclomatic complexity: 6 Stem has 35 letters. Loop has 3 letters. [2022-02-21 03:23:52,329 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:52,330 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 5 states have internal predecessors, (13), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Stem has 35 letters. Loop has 3 letters. [2022-02-21 03:23:52,330 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:52,330 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 83 states and 121 transitions. cyclomatic complexity: 43 Stem has 35 letters. Loop has 3 letters. [2022-02-21 03:23:52,330 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:52,330 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 22 transitions. cyclomatic complexity: 6 Stem has 36 letters. Loop has 3 letters. [2022-02-21 03:23:52,330 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:52,330 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 5 states have internal predecessors, (13), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Stem has 36 letters. Loop has 3 letters. [2022-02-21 03:23:52,330 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:52,331 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 83 states and 121 transitions. cyclomatic complexity: 43 Stem has 36 letters. Loop has 3 letters. [2022-02-21 03:23:52,331 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:52,331 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 22 transitions. cyclomatic complexity: 6 Stem has 33 letters. Loop has 8 letters. [2022-02-21 03:23:52,332 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:52,332 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 5 states have internal predecessors, (13), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Stem has 33 letters. Loop has 8 letters. [2022-02-21 03:23:52,332 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:52,332 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 83 states and 121 transitions. cyclomatic complexity: 43 Stem has 33 letters. Loop has 8 letters. [2022-02-21 03:23:52,332 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:52,332 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 22 transitions. cyclomatic complexity: 6 Stem has 33 letters. Loop has 19 letters. [2022-02-21 03:23:52,332 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:52,333 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 5 states have internal predecessors, (13), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Stem has 33 letters. Loop has 19 letters. [2022-02-21 03:23:52,333 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:52,333 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 83 states and 121 transitions. cyclomatic complexity: 43 Stem has 33 letters. Loop has 19 letters. [2022-02-21 03:23:52,334 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:52,334 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 22 transitions. cyclomatic complexity: 6 Stem has 19 letters. Loop has 3 letters. [2022-02-21 03:23:52,334 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:52,334 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 5 states have internal predecessors, (13), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Stem has 19 letters. Loop has 3 letters. [2022-02-21 03:23:52,334 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:52,334 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 83 states and 121 transitions. cyclomatic complexity: 43 Stem has 19 letters. Loop has 3 letters. [2022-02-21 03:23:52,334 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:52,334 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 22 transitions. cyclomatic complexity: 6 Stem has 25 letters. Loop has 8 letters. [2022-02-21 03:23:52,335 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:52,335 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 5 states have internal predecessors, (13), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Stem has 25 letters. Loop has 8 letters. [2022-02-21 03:23:52,335 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:52,335 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 83 states and 121 transitions. cyclomatic complexity: 43 Stem has 25 letters. Loop has 8 letters. [2022-02-21 03:23:52,335 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:52,335 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 22 transitions. cyclomatic complexity: 6 Stem has 20 letters. Loop has 3 letters. [2022-02-21 03:23:52,335 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:52,335 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 5 states have internal predecessors, (13), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Stem has 20 letters. Loop has 3 letters. [2022-02-21 03:23:52,336 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:52,336 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 83 states and 121 transitions. cyclomatic complexity: 43 Stem has 20 letters. Loop has 3 letters. [2022-02-21 03:23:52,336 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:52,336 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 22 transitions. cyclomatic complexity: 6 Stem has 18 letters. Loop has 3 letters. [2022-02-21 03:23:52,336 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:52,336 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 5 states have internal predecessors, (13), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Stem has 18 letters. Loop has 3 letters. [2022-02-21 03:23:52,336 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:52,336 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 83 states and 121 transitions. cyclomatic complexity: 43 Stem has 18 letters. Loop has 3 letters. [2022-02-21 03:23:52,337 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:52,337 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 22 transitions. cyclomatic complexity: 6 Stem has 25 letters. Loop has 19 letters. [2022-02-21 03:23:52,337 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:52,337 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 5 states have internal predecessors, (13), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Stem has 25 letters. Loop has 19 letters. [2022-02-21 03:23:52,337 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:52,337 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 83 states and 121 transitions. cyclomatic complexity: 43 Stem has 25 letters. Loop has 19 letters. [2022-02-21 03:23:52,338 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:52,338 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 22 transitions. cyclomatic complexity: 6 Stem has 25 letters. Loop has 8 letters. [2022-02-21 03:23:52,338 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:52,339 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 5 states have internal predecessors, (13), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Stem has 25 letters. Loop has 8 letters. [2022-02-21 03:23:52,339 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:52,339 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 83 states and 121 transitions. cyclomatic complexity: 43 Stem has 25 letters. Loop has 8 letters. [2022-02-21 03:23:52,339 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:52,339 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:23:52,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 5 states have internal predecessors, (13), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-21 03:23:52,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 37 transitions. [2022-02-21 03:23:52,341 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 37 transitions. Stem has 11 letters. Loop has 8 letters. [2022-02-21 03:23:52,341 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:52,342 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 37 transitions. Stem has 19 letters. Loop has 8 letters. [2022-02-21 03:23:52,342 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:52,342 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 37 transitions. Stem has 11 letters. Loop has 16 letters. [2022-02-21 03:23:52,342 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:23:52,342 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 83 states and 121 transitions. cyclomatic complexity: 43 [2022-02-21 03:23:52,346 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2022-02-21 03:23:52,349 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 83 states to 59 states and 82 transitions. [2022-02-21 03:23:52,349 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 45 [2022-02-21 03:23:52,349 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 46 [2022-02-21 03:23:52,349 INFO L73 IsDeterministic]: Start isDeterministic. Operand 59 states and 82 transitions. [2022-02-21 03:23:52,349 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:23:52,349 INFO L681 BuchiCegarLoop]: Abstraction has 59 states and 82 transitions. [2022-02-21 03:23:52,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states and 82 transitions. [2022-02-21 03:23:52,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 53. [2022-02-21 03:23:52,353 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:23:52,354 INFO L82 GeneralOperation]: Start isEquivalent. First operand 59 states and 82 transitions. Second operand has 53 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 33 states have internal predecessors, (36), 15 states have call successors, (18), 8 states have call predecessors, (18), 7 states have return successors, (18), 11 states have call predecessors, (18), 13 states have call successors, (18) [2022-02-21 03:23:52,354 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states and 82 transitions. Second operand has 53 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 33 states have internal predecessors, (36), 15 states have call successors, (18), 8 states have call predecessors, (18), 7 states have return successors, (18), 11 states have call predecessors, (18), 13 states have call successors, (18) [2022-02-21 03:23:52,354 INFO L87 Difference]: Start difference. First operand 59 states and 82 transitions. Second operand has 53 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 33 states have internal predecessors, (36), 15 states have call successors, (18), 8 states have call predecessors, (18), 7 states have return successors, (18), 11 states have call predecessors, (18), 13 states have call successors, (18) [2022-02-21 03:23:52,354 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:23:52,363 INFO L93 Difference]: Finished difference Result 159 states and 213 transitions. [2022-02-21 03:23:52,363 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 213 transitions. [2022-02-21 03:23:52,365 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:23:52,365 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:23:52,365 INFO L74 IsIncluded]: Start isIncluded. First operand has 53 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 33 states have internal predecessors, (36), 15 states have call successors, (18), 8 states have call predecessors, (18), 7 states have return successors, (18), 11 states have call predecessors, (18), 13 states have call successors, (18) Second operand 59 states and 82 transitions. [2022-02-21 03:23:52,365 INFO L87 Difference]: Start difference. First operand has 53 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 33 states have internal predecessors, (36), 15 states have call successors, (18), 8 states have call predecessors, (18), 7 states have return successors, (18), 11 states have call predecessors, (18), 13 states have call successors, (18) Second operand 59 states and 82 transitions. [2022-02-21 03:23:52,366 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:23:52,374 INFO L93 Difference]: Finished difference Result 159 states and 213 transitions. [2022-02-21 03:23:52,374 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 213 transitions. [2022-02-21 03:23:52,376 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:23:52,376 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:23:52,376 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:23:52,376 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:23:52,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 33 states have internal predecessors, (36), 15 states have call successors, (18), 8 states have call predecessors, (18), 7 states have return successors, (18), 11 states have call predecessors, (18), 13 states have call successors, (18) [2022-02-21 03:23:52,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 72 transitions. [2022-02-21 03:23:52,379 INFO L704 BuchiCegarLoop]: Abstraction has 53 states and 72 transitions. [2022-02-21 03:23:52,379 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:23:52,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-02-21 03:23:52,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-02-21 03:23:52,382 INFO L87 Difference]: Start difference. First operand 53 states and 72 transitions. Second operand has 11 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 8 states have internal predecessors, (17), 3 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-21 03:23:52,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:23:52,502 INFO L93 Difference]: Finished difference Result 40 states and 45 transitions. [2022-02-21 03:23:52,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-21 03:23:52,503 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 11 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 8 states have internal predecessors, (17), 3 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-21 03:23:52,518 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:23:52,519 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 45 transitions. [2022-02-21 03:23:52,520 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2022-02-21 03:23:52,521 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 31 states and 35 transitions. [2022-02-21 03:23:52,521 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2022-02-21 03:23:52,521 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2022-02-21 03:23:52,521 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 35 transitions. [2022-02-21 03:23:52,521 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:23:52,521 INFO L681 BuchiCegarLoop]: Abstraction has 31 states and 35 transitions. [2022-02-21 03:23:52,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 35 transitions. [2022-02-21 03:23:52,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 26. [2022-02-21 03:23:52,523 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:23:52,523 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states and 35 transitions. Second operand has 26 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 states have internal predecessors, (19), 7 states have call successors, (7), 6 states have call predecessors, (7), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-21 03:23:52,523 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states and 35 transitions. Second operand has 26 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 states have internal predecessors, (19), 7 states have call successors, (7), 6 states have call predecessors, (7), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-21 03:23:52,523 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand has 26 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 states have internal predecessors, (19), 7 states have call successors, (7), 6 states have call predecessors, (7), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-21 03:23:52,524 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:23:52,525 INFO L93 Difference]: Finished difference Result 37 states and 42 transitions. [2022-02-21 03:23:52,525 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2022-02-21 03:23:52,525 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:23:52,525 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:23:52,526 INFO L74 IsIncluded]: Start isIncluded. First operand has 26 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 states have internal predecessors, (19), 7 states have call successors, (7), 6 states have call predecessors, (7), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 31 states and 35 transitions. [2022-02-21 03:23:52,526 INFO L87 Difference]: Start difference. First operand has 26 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 states have internal predecessors, (19), 7 states have call successors, (7), 6 states have call predecessors, (7), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 31 states and 35 transitions. [2022-02-21 03:23:52,526 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:23:52,528 INFO L93 Difference]: Finished difference Result 56 states and 63 transitions. [2022-02-21 03:23:52,528 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 63 transitions. [2022-02-21 03:23:52,528 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:23:52,528 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:23:52,528 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:23:52,529 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:23:52,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 states have internal predecessors, (19), 7 states have call successors, (7), 6 states have call predecessors, (7), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-21 03:23:52,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2022-02-21 03:23:52,529 INFO L704 BuchiCegarLoop]: Abstraction has 26 states and 28 transitions. [2022-02-21 03:23:52,529 INFO L587 BuchiCegarLoop]: Abstraction has 26 states and 28 transitions. [2022-02-21 03:23:52,529 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2022-02-21 03:23:52,530 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 28 transitions. [2022-02-21 03:23:52,530 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2022-02-21 03:23:52,530 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:23:52,530 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:23:52,530 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:23:52,530 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-02-21 03:23:52,531 INFO L791 eck$LassoCheckResult]: Stem: 1367#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 1368#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~ret3#1, main_~x~0#1;main_~x~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; 1378#L20 assume !(main_~x~0#1 < 0); 1376#L21 call main_#t~ret3#1 := g(main_~x~0#1);< 1377#gENTRY ~x := #in~x; 1380#L12 assume !(0 == ~x); 1370#L15 call #t~ret0 := g(~x - 1);< 1375#gENTRY ~x := #in~x; 1381#L12 assume 0 == ~x;#res := 1; 1369#gFINAL assume true; 1371#gEXIT >#23#return; 1373#L15-1 call #t~ret1 := g(1 + #t~ret0);< 1383#gENTRY ~x := #in~x; 1390#L12 assume !(0 == ~x); 1372#L15 call #t~ret0 := g(~x - 1);< 1374#gENTRY ~x := #in~x; 1379#L12 assume !(0 == ~x); 1382#L15 [2022-02-21 03:23:52,531 INFO L793 eck$LassoCheckResult]: Loop: 1382#L15 call #t~ret0 := g(~x - 1);< 1384#gENTRY ~x := #in~x; 1386#L12 assume !(0 == ~x); 1382#L15 [2022-02-21 03:23:52,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:23:52,531 INFO L85 PathProgramCache]: Analyzing trace with hash -1443446059, now seen corresponding path program 2 times [2022-02-21 03:23:52,531 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:23:52,531 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937427146] [2022-02-21 03:23:52,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:23:52,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:23:52,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:23:52,538 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:23:52,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:23:52,544 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:23:52,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:23:52,544 INFO L85 PathProgramCache]: Analyzing trace with hash 50937, now seen corresponding path program 2 times [2022-02-21 03:23:52,544 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:23:52,544 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724982737] [2022-02-21 03:23:52,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:23:52,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:23:52,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:23:52,547 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:23:52,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:23:52,548 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:23:52,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:23:52,549 INFO L85 PathProgramCache]: Analyzing trace with hash -488954971, now seen corresponding path program 3 times [2022-02-21 03:23:52,549 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:23:52,549 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633247468] [2022-02-21 03:23:52,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:23:52,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:23:52,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:23:52,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-21 03:23:52,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:23:52,665 INFO L290 TraceCheckUtils]: 0: Hoare triple {1603#true} ~x := #in~x; {1603#true} is VALID [2022-02-21 03:23:52,665 INFO L290 TraceCheckUtils]: 1: Hoare triple {1603#true} assume 0 == ~x;#res := 1; {1616#(and (<= 1 |g_#res|) (<= |g_#res| 1))} is VALID [2022-02-21 03:23:52,666 INFO L290 TraceCheckUtils]: 2: Hoare triple {1616#(and (<= 1 |g_#res|) (<= |g_#res| 1))} assume true; {1616#(and (<= 1 |g_#res|) (<= |g_#res| 1))} is VALID [2022-02-21 03:23:52,666 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1616#(and (<= 1 |g_#res|) (<= |g_#res| 1))} {1603#true} #23#return; {1609#(and (<= 1 |g_#t~ret0|) (<= |g_#t~ret0| 1))} is VALID [2022-02-21 03:23:52,667 INFO L290 TraceCheckUtils]: 0: Hoare triple {1603#true} assume { :begin_inline_ULTIMATE.init } true; {1603#true} is VALID [2022-02-21 03:23:52,667 INFO L290 TraceCheckUtils]: 1: Hoare triple {1603#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~ret3#1, main_~x~0#1;main_~x~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; {1603#true} is VALID [2022-02-21 03:23:52,667 INFO L290 TraceCheckUtils]: 2: Hoare triple {1603#true} assume !(main_~x~0#1 < 0); {1603#true} is VALID [2022-02-21 03:23:52,667 INFO L272 TraceCheckUtils]: 3: Hoare triple {1603#true} call main_#t~ret3#1 := g(main_~x~0#1); {1603#true} is VALID [2022-02-21 03:23:52,667 INFO L290 TraceCheckUtils]: 4: Hoare triple {1603#true} ~x := #in~x; {1603#true} is VALID [2022-02-21 03:23:52,668 INFO L290 TraceCheckUtils]: 5: Hoare triple {1603#true} assume !(0 == ~x); {1603#true} is VALID [2022-02-21 03:23:52,668 INFO L272 TraceCheckUtils]: 6: Hoare triple {1603#true} call #t~ret0 := g(~x - 1); {1603#true} is VALID [2022-02-21 03:23:52,668 INFO L290 TraceCheckUtils]: 7: Hoare triple {1603#true} ~x := #in~x; {1603#true} is VALID [2022-02-21 03:23:52,670 INFO L290 TraceCheckUtils]: 8: Hoare triple {1603#true} assume 0 == ~x;#res := 1; {1616#(and (<= 1 |g_#res|) (<= |g_#res| 1))} is VALID [2022-02-21 03:23:52,671 INFO L290 TraceCheckUtils]: 9: Hoare triple {1616#(and (<= 1 |g_#res|) (<= |g_#res| 1))} assume true; {1616#(and (<= 1 |g_#res|) (<= |g_#res| 1))} is VALID [2022-02-21 03:23:52,672 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1616#(and (<= 1 |g_#res|) (<= |g_#res| 1))} {1603#true} #23#return; {1609#(and (<= 1 |g_#t~ret0|) (<= |g_#t~ret0| 1))} is VALID [2022-02-21 03:23:52,672 INFO L272 TraceCheckUtils]: 11: Hoare triple {1609#(and (<= 1 |g_#t~ret0|) (<= |g_#t~ret0| 1))} call #t~ret1 := g(1 + #t~ret0); {1610#(and (<= |g_#in~x| 2) (<= 2 |g_#in~x|))} is VALID [2022-02-21 03:23:52,673 INFO L290 TraceCheckUtils]: 12: Hoare triple {1610#(and (<= |g_#in~x| 2) (<= 2 |g_#in~x|))} ~x := #in~x; {1611#(and (<= 2 g_~x) (<= g_~x 2))} is VALID [2022-02-21 03:23:52,673 INFO L290 TraceCheckUtils]: 13: Hoare triple {1611#(and (<= 2 g_~x) (<= g_~x 2))} assume !(0 == ~x); {1611#(and (<= 2 g_~x) (<= g_~x 2))} is VALID [2022-02-21 03:23:52,674 INFO L272 TraceCheckUtils]: 14: Hoare triple {1611#(and (<= 2 g_~x) (<= g_~x 2))} call #t~ret0 := g(~x - 1); {1612#(and (<= 1 |g_#in~x|) (<= |g_#in~x| 1))} is VALID [2022-02-21 03:23:52,674 INFO L290 TraceCheckUtils]: 15: Hoare triple {1612#(and (<= 1 |g_#in~x|) (<= |g_#in~x| 1))} ~x := #in~x; {1613#(and (<= g_~x 1) (<= 1 g_~x))} is VALID [2022-02-21 03:23:52,675 INFO L290 TraceCheckUtils]: 16: Hoare triple {1613#(and (<= g_~x 1) (<= 1 g_~x))} assume !(0 == ~x); {1613#(and (<= g_~x 1) (<= 1 g_~x))} is VALID [2022-02-21 03:23:52,675 INFO L272 TraceCheckUtils]: 17: Hoare triple {1613#(and (<= g_~x 1) (<= 1 g_~x))} call #t~ret0 := g(~x - 1); {1614#(and (<= 0 |g_#in~x|) (<= |g_#in~x| 0))} is VALID [2022-02-21 03:23:52,676 INFO L290 TraceCheckUtils]: 18: Hoare triple {1614#(and (<= 0 |g_#in~x|) (<= |g_#in~x| 0))} ~x := #in~x; {1615#(and (<= g_~x 0) (< 0 (+ g_~x 1)))} is VALID [2022-02-21 03:23:52,676 INFO L290 TraceCheckUtils]: 19: Hoare triple {1615#(and (<= g_~x 0) (< 0 (+ g_~x 1)))} assume !(0 == ~x); {1604#false} is VALID [2022-02-21 03:23:52,677 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 14 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-21 03:23:52,677 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:23:52,677 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633247468] [2022-02-21 03:23:52,677 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [633247468] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:23:52,677 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1106172519] [2022-02-21 03:23:52,677 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-21 03:23:52,678 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:23:52,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:23:52,705 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:23:52,729 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2022-02-21 03:23:52,742 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-02-21 03:23:52,742 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-21 03:23:52,743 INFO L263 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 17 conjunts are in the unsatisfiable core [2022-02-21 03:23:52,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:23:52,749 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:23:52,864 INFO L290 TraceCheckUtils]: 0: Hoare triple {1603#true} assume { :begin_inline_ULTIMATE.init } true; {1603#true} is VALID [2022-02-21 03:23:52,864 INFO L290 TraceCheckUtils]: 1: Hoare triple {1603#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~ret3#1, main_~x~0#1;main_~x~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; {1603#true} is VALID [2022-02-21 03:23:52,864 INFO L290 TraceCheckUtils]: 2: Hoare triple {1603#true} assume !(main_~x~0#1 < 0); {1603#true} is VALID [2022-02-21 03:23:52,865 INFO L272 TraceCheckUtils]: 3: Hoare triple {1603#true} call main_#t~ret3#1 := g(main_~x~0#1); {1603#true} is VALID [2022-02-21 03:23:52,865 INFO L290 TraceCheckUtils]: 4: Hoare triple {1603#true} ~x := #in~x; {1603#true} is VALID [2022-02-21 03:23:52,865 INFO L290 TraceCheckUtils]: 5: Hoare triple {1603#true} assume !(0 == ~x); {1603#true} is VALID [2022-02-21 03:23:52,865 INFO L272 TraceCheckUtils]: 6: Hoare triple {1603#true} call #t~ret0 := g(~x - 1); {1603#true} is VALID [2022-02-21 03:23:52,865 INFO L290 TraceCheckUtils]: 7: Hoare triple {1603#true} ~x := #in~x; {1603#true} is VALID [2022-02-21 03:23:52,866 INFO L290 TraceCheckUtils]: 8: Hoare triple {1603#true} assume 0 == ~x;#res := 1; {1616#(and (<= 1 |g_#res|) (<= |g_#res| 1))} is VALID [2022-02-21 03:23:52,866 INFO L290 TraceCheckUtils]: 9: Hoare triple {1616#(and (<= 1 |g_#res|) (<= |g_#res| 1))} assume true; {1616#(and (<= 1 |g_#res|) (<= |g_#res| 1))} is VALID [2022-02-21 03:23:52,867 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1616#(and (<= 1 |g_#res|) (<= |g_#res| 1))} {1603#true} #23#return; {1609#(and (<= 1 |g_#t~ret0|) (<= |g_#t~ret0| 1))} is VALID [2022-02-21 03:23:52,868 INFO L272 TraceCheckUtils]: 11: Hoare triple {1609#(and (<= 1 |g_#t~ret0|) (<= |g_#t~ret0| 1))} call #t~ret1 := g(1 + #t~ret0); {1610#(and (<= |g_#in~x| 2) (<= 2 |g_#in~x|))} is VALID [2022-02-21 03:23:52,868 INFO L290 TraceCheckUtils]: 12: Hoare triple {1610#(and (<= |g_#in~x| 2) (<= 2 |g_#in~x|))} ~x := #in~x; {1611#(and (<= 2 g_~x) (<= g_~x 2))} is VALID [2022-02-21 03:23:52,869 INFO L290 TraceCheckUtils]: 13: Hoare triple {1611#(and (<= 2 g_~x) (<= g_~x 2))} assume !(0 == ~x); {1611#(and (<= 2 g_~x) (<= g_~x 2))} is VALID [2022-02-21 03:23:52,869 INFO L272 TraceCheckUtils]: 14: Hoare triple {1611#(and (<= 2 g_~x) (<= g_~x 2))} call #t~ret0 := g(~x - 1); {1612#(and (<= 1 |g_#in~x|) (<= |g_#in~x| 1))} is VALID [2022-02-21 03:23:52,870 INFO L290 TraceCheckUtils]: 15: Hoare triple {1612#(and (<= 1 |g_#in~x|) (<= |g_#in~x| 1))} ~x := #in~x; {1613#(and (<= g_~x 1) (<= 1 g_~x))} is VALID [2022-02-21 03:23:52,870 INFO L290 TraceCheckUtils]: 16: Hoare triple {1613#(and (<= g_~x 1) (<= 1 g_~x))} assume !(0 == ~x); {1613#(and (<= g_~x 1) (<= 1 g_~x))} is VALID [2022-02-21 03:23:52,871 INFO L272 TraceCheckUtils]: 17: Hoare triple {1613#(and (<= g_~x 1) (<= 1 g_~x))} call #t~ret0 := g(~x - 1); {1614#(and (<= 0 |g_#in~x|) (<= |g_#in~x| 0))} is VALID [2022-02-21 03:23:52,871 INFO L290 TraceCheckUtils]: 18: Hoare triple {1614#(and (<= 0 |g_#in~x|) (<= |g_#in~x| 0))} ~x := #in~x; {1615#(and (<= g_~x 0) (< 0 (+ g_~x 1)))} is VALID [2022-02-21 03:23:52,876 INFO L290 TraceCheckUtils]: 19: Hoare triple {1615#(and (<= g_~x 0) (< 0 (+ g_~x 1)))} assume !(0 == ~x); {1604#false} is VALID [2022-02-21 03:23:52,877 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 14 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-21 03:23:52,877 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:23:53,010 INFO L290 TraceCheckUtils]: 19: Hoare triple {1615#(and (<= g_~x 0) (< 0 (+ g_~x 1)))} assume !(0 == ~x); {1604#false} is VALID [2022-02-21 03:23:53,011 INFO L290 TraceCheckUtils]: 18: Hoare triple {1614#(and (<= 0 |g_#in~x|) (<= |g_#in~x| 0))} ~x := #in~x; {1615#(and (<= g_~x 0) (< 0 (+ g_~x 1)))} is VALID [2022-02-21 03:23:53,012 INFO L272 TraceCheckUtils]: 17: Hoare triple {1613#(and (<= g_~x 1) (<= 1 g_~x))} call #t~ret0 := g(~x - 1); {1614#(and (<= 0 |g_#in~x|) (<= |g_#in~x| 0))} is VALID [2022-02-21 03:23:53,012 INFO L290 TraceCheckUtils]: 16: Hoare triple {1613#(and (<= g_~x 1) (<= 1 g_~x))} assume !(0 == ~x); {1613#(and (<= g_~x 1) (<= 1 g_~x))} is VALID [2022-02-21 03:23:53,012 INFO L290 TraceCheckUtils]: 15: Hoare triple {1612#(and (<= 1 |g_#in~x|) (<= |g_#in~x| 1))} ~x := #in~x; {1613#(and (<= g_~x 1) (<= 1 g_~x))} is VALID [2022-02-21 03:23:53,013 INFO L272 TraceCheckUtils]: 14: Hoare triple {1611#(and (<= 2 g_~x) (<= g_~x 2))} call #t~ret0 := g(~x - 1); {1612#(and (<= 1 |g_#in~x|) (<= |g_#in~x| 1))} is VALID [2022-02-21 03:23:53,013 INFO L290 TraceCheckUtils]: 13: Hoare triple {1611#(and (<= 2 g_~x) (<= g_~x 2))} assume !(0 == ~x); {1611#(and (<= 2 g_~x) (<= g_~x 2))} is VALID [2022-02-21 03:23:53,014 INFO L290 TraceCheckUtils]: 12: Hoare triple {1610#(and (<= |g_#in~x| 2) (<= 2 |g_#in~x|))} ~x := #in~x; {1611#(and (<= 2 g_~x) (<= g_~x 2))} is VALID [2022-02-21 03:23:53,014 INFO L272 TraceCheckUtils]: 11: Hoare triple {1609#(and (<= 1 |g_#t~ret0|) (<= |g_#t~ret0| 1))} call #t~ret1 := g(1 + #t~ret0); {1610#(and (<= |g_#in~x| 2) (<= 2 |g_#in~x|))} is VALID [2022-02-21 03:23:53,015 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1616#(and (<= 1 |g_#res|) (<= |g_#res| 1))} {1603#true} #23#return; {1609#(and (<= 1 |g_#t~ret0|) (<= |g_#t~ret0| 1))} is VALID [2022-02-21 03:23:53,015 INFO L290 TraceCheckUtils]: 9: Hoare triple {1616#(and (<= 1 |g_#res|) (<= |g_#res| 1))} assume true; {1616#(and (<= 1 |g_#res|) (<= |g_#res| 1))} is VALID [2022-02-21 03:23:53,015 INFO L290 TraceCheckUtils]: 8: Hoare triple {1603#true} assume 0 == ~x;#res := 1; {1616#(and (<= 1 |g_#res|) (<= |g_#res| 1))} is VALID [2022-02-21 03:23:53,015 INFO L290 TraceCheckUtils]: 7: Hoare triple {1603#true} ~x := #in~x; {1603#true} is VALID [2022-02-21 03:23:53,015 INFO L272 TraceCheckUtils]: 6: Hoare triple {1603#true} call #t~ret0 := g(~x - 1); {1603#true} is VALID [2022-02-21 03:23:53,016 INFO L290 TraceCheckUtils]: 5: Hoare triple {1603#true} assume !(0 == ~x); {1603#true} is VALID [2022-02-21 03:23:53,016 INFO L290 TraceCheckUtils]: 4: Hoare triple {1603#true} ~x := #in~x; {1603#true} is VALID [2022-02-21 03:23:53,016 INFO L272 TraceCheckUtils]: 3: Hoare triple {1603#true} call main_#t~ret3#1 := g(main_~x~0#1); {1603#true} is VALID [2022-02-21 03:23:53,016 INFO L290 TraceCheckUtils]: 2: Hoare triple {1603#true} assume !(main_~x~0#1 < 0); {1603#true} is VALID [2022-02-21 03:23:53,016 INFO L290 TraceCheckUtils]: 1: Hoare triple {1603#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~ret3#1, main_~x~0#1;main_~x~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; {1603#true} is VALID [2022-02-21 03:23:53,016 INFO L290 TraceCheckUtils]: 0: Hoare triple {1603#true} assume { :begin_inline_ULTIMATE.init } true; {1603#true} is VALID [2022-02-21 03:23:53,016 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 14 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-21 03:23:53,016 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1106172519] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:23:53,016 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:23:53,016 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 9 [2022-02-21 03:23:53,017 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30294576] [2022-02-21 03:23:53,017 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:23:53,047 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:23:53,048 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:23:53,048 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:23:53,048 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:23:53,048 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-02-21 03:23:53,048 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:23:53,048 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:23:53,048 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:23:53,048 INFO L133 ssoRankerPreferences]: Filename of dumped script: NestedRecursion_2b.c_Iteration3_Loop [2022-02-21 03:23:53,048 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:23:53,048 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:23:53,048 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:23:53,052 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:23:53,053 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:23:53,054 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:23:53,090 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:23:53,091 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-02-21 03:23:53,091 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:23:53,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:23:53,099 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:23:53,100 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2022-02-21 03:23:53,101 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:23:53,101 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:23:53,139 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0 [2022-02-21 03:23:53,139 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:23:53,139 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:23:53,140 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:23:53,165 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2022-02-21 03:23:53,165 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-02-21 03:23:53,166 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:23:53,763 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:23:53,763 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {g_#in~x=-5, g_~x=-7} Honda state: {g_#in~x=-5, g_~x=-7} Generalized eigenvectors: [{g_#in~x=-4, g_~x=-1}, {g_#in~x=3, g_~x=0}, {g_#in~x=-2, g_~x=0}] Lambdas: [1, 0, 0] Nus: [1, 0] [2022-02-21 03:23:53,779 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Ended with exit code 0 [2022-02-21 03:23:53,779 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:23:53,779 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:23:53,780 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:23:53,781 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2022-02-21 03:23:53,782 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:23:53,782 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:23:53,788 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:23:53,788 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {g_#res=0} Honda state: {g_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 03:23:53,805 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 [2022-02-21 03:23:53,806 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:23:53,806 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:23:53,807 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:23:53,809 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2022-02-21 03:23:53,810 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:23:53,810 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:23:53,816 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:23:53,816 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {g_#t~ret0=0} Honda state: {g_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 03:23:53,831 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Forceful destruction successful, exit code 0 [2022-02-21 03:23:53,831 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:23:53,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:23:53,832 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:23:53,844 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:23:53,844 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:23:53,845 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2022-02-21 03:23:53,850 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:23:53,850 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {g_#t~ret1=0} Honda state: {g_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 03:23:53,865 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Forceful destruction successful, exit code 0 [2022-02-21 03:23:53,866 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:23:53,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-21 03:23:53,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-02-21 03:23:53,866 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. cyclomatic complexity: 4 Second operand has 10 states, 8 states have (on average 1.625) internal successors, (13), 6 states have internal predecessors, (13), 4 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-21 03:23:54,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:23:54,106 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2022-02-21 03:23:54,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-21 03:23:54,107 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 10 states, 8 states have (on average 1.625) internal successors, (13), 6 states have internal predecessors, (13), 4 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-21 03:23:54,120 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:23:54,120 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 29 transitions. [2022-02-21 03:23:54,121 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2022-02-21 03:23:54,122 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 28 states and 29 transitions. [2022-02-21 03:23:54,122 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2022-02-21 03:23:54,122 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2022-02-21 03:23:54,122 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 29 transitions. [2022-02-21 03:23:54,122 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:23:54,122 INFO L681 BuchiCegarLoop]: Abstraction has 28 states and 29 transitions. [2022-02-21 03:23:54,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 29 transitions. [2022-02-21 03:23:54,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 22. [2022-02-21 03:23:54,123 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:23:54,123 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states and 29 transitions. Second operand has 22 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 15 states have internal predecessors, (16), 5 states have call successors, (5), 5 states have call predecessors, (5), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-21 03:23:54,123 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states and 29 transitions. Second operand has 22 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 15 states have internal predecessors, (16), 5 states have call successors, (5), 5 states have call predecessors, (5), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-21 03:23:54,123 INFO L87 Difference]: Start difference. First operand 28 states and 29 transitions. Second operand has 22 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 15 states have internal predecessors, (16), 5 states have call successors, (5), 5 states have call predecessors, (5), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-21 03:23:54,124 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:23:54,124 INFO L93 Difference]: Finished difference Result 31 states and 33 transitions. [2022-02-21 03:23:54,124 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2022-02-21 03:23:54,124 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:23:54,124 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:23:54,125 INFO L74 IsIncluded]: Start isIncluded. First operand has 22 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 15 states have internal predecessors, (16), 5 states have call successors, (5), 5 states have call predecessors, (5), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Second operand 28 states and 29 transitions. [2022-02-21 03:23:54,125 INFO L87 Difference]: Start difference. First operand has 22 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 15 states have internal predecessors, (16), 5 states have call successors, (5), 5 states have call predecessors, (5), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Second operand 28 states and 29 transitions. [2022-02-21 03:23:54,125 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:23:54,126 INFO L93 Difference]: Finished difference Result 33 states and 36 transitions. [2022-02-21 03:23:54,126 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2022-02-21 03:23:54,126 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:23:54,126 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:23:54,126 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:23:54,126 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:23:54,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 15 states have internal predecessors, (16), 5 states have call successors, (5), 5 states have call predecessors, (5), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-21 03:23:54,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2022-02-21 03:23:54,127 INFO L704 BuchiCegarLoop]: Abstraction has 22 states and 23 transitions. [2022-02-21 03:23:54,127 INFO L587 BuchiCegarLoop]: Abstraction has 22 states and 23 transitions. [2022-02-21 03:23:54,127 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2022-02-21 03:23:54,127 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 23 transitions. [2022-02-21 03:23:54,127 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2022-02-21 03:23:54,127 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:23:54,127 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:23:54,127 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:23:54,127 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [3, 2, 2, 1, 1, 1, 1] [2022-02-21 03:23:54,127 INFO L791 eck$LassoCheckResult]: Stem: 1771#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 1772#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~ret3#1, main_~x~0#1;main_~x~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; 1784#L20 assume !(main_~x~0#1 < 0); 1780#L21 call main_#t~ret3#1 := g(main_~x~0#1);< 1783#gENTRY ~x := #in~x; 1787#L12 assume !(0 == ~x); 1779#L15 call #t~ret0 := g(~x - 1);< 1781#gENTRY ~x := #in~x; 1788#L12 assume 0 == ~x;#res := 1; 1789#gFINAL assume true; 1782#gEXIT >#23#return; 1777#L15-1 [2022-02-21 03:23:54,127 INFO L793 eck$LassoCheckResult]: Loop: 1777#L15-1 call #t~ret1 := g(1 + #t~ret0);< 1785#gENTRY ~x := #in~x; 1786#L12 assume !(0 == ~x); 1776#L15 call #t~ret0 := g(~x - 1);< 1778#gENTRY ~x := #in~x; 1791#L12 assume !(0 == ~x); 1774#L15 call #t~ret0 := g(~x - 1);< 1790#gENTRY ~x := #in~x; 1792#L12 assume 0 == ~x;#res := 1; 1773#gFINAL assume true; 1775#gEXIT >#23#return; 1777#L15-1 [2022-02-21 03:23:54,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:23:54,128 INFO L85 PathProgramCache]: Analyzing trace with hash -1676493545, now seen corresponding path program 2 times [2022-02-21 03:23:54,128 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:23:54,128 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532022535] [2022-02-21 03:23:54,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:23:54,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:23:54,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:23:54,131 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:23:54,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:23:54,134 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:23:54,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:23:54,134 INFO L85 PathProgramCache]: Analyzing trace with hash 1133998729, now seen corresponding path program 2 times [2022-02-21 03:23:54,134 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:23:54,134 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769607354] [2022-02-21 03:23:54,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:23:54,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:23:54,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:23:54,137 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:23:54,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:23:54,140 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:23:54,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:23:54,140 INFO L85 PathProgramCache]: Analyzing trace with hash -1734292557, now seen corresponding path program 4 times [2022-02-21 03:23:54,140 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:23:54,140 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786405769] [2022-02-21 03:23:54,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:23:54,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:23:54,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:23:54,145 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:23:54,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:23:54,149 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:23:54,479 FATAL L489 DefaultTranslator]: Callstack has procedure call flag but succeeding procedure is empty at [CALL] call #t~ret3 := g(~x~0); [2022-02-21 03:23:54,480 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.AssertionError: callstack broken after backtranslation by InlinerBacktranslator at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator.translateProgramExecution(InlinerBacktranslator.java:230) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:216) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:225) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:225) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:206) at de.uni_freiburg.informatik.ultimate.core.lib.results.NonterminatingLassoResult.getLongDescription(NonterminatingLassoResult.java:69) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ResultService.reportResult(ResultService.java:86) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.reportResult(BuchiAutomizerObserver.java:374) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.interpretAndReportResult(BuchiAutomizerObserver.java:294) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:397) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-02-21 03:23:54,482 INFO L158 Benchmark]: Toolchain (without parser) took 8207.95ms. Allocated memory was 96.5MB in the beginning and 142.6MB in the end (delta: 46.1MB). Free memory was 56.7MB in the beginning and 60.3MB in the end (delta: -3.6MB). Peak memory consumption was 44.2MB. Max. memory is 16.1GB. [2022-02-21 03:23:54,483 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 96.5MB. Free memory is still 73.7MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:23:54,483 INFO L158 Benchmark]: CACSL2BoogieTranslator took 136.35ms. Allocated memory is still 96.5MB. Free memory was 56.5MB in the beginning and 48.0MB in the end (delta: 8.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-21 03:23:54,483 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.27ms. Allocated memory was 96.5MB in the beginning and 117.4MB in the end (delta: 21.0MB). Free memory was 48.0MB in the beginning and 97.0MB in the end (delta: -49.1MB). Peak memory consumption was 6.2MB. Max. memory is 16.1GB. [2022-02-21 03:23:54,483 INFO L158 Benchmark]: Boogie Preprocessor took 11.94ms. Allocated memory is still 117.4MB. Free memory was 97.0MB in the beginning and 96.2MB in the end (delta: 851.2kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:23:54,483 INFO L158 Benchmark]: RCFGBuilder took 204.15ms. Allocated memory is still 117.4MB. Free memory was 96.1MB in the beginning and 88.7MB in the end (delta: 7.5MB). Peak memory consumption was 6.6MB. Max. memory is 16.1GB. [2022-02-21 03:23:54,483 INFO L158 Benchmark]: BuchiAutomizer took 7820.29ms. Allocated memory was 117.4MB in the beginning and 142.6MB in the end (delta: 25.2MB). Free memory was 88.7MB in the beginning and 60.3MB in the end (delta: 28.3MB). Peak memory consumption was 54.5MB. Max. memory is 16.1GB. [2022-02-21 03:23:54,484 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 96.5MB. Free memory is still 73.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 136.35ms. Allocated memory is still 96.5MB. Free memory was 56.5MB in the beginning and 48.0MB in the end (delta: 8.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 31.27ms. Allocated memory was 96.5MB in the beginning and 117.4MB in the end (delta: 21.0MB). Free memory was 48.0MB in the beginning and 97.0MB in the end (delta: -49.1MB). Peak memory consumption was 6.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 11.94ms. Allocated memory is still 117.4MB. Free memory was 97.0MB in the beginning and 96.2MB in the end (delta: 851.2kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 204.15ms. Allocated memory is still 117.4MB. Free memory was 96.1MB in the beginning and 88.7MB in the end (delta: 7.5MB). Peak memory consumption was 6.6MB. Max. memory is 16.1GB. * BuchiAutomizer took 7820.29ms. Allocated memory was 117.4MB in the beginning and 142.6MB in the end (delta: 25.2MB). Free memory was 88.7MB in the beginning and 60.3MB in the end (delta: 28.3MB). Peak memory consumption was 54.5MB. 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 4 terminating modules (2 trivial, 2 deterministic, 0 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function \old(x) and consists of 5 locations. One deterministic module has affine ranking function -2 * aux-g(x - 1)-aux + 1 and consists of 10 locations. 2 modules have a trivial ranking function, the largest among these consists of 11 locations. The remainder module has 22 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 7.7s and 4 iterations. TraceHistogramMax:4. Analysis of lassos took 5.8s. Construction of modules took 0.2s. Büchi inclusion checks took 1.4s. Highest rank in rank-based complementation 3. Minimization of det autom 0. Minimization of nondet autom 4. Automata minimization 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 19 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 26 states and ocurred in iteration 2. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/2 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 65 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 63 mSDsluCounter, 163 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 113 mSDsCounter, 48 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 225 IncrementalHoareTripleChecker+Invalid, 273 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 48 mSolverCounterUnsat, 50 mSDtfsCounter, 225 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT0 conc1 concLT1 SILN0 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital14 mio100 ax100 hnf100 lsp100 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq192 hnf93 smp100 dnf138 smp100 tf103 neg95 sie107 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 110ms VariablesStem: 1 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 16 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 16 LassoNonterminationAnalysisSatUnbounded: 2 LassoNonterminationAnalysisUnsat: 2 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 2.7s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 15]: 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 {org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@21c93274=0, x=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5d440967=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@529f4245=0, \result=0, NULL=0, \old(x)=1, \result=0, x=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@52b8f180=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: AssertionError: callstack broken after backtranslation by InlinerBacktranslator de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: AssertionError: callstack broken after backtranslation by InlinerBacktranslator: de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator.translateProgramExecution(InlinerBacktranslator.java:230) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-02-21 03:23:54,507 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2022-02-21 03:23:54,723 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-02-21 03:23:54,939 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis No suitable file found in config dir /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config using search string *Termination*64bit*_Bitvector*.epf No suitable settings file found using Termination*64bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: callstack broken after backtranslation by InlinerBacktranslator