./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-pthread/cs_peterson.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 48c9605d 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/AutomizerReach.xml -i ../sv-benchmarks/c/seq-pthread/cs_peterson.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-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(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4a8be7009a37d1df58713fd67cd9771c39e6139a0416009824ceb58da10928b7 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-07 21:25:11,040 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-07 21:25:11,100 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-07 21:25:11,106 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-07 21:25:11,106 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-07 21:25:11,128 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-07 21:25:11,129 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-07 21:25:11,129 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-07 21:25:11,130 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-07 21:25:11,130 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-07 21:25:11,130 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-07 21:25:11,130 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-07 21:25:11,130 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-07 21:25:11,130 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-07 21:25:11,130 INFO L153 SettingsManager]: * Use SBE=true [2025-02-07 21:25:11,130 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-07 21:25:11,130 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-07 21:25:11,131 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-07 21:25:11,131 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-07 21:25:11,131 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-07 21:25:11,131 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-07 21:25:11,131 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-07 21:25:11,131 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-07 21:25:11,131 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-07 21:25:11,132 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-07 21:25:11,132 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-07 21:25:11,132 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-07 21:25:11,132 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-07 21:25:11,132 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-07 21:25:11,132 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-07 21:25:11,132 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-07 21:25:11,132 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-07 21:25:11,132 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 21:25:11,132 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-07 21:25:11,132 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-07 21:25:11,132 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-07 21:25:11,132 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-07 21:25:11,132 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-07 21:25:11,132 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-07 21:25:11,132 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-07 21:25:11,132 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-07 21:25:11,132 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-07 21:25:11,132 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-07 21:25:11,132 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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(G ! call(reach_error())) ) 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 -> 4a8be7009a37d1df58713fd67cd9771c39e6139a0416009824ceb58da10928b7 [2025-02-07 21:25:11,368 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-07 21:25:11,377 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-07 21:25:11,378 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-07 21:25:11,379 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-07 21:25:11,379 INFO L274 PluginConnector]: CDTParser initialized [2025-02-07 21:25:11,380 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-pthread/cs_peterson.i [2025-02-07 21:25:12,536 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9e8c94b37/79fe5f5a80854d209fb4d35e50ea8c0a/FLAGa51fd03d8 [2025-02-07 21:25:12,848 INFO L384 CDTParser]: Found 1 translation units. [2025-02-07 21:25:12,848 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-pthread/cs_peterson.i [2025-02-07 21:25:12,873 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9e8c94b37/79fe5f5a80854d209fb4d35e50ea8c0a/FLAGa51fd03d8 [2025-02-07 21:25:13,103 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9e8c94b37/79fe5f5a80854d209fb4d35e50ea8c0a [2025-02-07 21:25:13,104 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-07 21:25:13,105 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-07 21:25:13,106 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-07 21:25:13,106 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-07 21:25:13,109 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-07 21:25:13,110 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 09:25:13" (1/1) ... [2025-02-07 21:25:13,110 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54210c67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:25:13, skipping insertion in model container [2025-02-07 21:25:13,110 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 09:25:13" (1/1) ... [2025-02-07 21:25:13,139 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-07 21:25:13,371 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-pthread/cs_peterson.i[23605,23618] [2025-02-07 21:25:13,471 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 21:25:13,485 INFO L200 MainTranslator]: Completed pre-run [2025-02-07 21:25:13,510 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-pthread/cs_peterson.i[23605,23618] [2025-02-07 21:25:13,552 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 21:25:13,583 INFO L204 MainTranslator]: Completed translation [2025-02-07 21:25:13,584 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:25:13 WrapperNode [2025-02-07 21:25:13,584 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-07 21:25:13,585 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-07 21:25:13,585 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-07 21:25:13,585 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-07 21:25:13,589 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:25:13" (1/1) ... [2025-02-07 21:25:13,616 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:25:13" (1/1) ... [2025-02-07 21:25:13,654 INFO L138 Inliner]: procedures = 145, calls = 285, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 437 [2025-02-07 21:25:13,655 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-07 21:25:13,655 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-07 21:25:13,655 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-07 21:25:13,655 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-07 21:25:13,667 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:25:13" (1/1) ... [2025-02-07 21:25:13,667 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:25:13" (1/1) ... [2025-02-07 21:25:13,671 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:25:13" (1/1) ... [2025-02-07 21:25:13,692 INFO L175 MemorySlicer]: Split 156 memory accesses to 18 slices as follows [2, 8, 8, 5, 8, 29, 5, 21, 7, 7, 7, 7, 13, 5, 13, 6, 0, 5]. 19 percent of accesses are in the largest equivalence class. The 43 initializations are split as follows [2, 3, 3, 0, 3, 9, 0, 9, 3, 3, 3, 3, 0, 0, 0, 2, 0, 0]. The 39 writes are split as follows [0, 2, 2, 1, 2, 11, 1, 6, 2, 2, 2, 2, 1, 1, 1, 2, 0, 1]. [2025-02-07 21:25:13,692 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:25:13" (1/1) ... [2025-02-07 21:25:13,692 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:25:13" (1/1) ... [2025-02-07 21:25:13,716 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:25:13" (1/1) ... [2025-02-07 21:25:13,717 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:25:13" (1/1) ... [2025-02-07 21:25:13,724 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:25:13" (1/1) ... [2025-02-07 21:25:13,730 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:25:13" (1/1) ... [2025-02-07 21:25:13,736 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-07 21:25:13,737 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-07 21:25:13,737 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-07 21:25:13,737 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-07 21:25:13,738 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:25:13" (1/1) ... [2025-02-07 21:25:13,741 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 21:25:13,751 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 21:25:13,761 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-07 21:25:13,764 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-07 21:25:13,779 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-07 21:25:13,779 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-07 21:25:13,779 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-07 21:25:13,779 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-02-07 21:25:13,779 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-02-07 21:25:13,779 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-02-07 21:25:13,779 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-02-07 21:25:13,779 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-02-07 21:25:13,779 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-02-07 21:25:13,779 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-02-07 21:25:13,779 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-02-07 21:25:13,779 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-02-07 21:25:13,779 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-02-07 21:25:13,779 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2025-02-07 21:25:13,779 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2025-02-07 21:25:13,779 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#15 [2025-02-07 21:25:13,779 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#16 [2025-02-07 21:25:13,779 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#17 [2025-02-07 21:25:13,779 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-07 21:25:13,779 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-07 21:25:13,779 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-07 21:25:13,779 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-02-07 21:25:13,779 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-02-07 21:25:13,779 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-02-07 21:25:13,779 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-02-07 21:25:13,780 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-02-07 21:25:13,780 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-02-07 21:25:13,780 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-02-07 21:25:13,780 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-02-07 21:25:13,780 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-02-07 21:25:13,780 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-02-07 21:25:13,780 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2025-02-07 21:25:13,780 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2025-02-07 21:25:13,780 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#15 [2025-02-07 21:25:13,780 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#16 [2025-02-07 21:25:13,780 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#17 [2025-02-07 21:25:13,780 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-07 21:25:13,780 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-07 21:25:13,780 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-07 21:25:13,780 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-07 21:25:13,780 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-07 21:25:13,780 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-07 21:25:13,780 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-02-07 21:25:13,780 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-02-07 21:25:13,780 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-02-07 21:25:13,780 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-02-07 21:25:13,780 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-02-07 21:25:13,780 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2025-02-07 21:25:13,780 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2025-02-07 21:25:13,780 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2025-02-07 21:25:13,780 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2025-02-07 21:25:13,780 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2025-02-07 21:25:13,780 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2025-02-07 21:25:13,780 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2025-02-07 21:25:13,781 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#14 [2025-02-07 21:25:13,781 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#15 [2025-02-07 21:25:13,781 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#16 [2025-02-07 21:25:13,781 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#17 [2025-02-07 21:25:13,781 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_create [2025-02-07 21:25:13,781 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_create [2025-02-07 21:25:13,781 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-07 21:25:13,781 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-07 21:25:13,781 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-02-07 21:25:13,781 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-02-07 21:25:13,781 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-02-07 21:25:13,781 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-02-07 21:25:13,781 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-02-07 21:25:13,781 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-02-07 21:25:13,781 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2025-02-07 21:25:13,781 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2025-02-07 21:25:13,781 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2025-02-07 21:25:13,781 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2025-02-07 21:25:13,781 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2025-02-07 21:25:13,781 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2025-02-07 21:25:13,781 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#14 [2025-02-07 21:25:13,781 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#15 [2025-02-07 21:25:13,781 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#16 [2025-02-07 21:25:13,781 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#17 [2025-02-07 21:25:13,781 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_join [2025-02-07 21:25:13,781 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_join [2025-02-07 21:25:13,781 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~$Pointer$ [2025-02-07 21:25:13,781 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~$Pointer$ [2025-02-07 21:25:13,781 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-07 21:25:13,781 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-02-07 21:25:13,782 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-02-07 21:25:13,782 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-02-07 21:25:13,782 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-02-07 21:25:13,782 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2025-02-07 21:25:13,782 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2025-02-07 21:25:13,782 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2025-02-07 21:25:13,782 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2025-02-07 21:25:13,782 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#8 [2025-02-07 21:25:13,782 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#9 [2025-02-07 21:25:13,782 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#10 [2025-02-07 21:25:13,782 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#11 [2025-02-07 21:25:13,782 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#12 [2025-02-07 21:25:13,782 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#13 [2025-02-07 21:25:13,782 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#14 [2025-02-07 21:25:13,782 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#15 [2025-02-07 21:25:13,782 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#16 [2025-02-07 21:25:13,782 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#17 [2025-02-07 21:25:13,782 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_cs [2025-02-07 21:25:13,783 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_cs [2025-02-07 21:25:13,783 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-07 21:25:13,783 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-07 21:25:13,783 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-07 21:25:13,783 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-07 21:25:13,783 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-02-07 21:25:13,783 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-02-07 21:25:13,783 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-02-07 21:25:13,783 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-02-07 21:25:13,783 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-02-07 21:25:13,783 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-02-07 21:25:13,783 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-02-07 21:25:13,783 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-02-07 21:25:13,783 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-02-07 21:25:13,783 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-02-07 21:25:13,783 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-02-07 21:25:13,783 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-02-07 21:25:13,783 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2025-02-07 21:25:13,784 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2025-02-07 21:25:13,784 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-07 21:25:13,784 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-07 21:25:13,989 INFO L257 CfgBuilder]: Building ICFG [2025-02-07 21:25:13,992 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-07 21:25:18,475 INFO L? ?]: Removed 62 outVars from TransFormulas that were not future-live. [2025-02-07 21:25:18,475 INFO L308 CfgBuilder]: Performing block encoding [2025-02-07 21:25:18,482 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-07 21:25:18,483 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-07 21:25:18,483 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 09:25:18 BoogieIcfgContainer [2025-02-07 21:25:18,483 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-07 21:25:18,484 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-07 21:25:18,484 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-07 21:25:18,487 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-07 21:25:18,487 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.02 09:25:13" (1/3) ... [2025-02-07 21:25:18,488 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b73fdc6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 09:25:18, skipping insertion in model container [2025-02-07 21:25:18,488 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 09:25:13" (2/3) ... [2025-02-07 21:25:18,488 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b73fdc6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 09:25:18, skipping insertion in model container [2025-02-07 21:25:18,488 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 09:25:18" (3/3) ... [2025-02-07 21:25:18,489 INFO L128 eAbstractionObserver]: Analyzing ICFG cs_peterson.i [2025-02-07 21:25:18,499 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-07 21:25:18,500 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG cs_peterson.i that has 6 procedures, 108 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-02-07 21:25:18,538 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-07 21:25:18,546 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@30a08b11, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-07 21:25:18,546 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-07 21:25:18,551 INFO L276 IsEmpty]: Start isEmpty. Operand has 108 states, 66 states have (on average 1.3181818181818181) internal successors, (87), 68 states have internal predecessors, (87), 34 states have call successors, (34), 5 states have call predecessors, (34), 5 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-02-07 21:25:18,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-02-07 21:25:18,563 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:25:18,565 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:25:18,565 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:25:18,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:25:18,570 INFO L85 PathProgramCache]: Analyzing trace with hash -1470350782, now seen corresponding path program 1 times [2025-02-07 21:25:18,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:25:18,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055922751] [2025-02-07 21:25:18,578 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:25:18,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:25:18,758 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-02-07 21:25:18,856 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-02-07 21:25:18,857 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:25:18,857 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:25:19,183 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-02-07 21:25:19,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:25:19,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055922751] [2025-02-07 21:25:19,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1055922751] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:25:19,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:25:19,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-07 21:25:19,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241912195] [2025-02-07 21:25:19,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:25:19,189 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-07 21:25:19,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:25:19,203 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-07 21:25:19,204 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-07 21:25:19,205 INFO L87 Difference]: Start difference. First operand has 108 states, 66 states have (on average 1.3181818181818181) internal successors, (87), 68 states have internal predecessors, (87), 34 states have call successors, (34), 5 states have call predecessors, (34), 5 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-02-07 21:25:23,241 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-07 21:25:23,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:25:23,289 INFO L93 Difference]: Finished difference Result 215 states and 341 transitions. [2025-02-07 21:25:23,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-07 21:25:23,291 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 130 [2025-02-07 21:25:23,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:25:23,297 INFO L225 Difference]: With dead ends: 215 [2025-02-07 21:25:23,298 INFO L226 Difference]: Without dead ends: 106 [2025-02-07 21:25:23,302 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-07 21:25:23,304 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 2 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 297 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2025-02-07 21:25:23,304 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 297 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 1 Unknown, 0 Unchecked, 4.0s Time] [2025-02-07 21:25:23,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2025-02-07 21:25:23,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 105. [2025-02-07 21:25:23,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 65 states have (on average 1.2) internal successors, (78), 65 states have internal predecessors, (78), 34 states have call successors, (34), 5 states have call predecessors, (34), 5 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-02-07 21:25:23,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 146 transitions. [2025-02-07 21:25:23,340 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 146 transitions. Word has length 130 [2025-02-07 21:25:23,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:25:23,341 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 146 transitions. [2025-02-07 21:25:23,341 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-02-07 21:25:23,341 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 146 transitions. [2025-02-07 21:25:23,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-02-07 21:25:23,345 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:25:23,345 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:25:23,346 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-07 21:25:23,346 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:25:23,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:25:23,347 INFO L85 PathProgramCache]: Analyzing trace with hash -1459188208, now seen corresponding path program 1 times [2025-02-07 21:25:23,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:25:23,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635415478] [2025-02-07 21:25:23,347 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:25:23,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:25:23,438 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-02-07 21:25:23,456 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-02-07 21:25:23,457 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:25:23,457 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:25:23,636 INFO L134 CoverageAnalysis]: Checked inductivity of 761 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-02-07 21:25:23,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:25:23,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635415478] [2025-02-07 21:25:23,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1635415478] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:25:23,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:25:23,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-07 21:25:23,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618341294] [2025-02-07 21:25:23,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:25:23,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-07 21:25:23,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:25:23,641 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-07 21:25:23,641 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-07 21:25:23,641 INFO L87 Difference]: Start difference. First operand 105 states and 146 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-02-07 21:25:23,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:25:23,680 INFO L93 Difference]: Finished difference Result 209 states and 292 transitions. [2025-02-07 21:25:23,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-07 21:25:23,681 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 132 [2025-02-07 21:25:23,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:25:23,682 INFO L225 Difference]: With dead ends: 209 [2025-02-07 21:25:23,682 INFO L226 Difference]: Without dead ends: 106 [2025-02-07 21:25:23,683 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-07 21:25:23,683 INFO L435 NwaCegarLoop]: 144 mSDtfsCounter, 0 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 21:25:23,684 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 285 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 21:25:23,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2025-02-07 21:25:23,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2025-02-07 21:25:23,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 66 states have (on average 1.196969696969697) internal successors, (79), 66 states have internal predecessors, (79), 34 states have call successors, (34), 5 states have call predecessors, (34), 5 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-02-07 21:25:23,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 147 transitions. [2025-02-07 21:25:23,692 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 147 transitions. Word has length 132 [2025-02-07 21:25:23,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:25:23,692 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 147 transitions. [2025-02-07 21:25:23,692 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-02-07 21:25:23,692 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 147 transitions. [2025-02-07 21:25:23,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-02-07 21:25:23,694 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:25:23,694 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:25:23,694 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-07 21:25:23,694 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:25:23,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:25:23,694 INFO L85 PathProgramCache]: Analyzing trace with hash -864746856, now seen corresponding path program 1 times [2025-02-07 21:25:23,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:25:23,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780947192] [2025-02-07 21:25:23,695 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:25:23,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:25:23,785 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-02-07 21:25:23,810 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-02-07 21:25:23,810 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:25:23,811 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:25:23,998 INFO L134 CoverageAnalysis]: Checked inductivity of 762 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-02-07 21:25:23,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:25:23,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780947192] [2025-02-07 21:25:23,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780947192] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 21:25:23,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1351709309] [2025-02-07 21:25:23,998 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:25:23,999 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 21:25:23,999 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 21:25:24,003 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) [2025-02-07 21:25:24,008 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 [2025-02-07 21:25:24,250 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-02-07 21:25:24,380 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-02-07 21:25:24,380 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:25:24,380 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:25:24,386 INFO L256 TraceCheckSpWp]: Trace formula consists of 945 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-07 21:25:24,394 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 21:25:24,436 INFO L134 CoverageAnalysis]: Checked inductivity of 762 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-02-07 21:25:24,437 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 21:25:24,578 INFO L134 CoverageAnalysis]: Checked inductivity of 762 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-02-07 21:25:24,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1351709309] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 21:25:24,579 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 21:25:24,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2025-02-07 21:25:24,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342650132] [2025-02-07 21:25:24,579 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 21:25:24,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 21:25:24,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:25:24,580 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 21:25:24,581 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-07 21:25:24,581 INFO L87 Difference]: Start difference. First operand 106 states and 147 transitions. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 1 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2025-02-07 21:25:24,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:25:24,623 INFO L93 Difference]: Finished difference Result 212 states and 296 transitions. [2025-02-07 21:25:24,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 21:25:24,624 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 1 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) Word has length 133 [2025-02-07 21:25:24,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:25:24,628 INFO L225 Difference]: With dead ends: 212 [2025-02-07 21:25:24,628 INFO L226 Difference]: Without dead ends: 108 [2025-02-07 21:25:24,629 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 263 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-07 21:25:24,630 INFO L435 NwaCegarLoop]: 144 mSDtfsCounter, 0 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 21:25:24,630 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 285 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 21:25:24,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2025-02-07 21:25:24,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2025-02-07 21:25:24,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 68 states have (on average 1.1911764705882353) internal successors, (81), 68 states have internal predecessors, (81), 34 states have call successors, (34), 5 states have call predecessors, (34), 5 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-02-07 21:25:24,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 149 transitions. [2025-02-07 21:25:24,641 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 149 transitions. Word has length 133 [2025-02-07 21:25:24,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:25:24,641 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 149 transitions. [2025-02-07 21:25:24,641 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 1 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2025-02-07 21:25:24,641 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 149 transitions. [2025-02-07 21:25:24,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-02-07 21:25:24,647 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:25:24,647 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:25:24,655 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-07 21:25:24,848 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 21:25:24,848 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:25:24,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:25:24,849 INFO L85 PathProgramCache]: Analyzing trace with hash 410554776, now seen corresponding path program 2 times [2025-02-07 21:25:24,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:25:24,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274497200] [2025-02-07 21:25:24,849 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-07 21:25:24,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:25:24,946 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 135 statements into 2 equivalence classes. [2025-02-07 21:25:24,973 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 16 of 135 statements. [2025-02-07 21:25:24,974 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-07 21:25:24,974 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:25:25,169 INFO L134 CoverageAnalysis]: Checked inductivity of 767 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 767 trivial. 0 not checked. [2025-02-07 21:25:25,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:25:25,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274497200] [2025-02-07 21:25:25,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [274497200] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:25:25,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:25:25,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 21:25:25,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637222518] [2025-02-07 21:25:25,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:25:25,170 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 21:25:25,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:25:25,171 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 21:25:25,171 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 21:25:25,171 INFO L87 Difference]: Start difference. First operand 108 states and 149 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-02-07 21:25:25,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:25:25,215 INFO L93 Difference]: Finished difference Result 207 states and 290 transitions. [2025-02-07 21:25:25,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 21:25:25,216 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 135 [2025-02-07 21:25:25,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:25:25,219 INFO L225 Difference]: With dead ends: 207 [2025-02-07 21:25:25,219 INFO L226 Difference]: Without dead ends: 161 [2025-02-07 21:25:25,219 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-07 21:25:25,222 INFO L435 NwaCegarLoop]: 170 mSDtfsCounter, 91 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 474 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 21:25:25,223 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 474 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 21:25:25,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2025-02-07 21:25:25,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 161. [2025-02-07 21:25:25,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 103 states have (on average 1.203883495145631) internal successors, (124), 103 states have internal predecessors, (124), 47 states have call successors, (47), 10 states have call predecessors, (47), 10 states have return successors, (51), 47 states have call predecessors, (51), 47 states have call successors, (51) [2025-02-07 21:25:25,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 222 transitions. [2025-02-07 21:25:25,246 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 222 transitions. Word has length 135 [2025-02-07 21:25:25,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:25:25,247 INFO L471 AbstractCegarLoop]: Abstraction has 161 states and 222 transitions. [2025-02-07 21:25:25,247 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-02-07 21:25:25,247 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 222 transitions. [2025-02-07 21:25:25,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2025-02-07 21:25:25,250 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:25:25,250 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 5, 5, 5, 5, 5, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:25:25,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-07 21:25:25,251 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:25:25,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:25:25,252 INFO L85 PathProgramCache]: Analyzing trace with hash -113219249, now seen corresponding path program 1 times [2025-02-07 21:25:25,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:25:25,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355056642] [2025-02-07 21:25:25,252 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:25:25,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:25:25,328 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 222 statements into 1 equivalence classes. [2025-02-07 21:25:25,345 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 222 of 222 statements. [2025-02-07 21:25:25,346 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:25:25,346 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:25:25,556 INFO L134 CoverageAnalysis]: Checked inductivity of 1265 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1264 trivial. 0 not checked. [2025-02-07 21:25:25,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:25:25,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355056642] [2025-02-07 21:25:25,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1355056642] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 21:25:25,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [667082144] [2025-02-07 21:25:25,557 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:25:25,557 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 21:25:25,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 21:25:25,559 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) [2025-02-07 21:25:25,561 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 [2025-02-07 21:25:25,837 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 222 statements into 1 equivalence classes. [2025-02-07 21:25:25,991 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 222 of 222 statements. [2025-02-07 21:25:25,991 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:25:25,991 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:25:25,996 INFO L256 TraceCheckSpWp]: Trace formula consists of 1517 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-07 21:25:26,007 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 21:25:26,035 INFO L134 CoverageAnalysis]: Checked inductivity of 1265 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1264 trivial. 0 not checked. [2025-02-07 21:25:26,035 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 21:25:26,266 INFO L134 CoverageAnalysis]: Checked inductivity of 1265 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1264 trivial. 0 not checked. [2025-02-07 21:25:26,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [667082144] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 21:25:26,266 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 21:25:26,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 4] total 6 [2025-02-07 21:25:26,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593778585] [2025-02-07 21:25:26,266 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 21:25:26,267 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-07 21:25:26,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:25:26,267 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-07 21:25:26,267 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-07 21:25:26,268 INFO L87 Difference]: Start difference. First operand 161 states and 222 transitions. Second operand has 6 states, 6 states have (on average 16.0) internal successors, (96), 6 states have internal predecessors, (96), 2 states have call successors, (62), 2 states have call predecessors, (62), 2 states have return successors, (62), 2 states have call predecessors, (62), 2 states have call successors, (62) [2025-02-07 21:25:30,677 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-07 21:25:32,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:25:32,526 INFO L93 Difference]: Finished difference Result 325 states and 449 transitions. [2025-02-07 21:25:32,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 21:25:32,527 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.0) internal successors, (96), 6 states have internal predecessors, (96), 2 states have call successors, (62), 2 states have call predecessors, (62), 2 states have return successors, (62), 2 states have call predecessors, (62), 2 states have call successors, (62) Word has length 222 [2025-02-07 21:25:32,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:25:32,528 INFO L225 Difference]: With dead ends: 325 [2025-02-07 21:25:32,528 INFO L226 Difference]: Without dead ends: 171 [2025-02-07 21:25:32,529 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 446 GetRequests, 441 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-07 21:25:32,529 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 2 mSDsluCounter, 420 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 562 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.2s IncrementalHoareTripleChecker+Time [2025-02-07 21:25:32,530 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 562 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 1 Unknown, 0 Unchecked, 6.2s Time] [2025-02-07 21:25:32,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2025-02-07 21:25:32,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2025-02-07 21:25:32,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 113 states have (on average 1.2035398230088497) internal successors, (136), 113 states have internal predecessors, (136), 47 states have call successors, (47), 10 states have call predecessors, (47), 10 states have return successors, (51), 47 states have call predecessors, (51), 47 states have call successors, (51) [2025-02-07 21:25:32,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 234 transitions. [2025-02-07 21:25:32,546 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 234 transitions. Word has length 222 [2025-02-07 21:25:32,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:25:32,546 INFO L471 AbstractCegarLoop]: Abstraction has 171 states and 234 transitions. [2025-02-07 21:25:32,546 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.0) internal successors, (96), 6 states have internal predecessors, (96), 2 states have call successors, (62), 2 states have call predecessors, (62), 2 states have return successors, (62), 2 states have call predecessors, (62), 2 states have call successors, (62) [2025-02-07 21:25:32,546 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 234 transitions. [2025-02-07 21:25:32,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2025-02-07 21:25:32,548 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:25:32,548 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 9, 5, 5, 5, 5, 5, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:25:32,557 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-07 21:25:32,749 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 21:25:32,749 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:25:32,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:25:32,749 INFO L85 PathProgramCache]: Analyzing trace with hash -1671775345, now seen corresponding path program 2 times [2025-02-07 21:25:32,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:25:32,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531560419] [2025-02-07 21:25:32,750 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-07 21:25:32,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:25:32,878 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 232 statements into 2 equivalence classes. [2025-02-07 21:25:32,898 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 232 statements. [2025-02-07 21:25:32,901 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-07 21:25:32,901 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:25:33,065 INFO L134 CoverageAnalysis]: Checked inductivity of 1330 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1330 trivial. 0 not checked. [2025-02-07 21:25:33,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:25:33,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531560419] [2025-02-07 21:25:33,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1531560419] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:25:33,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:25:33,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 21:25:33,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762252868] [2025-02-07 21:25:33,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:25:33,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 21:25:33,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:25:33,070 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 21:25:33,070 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 21:25:33,070 INFO L87 Difference]: Start difference. First operand 171 states and 234 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2025-02-07 21:25:36,145 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.06s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-07 21:25:40,173 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-07 21:25:40,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:25:40,286 INFO L93 Difference]: Finished difference Result 453 states and 624 transitions. [2025-02-07 21:25:40,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 21:25:40,287 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) Word has length 232 [2025-02-07 21:25:40,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:25:40,291 INFO L225 Difference]: With dead ends: 453 [2025-02-07 21:25:40,291 INFO L226 Difference]: Without dead ends: 315 [2025-02-07 21:25:40,292 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-07 21:25:40,293 INFO L435 NwaCegarLoop]: 246 mSDtfsCounter, 130 mSDsluCounter, 374 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 620 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.2s IncrementalHoareTripleChecker+Time [2025-02-07 21:25:40,294 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 620 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 1 Unknown, 0 Unchecked, 7.2s Time] [2025-02-07 21:25:40,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2025-02-07 21:25:40,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 311. [2025-02-07 21:25:40,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 311 states, 199 states have (on average 1.185929648241206) internal successors, (236), 199 states have internal predecessors, (236), 91 states have call successors, (91), 20 states have call predecessors, (91), 20 states have return successors, (106), 91 states have call predecessors, (106), 91 states have call successors, (106) [2025-02-07 21:25:40,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 433 transitions. [2025-02-07 21:25:40,334 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 433 transitions. Word has length 232 [2025-02-07 21:25:40,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:25:40,335 INFO L471 AbstractCegarLoop]: Abstraction has 311 states and 433 transitions. [2025-02-07 21:25:40,335 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2025-02-07 21:25:40,335 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 433 transitions. [2025-02-07 21:25:40,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2025-02-07 21:25:40,340 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:25:40,341 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 9, 5, 5, 5, 5, 5, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:25:40,341 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-07 21:25:40,341 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:25:40,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:25:40,341 INFO L85 PathProgramCache]: Analyzing trace with hash 316264397, now seen corresponding path program 1 times [2025-02-07 21:25:40,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:25:40,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959696774] [2025-02-07 21:25:40,342 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:25:40,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:25:40,445 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 232 statements into 1 equivalence classes. [2025-02-07 21:25:40,517 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 232 of 232 statements. [2025-02-07 21:25:40,518 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:25:40,518 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:25:40,999 INFO L134 CoverageAnalysis]: Checked inductivity of 1330 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1330 trivial. 0 not checked. [2025-02-07 21:25:40,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:25:41,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959696774] [2025-02-07 21:25:41,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [959696774] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:25:41,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 21:25:41,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 21:25:41,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518427030] [2025-02-07 21:25:41,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:25:41,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 21:25:41,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:25:41,003 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 21:25:41,003 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 21:25:41,003 INFO L87 Difference]: Start difference. First operand 311 states and 433 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2025-02-07 21:25:44,101 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.20s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-07 21:25:44,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:25:44,207 INFO L93 Difference]: Finished difference Result 569 states and 779 transitions. [2025-02-07 21:25:44,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 21:25:44,208 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) Word has length 232 [2025-02-07 21:25:44,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:25:44,211 INFO L225 Difference]: With dead ends: 569 [2025-02-07 21:25:44,212 INFO L226 Difference]: Without dead ends: 286 [2025-02-07 21:25:44,213 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-07 21:25:44,214 INFO L435 NwaCegarLoop]: 244 mSDtfsCounter, 126 mSDsluCounter, 373 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 617 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2025-02-07 21:25:44,214 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 617 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2025-02-07 21:25:44,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2025-02-07 21:25:44,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 282. [2025-02-07 21:25:44,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 181 states have (on average 1.1767955801104972) internal successors, (213), 181 states have internal predecessors, (213), 82 states have call successors, (82), 18 states have call predecessors, (82), 18 states have return successors, (90), 82 states have call predecessors, (90), 82 states have call successors, (90) [2025-02-07 21:25:44,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 385 transitions. [2025-02-07 21:25:44,236 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 385 transitions. Word has length 232 [2025-02-07 21:25:44,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:25:44,237 INFO L471 AbstractCegarLoop]: Abstraction has 282 states and 385 transitions. [2025-02-07 21:25:44,237 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2025-02-07 21:25:44,237 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 385 transitions. [2025-02-07 21:25:44,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2025-02-07 21:25:44,241 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:25:44,241 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 9, 5, 5, 5, 5, 5, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:25:44,241 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-07 21:25:44,241 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:25:44,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:25:44,242 INFO L85 PathProgramCache]: Analyzing trace with hash 1585590219, now seen corresponding path program 1 times [2025-02-07 21:25:44,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:25:44,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911755033] [2025-02-07 21:25:44,242 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:25:44,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:25:44,322 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 232 statements into 1 equivalence classes. [2025-02-07 21:25:44,412 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 232 of 232 statements. [2025-02-07 21:25:44,413 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:25:44,413 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:25:44,783 INFO L134 CoverageAnalysis]: Checked inductivity of 1330 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1326 trivial. 0 not checked. [2025-02-07 21:25:44,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:25:44,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911755033] [2025-02-07 21:25:44,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911755033] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 21:25:44,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [262895711] [2025-02-07 21:25:44,785 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:25:44,785 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 21:25:44,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 21:25:44,787 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) [2025-02-07 21:25:44,789 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 [2025-02-07 21:25:45,137 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 232 statements into 1 equivalence classes. [2025-02-07 21:25:45,310 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 232 of 232 statements. [2025-02-07 21:25:45,311 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:25:45,311 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:25:45,318 INFO L256 TraceCheckSpWp]: Trace formula consists of 1803 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-02-07 21:25:45,324 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 21:25:45,575 INFO L134 CoverageAnalysis]: Checked inductivity of 1330 backedges. 375 proven. 0 refuted. 0 times theorem prover too weak. 955 trivial. 0 not checked. [2025-02-07 21:25:45,575 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-07 21:25:45,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [262895711] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 21:25:45,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-07 21:25:45,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 12 [2025-02-07 21:25:45,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846801269] [2025-02-07 21:25:45,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 21:25:45,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-07 21:25:45,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:25:45,576 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-07 21:25:45,576 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2025-02-07 21:25:45,577 INFO L87 Difference]: Start difference. First operand 282 states and 385 transitions. Second operand has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 6 states have internal predecessors, (72), 4 states have call successors, (33), 3 states have call predecessors, (33), 4 states have return successors, (33), 4 states have call predecessors, (33), 4 states have call successors, (33) [2025-02-07 21:25:46,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:25:46,227 INFO L93 Difference]: Finished difference Result 615 states and 820 transitions. [2025-02-07 21:25:46,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-07 21:25:46,227 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 6 states have internal predecessors, (72), 4 states have call successors, (33), 3 states have call predecessors, (33), 4 states have return successors, (33), 4 states have call predecessors, (33), 4 states have call successors, (33) Word has length 232 [2025-02-07 21:25:46,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:25:46,230 INFO L225 Difference]: With dead ends: 615 [2025-02-07 21:25:46,230 INFO L226 Difference]: Without dead ends: 325 [2025-02-07 21:25:46,231 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 229 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2025-02-07 21:25:46,231 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 113 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 415 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 477 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 415 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-07 21:25:46,232 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 342 Invalid, 477 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 415 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-07 21:25:46,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2025-02-07 21:25:46,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 322. [2025-02-07 21:25:46,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 322 states, 207 states have (on average 1.1497584541062802) internal successors, (238), 209 states have internal predecessors, (238), 89 states have call successors, (89), 25 states have call predecessors, (89), 25 states have return successors, (103), 87 states have call predecessors, (103), 89 states have call successors, (103) [2025-02-07 21:25:46,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 430 transitions. [2025-02-07 21:25:46,253 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 430 transitions. Word has length 232 [2025-02-07 21:25:46,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:25:46,253 INFO L471 AbstractCegarLoop]: Abstraction has 322 states and 430 transitions. [2025-02-07 21:25:46,253 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 6 states have internal predecessors, (72), 4 states have call successors, (33), 3 states have call predecessors, (33), 4 states have return successors, (33), 4 states have call predecessors, (33), 4 states have call successors, (33) [2025-02-07 21:25:46,253 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 430 transitions. [2025-02-07 21:25:46,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2025-02-07 21:25:46,256 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:25:46,256 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 9, 5, 5, 5, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:25:46,266 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-07 21:25:46,460 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 21:25:46,460 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:25:46,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:25:46,461 INFO L85 PathProgramCache]: Analyzing trace with hash -1140486964, now seen corresponding path program 1 times [2025-02-07 21:25:46,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:25:46,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971096364] [2025-02-07 21:25:46,461 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:25:46,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:25:46,574 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 230 statements into 1 equivalence classes. [2025-02-07 21:25:46,638 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 230 of 230 statements. [2025-02-07 21:25:46,638 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:25:46,638 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:25:47,040 INFO L134 CoverageAnalysis]: Checked inductivity of 1330 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1326 trivial. 0 not checked. [2025-02-07 21:25:47,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:25:47,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971096364] [2025-02-07 21:25:47,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [971096364] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 21:25:47,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1337814297] [2025-02-07 21:25:47,041 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:25:47,041 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 21:25:47,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 21:25:47,043 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 21:25:47,045 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-07 21:25:47,409 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 230 statements into 1 equivalence classes. [2025-02-07 21:25:47,595 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 230 of 230 statements. [2025-02-07 21:25:47,595 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:25:47,595 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:25:47,606 INFO L256 TraceCheckSpWp]: Trace formula consists of 1800 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-02-07 21:25:47,612 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 21:25:47,745 INFO L134 CoverageAnalysis]: Checked inductivity of 1330 backedges. 400 proven. 4 refuted. 0 times theorem prover too weak. 926 trivial. 0 not checked. [2025-02-07 21:25:47,747 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 21:25:48,207 INFO L134 CoverageAnalysis]: Checked inductivity of 1330 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1326 trivial. 0 not checked. [2025-02-07 21:25:48,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1337814297] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 21:25:48,208 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 21:25:48,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 5] total 11 [2025-02-07 21:25:48,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058201535] [2025-02-07 21:25:48,208 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 21:25:48,209 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-07 21:25:48,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:25:48,209 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-07 21:25:48,210 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2025-02-07 21:25:48,210 INFO L87 Difference]: Start difference. First operand 322 states and 430 transitions. Second operand has 11 states, 11 states have (on average 7.545454545454546) internal successors, (83), 11 states have internal predecessors, (83), 9 states have call successors, (62), 5 states have call predecessors, (62), 6 states have return successors, (63), 7 states have call predecessors, (63), 9 states have call successors, (63) [2025-02-07 21:25:49,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 21:25:49,772 INFO L93 Difference]: Finished difference Result 632 states and 852 transitions. [2025-02-07 21:25:49,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-07 21:25:49,773 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.545454545454546) internal successors, (83), 11 states have internal predecessors, (83), 9 states have call successors, (62), 5 states have call predecessors, (62), 6 states have return successors, (63), 7 states have call predecessors, (63), 9 states have call successors, (63) Word has length 230 [2025-02-07 21:25:49,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 21:25:49,775 INFO L225 Difference]: With dead ends: 632 [2025-02-07 21:25:49,778 INFO L226 Difference]: Without dead ends: 339 [2025-02-07 21:25:49,780 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 470 GetRequests, 459 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2025-02-07 21:25:49,781 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 135 mSDsluCounter, 349 mSDsCounter, 0 mSdLazyCounter, 432 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 486 SdHoareTripleChecker+Invalid, 527 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 432 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-02-07 21:25:49,781 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 486 Invalid, 527 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 432 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-02-07 21:25:49,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2025-02-07 21:25:49,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 336. [2025-02-07 21:25:49,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 336 states, 220 states have (on average 1.1454545454545455) internal successors, (252), 221 states have internal predecessors, (252), 82 states have call successors, (82), 33 states have call predecessors, (82), 33 states have return successors, (105), 81 states have call predecessors, (105), 82 states have call successors, (105) [2025-02-07 21:25:49,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 439 transitions. [2025-02-07 21:25:49,808 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 439 transitions. Word has length 230 [2025-02-07 21:25:49,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 21:25:49,808 INFO L471 AbstractCegarLoop]: Abstraction has 336 states and 439 transitions. [2025-02-07 21:25:49,808 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.545454545454546) internal successors, (83), 11 states have internal predecessors, (83), 9 states have call successors, (62), 5 states have call predecessors, (62), 6 states have return successors, (63), 7 states have call predecessors, (63), 9 states have call successors, (63) [2025-02-07 21:25:49,808 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 439 transitions. [2025-02-07 21:25:49,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2025-02-07 21:25:49,811 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 21:25:49,811 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 9, 5, 5, 5, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 21:25:49,824 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-07 21:25:50,015 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2025-02-07 21:25:50,016 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 21:25:50,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 21:25:50,017 INFO L85 PathProgramCache]: Analyzing trace with hash 1901977740, now seen corresponding path program 1 times [2025-02-07 21:25:50,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 21:25:50,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509294562] [2025-02-07 21:25:50,018 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:25:50,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 21:25:50,123 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 230 statements into 1 equivalence classes. [2025-02-07 21:25:50,182 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 230 of 230 statements. [2025-02-07 21:25:50,184 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:25:50,185 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:25:51,348 INFO L134 CoverageAnalysis]: Checked inductivity of 1330 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 1323 trivial. 0 not checked. [2025-02-07 21:25:51,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 21:25:51,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509294562] [2025-02-07 21:25:51,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1509294562] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 21:25:51,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1862138501] [2025-02-07 21:25:51,348 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 21:25:51,349 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 21:25:51,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 21:25:51,350 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 21:25:51,352 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-07 21:25:51,754 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 230 statements into 1 equivalence classes. [2025-02-07 21:25:51,935 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 230 of 230 statements. [2025-02-07 21:25:51,935 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 21:25:51,935 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 21:25:51,944 INFO L256 TraceCheckSpWp]: Trace formula consists of 1898 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-02-07 21:25:51,949 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 21:25:52,122 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-02-07 21:26:02,435 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-07 21:26:02,451 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 21:26:02,451 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 48 [2025-02-07 21:26:03,618 INFO L349 Elim1Store]: treesize reduction 64, result has 54.9 percent of original size [2025-02-07 21:26:03,618 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 49 treesize of output 104 [2025-02-07 21:26:39,665 INFO L134 CoverageAnalysis]: Checked inductivity of 1330 backedges. 463 proven. 4 refuted. 0 times theorem prover too weak. 863 trivial. 0 not checked. [2025-02-07 21:26:39,665 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 21:26:39,872 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 23 [2025-02-07 21:26:39,875 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 31 [2025-02-07 21:26:40,183 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2025-02-07 21:26:40,185 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 22 [2025-02-07 21:26:40,225 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2025-02-07 21:26:40,227 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 22 [2025-02-07 21:26:40,278 INFO L134 CoverageAnalysis]: Checked inductivity of 1330 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1326 trivial. 0 not checked. [2025-02-07 21:26:40,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1862138501] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 21:26:40,278 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 21:26:40,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15, 9] total 34 [2025-02-07 21:26:40,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603514067] [2025-02-07 21:26:40,279 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 21:26:40,279 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-02-07 21:26:40,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 21:26:40,280 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-02-07 21:26:40,280 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=986, Unknown=3, NotChecked=0, Total=1122 [2025-02-07 21:26:40,280 INFO L87 Difference]: Start difference. First operand 336 states and 439 transitions. Second operand has 34 states, 31 states have (on average 4.451612903225806) internal successors, (138), 34 states have internal predecessors, (138), 19 states have call successors, (74), 11 states have call predecessors, (74), 14 states have return successors, (74), 17 states have call predecessors, (74), 19 states have call successors, (74) [2025-02-07 21:26:42,445 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-07 21:26:43,583 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-02-07 21:26:47,974 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0]