./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/loop-simple/nested_3.c --full-output --architecture 32bit
--------------------------------------------------------------------------------
Checking for termination
Using default analysis
Version 4f9af400
extending candidate: java
['java']
extending candidate: /usr/bin/java
['java', '/usr/bin/java']
extending candidate: /opt/oracle-jdk-bin-*/bin/java
['java', '/usr/bin/java']
extending candidate: /opt/openjdk-*/bin/java
['java', '/usr/bin/java']
extending candidate: /usr/lib/jvm/java-*-openjdk-amd64/bin/java
['java', '/usr/bin/java', '/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java', '/usr/lib/jvm/java-17-openjdk-amd64/bin/java', '/usr/lib/jvm/java-11-openjdk-amd64/bin/java', '/usr/lib/jvm/java-1.17.0-openjdk-amd64/bin/java']
['/root/.sdkman/candidates/java/21.0.5-tem/bin/java', '-Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config', '-Xmx15G', '-Xms4m', '-jar', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar', '-data', '@noDefault', '-ultimatedata', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data', '-tc', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml', '-i', '../sv-benchmarks/c/loop-simple/nested_3.c', '-s', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf', '--cacsl2boogietranslator.entry.function', 'main', '--witnessprinter.witness.directory', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux', '--witnessprinter.witness.filename', 'witness', '--witnessprinter.write.witness.besides.input.file', 'false', '--witnessprinter.graph.data.specification', 'CHECK( init(main()), LTL(F end) )\n\n', '--witnessprinter.graph.data.producer', 'Automizer', '--witnessprinter.graph.data.architecture', '32bit', '--witnessprinter.graph.data.programhash', '6a30debb45adf4eb2040807436dec0136066a492a6c11eb0dbebd1f179f328d9']
Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/loop-simple/nested_3.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) )
--witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6a30debb45adf4eb2040807436dec0136066a492a6c11eb0dbebd1f179f328d9
--- Real Ultimate output ---
This is Ultimate 0.3.0-?-4f9af40
[2024-11-08 00:19:19,335 INFO L188 SettingsManager]: Resetting all preferences to default values...
[2024-11-08 00:19:19,460 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf
[2024-11-08 00:19:19,468 WARN L101 SettingsManager]: Preference file contains the following unknown settings:
[2024-11-08 00:19:19,469 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-11-08 00:19:19,498 INFO L130 SettingsManager]: Preferences different from defaults after loading the file:
[2024-11-08 00:19:19,499 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-11-08 00:19:19,500 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-11-08 00:19:19,500 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-11-08 00:19:19,501 INFO L153 SettingsManager]: * Use memory slicer=true
[2024-11-08 00:19:19,501 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-11-08 00:19:19,502 INFO L153 SettingsManager]: * Create parallel compositions if possible=false
[2024-11-08 00:19:19,502 INFO L153 SettingsManager]: * Use SBE=true
[2024-11-08 00:19:19,502 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults:
[2024-11-08 00:19:19,502 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3
[2024-11-08 00:19:19,502 INFO L153 SettingsManager]: * Use old map elimination=false
[2024-11-08 00:19:19,502 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false
[2024-11-08 00:19:19,503 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true
[2024-11-08 00:19:19,503 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES
[2024-11-08 00:19:19,503 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-11-08 00:19:19,503 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME
[2024-11-08 00:19:19,503 INFO L153 SettingsManager]: * sizeof long=4
[2024-11-08 00:19:19,503 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true
[2024-11-08 00:19:19,503 INFO L153 SettingsManager]: * sizeof POINTER=4
[2024-11-08 00:19:19,503 INFO L153 SettingsManager]: * Check division by zero=IGNORE
[2024-11-08 00:19:19,503 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME
[2024-11-08 00:19:19,503 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME
[2024-11-08 00:19:19,503 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME
[2024-11-08 00:19:19,503 INFO L153 SettingsManager]: * Allow undefined functions=false
[2024-11-08 00:19:19,503 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false
[2024-11-08 00:19:19,503 INFO L153 SettingsManager]: * sizeof long double=12
[2024-11-08 00:19:19,503 INFO L153 SettingsManager]: * Check if freed pointer was valid=false
[2024-11-08 00:19:19,503 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false
[2024-11-08 00:19:19,503 INFO L153 SettingsManager]: * Use constant arrays=true
[2024-11-08 00:19:19,503 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-11-08 00:19:19,504 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements
[2024-11-08 00:19:19,504 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-11-08 00:19:19,504 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL
[2024-11-08 00:19:19,504 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults:
[2024-11-08 00:19:19,504 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR
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-jdk21/releaseScripts/default/UAutomizer-linux
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) )
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6a30debb45adf4eb2040807436dec0136066a492a6c11eb0dbebd1f179f328d9
[2024-11-08 00:19:19,782 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2024-11-08 00:19:19,792 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-11-08 00:19:19,794 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-11-08 00:19:19,796 INFO L270 PluginConnector]: Initializing CDTParser...
[2024-11-08 00:19:19,797 INFO L274 PluginConnector]: CDTParser initialized
[2024-11-08 00:19:19,799 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-simple/nested_3.c
[2024-11-08 00:19:21,140 INFO L533 CDTParser]: Created temporary CDT project at NULL
[2024-11-08 00:19:21,338 INFO L384 CDTParser]: Found 1 translation units.
[2024-11-08 00:19:21,339 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/loop-simple/nested_3.c
[2024-11-08 00:19:21,345 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e7147ec86/171e364552ad4632be4ae24bcfe55659/FLAGb9145154c
[2024-11-08 00:19:21,365 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e7147ec86/171e364552ad4632be4ae24bcfe55659
[2024-11-08 00:19:21,368 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-11-08 00:19:21,371 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements.
[2024-11-08 00:19:21,373 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-11-08 00:19:21,373 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-11-08 00:19:21,377 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized
[2024-11-08 00:19:21,378 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 12:19:21" (1/1) ...
[2024-11-08 00:19:21,379 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@41d8e9bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:19:21, skipping insertion in model container
[2024-11-08 00:19:21,379 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 12:19:21" (1/1) ...
[2024-11-08 00:19:21,388 INFO L175 MainTranslator]: Built tables and reachable declarations
[2024-11-08 00:19:21,529 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-11-08 00:19:21,542 INFO L200 MainTranslator]: Completed pre-run
[2024-11-08 00:19:21,556 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-11-08 00:19:21,571 INFO L204 MainTranslator]: Completed translation
[2024-11-08 00:19:21,572 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:19:21 WrapperNode
[2024-11-08 00:19:21,572 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-11-08 00:19:21,573 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-11-08 00:19:21,573 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-11-08 00:19:21,573 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized
[2024-11-08 00:19:21,579 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:19:21" (1/1) ...
[2024-11-08 00:19:21,584 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:19:21" (1/1) ...
[2024-11-08 00:19:21,600 INFO L138 Inliner]: procedures = 10, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 41
[2024-11-08 00:19:21,601 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-11-08 00:19:21,601 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-11-08 00:19:21,602 INFO L270 PluginConnector]: Initializing Boogie Preprocessor...
[2024-11-08 00:19:21,602 INFO L274 PluginConnector]: Boogie Preprocessor initialized
[2024-11-08 00:19:21,610 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:19:21" (1/1) ...
[2024-11-08 00:19:21,610 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:19:21" (1/1) ...
[2024-11-08 00:19:21,611 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:19:21" (1/1) ...
[2024-11-08 00:19:21,620 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0].
[2024-11-08 00:19:21,621 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:19:21" (1/1) ...
[2024-11-08 00:19:21,622 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:19:21" (1/1) ...
[2024-11-08 00:19:21,626 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:19:21" (1/1) ...
[2024-11-08 00:19:21,628 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:19:21" (1/1) ...
[2024-11-08 00:19:21,633 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:19:21" (1/1) ...
[2024-11-08 00:19:21,634 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:19:21" (1/1) ...
[2024-11-08 00:19:21,635 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-11-08 00:19:21,636 INFO L112 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-11-08 00:19:21,636 INFO L270 PluginConnector]: Initializing RCFGBuilder...
[2024-11-08 00:19:21,636 INFO L274 PluginConnector]: RCFGBuilder initialized
[2024-11-08 00:19:21,638 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:19:21" (1/1) ...
[2024-11-08 00:19:21,650 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 00:19:21,664 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-08 00:19:21,684 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-08 00:19:21,692 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process
[2024-11-08 00:19:21,715 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-11-08 00:19:21,715 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-11-08 00:19:21,716 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-11-08 00:19:21,716 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0
[2024-11-08 00:19:21,780 INFO L238 CfgBuilder]: Building ICFG
[2024-11-08 00:19:21,782 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation
[2024-11-08 00:19:21,892 INFO L? ?]: Removed 5 outVars from TransFormulas that were not future-live.
[2024-11-08 00:19:21,893 INFO L287 CfgBuilder]: Performing block encoding
[2024-11-08 00:19:21,900 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-11-08 00:19:21,900 INFO L316 CfgBuilder]: Removed 3 assume(true) statements.
[2024-11-08 00:19:21,901 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 12:19:21 BoogieIcfgContainer
[2024-11-08 00:19:21,901 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-11-08 00:19:21,902 INFO L112 PluginConnector]: ------------------------BuchiAutomizer----------------------------
[2024-11-08 00:19:21,902 INFO L270 PluginConnector]: Initializing BuchiAutomizer...
[2024-11-08 00:19:21,909 INFO L274 PluginConnector]: BuchiAutomizer initialized
[2024-11-08 00:19:21,911 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis
[2024-11-08 00:19:21,911 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 08.11 12:19:21" (1/3) ...
[2024-11-08 00:19:21,912 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@63a3a235 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 08.11 12:19:21, skipping insertion in model container
[2024-11-08 00:19:21,912 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis
[2024-11-08 00:19:21,912 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:19:21" (2/3) ...
[2024-11-08 00:19:21,913 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@63a3a235 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 08.11 12:19:21, skipping insertion in model container
[2024-11-08 00:19:21,913 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis
[2024-11-08 00:19:21,913 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 12:19:21" (3/3) ...
[2024-11-08 00:19:21,914 INFO L332 chiAutomizerObserver]: Analyzing ICFG nested_3.c
[2024-11-08 00:19:21,967 INFO L300 stractBuchiCegarLoop]: Interprodecural is true
[2024-11-08 00:19:21,968 INFO L301 stractBuchiCegarLoop]: Hoare is None
[2024-11-08 00:19:21,968 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates
[2024-11-08 00:19:21,968 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE
[2024-11-08 00:19:21,968 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2024-11-08 00:19:21,968 INFO L305 stractBuchiCegarLoop]: Difference is false
[2024-11-08 00:19:21,968 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA
[2024-11-08 00:19:21,968 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ========
[2024-11-08 00:19:21,974 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 14 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 13 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 00:19:21,987 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6
[2024-11-08 00:19:21,987 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2024-11-08 00:19:21,987 INFO L119 BuchiIsEmpty]: Starting construction of run
[2024-11-08 00:19:21,991 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1]
[2024-11-08 00:19:21,991 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1]
[2024-11-08 00:19:21,992 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============
[2024-11-08 00:19:21,992 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 14 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 13 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 00:19:21,993 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6
[2024-11-08 00:19:21,993 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2024-11-08 00:19:21,993 INFO L119 BuchiIsEmpty]: Starting construction of run
[2024-11-08 00:19:21,993 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1]
[2024-11-08 00:19:21,993 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1]
[2024-11-08 00:19:22,001 INFO L745 eck$LassoCheckResult]: Stem: 10#$Ultimate##0true assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); 4#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~pre4#1, main_#t~pre5#1, main_#t~pre6#1, main_~a~0#1, main_~b~0#1, main_~c~0#1;main_~a~0#1 := 6;main_~b~0#1 := 6;main_~c~0#1 := 6;main_~a~0#1 := 0; 3#L21-3true
[2024-11-08 00:19:22,002 INFO L747 eck$LassoCheckResult]: Loop: 3#L21-3true assume !!(main_~a~0#1 < 6);main_~b~0#1 := 0; 11#L22-3true assume !(main_~b~0#1 < 6); 13#L21-2true main_#t~pre6#1 := 1 + main_~a~0#1;main_~a~0#1 := 1 + main_~a~0#1;havoc main_#t~pre6#1; 3#L21-3true
[2024-11-08 00:19:22,006 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 00:19:22,007 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times
[2024-11-08 00:19:22,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 00:19:22,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835676484]
[2024-11-08 00:19:22,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 00:19:22,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 00:19:22,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 00:19:22,092 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-08 00:19:22,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 00:19:22,121 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-08 00:19:22,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 00:19:22,124 INFO L85 PathProgramCache]: Analyzing trace with hash 39933, now seen corresponding path program 1 times
[2024-11-08 00:19:22,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 00:19:22,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317091986]
[2024-11-08 00:19:22,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 00:19:22,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 00:19:22,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 00:19:22,210 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-08 00:19:22,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 00:19:22,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317091986]
[2024-11-08 00:19:22,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1317091986] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 00:19:22,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 00:19:22,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-11-08 00:19:22,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140107340]
[2024-11-08 00:19:22,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 00:19:22,215 INFO L762 eck$LassoCheckResult]: loop already infeasible
[2024-11-08 00:19:22,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 00:19:22,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-08 00:19:22,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-08 00:19:22,243 INFO L87 Difference]: Start difference. First operand has 14 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 13 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 1.0) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 00:19:22,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 00:19:22,277 INFO L93 Difference]: Finished difference Result 17 states and 20 transitions.
[2024-11-08 00:19:22,278 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 20 transitions.
[2024-11-08 00:19:22,280 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10
[2024-11-08 00:19:22,286 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 12 states and 15 transitions.
[2024-11-08 00:19:22,287 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12
[2024-11-08 00:19:22,289 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12
[2024-11-08 00:19:22,289 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 15 transitions.
[2024-11-08 00:19:22,290 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-11-08 00:19:22,290 INFO L218 hiAutomatonCegarLoop]: Abstraction has 12 states and 15 transitions.
[2024-11-08 00:19:22,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 15 transitions.
[2024-11-08 00:19:22,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 9.
[2024-11-08 00:19:22,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 8 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 00:19:22,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 11 transitions.
[2024-11-08 00:19:22,316 INFO L240 hiAutomatonCegarLoop]: Abstraction has 9 states and 11 transitions.
[2024-11-08 00:19:22,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-11-08 00:19:22,322 INFO L425 stractBuchiCegarLoop]: Abstraction has 9 states and 11 transitions.
[2024-11-08 00:19:22,323 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============
[2024-11-08 00:19:22,323 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 11 transitions.
[2024-11-08 00:19:22,324 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7
[2024-11-08 00:19:22,324 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2024-11-08 00:19:22,324 INFO L119 BuchiIsEmpty]: Starting construction of run
[2024-11-08 00:19:22,325 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1]
[2024-11-08 00:19:22,325 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1]
[2024-11-08 00:19:22,325 INFO L745 eck$LassoCheckResult]: Stem: 44#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); 45#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~pre4#1, main_#t~pre5#1, main_#t~pre6#1, main_~a~0#1, main_~b~0#1, main_~c~0#1;main_~a~0#1 := 6;main_~b~0#1 := 6;main_~c~0#1 := 6;main_~a~0#1 := 0; 40#L21-3
[2024-11-08 00:19:22,325 INFO L747 eck$LassoCheckResult]: Loop: 40#L21-3 assume !!(main_~a~0#1 < 6);main_~b~0#1 := 0; 41#L22-3 assume !!(main_~b~0#1 < 6);main_~c~0#1 := 0; 43#L23-3 assume !(main_~c~0#1 < 6); 47#L22-2 main_#t~pre5#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre5#1; 48#L22-3 assume !(main_~b~0#1 < 6); 46#L21-2 main_#t~pre6#1 := 1 + main_~a~0#1;main_~a~0#1 := 1 + main_~a~0#1;havoc main_#t~pre6#1; 40#L21-3
[2024-11-08 00:19:22,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 00:19:22,327 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times
[2024-11-08 00:19:22,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 00:19:22,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971629814]
[2024-11-08 00:19:22,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 00:19:22,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 00:19:22,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 00:19:22,337 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-08 00:19:22,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 00:19:22,343 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-08 00:19:22,344 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 00:19:22,344 INFO L85 PathProgramCache]: Analyzing trace with hash 1191164837, now seen corresponding path program 1 times
[2024-11-08 00:19:22,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 00:19:22,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541179250]
[2024-11-08 00:19:22,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 00:19:22,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 00:19:22,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 00:19:22,372 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-08 00:19:22,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 00:19:22,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541179250]
[2024-11-08 00:19:22,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [541179250] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 00:19:22,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 00:19:22,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-08 00:19:22,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024613808]
[2024-11-08 00:19:22,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 00:19:22,373 INFO L762 eck$LassoCheckResult]: loop already infeasible
[2024-11-08 00:19:22,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 00:19:22,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-08 00:19:22,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-08 00:19:22,374 INFO L87 Difference]: Start difference. First operand 9 states and 11 transitions. cyclomatic complexity: 3 Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 00:19:22,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 00:19:22,389 INFO L93 Difference]: Finished difference Result 11 states and 13 transitions.
[2024-11-08 00:19:22,390 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 13 transitions.
[2024-11-08 00:19:22,390 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9
[2024-11-08 00:19:22,390 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 11 states and 13 transitions.
[2024-11-08 00:19:22,391 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11
[2024-11-08 00:19:22,391 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11
[2024-11-08 00:19:22,391 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 13 transitions.
[2024-11-08 00:19:22,391 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-11-08 00:19:22,391 INFO L218 hiAutomatonCegarLoop]: Abstraction has 11 states and 13 transitions.
[2024-11-08 00:19:22,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 13 transitions.
[2024-11-08 00:19:22,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 10.
[2024-11-08 00:19:22,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.2) internal successors, (12), 9 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 00:19:22,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 12 transitions.
[2024-11-08 00:19:22,393 INFO L240 hiAutomatonCegarLoop]: Abstraction has 10 states and 12 transitions.
[2024-11-08 00:19:22,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-11-08 00:19:22,394 INFO L425 stractBuchiCegarLoop]: Abstraction has 10 states and 12 transitions.
[2024-11-08 00:19:22,394 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============
[2024-11-08 00:19:22,394 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 12 transitions.
[2024-11-08 00:19:22,394 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8
[2024-11-08 00:19:22,394 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2024-11-08 00:19:22,395 INFO L119 BuchiIsEmpty]: Starting construction of run
[2024-11-08 00:19:22,395 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1]
[2024-11-08 00:19:22,395 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 00:19:22,395 INFO L745 eck$LassoCheckResult]: Stem: 70#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); 71#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~pre4#1, main_#t~pre5#1, main_#t~pre6#1, main_~a~0#1, main_~b~0#1, main_~c~0#1;main_~a~0#1 := 6;main_~b~0#1 := 6;main_~c~0#1 := 6;main_~a~0#1 := 0; 66#L21-3
[2024-11-08 00:19:22,395 INFO L747 eck$LassoCheckResult]: Loop: 66#L21-3 assume !!(main_~a~0#1 < 6);main_~b~0#1 := 0; 67#L22-3 assume !!(main_~b~0#1 < 6);main_~c~0#1 := 0; 72#L23-3 assume !!(main_~c~0#1 < 6); 68#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 69#L23-3 assume !(main_~c~0#1 < 6); 74#L22-2 main_#t~pre5#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre5#1; 75#L22-3 assume !(main_~b~0#1 < 6); 73#L21-2 main_#t~pre6#1 := 1 + main_~a~0#1;main_~a~0#1 := 1 + main_~a~0#1;havoc main_#t~pre6#1; 66#L21-3
[2024-11-08 00:19:22,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 00:19:22,396 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times
[2024-11-08 00:19:22,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 00:19:22,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824447819]
[2024-11-08 00:19:22,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 00:19:22,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 00:19:22,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 00:19:22,403 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-08 00:19:22,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 00:19:22,413 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-08 00:19:22,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 00:19:22,413 INFO L85 PathProgramCache]: Analyzing trace with hash -1993060441, now seen corresponding path program 1 times
[2024-11-08 00:19:22,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 00:19:22,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468842965]
[2024-11-08 00:19:22,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 00:19:22,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 00:19:22,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 00:19:22,464 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-08 00:19:22,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 00:19:22,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468842965]
[2024-11-08 00:19:22,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1468842965] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-08 00:19:22,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [371137539]
[2024-11-08 00:19:22,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 00:19:22,465 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-08 00:19:22,465 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-08 00:19:22,468 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-08 00:19:22,470 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2024-11-08 00:19:22,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 00:19:22,508 INFO L255 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 3 conjuncts are in the unsatisfiable core
[2024-11-08 00:19:22,511 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 00:19:22,560 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-08 00:19:22,561 INFO L311 TraceCheckSpWp]: Computing backward predicates...
[2024-11-08 00:19:22,598 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-08 00:19:22,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [371137539] provided 0 perfect and 2 imperfect interpolant sequences
[2024-11-08 00:19:22,599 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-11-08 00:19:22,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6
[2024-11-08 00:19:22,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585829780]
[2024-11-08 00:19:22,599 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-11-08 00:19:22,599 INFO L762 eck$LassoCheckResult]: loop already infeasible
[2024-11-08 00:19:22,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 00:19:22,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-11-08 00:19:22,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-11-08 00:19:22,600 INFO L87 Difference]: Start difference. First operand 10 states and 12 transitions. cyclomatic complexity: 3 Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 00:19:22,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 00:19:22,630 INFO L93 Difference]: Finished difference Result 16 states and 18 transitions.
[2024-11-08 00:19:22,630 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 18 transitions.
[2024-11-08 00:19:22,631 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14
[2024-11-08 00:19:22,632 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 16 states and 18 transitions.
[2024-11-08 00:19:22,632 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16
[2024-11-08 00:19:22,632 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16
[2024-11-08 00:19:22,632 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 18 transitions.
[2024-11-08 00:19:22,632 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-11-08 00:19:22,632 INFO L218 hiAutomatonCegarLoop]: Abstraction has 16 states and 18 transitions.
[2024-11-08 00:19:22,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 18 transitions.
[2024-11-08 00:19:22,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16.
[2024-11-08 00:19:22,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.125) internal successors, (18), 15 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 00:19:22,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions.
[2024-11-08 00:19:22,634 INFO L240 hiAutomatonCegarLoop]: Abstraction has 16 states and 18 transitions.
[2024-11-08 00:19:22,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2024-11-08 00:19:22,635 INFO L425 stractBuchiCegarLoop]: Abstraction has 16 states and 18 transitions.
[2024-11-08 00:19:22,635 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============
[2024-11-08 00:19:22,635 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 18 transitions.
[2024-11-08 00:19:22,636 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14
[2024-11-08 00:19:22,636 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2024-11-08 00:19:22,636 INFO L119 BuchiIsEmpty]: Starting construction of run
[2024-11-08 00:19:22,636 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1]
[2024-11-08 00:19:22,636 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [4, 4, 1, 1, 1, 1, 1, 1]
[2024-11-08 00:19:22,636 INFO L745 eck$LassoCheckResult]: Stem: 147#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); 148#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~pre4#1, main_#t~pre5#1, main_#t~pre6#1, main_~a~0#1, main_~b~0#1, main_~c~0#1;main_~a~0#1 := 6;main_~b~0#1 := 6;main_~c~0#1 := 6;main_~a~0#1 := 0; 143#L21-3
[2024-11-08 00:19:22,636 INFO L747 eck$LassoCheckResult]: Loop: 143#L21-3 assume !!(main_~a~0#1 < 6);main_~b~0#1 := 0; 144#L22-3 assume !!(main_~b~0#1 < 6);main_~c~0#1 := 0; 149#L23-3 assume !!(main_~c~0#1 < 6); 145#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 146#L23-3 assume !!(main_~c~0#1 < 6); 158#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 157#L23-3 assume !!(main_~c~0#1 < 6); 156#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 155#L23-3 assume !!(main_~c~0#1 < 6); 154#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 153#L23-3 assume !(main_~c~0#1 < 6); 151#L22-2 main_#t~pre5#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre5#1; 152#L22-3 assume !(main_~b~0#1 < 6); 150#L21-2 main_#t~pre6#1 := 1 + main_~a~0#1;main_~a~0#1 := 1 + main_~a~0#1;havoc main_#t~pre6#1; 143#L21-3
[2024-11-08 00:19:22,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 00:19:22,637 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times
[2024-11-08 00:19:22,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 00:19:22,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055273666]
[2024-11-08 00:19:22,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 00:19:22,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 00:19:22,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 00:19:22,645 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-08 00:19:22,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 00:19:22,654 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-08 00:19:22,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 00:19:22,655 INFO L85 PathProgramCache]: Analyzing trace with hash -1917011795, now seen corresponding path program 2 times
[2024-11-08 00:19:22,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 00:19:22,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271653669]
[2024-11-08 00:19:22,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 00:19:22,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 00:19:22,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 00:19:22,710 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked.
[2024-11-08 00:19:22,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 00:19:22,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271653669]
[2024-11-08 00:19:22,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1271653669] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-08 00:19:22,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1696334576]
[2024-11-08 00:19:22,711 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2024-11-08 00:19:22,711 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-08 00:19:22,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-08 00:19:22,713 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-08 00:19:22,715 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process
[2024-11-08 00:19:22,751 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2024-11-08 00:19:22,751 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat
[2024-11-08 00:19:22,752 INFO L255 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 6 conjuncts are in the unsatisfiable core
[2024-11-08 00:19:22,753 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 00:19:22,828 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-08 00:19:22,828 INFO L311 TraceCheckSpWp]: Computing backward predicates...
[2024-11-08 00:19:22,905 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-08 00:19:22,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1696334576] provided 0 perfect and 2 imperfect interpolant sequences
[2024-11-08 00:19:22,906 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-11-08 00:19:22,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 7, 7] total 10
[2024-11-08 00:19:22,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788078981]
[2024-11-08 00:19:22,906 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-11-08 00:19:22,906 INFO L762 eck$LassoCheckResult]: loop already infeasible
[2024-11-08 00:19:22,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 00:19:22,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-11-08 00:19:22,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90
[2024-11-08 00:19:22,908 INFO L87 Difference]: Start difference. First operand 16 states and 18 transitions. cyclomatic complexity: 3 Second operand has 10 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 00:19:23,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 00:19:23,109 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions.
[2024-11-08 00:19:23,109 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 53 transitions.
[2024-11-08 00:19:23,111 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 47
[2024-11-08 00:19:23,111 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 49 states and 53 transitions.
[2024-11-08 00:19:23,112 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 49
[2024-11-08 00:19:23,112 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 49
[2024-11-08 00:19:23,112 INFO L73 IsDeterministic]: Start isDeterministic. Operand 49 states and 53 transitions.
[2024-11-08 00:19:23,112 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-11-08 00:19:23,112 INFO L218 hiAutomatonCegarLoop]: Abstraction has 49 states and 53 transitions.
[2024-11-08 00:19:23,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states and 53 transitions.
[2024-11-08 00:19:23,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 35.
[2024-11-08 00:19:23,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 35 states have (on average 1.0857142857142856) internal successors, (38), 34 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 00:19:23,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions.
[2024-11-08 00:19:23,115 INFO L240 hiAutomatonCegarLoop]: Abstraction has 35 states and 38 transitions.
[2024-11-08 00:19:23,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states.
[2024-11-08 00:19:23,116 INFO L425 stractBuchiCegarLoop]: Abstraction has 35 states and 38 transitions.
[2024-11-08 00:19:23,116 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============
[2024-11-08 00:19:23,116 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 38 transitions.
[2024-11-08 00:19:23,117 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 33
[2024-11-08 00:19:23,117 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2024-11-08 00:19:23,117 INFO L119 BuchiIsEmpty]: Starting construction of run
[2024-11-08 00:19:23,118 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1]
[2024-11-08 00:19:23,118 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [12, 12, 2, 2, 2, 1, 1, 1]
[2024-11-08 00:19:23,118 INFO L745 eck$LassoCheckResult]: Stem: 327#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); 328#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~pre4#1, main_#t~pre5#1, main_#t~pre6#1, main_~a~0#1, main_~b~0#1, main_~c~0#1;main_~a~0#1 := 6;main_~b~0#1 := 6;main_~c~0#1 := 6;main_~a~0#1 := 0; 323#L21-3
[2024-11-08 00:19:23,118 INFO L747 eck$LassoCheckResult]: Loop: 323#L21-3 assume !!(main_~a~0#1 < 6);main_~b~0#1 := 0; 324#L22-3 assume !!(main_~b~0#1 < 6);main_~c~0#1 := 0; 348#L23-3 assume !!(main_~c~0#1 < 6); 347#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 346#L23-3 assume !!(main_~c~0#1 < 6); 345#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 344#L23-3 assume !!(main_~c~0#1 < 6); 343#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 342#L23-3 assume !!(main_~c~0#1 < 6); 341#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 340#L23-3 assume !!(main_~c~0#1 < 6); 339#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 338#L23-3 assume !!(main_~c~0#1 < 6); 337#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 336#L23-3 assume !(main_~c~0#1 < 6); 333#L22-2 main_#t~pre5#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre5#1; 330#L22-3 assume !!(main_~b~0#1 < 6);main_~c~0#1 := 0; 331#L23-3 assume !!(main_~c~0#1 < 6); 325#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 326#L23-3 assume !!(main_~c~0#1 < 6); 329#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 357#L23-3 assume !!(main_~c~0#1 < 6); 356#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 355#L23-3 assume !!(main_~c~0#1 < 6); 354#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 353#L23-3 assume !!(main_~c~0#1 < 6); 352#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 351#L23-3 assume !!(main_~c~0#1 < 6); 350#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 349#L23-3 assume !(main_~c~0#1 < 6); 335#L22-2 main_#t~pre5#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre5#1; 334#L22-3 assume !(main_~b~0#1 < 6); 332#L21-2 main_#t~pre6#1 := 1 + main_~a~0#1;main_~a~0#1 := 1 + main_~a~0#1;havoc main_#t~pre6#1; 323#L21-3
[2024-11-08 00:19:23,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 00:19:23,119 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 5 times
[2024-11-08 00:19:23,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 00:19:23,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771874650]
[2024-11-08 00:19:23,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 00:19:23,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 00:19:23,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 00:19:23,130 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-08 00:19:23,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 00:19:23,137 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-08 00:19:23,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 00:19:23,138 INFO L85 PathProgramCache]: Analyzing trace with hash 1010871677, now seen corresponding path program 3 times
[2024-11-08 00:19:23,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 00:19:23,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181112576]
[2024-11-08 00:19:23,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 00:19:23,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 00:19:23,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 00:19:23,240 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 0 proven. 89 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked.
[2024-11-08 00:19:23,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 00:19:23,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181112576]
[2024-11-08 00:19:23,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [181112576] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-08 00:19:23,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2036815754]
[2024-11-08 00:19:23,242 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2024-11-08 00:19:23,242 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-08 00:19:23,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-08 00:19:23,264 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-11-08 00:19:23,266 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process
[2024-11-08 00:19:23,307 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s)
[2024-11-08 00:19:23,308 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat
[2024-11-08 00:19:23,309 INFO L255 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 4 conjuncts are in the unsatisfiable core
[2024-11-08 00:19:23,310 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 00:19:23,368 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 0 proven. 89 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked.
[2024-11-08 00:19:23,368 INFO L311 TraceCheckSpWp]: Computing backward predicates...
[2024-11-08 00:19:23,454 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 0 proven. 89 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked.
[2024-11-08 00:19:23,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2036815754] provided 0 perfect and 2 imperfect interpolant sequences
[2024-11-08 00:19:23,454 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-11-08 00:19:23,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7
[2024-11-08 00:19:23,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070720777]
[2024-11-08 00:19:23,454 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-11-08 00:19:23,455 INFO L762 eck$LassoCheckResult]: loop already infeasible
[2024-11-08 00:19:23,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 00:19:23,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-11-08 00:19:23,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56
[2024-11-08 00:19:23,455 INFO L87 Difference]: Start difference. First operand 35 states and 38 transitions. cyclomatic complexity: 4 Second operand has 8 states, 8 states have (on average 3.125) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 00:19:23,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 00:19:23,492 INFO L93 Difference]: Finished difference Result 95 states and 102 transitions.
[2024-11-08 00:19:23,493 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 95 states and 102 transitions.
[2024-11-08 00:19:23,494 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 93
[2024-11-08 00:19:23,495 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 95 states to 95 states and 102 transitions.
[2024-11-08 00:19:23,495 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 95
[2024-11-08 00:19:23,496 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 95
[2024-11-08 00:19:23,496 INFO L73 IsDeterministic]: Start isDeterministic. Operand 95 states and 102 transitions.
[2024-11-08 00:19:23,496 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-11-08 00:19:23,496 INFO L218 hiAutomatonCegarLoop]: Abstraction has 95 states and 102 transitions.
[2024-11-08 00:19:23,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states and 102 transitions.
[2024-11-08 00:19:23,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95.
[2024-11-08 00:19:23,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 95 states have (on average 1.0736842105263158) internal successors, (102), 94 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 00:19:23,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 102 transitions.
[2024-11-08 00:19:23,502 INFO L240 hiAutomatonCegarLoop]: Abstraction has 95 states and 102 transitions.
[2024-11-08 00:19:23,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states.
[2024-11-08 00:19:23,505 INFO L425 stractBuchiCegarLoop]: Abstraction has 95 states and 102 transitions.
[2024-11-08 00:19:23,505 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============
[2024-11-08 00:19:23,505 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 95 states and 102 transitions.
[2024-11-08 00:19:23,506 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 93
[2024-11-08 00:19:23,506 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2024-11-08 00:19:23,506 INFO L119 BuchiIsEmpty]: Starting construction of run
[2024-11-08 00:19:23,511 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1]
[2024-11-08 00:19:23,511 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [36, 36, 6, 6, 6, 1, 1, 1]
[2024-11-08 00:19:23,511 INFO L745 eck$LassoCheckResult]: Stem: 660#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); 661#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~pre4#1, main_#t~pre5#1, main_#t~pre6#1, main_~a~0#1, main_~b~0#1, main_~c~0#1;main_~a~0#1 := 6;main_~b~0#1 := 6;main_~c~0#1 := 6;main_~a~0#1 := 0; 656#L21-3
[2024-11-08 00:19:23,512 INFO L747 eck$LassoCheckResult]: Loop: 656#L21-3 assume !!(main_~a~0#1 < 6);main_~b~0#1 := 0; 657#L22-3 assume !!(main_~b~0#1 < 6);main_~c~0#1 := 0; 662#L23-3 assume !!(main_~c~0#1 < 6); 658#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 659#L23-3 assume !!(main_~c~0#1 < 6); 747#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 745#L23-3 assume !!(main_~c~0#1 < 6); 743#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 741#L23-3 assume !!(main_~c~0#1 < 6); 739#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 737#L23-3 assume !!(main_~c~0#1 < 6); 735#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 733#L23-3 assume !!(main_~c~0#1 < 6); 731#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 730#L23-3 assume !(main_~c~0#1 < 6); 664#L22-2 main_#t~pre5#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre5#1; 665#L22-3 assume !!(main_~b~0#1 < 6);main_~c~0#1 := 0; 750#L23-3 assume !!(main_~c~0#1 < 6); 749#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 748#L23-3 assume !!(main_~c~0#1 < 6); 746#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 744#L23-3 assume !!(main_~c~0#1 < 6); 742#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 740#L23-3 assume !!(main_~c~0#1 < 6); 738#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 736#L23-3 assume !!(main_~c~0#1 < 6); 734#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 732#L23-3 assume !!(main_~c~0#1 < 6); 729#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 728#L23-3 assume !(main_~c~0#1 < 6); 727#L22-2 main_#t~pre5#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre5#1; 726#L22-3 assume !!(main_~b~0#1 < 6);main_~c~0#1 := 0; 725#L23-3 assume !!(main_~c~0#1 < 6); 724#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 723#L23-3 assume !!(main_~c~0#1 < 6); 722#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 721#L23-3 assume !!(main_~c~0#1 < 6); 720#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 719#L23-3 assume !!(main_~c~0#1 < 6); 718#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 717#L23-3 assume !!(main_~c~0#1 < 6); 716#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 715#L23-3 assume !!(main_~c~0#1 < 6); 714#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 713#L23-3 assume !(main_~c~0#1 < 6); 712#L22-2 main_#t~pre5#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre5#1; 711#L22-3 assume !!(main_~b~0#1 < 6);main_~c~0#1 := 0; 710#L23-3 assume !!(main_~c~0#1 < 6); 709#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 708#L23-3 assume !!(main_~c~0#1 < 6); 707#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 706#L23-3 assume !!(main_~c~0#1 < 6); 705#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 704#L23-3 assume !!(main_~c~0#1 < 6); 703#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 702#L23-3 assume !!(main_~c~0#1 < 6); 701#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 700#L23-3 assume !!(main_~c~0#1 < 6); 699#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 698#L23-3 assume !(main_~c~0#1 < 6); 697#L22-2 main_#t~pre5#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre5#1; 696#L22-3 assume !!(main_~b~0#1 < 6);main_~c~0#1 := 0; 695#L23-3 assume !!(main_~c~0#1 < 6); 694#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 693#L23-3 assume !!(main_~c~0#1 < 6); 692#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 691#L23-3 assume !!(main_~c~0#1 < 6); 690#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 689#L23-3 assume !!(main_~c~0#1 < 6); 688#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 687#L23-3 assume !!(main_~c~0#1 < 6); 686#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 685#L23-3 assume !!(main_~c~0#1 < 6); 684#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 683#L23-3 assume !(main_~c~0#1 < 6); 682#L22-2 main_#t~pre5#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre5#1; 681#L22-3 assume !!(main_~b~0#1 < 6);main_~c~0#1 := 0; 667#L23-3 assume !!(main_~c~0#1 < 6); 680#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 679#L23-3 assume !!(main_~c~0#1 < 6); 678#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 677#L23-3 assume !!(main_~c~0#1 < 6); 676#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 675#L23-3 assume !!(main_~c~0#1 < 6); 674#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 673#L23-3 assume !!(main_~c~0#1 < 6); 672#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 671#L23-3 assume !!(main_~c~0#1 < 6); 670#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 669#L23-3 assume !(main_~c~0#1 < 6); 668#L22-2 main_#t~pre5#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre5#1; 666#L22-3 assume !(main_~b~0#1 < 6); 663#L21-2 main_#t~pre6#1 := 1 + main_~a~0#1;main_~a~0#1 := 1 + main_~a~0#1;havoc main_#t~pre6#1; 656#L21-3
[2024-11-08 00:19:23,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 00:19:23,512 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 6 times
[2024-11-08 00:19:23,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 00:19:23,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955540201]
[2024-11-08 00:19:23,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 00:19:23,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 00:19:23,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 00:19:23,520 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-08 00:19:23,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 00:19:23,527 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-08 00:19:23,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 00:19:23,528 INFO L85 PathProgramCache]: Analyzing trace with hash -655757187, now seen corresponding path program 4 times
[2024-11-08 00:19:23,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 00:19:23,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606870498]
[2024-11-08 00:19:23,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 00:19:23,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 00:19:23,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 00:19:23,608 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-08 00:19:23,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 00:19:23,643 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-08 00:19:23,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 00:19:23,643 INFO L85 PathProgramCache]: Analyzing trace with hash -1993610245, now seen corresponding path program 1 times
[2024-11-08 00:19:23,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 00:19:23,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514418702]
[2024-11-08 00:19:23,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 00:19:23,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 00:19:23,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 00:19:23,671 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-08 00:19:23,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 00:19:23,706 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-08 00:19:24,612 INFO L204 LassoAnalysis]: Preferences:
[2024-11-08 00:19:24,613 INFO L125 ssoRankerPreferences]: Compute integeral hull: false
[2024-11-08 00:19:24,613 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true
[2024-11-08 00:19:24,613 INFO L127 ssoRankerPreferences]: Term annotations enabled: false
[2024-11-08 00:19:24,614 INFO L128 ssoRankerPreferences]: Use exernal solver: true
[2024-11-08 00:19:24,614 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 00:19:24,614 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false
[2024-11-08 00:19:24,614 INFO L131 ssoRankerPreferences]: Path of dumped script:
[2024-11-08 00:19:24,614 INFO L132 ssoRankerPreferences]: Filename of dumped script: nested_3.c_Iteration6_Loop
[2024-11-08 00:19:24,614 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank
[2024-11-08 00:19:24,615 INFO L241 LassoAnalysis]: Starting lasso preprocessing...
[2024-11-08 00:19:24,633 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 00:19:24,641 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 00:19:24,647 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 00:19:24,650 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 00:19:24,653 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 00:19:24,655 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 00:19:24,713 INFO L259 LassoAnalysis]: Preprocessing complete.
[2024-11-08 00:19:24,714 INFO L365 LassoAnalysis]: Checking for nontermination...
[2024-11-08 00:19:24,715 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 00:19:24,716 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-08 00:19:24,722 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-08 00:19:24,724 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true
[2024-11-08 00:19:24,724 INFO L160 nArgumentSynthesizer]: Using integer mode.
[2024-11-08 00:19:24,729 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process
[2024-11-08 00:19:24,745 INFO L398 LassoAnalysis]: Proved nontermination for one component.
[2024-11-08 00:19:24,745 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~pre5#1=0} Honda state: {ULTIMATE.start_main_#t~pre5#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: []
[2024-11-08 00:19:24,761 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0
[2024-11-08 00:19:24,763 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 00:19:24,763 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-08 00:19:24,765 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-08 00:19:24,767 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process
[2024-11-08 00:19:24,768 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true
[2024-11-08 00:19:24,768 INFO L160 nArgumentSynthesizer]: Using integer mode.
[2024-11-08 00:19:24,804 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0
[2024-11-08 00:19:24,804 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 00:19:24,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-08 00:19:24,807 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-08 00:19:24,808 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process
[2024-11-08 00:19:24,811 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true
[2024-11-08 00:19:24,811 INFO L160 nArgumentSynthesizer]: Using integer mode.
[2024-11-08 00:19:24,859 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists.
[2024-11-08 00:19:24,865 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0
[2024-11-08 00:19:24,865 INFO L204 LassoAnalysis]: Preferences:
[2024-11-08 00:19:24,865 INFO L125 ssoRankerPreferences]: Compute integeral hull: false
[2024-11-08 00:19:24,865 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true
[2024-11-08 00:19:24,865 INFO L127 ssoRankerPreferences]: Term annotations enabled: false
[2024-11-08 00:19:24,865 INFO L128 ssoRankerPreferences]: Use exernal solver: false
[2024-11-08 00:19:24,865 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 00:19:24,865 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false
[2024-11-08 00:19:24,865 INFO L131 ssoRankerPreferences]: Path of dumped script:
[2024-11-08 00:19:24,865 INFO L132 ssoRankerPreferences]: Filename of dumped script: nested_3.c_Iteration6_Loop
[2024-11-08 00:19:24,865 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank
[2024-11-08 00:19:24,865 INFO L241 LassoAnalysis]: Starting lasso preprocessing...
[2024-11-08 00:19:24,867 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 00:19:24,870 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 00:19:24,873 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 00:19:24,875 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 00:19:24,878 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 00:19:24,883 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 00:19:24,920 INFO L259 LassoAnalysis]: Preprocessing complete.
[2024-11-08 00:19:24,924 INFO L451 LassoAnalysis]: Using template 'affine'.
[2024-11-08 00:19:24,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 00:19:24,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-08 00:19:24,928 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-08 00:19:24,930 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process
[2024-11-08 00:19:24,931 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
[2024-11-08 00:19:24,945 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-08 00:19:24,945 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-08 00:19:24,946 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-08 00:19:24,946 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-08 00:19:24,946 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-08 00:19:24,950 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-08 00:19:24,950 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-08 00:19:24,953 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-08 00:19:24,967 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0
[2024-11-08 00:19:24,968 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 00:19:24,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-08 00:19:24,970 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-08 00:19:24,974 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process
[2024-11-08 00:19:24,975 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2024-11-08 00:19:24,988 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-08 00:19:24,988 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-08 00:19:24,989 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-08 00:19:24,989 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-08 00:19:24,989 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-08 00:19:24,989 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-08 00:19:24,989 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-08 00:19:24,992 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-08 00:19:25,007 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0
[2024-11-08 00:19:25,008 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 00:19:25,008 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-08 00:19:25,010 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-08 00:19:25,012 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process
[2024-11-08 00:19:25,013 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
[2024-11-08 00:19:25,027 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-08 00:19:25,027 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-08 00:19:25,027 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-08 00:19:25,028 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-08 00:19:25,028 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-08 00:19:25,028 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-08 00:19:25,028 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-08 00:19:25,030 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-08 00:19:25,045 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0
[2024-11-08 00:19:25,046 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 00:19:25,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-08 00:19:25,048 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-08 00:19:25,050 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process
[2024-11-08 00:19:25,051 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
[2024-11-08 00:19:25,064 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-08 00:19:25,065 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-08 00:19:25,065 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-08 00:19:25,065 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-08 00:19:25,065 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-08 00:19:25,066 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-08 00:19:25,066 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-08 00:19:25,068 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-08 00:19:25,084 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0
[2024-11-08 00:19:25,084 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 00:19:25,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-08 00:19:25,087 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-08 00:19:25,088 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process
[2024-11-08 00:19:25,090 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
[2024-11-08 00:19:25,103 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-08 00:19:25,104 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-08 00:19:25,104 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-08 00:19:25,104 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-08 00:19:25,104 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-08 00:19:25,106 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-08 00:19:25,106 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-08 00:19:25,111 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify.
[2024-11-08 00:19:25,116 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver.
[2024-11-08 00:19:25,120 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero.
[2024-11-08 00:19:25,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 00:19:25,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-08 00:19:25,126 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-08 00:19:25,127 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process
[2024-11-08 00:19:25,129 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants...
[2024-11-08 00:19:25,129 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0.
[2024-11-08 00:19:25,130 INFO L474 LassoAnalysis]: Proved termination.
[2024-11-08 00:19:25,130 INFO L476 LassoAnalysis]: Termination argument consisting of:
Ranking function f(ULTIMATE.start_main_~a~0#1) = -2*ULTIMATE.start_main_~a~0#1 + 11
Supporting invariants []
[2024-11-08 00:19:25,147 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0
[2024-11-08 00:19:25,150 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed
[2024-11-08 00:19:25,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 00:19:25,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 00:19:25,187 INFO L255 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 2 conjuncts are in the unsatisfiable core
[2024-11-08 00:19:25,187 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 00:19:25,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 00:19:25,233 INFO L255 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 4 conjuncts are in the unsatisfiable core
[2024-11-08 00:19:25,236 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 00:19:25,673 INFO L134 CoverageAnalysis]: Checked inductivity of 1527 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1527 trivial. 0 not checked.
[2024-11-08 00:19:25,676 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates
[2024-11-08 00:19:25,677 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 95 states and 102 transitions. cyclomatic complexity: 8 Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 00:19:25,713 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 95 states and 102 transitions. cyclomatic complexity: 8. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 188 states and 203 transitions. Complement of second has 4 states.
[2024-11-08 00:19:25,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states
[2024-11-08 00:19:25,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 00:19:25,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 10 transitions.
[2024-11-08 00:19:25,721 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 2 letters. Loop has 93 letters.
[2024-11-08 00:19:25,723 INFO L116 BuchiAccepts]: Finished buchiAccepts.
[2024-11-08 00:19:25,723 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 95 letters. Loop has 93 letters.
[2024-11-08 00:19:25,724 INFO L116 BuchiAccepts]: Finished buchiAccepts.
[2024-11-08 00:19:25,724 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 2 letters. Loop has 186 letters.
[2024-11-08 00:19:25,727 INFO L116 BuchiAccepts]: Finished buchiAccepts.
[2024-11-08 00:19:25,728 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 188 states and 203 transitions.
[2024-11-08 00:19:25,733 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 25
[2024-11-08 00:19:25,735 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 188 states to 187 states and 202 transitions.
[2024-11-08 00:19:25,735 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 93
[2024-11-08 00:19:25,735 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 94
[2024-11-08 00:19:25,735 INFO L73 IsDeterministic]: Start isDeterministic. Operand 187 states and 202 transitions.
[2024-11-08 00:19:25,735 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic.
[2024-11-08 00:19:25,736 INFO L218 hiAutomatonCegarLoop]: Abstraction has 187 states and 202 transitions.
[2024-11-08 00:19:25,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states and 202 transitions.
[2024-11-08 00:19:25,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 111.
[2024-11-08 00:19:25,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 111 states have (on average 1.09009009009009) internal successors, (121), 110 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 00:19:25,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 121 transitions.
[2024-11-08 00:19:25,750 INFO L240 hiAutomatonCegarLoop]: Abstraction has 111 states and 121 transitions.
[2024-11-08 00:19:25,750 INFO L425 stractBuchiCegarLoop]: Abstraction has 111 states and 121 transitions.
[2024-11-08 00:19:25,750 INFO L332 stractBuchiCegarLoop]: ======== Iteration 7 ============
[2024-11-08 00:19:25,750 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 111 states and 121 transitions.
[2024-11-08 00:19:25,751 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15
[2024-11-08 00:19:25,751 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2024-11-08 00:19:25,751 INFO L119 BuchiIsEmpty]: Starting construction of run
[2024-11-08 00:19:25,751 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1]
[2024-11-08 00:19:25,751 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [6, 6, 1, 1, 1]
[2024-11-08 00:19:25,752 INFO L745 eck$LassoCheckResult]: Stem: 1251#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); 1252#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~pre4#1, main_#t~pre5#1, main_#t~pre6#1, main_~a~0#1, main_~b~0#1, main_~c~0#1;main_~a~0#1 := 6;main_~b~0#1 := 6;main_~c~0#1 := 6;main_~a~0#1 := 0; 1243#L21-3 assume !!(main_~a~0#1 < 6);main_~b~0#1 := 0; 1245#L22-3
[2024-11-08 00:19:25,752 INFO L747 eck$LassoCheckResult]: Loop: 1245#L22-3 assume !!(main_~b~0#1 < 6);main_~c~0#1 := 0; 1253#L23-3 assume !!(main_~c~0#1 < 6); 1247#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 1248#L23-3 assume !!(main_~c~0#1 < 6); 1353#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 1352#L23-3 assume !!(main_~c~0#1 < 6); 1351#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 1350#L23-3 assume !!(main_~c~0#1 < 6); 1349#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 1348#L23-3 assume !!(main_~c~0#1 < 6); 1347#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 1346#L23-3 assume !!(main_~c~0#1 < 6); 1345#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 1344#L23-3 assume !(main_~c~0#1 < 6); 1257#L22-2 main_#t~pre5#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre5#1; 1245#L22-3
[2024-11-08 00:19:25,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 00:19:25,752 INFO L85 PathProgramCache]: Analyzing trace with hash 29863, now seen corresponding path program 1 times
[2024-11-08 00:19:25,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 00:19:25,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164618361]
[2024-11-08 00:19:25,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 00:19:25,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 00:19:25,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 00:19:25,776 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-08 00:19:25,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 00:19:25,787 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-08 00:19:25,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 00:19:25,792 INFO L85 PathProgramCache]: Analyzing trace with hash -706979195, now seen corresponding path program 1 times
[2024-11-08 00:19:25,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 00:19:25,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509524821]
[2024-11-08 00:19:25,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 00:19:25,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 00:19:25,804 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0
[2024-11-08 00:19:25,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 00:19:25,806 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-08 00:19:25,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 00:19:25,815 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-08 00:19:25,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 00:19:25,815 INFO L85 PathProgramCache]: Analyzing trace with hash 855328031, now seen corresponding path program 1 times
[2024-11-08 00:19:25,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 00:19:25,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592938566]
[2024-11-08 00:19:25,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 00:19:25,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 00:19:25,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 00:19:25,830 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-08 00:19:25,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 00:19:25,838 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-08 00:19:25,902 INFO L204 LassoAnalysis]: Preferences:
[2024-11-08 00:19:25,903 INFO L125 ssoRankerPreferences]: Compute integeral hull: false
[2024-11-08 00:19:25,903 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true
[2024-11-08 00:19:25,903 INFO L127 ssoRankerPreferences]: Term annotations enabled: false
[2024-11-08 00:19:25,903 INFO L128 ssoRankerPreferences]: Use exernal solver: true
[2024-11-08 00:19:25,903 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 00:19:25,903 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false
[2024-11-08 00:19:25,903 INFO L131 ssoRankerPreferences]: Path of dumped script:
[2024-11-08 00:19:25,903 INFO L132 ssoRankerPreferences]: Filename of dumped script: nested_3.c_Iteration7_Loop
[2024-11-08 00:19:25,903 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank
[2024-11-08 00:19:25,904 INFO L241 LassoAnalysis]: Starting lasso preprocessing...
[2024-11-08 00:19:25,904 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 00:19:25,911 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 00:19:25,914 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 00:19:25,916 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 00:19:25,942 INFO L259 LassoAnalysis]: Preprocessing complete.
[2024-11-08 00:19:25,943 INFO L365 LassoAnalysis]: Checking for nontermination...
[2024-11-08 00:19:25,944 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 00:19:25,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-08 00:19:25,947 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-08 00:19:25,949 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process
[2024-11-08 00:19:25,951 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true
[2024-11-08 00:19:25,951 INFO L160 nArgumentSynthesizer]: Using integer mode.
[2024-11-08 00:19:25,984 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0
[2024-11-08 00:19:25,984 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 00:19:25,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-08 00:19:25,987 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-08 00:19:25,988 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process
[2024-11-08 00:19:25,990 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true
[2024-11-08 00:19:25,990 INFO L160 nArgumentSynthesizer]: Using integer mode.
[2024-11-08 00:19:26,028 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists.
[2024-11-08 00:19:26,034 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0
[2024-11-08 00:19:26,034 INFO L204 LassoAnalysis]: Preferences:
[2024-11-08 00:19:26,034 INFO L125 ssoRankerPreferences]: Compute integeral hull: false
[2024-11-08 00:19:26,034 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true
[2024-11-08 00:19:26,034 INFO L127 ssoRankerPreferences]: Term annotations enabled: false
[2024-11-08 00:19:26,034 INFO L128 ssoRankerPreferences]: Use exernal solver: false
[2024-11-08 00:19:26,034 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 00:19:26,034 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false
[2024-11-08 00:19:26,034 INFO L131 ssoRankerPreferences]: Path of dumped script:
[2024-11-08 00:19:26,034 INFO L132 ssoRankerPreferences]: Filename of dumped script: nested_3.c_Iteration7_Loop
[2024-11-08 00:19:26,035 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank
[2024-11-08 00:19:26,035 INFO L241 LassoAnalysis]: Starting lasso preprocessing...
[2024-11-08 00:19:26,036 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 00:19:26,041 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 00:19:26,043 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 00:19:26,045 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 00:19:26,073 INFO L259 LassoAnalysis]: Preprocessing complete.
[2024-11-08 00:19:26,073 INFO L451 LassoAnalysis]: Using template 'affine'.
[2024-11-08 00:19:26,073 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 00:19:26,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-08 00:19:26,076 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-08 00:19:26,077 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process
[2024-11-08 00:19:26,078 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false
[2024-11-08 00:19:26,092 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-08 00:19:26,092 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-08 00:19:26,092 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-08 00:19:26,092 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-08 00:19:26,092 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-08 00:19:26,093 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-08 00:19:26,093 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-08 00:19:26,095 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify.
[2024-11-08 00:19:26,098 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver.
[2024-11-08 00:19:26,098 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero.
[2024-11-08 00:19:26,099 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 00:19:26,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-08 00:19:26,101 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-08 00:19:26,103 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process
[2024-11-08 00:19:26,104 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants...
[2024-11-08 00:19:26,104 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0.
[2024-11-08 00:19:26,104 INFO L474 LassoAnalysis]: Proved termination.
[2024-11-08 00:19:26,104 INFO L476 LassoAnalysis]: Termination argument consisting of:
Ranking function f(ULTIMATE.start_main_~b~0#1) = -2*ULTIMATE.start_main_~b~0#1 + 11
Supporting invariants []
[2024-11-08 00:19:26,119 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0
[2024-11-08 00:19:26,120 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed
[2024-11-08 00:19:26,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 00:19:26,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 00:19:26,140 INFO L255 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 2 conjuncts are in the unsatisfiable core
[2024-11-08 00:19:26,141 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 00:19:26,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 00:19:26,150 INFO L255 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 4 conjuncts are in the unsatisfiable core
[2024-11-08 00:19:26,151 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 00:19:26,212 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked.
[2024-11-08 00:19:26,213 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates
[2024-11-08 00:19:26,214 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 111 states and 121 transitions. cyclomatic complexity: 12 Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 00:19:26,243 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 111 states and 121 transitions. cyclomatic complexity: 12. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 320 states and 348 transitions. Complement of second has 7 states.
[2024-11-08 00:19:26,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states
[2024-11-08 00:19:26,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 00:19:26,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 10 transitions.
[2024-11-08 00:19:26,248 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 3 letters. Loop has 15 letters.
[2024-11-08 00:19:26,248 INFO L116 BuchiAccepts]: Finished buchiAccepts.
[2024-11-08 00:19:26,248 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 18 letters. Loop has 15 letters.
[2024-11-08 00:19:26,248 INFO L116 BuchiAccepts]: Finished buchiAccepts.
[2024-11-08 00:19:26,249 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 3 letters. Loop has 30 letters.
[2024-11-08 00:19:26,249 INFO L116 BuchiAccepts]: Finished buchiAccepts.
[2024-11-08 00:19:26,249 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 320 states and 348 transitions.
[2024-11-08 00:19:26,255 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17
[2024-11-08 00:19:26,258 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 320 states to 233 states and 254 transitions.
[2024-11-08 00:19:26,260 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 31
[2024-11-08 00:19:26,260 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 32
[2024-11-08 00:19:26,260 INFO L73 IsDeterministic]: Start isDeterministic. Operand 233 states and 254 transitions.
[2024-11-08 00:19:26,260 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic.
[2024-11-08 00:19:26,261 INFO L218 hiAutomatonCegarLoop]: Abstraction has 233 states and 254 transitions.
[2024-11-08 00:19:26,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states and 254 transitions.
[2024-11-08 00:19:26,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 129.
[2024-11-08 00:19:26,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 129 states have (on average 1.1007751937984496) internal successors, (142), 128 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 00:19:26,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 142 transitions.
[2024-11-08 00:19:26,273 INFO L240 hiAutomatonCegarLoop]: Abstraction has 129 states and 142 transitions.
[2024-11-08 00:19:26,273 INFO L425 stractBuchiCegarLoop]: Abstraction has 129 states and 142 transitions.
[2024-11-08 00:19:26,273 INFO L332 stractBuchiCegarLoop]: ======== Iteration 8 ============
[2024-11-08 00:19:26,275 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 129 states and 142 transitions.
[2024-11-08 00:19:26,276 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17
[2024-11-08 00:19:26,276 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2024-11-08 00:19:26,276 INFO L119 BuchiIsEmpty]: Starting construction of run
[2024-11-08 00:19:26,276 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1]
[2024-11-08 00:19:26,276 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1]
[2024-11-08 00:19:26,276 INFO L745 eck$LassoCheckResult]: Stem: 1760#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); 1761#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~pre4#1, main_#t~pre5#1, main_#t~pre6#1, main_~a~0#1, main_~b~0#1, main_~c~0#1;main_~a~0#1 := 6;main_~b~0#1 := 6;main_~c~0#1 := 6;main_~a~0#1 := 0; 1751#L21-3 assume !!(main_~a~0#1 < 6);main_~b~0#1 := 0; 1753#L22-3 assume !!(main_~b~0#1 < 6);main_~c~0#1 := 0; 1757#L23-3
[2024-11-08 00:19:26,277 INFO L747 eck$LassoCheckResult]: Loop: 1757#L23-3 assume !!(main_~c~0#1 < 6); 1756#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 1757#L23-3
[2024-11-08 00:19:26,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 00:19:26,277 INFO L85 PathProgramCache]: Analyzing trace with hash 925771, now seen corresponding path program 1 times
[2024-11-08 00:19:26,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 00:19:26,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349267910]
[2024-11-08 00:19:26,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 00:19:26,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 00:19:26,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 00:19:26,287 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-08 00:19:26,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 00:19:26,292 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-08 00:19:26,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 00:19:26,294 INFO L85 PathProgramCache]: Analyzing trace with hash 1795, now seen corresponding path program 1 times
[2024-11-08 00:19:26,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 00:19:26,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822695443]
[2024-11-08 00:19:26,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 00:19:26,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 00:19:26,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 00:19:26,297 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-08 00:19:26,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 00:19:26,301 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-08 00:19:26,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 00:19:26,301 INFO L85 PathProgramCache]: Analyzing trace with hash 889666765, now seen corresponding path program 1 times
[2024-11-08 00:19:26,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 00:19:26,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114443412]
[2024-11-08 00:19:26,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 00:19:26,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 00:19:26,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 00:19:26,309 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-08 00:19:26,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 00:19:26,313 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-08 00:19:26,326 INFO L204 LassoAnalysis]: Preferences:
[2024-11-08 00:19:26,327 INFO L125 ssoRankerPreferences]: Compute integeral hull: false
[2024-11-08 00:19:26,327 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true
[2024-11-08 00:19:26,327 INFO L127 ssoRankerPreferences]: Term annotations enabled: false
[2024-11-08 00:19:26,327 INFO L128 ssoRankerPreferences]: Use exernal solver: true
[2024-11-08 00:19:26,327 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 00:19:26,327 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false
[2024-11-08 00:19:26,328 INFO L131 ssoRankerPreferences]: Path of dumped script:
[2024-11-08 00:19:26,328 INFO L132 ssoRankerPreferences]: Filename of dumped script: nested_3.c_Iteration8_Loop
[2024-11-08 00:19:26,328 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank
[2024-11-08 00:19:26,329 INFO L241 LassoAnalysis]: Starting lasso preprocessing...
[2024-11-08 00:19:26,329 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 00:19:26,331 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 00:19:26,350 INFO L259 LassoAnalysis]: Preprocessing complete.
[2024-11-08 00:19:26,351 INFO L365 LassoAnalysis]: Checking for nontermination...
[2024-11-08 00:19:26,351 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 00:19:26,351 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-08 00:19:26,353 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-08 00:19:26,355 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process
[2024-11-08 00:19:26,356 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true
[2024-11-08 00:19:26,356 INFO L160 nArgumentSynthesizer]: Using integer mode.
[2024-11-08 00:19:26,373 INFO L398 LassoAnalysis]: Proved nontermination for one component.
[2024-11-08 00:19:26,374 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~pre4#1=0} Honda state: {ULTIMATE.start_main_#t~pre4#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: []
[2024-11-08 00:19:26,389 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0
[2024-11-08 00:19:26,390 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 00:19:26,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-08 00:19:26,392 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-08 00:19:26,393 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process
[2024-11-08 00:19:26,393 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true
[2024-11-08 00:19:26,393 INFO L160 nArgumentSynthesizer]: Using integer mode.
[2024-11-08 00:19:26,417 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0
[2024-11-08 00:19:26,417 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 00:19:26,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-08 00:19:26,419 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-08 00:19:26,421 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process
[2024-11-08 00:19:26,421 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true
[2024-11-08 00:19:26,421 INFO L160 nArgumentSynthesizer]: Using integer mode.
[2024-11-08 00:19:26,452 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists.
[2024-11-08 00:19:26,456 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0
[2024-11-08 00:19:26,457 INFO L204 LassoAnalysis]: Preferences:
[2024-11-08 00:19:26,457 INFO L125 ssoRankerPreferences]: Compute integeral hull: false
[2024-11-08 00:19:26,457 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true
[2024-11-08 00:19:26,457 INFO L127 ssoRankerPreferences]: Term annotations enabled: false
[2024-11-08 00:19:26,457 INFO L128 ssoRankerPreferences]: Use exernal solver: false
[2024-11-08 00:19:26,457 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 00:19:26,457 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false
[2024-11-08 00:19:26,457 INFO L131 ssoRankerPreferences]: Path of dumped script:
[2024-11-08 00:19:26,457 INFO L132 ssoRankerPreferences]: Filename of dumped script: nested_3.c_Iteration8_Loop
[2024-11-08 00:19:26,457 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank
[2024-11-08 00:19:26,457 INFO L241 LassoAnalysis]: Starting lasso preprocessing...
[2024-11-08 00:19:26,458 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 00:19:26,468 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 00:19:26,485 INFO L259 LassoAnalysis]: Preprocessing complete.
[2024-11-08 00:19:26,485 INFO L451 LassoAnalysis]: Using template 'affine'.
[2024-11-08 00:19:26,486 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 00:19:26,486 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-08 00:19:26,489 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-08 00:19:26,490 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process
[2024-11-08 00:19:26,491 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
[2024-11-08 00:19:26,504 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-08 00:19:26,505 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-08 00:19:26,505 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-08 00:19:26,505 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-08 00:19:26,505 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-08 00:19:26,509 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-08 00:19:26,510 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-08 00:19:26,514 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify.
[2024-11-08 00:19:26,518 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver.
[2024-11-08 00:19:26,518 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero.
[2024-11-08 00:19:26,518 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 00:19:26,519 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-08 00:19:26,522 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-08 00:19:26,524 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process
[2024-11-08 00:19:26,524 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants...
[2024-11-08 00:19:26,524 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0.
[2024-11-08 00:19:26,525 INFO L474 LassoAnalysis]: Proved termination.
[2024-11-08 00:19:26,525 INFO L476 LassoAnalysis]: Termination argument consisting of:
Ranking function f(ULTIMATE.start_main_~c~0#1) = -2*ULTIMATE.start_main_~c~0#1 + 11
Supporting invariants []
[2024-11-08 00:19:26,540 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0
[2024-11-08 00:19:26,541 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed
[2024-11-08 00:19:26,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 00:19:26,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 00:19:26,562 INFO L255 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 2 conjuncts are in the unsatisfiable core
[2024-11-08 00:19:26,563 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 00:19:26,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 00:19:26,570 WARN L253 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core
[2024-11-08 00:19:26,570 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 00:19:26,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-08 00:19:26,583 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates
[2024-11-08 00:19:26,583 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 129 states and 142 transitions. cyclomatic complexity: 17 Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 00:19:26,605 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 129 states and 142 transitions. cyclomatic complexity: 17. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 180 states and 199 transitions. Complement of second has 7 states.
[2024-11-08 00:19:26,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states
[2024-11-08 00:19:26,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 00:19:26,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 8 transitions.
[2024-11-08 00:19:26,609 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 4 letters. Loop has 2 letters.
[2024-11-08 00:19:26,609 INFO L116 BuchiAccepts]: Finished buchiAccepts.
[2024-11-08 00:19:26,609 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 6 letters. Loop has 2 letters.
[2024-11-08 00:19:26,609 INFO L116 BuchiAccepts]: Finished buchiAccepts.
[2024-11-08 00:19:26,609 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 4 letters. Loop has 4 letters.
[2024-11-08 00:19:26,609 INFO L116 BuchiAccepts]: Finished buchiAccepts.
[2024-11-08 00:19:26,609 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 180 states and 199 transitions.
[2024-11-08 00:19:26,611 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17
[2024-11-08 00:19:26,613 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 180 states to 160 states and 175 transitions.
[2024-11-08 00:19:26,613 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21
[2024-11-08 00:19:26,614 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21
[2024-11-08 00:19:26,614 INFO L73 IsDeterministic]: Start isDeterministic. Operand 160 states and 175 transitions.
[2024-11-08 00:19:26,614 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic.
[2024-11-08 00:19:26,614 INFO L218 hiAutomatonCegarLoop]: Abstraction has 160 states and 175 transitions.
[2024-11-08 00:19:26,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states and 175 transitions.
[2024-11-08 00:19:26,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 129.
[2024-11-08 00:19:26,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 129 states have (on average 1.0930232558139534) internal successors, (141), 128 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 00:19:26,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 141 transitions.
[2024-11-08 00:19:26,621 INFO L240 hiAutomatonCegarLoop]: Abstraction has 129 states and 141 transitions.
[2024-11-08 00:19:26,622 INFO L425 stractBuchiCegarLoop]: Abstraction has 129 states and 141 transitions.
[2024-11-08 00:19:26,622 INFO L332 stractBuchiCegarLoop]: ======== Iteration 9 ============
[2024-11-08 00:19:26,622 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 129 states and 141 transitions.
[2024-11-08 00:19:26,622 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17
[2024-11-08 00:19:26,622 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2024-11-08 00:19:26,622 INFO L119 BuchiIsEmpty]: Starting construction of run
[2024-11-08 00:19:26,623 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [6, 6, 2, 1, 1, 1, 1, 1]
[2024-11-08 00:19:26,623 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1]
[2024-11-08 00:19:26,627 INFO L745 eck$LassoCheckResult]: Stem: 2110#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); 2111#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~pre4#1, main_#t~pre5#1, main_#t~pre6#1, main_~a~0#1, main_~b~0#1, main_~c~0#1;main_~a~0#1 := 6;main_~b~0#1 := 6;main_~c~0#1 := 6;main_~a~0#1 := 0; 2101#L21-3 assume !!(main_~a~0#1 < 6);main_~b~0#1 := 0; 2103#L22-3 assume !!(main_~b~0#1 < 6);main_~c~0#1 := 0; 2112#L23-3 assume !!(main_~c~0#1 < 6); 2108#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 2109#L23-3 assume !!(main_~c~0#1 < 6); 2228#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 2226#L23-3 assume !!(main_~c~0#1 < 6); 2224#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 2222#L23-3 assume !!(main_~c~0#1 < 6); 2220#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 2218#L23-3 assume !!(main_~c~0#1 < 6); 2216#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 2214#L23-3 assume !!(main_~c~0#1 < 6); 2211#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 2210#L23-3 assume !(main_~c~0#1 < 6); 2207#L22-2 main_#t~pre5#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre5#1; 2147#L22-3 assume !!(main_~b~0#1 < 6);main_~c~0#1 := 0; 2107#L23-3
[2024-11-08 00:19:26,627 INFO L747 eck$LassoCheckResult]: Loop: 2107#L23-3 assume !!(main_~c~0#1 < 6); 2106#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 2107#L23-3
[2024-11-08 00:19:26,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 00:19:26,628 INFO L85 PathProgramCache]: Analyzing trace with hash 745365203, now seen corresponding path program 2 times
[2024-11-08 00:19:26,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 00:19:26,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239899804]
[2024-11-08 00:19:26,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 00:19:26,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 00:19:26,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 00:19:26,636 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-08 00:19:26,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 00:19:26,645 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-08 00:19:26,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 00:19:26,645 INFO L85 PathProgramCache]: Analyzing trace with hash 1795, now seen corresponding path program 2 times
[2024-11-08 00:19:26,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 00:19:26,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305218876]
[2024-11-08 00:19:26,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 00:19:26,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 00:19:26,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 00:19:26,650 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-08 00:19:26,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 00:19:26,652 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-08 00:19:26,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 00:19:26,653 INFO L85 PathProgramCache]: Analyzing trace with hash -963577515, now seen corresponding path program 3 times
[2024-11-08 00:19:26,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 00:19:26,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956063589]
[2024-11-08 00:19:26,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 00:19:26,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 00:19:26,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 00:19:26,663 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-08 00:19:26,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 00:19:26,676 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-08 00:19:26,691 INFO L204 LassoAnalysis]: Preferences:
[2024-11-08 00:19:26,691 INFO L125 ssoRankerPreferences]: Compute integeral hull: false
[2024-11-08 00:19:26,691 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true
[2024-11-08 00:19:26,691 INFO L127 ssoRankerPreferences]: Term annotations enabled: false
[2024-11-08 00:19:26,691 INFO L128 ssoRankerPreferences]: Use exernal solver: true
[2024-11-08 00:19:26,691 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 00:19:26,691 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false
[2024-11-08 00:19:26,691 INFO L131 ssoRankerPreferences]: Path of dumped script:
[2024-11-08 00:19:26,691 INFO L132 ssoRankerPreferences]: Filename of dumped script: nested_3.c_Iteration9_Loop
[2024-11-08 00:19:26,691 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank
[2024-11-08 00:19:26,691 INFO L241 LassoAnalysis]: Starting lasso preprocessing...
[2024-11-08 00:19:26,692 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 00:19:26,694 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 00:19:26,712 INFO L259 LassoAnalysis]: Preprocessing complete.
[2024-11-08 00:19:26,712 INFO L365 LassoAnalysis]: Checking for nontermination...
[2024-11-08 00:19:26,712 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 00:19:26,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-08 00:19:26,716 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-08 00:19:26,718 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process
[2024-11-08 00:19:26,719 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true
[2024-11-08 00:19:26,719 INFO L160 nArgumentSynthesizer]: Using integer mode.
[2024-11-08 00:19:26,737 INFO L398 LassoAnalysis]: Proved nontermination for one component.
[2024-11-08 00:19:26,737 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~pre4#1=0} Honda state: {ULTIMATE.start_main_#t~pre4#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: []
[2024-11-08 00:19:26,752 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0
[2024-11-08 00:19:26,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 00:19:26,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-08 00:19:26,755 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-08 00:19:26,757 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process
[2024-11-08 00:19:26,758 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true
[2024-11-08 00:19:26,758 INFO L160 nArgumentSynthesizer]: Using integer mode.
[2024-11-08 00:19:26,790 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0
[2024-11-08 00:19:26,791 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 00:19:26,791 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-08 00:19:26,793 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-08 00:19:26,795 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process
[2024-11-08 00:19:26,796 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true
[2024-11-08 00:19:26,796 INFO L160 nArgumentSynthesizer]: Using integer mode.
[2024-11-08 00:19:26,831 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists.
[2024-11-08 00:19:26,835 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0
[2024-11-08 00:19:26,836 INFO L204 LassoAnalysis]: Preferences:
[2024-11-08 00:19:26,836 INFO L125 ssoRankerPreferences]: Compute integeral hull: false
[2024-11-08 00:19:26,836 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true
[2024-11-08 00:19:26,836 INFO L127 ssoRankerPreferences]: Term annotations enabled: false
[2024-11-08 00:19:26,836 INFO L128 ssoRankerPreferences]: Use exernal solver: false
[2024-11-08 00:19:26,836 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 00:19:26,836 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false
[2024-11-08 00:19:26,836 INFO L131 ssoRankerPreferences]: Path of dumped script:
[2024-11-08 00:19:26,836 INFO L132 ssoRankerPreferences]: Filename of dumped script: nested_3.c_Iteration9_Loop
[2024-11-08 00:19:26,836 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank
[2024-11-08 00:19:26,836 INFO L241 LassoAnalysis]: Starting lasso preprocessing...
[2024-11-08 00:19:26,837 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 00:19:26,840 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 00:19:26,860 INFO L259 LassoAnalysis]: Preprocessing complete.
[2024-11-08 00:19:26,860 INFO L451 LassoAnalysis]: Using template 'affine'.
[2024-11-08 00:19:26,861 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 00:19:26,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-08 00:19:26,863 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-08 00:19:26,865 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process
[2024-11-08 00:19:26,866 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
[2024-11-08 00:19:26,879 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-08 00:19:26,879 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-08 00:19:26,879 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-08 00:19:26,879 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-08 00:19:26,879 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-08 00:19:26,880 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-08 00:19:26,880 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-08 00:19:26,884 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings.
[2024-11-08 00:19:26,899 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0
[2024-11-08 00:19:26,900 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 00:19:26,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-08 00:19:26,903 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-08 00:19:26,905 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process
[2024-11-08 00:19:26,906 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
[2024-11-08 00:19:26,921 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-08 00:19:26,921 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-08 00:19:26,921 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-08 00:19:26,921 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-08 00:19:26,921 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-08 00:19:26,923 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-08 00:19:26,923 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-08 00:19:26,929 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify.
[2024-11-08 00:19:26,932 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver.
[2024-11-08 00:19:26,933 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero.
[2024-11-08 00:19:26,933 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 00:19:26,933 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-08 00:19:26,936 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-08 00:19:26,938 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process
[2024-11-08 00:19:26,938 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants...
[2024-11-08 00:19:26,938 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0.
[2024-11-08 00:19:26,938 INFO L474 LassoAnalysis]: Proved termination.
[2024-11-08 00:19:26,938 INFO L476 LassoAnalysis]: Termination argument consisting of:
Ranking function f(ULTIMATE.start_main_~c~0#1) = -2*ULTIMATE.start_main_~c~0#1 + 11
Supporting invariants []
[2024-11-08 00:19:26,954 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0
[2024-11-08 00:19:26,956 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed
[2024-11-08 00:19:26,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 00:19:26,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 00:19:26,983 INFO L255 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 2 conjuncts are in the unsatisfiable core
[2024-11-08 00:19:26,983 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 00:19:27,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 00:19:27,006 WARN L253 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core
[2024-11-08 00:19:27,006 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 00:19:27,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-08 00:19:27,018 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates
[2024-11-08 00:19:27,018 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 129 states and 141 transitions. cyclomatic complexity: 16 Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 00:19:27,037 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 129 states and 141 transitions. cyclomatic complexity: 16. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 176 states and 193 transitions. Complement of second has 7 states.
[2024-11-08 00:19:27,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states
[2024-11-08 00:19:27,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 00:19:27,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 8 transitions.
[2024-11-08 00:19:27,039 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 19 letters. Loop has 2 letters.
[2024-11-08 00:19:27,039 INFO L116 BuchiAccepts]: Finished buchiAccepts.
[2024-11-08 00:19:27,039 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted
[2024-11-08 00:19:27,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 00:19:27,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 00:19:27,062 INFO L255 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 2 conjuncts are in the unsatisfiable core
[2024-11-08 00:19:27,062 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 00:19:27,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 00:19:27,086 WARN L253 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core
[2024-11-08 00:19:27,086 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 00:19:27,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-08 00:19:27,099 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates
[2024-11-08 00:19:27,099 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 129 states and 141 transitions. cyclomatic complexity: 16 Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 00:19:27,119 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 129 states and 141 transitions. cyclomatic complexity: 16. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 176 states and 193 transitions. Complement of second has 7 states.
[2024-11-08 00:19:27,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states
[2024-11-08 00:19:27,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 00:19:27,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 8 transitions.
[2024-11-08 00:19:27,121 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 19 letters. Loop has 2 letters.
[2024-11-08 00:19:27,121 INFO L116 BuchiAccepts]: Finished buchiAccepts.
[2024-11-08 00:19:27,121 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted
[2024-11-08 00:19:27,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 00:19:27,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 00:19:27,144 INFO L255 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 2 conjuncts are in the unsatisfiable core
[2024-11-08 00:19:27,145 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 00:19:27,198 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0
[2024-11-08 00:19:27,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 00:19:27,208 WARN L253 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core
[2024-11-08 00:19:27,208 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 00:19:27,210 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0
[2024-11-08 00:19:27,223 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0
[2024-11-08 00:19:27,227 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-08 00:19:27,228 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates
[2024-11-08 00:19:27,229 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 129 states and 141 transitions. cyclomatic complexity: 16 Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 00:19:27,251 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 129 states and 141 transitions. cyclomatic complexity: 16. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 200 states and 221 transitions. Complement of second has 6 states.
[2024-11-08 00:19:27,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states
[2024-11-08 00:19:27,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 00:19:27,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions.
[2024-11-08 00:19:27,252 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 19 letters. Loop has 2 letters.
[2024-11-08 00:19:27,253 INFO L116 BuchiAccepts]: Finished buchiAccepts.
[2024-11-08 00:19:27,254 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 21 letters. Loop has 2 letters.
[2024-11-08 00:19:27,254 INFO L116 BuchiAccepts]: Finished buchiAccepts.
[2024-11-08 00:19:27,254 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 19 letters. Loop has 4 letters.
[2024-11-08 00:19:27,254 INFO L116 BuchiAccepts]: Finished buchiAccepts.
[2024-11-08 00:19:27,254 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 200 states and 221 transitions.
[2024-11-08 00:19:27,256 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15
[2024-11-08 00:19:27,257 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 200 states to 112 states and 121 transitions.
[2024-11-08 00:19:27,257 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5
[2024-11-08 00:19:27,257 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6
[2024-11-08 00:19:27,257 INFO L73 IsDeterministic]: Start isDeterministic. Operand 112 states and 121 transitions.
[2024-11-08 00:19:27,257 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic.
[2024-11-08 00:19:27,257 INFO L218 hiAutomatonCegarLoop]: Abstraction has 112 states and 121 transitions.
[2024-11-08 00:19:27,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states and 121 transitions.
[2024-11-08 00:19:27,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 111.
[2024-11-08 00:19:27,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 111 states have (on average 1.0810810810810811) internal successors, (120), 110 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 00:19:27,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 120 transitions.
[2024-11-08 00:19:27,261 INFO L240 hiAutomatonCegarLoop]: Abstraction has 111 states and 120 transitions.
[2024-11-08 00:19:27,261 INFO L425 stractBuchiCegarLoop]: Abstraction has 111 states and 120 transitions.
[2024-11-08 00:19:27,261 INFO L332 stractBuchiCegarLoop]: ======== Iteration 10 ============
[2024-11-08 00:19:27,261 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 111 states and 120 transitions.
[2024-11-08 00:19:27,261 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15
[2024-11-08 00:19:27,262 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2024-11-08 00:19:27,262 INFO L119 BuchiIsEmpty]: Starting construction of run
[2024-11-08 00:19:27,263 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [36, 36, 6, 6, 6, 2, 1, 1, 1, 1]
[2024-11-08 00:19:27,263 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [6, 6, 1, 1, 1]
[2024-11-08 00:19:27,264 INFO L745 eck$LassoCheckResult]: Stem: 3015#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); 3016#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~pre4#1, main_#t~pre5#1, main_#t~pre6#1, main_~a~0#1, main_~b~0#1, main_~c~0#1;main_~a~0#1 := 6;main_~b~0#1 := 6;main_~c~0#1 := 6;main_~a~0#1 := 0; 3009#L21-3 assume !!(main_~a~0#1 < 6);main_~b~0#1 := 0; 3010#L22-3 assume !!(main_~b~0#1 < 6);main_~c~0#1 := 0; 3119#L23-3 assume !!(main_~c~0#1 < 6); 3118#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 3117#L23-3 assume !!(main_~c~0#1 < 6); 3115#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 3113#L23-3 assume !!(main_~c~0#1 < 6); 3111#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 3109#L23-3 assume !!(main_~c~0#1 < 6); 3107#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 3105#L23-3 assume !!(main_~c~0#1 < 6); 3103#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 3101#L23-3 assume !!(main_~c~0#1 < 6); 3098#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 3097#L23-3 assume !(main_~c~0#1 < 6); 3023#L22-2 main_#t~pre5#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre5#1; 3020#L22-3 assume !!(main_~b~0#1 < 6);main_~c~0#1 := 0; 3019#L23-3 assume !!(main_~c~0#1 < 6); 3013#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 3014#L23-3 assume !!(main_~c~0#1 < 6); 3116#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 3114#L23-3 assume !!(main_~c~0#1 < 6); 3112#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 3110#L23-3 assume !!(main_~c~0#1 < 6); 3108#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 3106#L23-3 assume !!(main_~c~0#1 < 6); 3104#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 3102#L23-3 assume !!(main_~c~0#1 < 6); 3100#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 3099#L23-3 assume !(main_~c~0#1 < 6); 3096#L22-2 main_#t~pre5#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre5#1; 3095#L22-3 assume !!(main_~b~0#1 < 6);main_~c~0#1 := 0; 3094#L23-3 assume !!(main_~c~0#1 < 6); 3093#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 3092#L23-3 assume !!(main_~c~0#1 < 6); 3091#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 3090#L23-3 assume !!(main_~c~0#1 < 6); 3089#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 3088#L23-3 assume !!(main_~c~0#1 < 6); 3087#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 3086#L23-3 assume !!(main_~c~0#1 < 6); 3085#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 3084#L23-3 assume !!(main_~c~0#1 < 6); 3083#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 3082#L23-3 assume !(main_~c~0#1 < 6); 3081#L22-2 main_#t~pre5#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre5#1; 3080#L22-3 assume !!(main_~b~0#1 < 6);main_~c~0#1 := 0; 3079#L23-3 assume !!(main_~c~0#1 < 6); 3078#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 3077#L23-3 assume !!(main_~c~0#1 < 6); 3076#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 3075#L23-3 assume !!(main_~c~0#1 < 6); 3074#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 3073#L23-3 assume !!(main_~c~0#1 < 6); 3072#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 3071#L23-3 assume !!(main_~c~0#1 < 6); 3070#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 3069#L23-3 assume !!(main_~c~0#1 < 6); 3068#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 3067#L23-3 assume !(main_~c~0#1 < 6); 3066#L22-2 main_#t~pre5#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre5#1; 3065#L22-3 assume !!(main_~b~0#1 < 6);main_~c~0#1 := 0; 3064#L23-3 assume !!(main_~c~0#1 < 6); 3063#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 3062#L23-3 assume !!(main_~c~0#1 < 6); 3061#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 3060#L23-3 assume !!(main_~c~0#1 < 6); 3059#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 3058#L23-3 assume !!(main_~c~0#1 < 6); 3057#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 3056#L23-3 assume !!(main_~c~0#1 < 6); 3055#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 3054#L23-3 assume !!(main_~c~0#1 < 6); 3053#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 3052#L23-3 assume !(main_~c~0#1 < 6); 3051#L22-2 main_#t~pre5#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre5#1; 3050#L22-3 assume !!(main_~b~0#1 < 6);main_~c~0#1 := 0; 3027#L23-3 assume !!(main_~c~0#1 < 6); 3049#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 3048#L23-3 assume !!(main_~c~0#1 < 6); 3047#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 3046#L23-3 assume !!(main_~c~0#1 < 6); 3044#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 3042#L23-3 assume !!(main_~c~0#1 < 6); 3040#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 3038#L23-3 assume !!(main_~c~0#1 < 6); 3036#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 3034#L23-3 assume !!(main_~c~0#1 < 6); 3031#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 3030#L23-3 assume !(main_~c~0#1 < 6); 3028#L22-2 main_#t~pre5#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre5#1; 3026#L22-3 assume !(main_~b~0#1 < 6); 3021#L21-2 main_#t~pre6#1 := 1 + main_~a~0#1;main_~a~0#1 := 1 + main_~a~0#1;havoc main_#t~pre6#1; 3011#L21-3 assume !!(main_~a~0#1 < 6);main_~b~0#1 := 0; 3012#L22-3
[2024-11-08 00:19:27,264 INFO L747 eck$LassoCheckResult]: Loop: 3012#L22-3 assume !!(main_~b~0#1 < 6);main_~c~0#1 := 0; 3017#L23-3 assume !!(main_~c~0#1 < 6); 3018#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 3045#L23-3 assume !!(main_~c~0#1 < 6); 3043#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 3041#L23-3 assume !!(main_~c~0#1 < 6); 3039#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 3037#L23-3 assume !!(main_~c~0#1 < 6); 3035#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 3033#L23-3 assume !!(main_~c~0#1 < 6); 3032#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 3029#L23-3 assume !!(main_~c~0#1 < 6); 3025#L23-2 main_#t~pre4#1 := 1 + main_~c~0#1;main_~c~0#1 := 1 + main_~c~0#1;havoc main_#t~pre4#1; 3024#L23-3 assume !(main_~c~0#1 < 6); 3022#L22-2 main_#t~pre5#1 := 1 + main_~b~0#1;main_~b~0#1 := 1 + main_~b~0#1;havoc main_#t~pre5#1; 3012#L22-3
[2024-11-08 00:19:27,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 00:19:27,265 INFO L85 PathProgramCache]: Analyzing trace with hash -1672375441, now seen corresponding path program 2 times
[2024-11-08 00:19:27,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 00:19:27,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195972258]
[2024-11-08 00:19:27,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 00:19:27,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 00:19:27,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 00:19:27,283 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-08 00:19:27,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 00:19:27,311 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-08 00:19:27,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 00:19:27,312 INFO L85 PathProgramCache]: Analyzing trace with hash -706979195, now seen corresponding path program 2 times
[2024-11-08 00:19:27,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 00:19:27,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403234463]
[2024-11-08 00:19:27,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 00:19:27,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 00:19:27,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 00:19:27,316 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-08 00:19:27,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 00:19:27,318 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-08 00:19:27,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 00:19:27,319 INFO L85 PathProgramCache]: Analyzing trace with hash -1669350057, now seen corresponding path program 3 times
[2024-11-08 00:19:27,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 00:19:27,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231967241]
[2024-11-08 00:19:27,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 00:19:27,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 00:19:27,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 00:19:27,336 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-08 00:19:27,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 00:19:27,362 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-08 00:19:27,423 INFO L204 LassoAnalysis]: Preferences:
[2024-11-08 00:19:27,423 INFO L125 ssoRankerPreferences]: Compute integeral hull: false
[2024-11-08 00:19:27,423 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true
[2024-11-08 00:19:27,423 INFO L127 ssoRankerPreferences]: Term annotations enabled: false
[2024-11-08 00:19:27,423 INFO L128 ssoRankerPreferences]: Use exernal solver: true
[2024-11-08 00:19:27,423 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 00:19:27,423 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false
[2024-11-08 00:19:27,423 INFO L131 ssoRankerPreferences]: Path of dumped script:
[2024-11-08 00:19:27,423 INFO L132 ssoRankerPreferences]: Filename of dumped script: nested_3.c_Iteration10_Loop
[2024-11-08 00:19:27,423 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank
[2024-11-08 00:19:27,423 INFO L241 LassoAnalysis]: Starting lasso preprocessing...
[2024-11-08 00:19:27,424 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 00:19:27,429 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 00:19:27,431 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 00:19:27,433 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 00:19:27,458 INFO L259 LassoAnalysis]: Preprocessing complete.
[2024-11-08 00:19:27,458 INFO L365 LassoAnalysis]: Checking for nontermination...
[2024-11-08 00:19:27,458 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 00:19:27,458 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-08 00:19:27,460 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-08 00:19:27,462 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process
[2024-11-08 00:19:27,463 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true
[2024-11-08 00:19:27,463 INFO L160 nArgumentSynthesizer]: Using integer mode.
[2024-11-08 00:19:27,495 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Ended with exit code 0
[2024-11-08 00:19:27,496 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 00:19:27,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-08 00:19:27,500 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-08 00:19:27,502 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process
[2024-11-08 00:19:27,503 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true
[2024-11-08 00:19:27,503 INFO L160 nArgumentSynthesizer]: Using integer mode.
[2024-11-08 00:19:27,545 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists.
[2024-11-08 00:19:27,551 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0
[2024-11-08 00:19:27,551 INFO L204 LassoAnalysis]: Preferences:
[2024-11-08 00:19:27,551 INFO L125 ssoRankerPreferences]: Compute integeral hull: false
[2024-11-08 00:19:27,551 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true
[2024-11-08 00:19:27,551 INFO L127 ssoRankerPreferences]: Term annotations enabled: false
[2024-11-08 00:19:27,551 INFO L128 ssoRankerPreferences]: Use exernal solver: false
[2024-11-08 00:19:27,551 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 00:19:27,551 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false
[2024-11-08 00:19:27,551 INFO L131 ssoRankerPreferences]: Path of dumped script:
[2024-11-08 00:19:27,551 INFO L132 ssoRankerPreferences]: Filename of dumped script: nested_3.c_Iteration10_Loop
[2024-11-08 00:19:27,551 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank
[2024-11-08 00:19:27,552 INFO L241 LassoAnalysis]: Starting lasso preprocessing...
[2024-11-08 00:19:27,552 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 00:19:27,558 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 00:19:27,560 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 00:19:27,562 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2024-11-08 00:19:27,586 INFO L259 LassoAnalysis]: Preprocessing complete.
[2024-11-08 00:19:27,586 INFO L451 LassoAnalysis]: Using template 'affine'.
[2024-11-08 00:19:27,586 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 00:19:27,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-08 00:19:27,589 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-08 00:19:27,590 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process
[2024-11-08 00:19:27,592 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
[2024-11-08 00:19:27,605 INFO L338 nArgumentSynthesizer]: Template has degree 0.
[2024-11-08 00:19:27,605 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2024-11-08 00:19:27,605 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts
[2024-11-08 00:19:27,605 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts
[2024-11-08 00:19:27,605 INFO L205 nArgumentSynthesizer]: 2 template conjuncts.
[2024-11-08 00:19:27,606 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2024-11-08 00:19:27,606 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2024-11-08 00:19:27,608 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify.
[2024-11-08 00:19:27,610 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver.
[2024-11-08 00:19:27,610 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero.
[2024-11-08 00:19:27,610 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2024-11-08 00:19:27,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-08 00:19:27,613 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2024-11-08 00:19:27,614 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process
[2024-11-08 00:19:27,615 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants...
[2024-11-08 00:19:27,615 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0.
[2024-11-08 00:19:27,615 INFO L474 LassoAnalysis]: Proved termination.
[2024-11-08 00:19:27,615 INFO L476 LassoAnalysis]: Termination argument consisting of:
Ranking function f(ULTIMATE.start_main_~b~0#1) = -2*ULTIMATE.start_main_~b~0#1 + 11
Supporting invariants []
[2024-11-08 00:19:27,630 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Ended with exit code 0
[2024-11-08 00:19:27,631 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed
[2024-11-08 00:19:27,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 00:19:27,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 00:19:27,675 INFO L255 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 2 conjuncts are in the unsatisfiable core
[2024-11-08 00:19:27,680 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 00:19:27,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 00:19:27,800 INFO L255 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 4 conjuncts are in the unsatisfiable core
[2024-11-08 00:19:27,801 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 00:19:27,857 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked.
[2024-11-08 00:19:27,858 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates
[2024-11-08 00:19:27,858 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 111 states and 120 transitions. cyclomatic complexity: 11 Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 00:19:27,876 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 111 states and 120 transitions. cyclomatic complexity: 11. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 290 states and 314 transitions. Complement of second has 7 states.
[2024-11-08 00:19:27,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states
[2024-11-08 00:19:27,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 00:19:27,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 10 transitions.
[2024-11-08 00:19:27,878 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 96 letters. Loop has 15 letters.
[2024-11-08 00:19:27,878 INFO L116 BuchiAccepts]: Finished buchiAccepts.
[2024-11-08 00:19:27,878 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted
[2024-11-08 00:19:27,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 00:19:27,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 00:19:27,918 INFO L255 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 2 conjuncts are in the unsatisfiable core
[2024-11-08 00:19:27,919 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 00:19:28,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 00:19:28,033 INFO L255 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 4 conjuncts are in the unsatisfiable core
[2024-11-08 00:19:28,033 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 00:19:28,062 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Ended with exit code 0
[2024-11-08 00:19:28,110 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked.
[2024-11-08 00:19:28,111 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates
[2024-11-08 00:19:28,111 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 111 states and 120 transitions. cyclomatic complexity: 11 Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 00:19:28,128 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 111 states and 120 transitions. cyclomatic complexity: 11. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 290 states and 314 transitions. Complement of second has 7 states.
[2024-11-08 00:19:28,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states
[2024-11-08 00:19:28,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 00:19:28,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 10 transitions.
[2024-11-08 00:19:28,129 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 96 letters. Loop has 15 letters.
[2024-11-08 00:19:28,129 INFO L116 BuchiAccepts]: Finished buchiAccepts.
[2024-11-08 00:19:28,129 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted
[2024-11-08 00:19:28,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 00:19:28,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 00:19:28,170 INFO L255 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 2 conjuncts are in the unsatisfiable core
[2024-11-08 00:19:28,171 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 00:19:28,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 00:19:28,277 INFO L255 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 4 conjuncts are in the unsatisfiable core
[2024-11-08 00:19:28,278 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-08 00:19:28,327 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked.
[2024-11-08 00:19:28,328 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates
[2024-11-08 00:19:28,328 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 111 states and 120 transitions. cyclomatic complexity: 11 Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 00:19:28,349 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 111 states and 120 transitions. cyclomatic complexity: 11. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 212 states and 230 transitions. Complement of second has 6 states.
[2024-11-08 00:19:28,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states
[2024-11-08 00:19:28,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-08 00:19:28,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions.
[2024-11-08 00:19:28,350 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 96 letters. Loop has 15 letters.
[2024-11-08 00:19:28,350 INFO L116 BuchiAccepts]: Finished buchiAccepts.
[2024-11-08 00:19:28,351 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 111 letters. Loop has 15 letters.
[2024-11-08 00:19:28,351 INFO L116 BuchiAccepts]: Finished buchiAccepts.
[2024-11-08 00:19:28,351 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 96 letters. Loop has 30 letters.
[2024-11-08 00:19:28,351 INFO L116 BuchiAccepts]: Finished buchiAccepts.
[2024-11-08 00:19:28,351 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 212 states and 230 transitions.
[2024-11-08 00:19:28,357 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0
[2024-11-08 00:19:28,358 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 212 states to 0 states and 0 transitions.
[2024-11-08 00:19:28,358 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0
[2024-11-08 00:19:28,358 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0
[2024-11-08 00:19:28,358 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions.
[2024-11-08 00:19:28,358 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-11-08 00:19:28,358 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions.
[2024-11-08 00:19:28,358 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions.
[2024-11-08 00:19:28,358 INFO L425 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions.
[2024-11-08 00:19:28,358 INFO L332 stractBuchiCegarLoop]: ======== Iteration 11 ============
[2024-11-08 00:19:28,358 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions.
[2024-11-08 00:19:28,358 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0
[2024-11-08 00:19:28,358 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true
[2024-11-08 00:19:28,371 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 08.11 12:19:28 BoogieIcfgContainer
[2024-11-08 00:19:28,371 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer----------------------------
[2024-11-08 00:19:28,372 INFO L112 PluginConnector]: ------------------------Witness Printer----------------------------
[2024-11-08 00:19:28,372 INFO L270 PluginConnector]: Initializing Witness Printer...
[2024-11-08 00:19:28,372 INFO L274 PluginConnector]: Witness Printer initialized
[2024-11-08 00:19:28,373 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 12:19:21" (3/4) ...
[2024-11-08 00:19:28,375 INFO L145 WitnessPrinter]: No result that supports witness generation found
[2024-11-08 00:19:28,376 INFO L131 PluginConnector]: ------------------------ END Witness Printer----------------------------
[2024-11-08 00:19:28,379 INFO L158 Benchmark]: Toolchain (without parser) took 7006.33ms. Allocated memory was 117.4MB in the beginning and 151.0MB in the end (delta: 33.6MB). Free memory was 93.2MB in the beginning and 87.1MB in the end (delta: 6.1MB). Peak memory consumption was 34.2MB. Max. memory is 16.1GB.
[2024-11-08 00:19:28,379 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 117.4MB. Free memory is still 81.4MB. There was no memory consumed. Max. memory is 16.1GB.
[2024-11-08 00:19:28,379 INFO L158 Benchmark]: CACSL2BoogieTranslator took 200.01ms. Allocated memory is still 117.4MB. Free memory was 93.0MB in the beginning and 82.7MB in the end (delta: 10.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
[2024-11-08 00:19:28,380 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.62ms. Allocated memory is still 117.4MB. Free memory was 82.7MB in the beginning and 81.6MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB.
[2024-11-08 00:19:28,380 INFO L158 Benchmark]: Boogie Preprocessor took 33.95ms. Allocated memory is still 117.4MB. Free memory was 81.6MB in the beginning and 80.5MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB.
[2024-11-08 00:19:28,380 INFO L158 Benchmark]: RCFGBuilder took 265.14ms. Allocated memory is still 117.4MB. Free memory was 80.5MB in the beginning and 71.5MB in the end (delta: 8.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
[2024-11-08 00:19:28,380 INFO L158 Benchmark]: BuchiAutomizer took 6469.35ms. Allocated memory was 117.4MB in the beginning and 151.0MB in the end (delta: 33.6MB). Free memory was 71.5MB in the beginning and 87.1MB in the end (delta: -15.6MB). Peak memory consumption was 17.4MB. Max. memory is 16.1GB.
[2024-11-08 00:19:28,380 INFO L158 Benchmark]: Witness Printer took 4.06ms. Allocated memory is still 151.0MB. Free memory was 87.1MB in the beginning and 87.1MB in the end (delta: 52.0kB). There was no memory consumed. Max. memory is 16.1GB.
[2024-11-08 00:19:28,382 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] #######################
--- Results ---
* Results from de.uni_freiburg.informatik.ultimate.core:
- StatisticsResult: Toolchain Benchmarks
Benchmark results are:
* CDTParser took 0.29ms. Allocated memory is still 117.4MB. Free memory is still 81.4MB. There was no memory consumed. Max. memory is 16.1GB.
* CACSL2BoogieTranslator took 200.01ms. Allocated memory is still 117.4MB. Free memory was 93.0MB in the beginning and 82.7MB in the end (delta: 10.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
* Boogie Procedure Inliner took 27.62ms. Allocated memory is still 117.4MB. Free memory was 82.7MB in the beginning and 81.6MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB.
* Boogie Preprocessor took 33.95ms. Allocated memory is still 117.4MB. Free memory was 81.6MB in the beginning and 80.5MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB.
* RCFGBuilder took 265.14ms. Allocated memory is still 117.4MB. Free memory was 80.5MB in the beginning and 71.5MB in the end (delta: 8.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
* BuchiAutomizer took 6469.35ms. Allocated memory was 117.4MB in the beginning and 151.0MB in the end (delta: 33.6MB). Free memory was 71.5MB in the beginning and 87.1MB in the end (delta: -15.6MB). Peak memory consumption was 17.4MB. Max. memory is 16.1GB.
* Witness Printer took 4.06ms. Allocated memory is still 151.0MB. Free memory was 87.1MB in the beginning and 87.1MB in the end (delta: 52.0kB). There was no memory consumed. 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 10 terminating modules (5 trivial, 3 deterministic, 2 nondeterministic). One deterministic module has affine ranking function (((long long) -2 * a) + 11) and consists of 3 locations. One deterministic module has affine ranking function (((long long) -2 * b) + 11) and consists of 4 locations. One deterministic module has affine ranking function (((long long) -2 * c) + 11) and consists of 4 locations. One nondeterministic module has affine ranking function (((long long) -2 * c) + 11) and consists of 4 locations. One nondeterministic module has affine ranking function (((long long) -2 * b) + 11) and consists of 4 locations. 5 modules have a trivial ranking function, the largest among these consists of 10 locations.
- StatisticsResult: Timing statistics
BüchiAutomizer plugin needed 6.4s and 11 iterations. TraceHistogramMax:36. Analysis of lassos took 4.0s. Construction of modules took 0.1s. Büchi inclusion checks took 2.0s. Highest rank in rank-based complementation 3. Minimization of det autom 6. Minimization of nondet autom 4. Automata minimization 0.1s AutomataMinimizationTime, 9 MinimizatonAttempts, 230 StatesRemovedByMinimization, 7 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [3, 0, 2, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 1599/1599 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 165 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 156 mSDsluCounter, 224 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 101 mSDsCounter, 42 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 154 IncrementalHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 42 mSolverCounterUnsat, 123 mSDtfsCounter, 154 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI5 SFLT5 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital12 mio100 ax100 hnf100 lsp83 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq160 hnf93 smp100 dnf100 smp100 tf113 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 27ms VariablesStem: 0 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 3 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 5 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.4s InitialAbstractionConstructionTime: 0.0s
- TerminationAnalysisResult: Termination proven
Buchi Automizer proved that your program is terminating
RESULT: Ultimate proved your program to be correct!
[2024-11-08 00:19:28,407 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0
[2024-11-08 00:19:28,605 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0
[2024-11-08 00:19:28,806 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0
[2024-11-08 00:19:29,007 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0
Received shutdown request...
--- End real Ultimate output ---
Execution finished normally
Writing output log to file Ultimate.log
Result:
TRUE