./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc 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-mthreaded-reduced/pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c -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 d33c1f18af8463c39a69fa160e98d9892e84f7d8b10911d6b0c55a462978880c --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 16:38:22,314 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 16:38:22,372 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 16:38:22,378 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 16:38:22,378 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 16:38:22,400 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 16:38:22,403 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 16:38:22,403 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 16:38:22,403 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 16:38:22,403 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 16:38:22,404 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 16:38:22,404 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 16:38:22,404 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 16:38:22,404 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 16:38:22,405 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 16:38:22,405 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 16:38:22,405 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 16:38:22,405 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 16:38:22,405 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 16:38:22,405 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 16:38:22,405 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 16:38:22,405 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 16:38:22,405 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 16:38:22,405 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 16:38:22,405 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 16:38:22,405 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 16:38:22,405 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 16:38:22,405 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 16:38:22,405 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 16:38:22,405 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 16:38:22,406 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 16:38:22,406 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 16:38:22,406 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 16:38:22,406 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 16:38:22,406 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 16:38:22,406 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 16:38:22,406 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 16:38:22,406 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 16:38:22,406 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 16:38:22,406 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 16:38:22,406 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 16:38:22,406 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 16:38:22,406 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 16:38:22,406 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 -> d33c1f18af8463c39a69fa160e98d9892e84f7d8b10911d6b0c55a462978880c [2025-02-05 16:38:22,675 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 16:38:22,685 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 16:38:22,686 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 16:38:22,687 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 16:38:22,687 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 16:38:22,688 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2025-02-05 16:38:23,904 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1e57ec305/0417c5d67d3e4c6eab4b4c2767c5cb7b/FLAGca48cff4c [2025-02-05 16:38:24,196 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 16:38:24,197 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2025-02-05 16:38:24,204 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1e57ec305/0417c5d67d3e4c6eab4b4c2767c5cb7b/FLAGca48cff4c [2025-02-05 16:38:24,216 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1e57ec305/0417c5d67d3e4c6eab4b4c2767c5cb7b [2025-02-05 16:38:24,218 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 16:38:24,219 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 16:38:24,223 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 16:38:24,223 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 16:38:24,226 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 16:38:24,226 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 04:38:24" (1/1) ... [2025-02-05 16:38:24,228 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@68fad818 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:38:24, skipping insertion in model container [2025-02-05 16:38:24,228 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 04:38:24" (1/1) ... [2025-02-05 16:38:24,246 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 16:38:24,353 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-mthreaded-reduced/pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c[4107,4120] [2025-02-05 16:38:24,363 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 16:38:24,377 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 16:38:24,395 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-mthreaded-reduced/pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c[4107,4120] [2025-02-05 16:38:24,406 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 16:38:24,423 INFO L204 MainTranslator]: Completed translation [2025-02-05 16:38:24,424 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:38:24 WrapperNode [2025-02-05 16:38:24,424 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 16:38:24,425 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 16:38:24,425 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 16:38:24,425 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 16:38:24,431 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:38:24" (1/1) ... [2025-02-05 16:38:24,438 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:38:24" (1/1) ... [2025-02-05 16:38:24,458 INFO L138 Inliner]: procedures = 23, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 291 [2025-02-05 16:38:24,458 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 16:38:24,459 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 16:38:24,459 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 16:38:24,459 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 16:38:24,465 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:38:24" (1/1) ... [2025-02-05 16:38:24,466 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:38:24" (1/1) ... [2025-02-05 16:38:24,471 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:38:24" (1/1) ... [2025-02-05 16:38:24,489 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-05 16:38:24,494 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:38:24" (1/1) ... [2025-02-05 16:38:24,494 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:38:24" (1/1) ... [2025-02-05 16:38:24,498 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:38:24" (1/1) ... [2025-02-05 16:38:24,502 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:38:24" (1/1) ... [2025-02-05 16:38:24,503 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:38:24" (1/1) ... [2025-02-05 16:38:24,504 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:38:24" (1/1) ... [2025-02-05 16:38:24,505 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 16:38:24,510 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 16:38:24,510 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 16:38:24,510 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 16:38:24,511 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:38:24" (1/1) ... [2025-02-05 16:38:24,519 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 16:38:24,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:38:24,542 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-05 16:38:24,546 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-05 16:38:24,566 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 16:38:24,567 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 16:38:24,567 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 16:38:24,567 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 16:38:24,656 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 16:38:24,658 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 16:38:24,919 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L308: havoc main_~node2____CPAchecker_TMP_0~0#1; [2025-02-05 16:38:24,919 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L143: havoc main_~node2__m2~0#1; [2025-02-05 16:38:24,920 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L359: havoc main_~node1____CPAchecker_TMP_0~0#1; [2025-02-05 16:38:24,920 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L194: havoc main_~__tmp_1~0#1, main_~assert__arg~0#1;havoc main_~check__tmp~0#1; [2025-02-05 16:38:24,920 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L263: havoc main_~node3____CPAchecker_TMP_0~0#1; [2025-02-05 16:38:24,920 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L123: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2025-02-05 16:38:24,920 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L158: havoc main_~node3__m3~0#1; [2025-02-05 16:38:24,931 INFO L? ?]: Removed 29 outVars from TransFormulas that were not future-live. [2025-02-05 16:38:24,932 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 16:38:24,938 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 16:38:24,938 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 16:38:24,938 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 04:38:24 BoogieIcfgContainer [2025-02-05 16:38:24,939 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 16:38:24,942 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 16:38:24,943 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 16:38:24,947 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 16:38:24,947 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 04:38:24" (1/3) ... [2025-02-05 16:38:24,947 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69fc5d53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 04:38:24, skipping insertion in model container [2025-02-05 16:38:24,948 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:38:24" (2/3) ... [2025-02-05 16:38:24,948 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69fc5d53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 04:38:24, skipping insertion in model container [2025-02-05 16:38:24,948 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 04:38:24" (3/3) ... [2025-02-05 16:38:24,950 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2025-02-05 16:38:24,961 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 16:38:24,962 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c that has 1 procedures, 64 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-02-05 16:38:25,001 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 16:38:25,009 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;@5d42cfef, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 16:38:25,009 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 16:38:25,012 INFO L276 IsEmpty]: Start isEmpty. Operand has 64 states, 62 states have (on average 1.6935483870967742) internal successors, (105), 63 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:38:25,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-02-05 16:38:25,019 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:38:25,019 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 16:38:25,019 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:38:25,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:38:25,027 INFO L85 PathProgramCache]: Analyzing trace with hash -1344899626, now seen corresponding path program 1 times [2025-02-05 16:38:25,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:38:25,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456404391] [2025-02-05 16:38:25,033 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:38:25,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:38:25,092 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-02-05 16:38:25,115 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-02-05 16:38:25,116 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:38:25,116 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:38:25,244 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:38:25,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:38:25,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456404391] [2025-02-05 16:38:25,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1456404391] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:38:25,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:38:25,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:38:25,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759411991] [2025-02-05 16:38:25,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:38:25,250 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:38:25,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:38:25,265 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:38:25,265 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:38:25,268 INFO L87 Difference]: Start difference. First operand has 64 states, 62 states have (on average 1.6935483870967742) internal successors, (105), 63 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:38:25,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:38:25,307 INFO L93 Difference]: Finished difference Result 146 states and 230 transitions. [2025-02-05 16:38:25,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:38:25,310 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2025-02-05 16:38:25,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:38:25,318 INFO L225 Difference]: With dead ends: 146 [2025-02-05 16:38:25,318 INFO L226 Difference]: Without dead ends: 95 [2025-02-05 16:38:25,321 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-05 16:38:25,323 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 61 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:38:25,323 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 211 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:38:25,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2025-02-05 16:38:25,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 93. [2025-02-05 16:38:25,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 92 states have (on average 1.4782608695652173) internal successors, (136), 92 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:38:25,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 136 transitions. [2025-02-05 16:38:25,346 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 136 transitions. Word has length 37 [2025-02-05 16:38:25,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:38:25,346 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 136 transitions. [2025-02-05 16:38:25,346 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:38:25,347 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 136 transitions. [2025-02-05 16:38:25,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-02-05 16:38:25,347 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:38:25,347 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 16:38:25,348 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 16:38:25,348 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:38:25,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:38:25,348 INFO L85 PathProgramCache]: Analyzing trace with hash -1859915076, now seen corresponding path program 1 times [2025-02-05 16:38:25,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:38:25,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129623805] [2025-02-05 16:38:25,349 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:38:25,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:38:25,365 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-02-05 16:38:25,380 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-02-05 16:38:25,381 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:38:25,381 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:38:25,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:38:25,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:38:25,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129623805] [2025-02-05 16:38:25,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2129623805] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:38:25,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:38:25,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:38:25,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215496738] [2025-02-05 16:38:25,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:38:25,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:38:25,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:38:25,439 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:38:25,439 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:38:25,440 INFO L87 Difference]: Start difference. First operand 93 states and 136 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:38:25,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:38:25,462 INFO L93 Difference]: Finished difference Result 225 states and 344 transitions. [2025-02-05 16:38:25,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:38:25,465 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2025-02-05 16:38:25,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:38:25,466 INFO L225 Difference]: With dead ends: 225 [2025-02-05 16:38:25,466 INFO L226 Difference]: Without dead ends: 151 [2025-02-05 16:38:25,466 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-05 16:38:25,467 INFO L435 NwaCegarLoop]: 107 mSDtfsCounter, 46 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:38:25,467 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 176 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:38:25,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2025-02-05 16:38:25,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 149. [2025-02-05 16:38:25,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 148 states have (on average 1.5135135135135136) internal successors, (224), 148 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:38:25,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 224 transitions. [2025-02-05 16:38:25,482 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 224 transitions. Word has length 38 [2025-02-05 16:38:25,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:38:25,482 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 224 transitions. [2025-02-05 16:38:25,483 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:38:25,483 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 224 transitions. [2025-02-05 16:38:25,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-02-05 16:38:25,483 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:38:25,483 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 16:38:25,483 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 16:38:25,484 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:38:25,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:38:25,484 INFO L85 PathProgramCache]: Analyzing trace with hash -37573565, now seen corresponding path program 1 times [2025-02-05 16:38:25,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:38:25,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996190755] [2025-02-05 16:38:25,484 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:38:25,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:38:25,511 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-02-05 16:38:25,521 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-02-05 16:38:25,521 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:38:25,521 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:38:25,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:38:25,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:38:25,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996190755] [2025-02-05 16:38:25,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [996190755] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:38:25,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:38:25,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 16:38:25,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028822765] [2025-02-05 16:38:25,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:38:25,659 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:38:25,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:38:25,659 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:38:25,659 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:38:25,659 INFO L87 Difference]: Start difference. First operand 149 states and 224 transitions. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:38:25,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:38:25,780 INFO L93 Difference]: Finished difference Result 929 states and 1454 transitions. [2025-02-05 16:38:25,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 16:38:25,781 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2025-02-05 16:38:25,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:38:25,785 INFO L225 Difference]: With dead ends: 929 [2025-02-05 16:38:25,785 INFO L226 Difference]: Without dead ends: 799 [2025-02-05 16:38:25,788 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-02-05 16:38:25,788 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 368 mSDsluCounter, 530 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 368 SdHoareTripleChecker+Valid, 611 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:38:25,789 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [368 Valid, 611 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:38:25,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 799 states. [2025-02-05 16:38:25,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 799 to 277. [2025-02-05 16:38:25,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 276 states have (on average 1.5217391304347827) internal successors, (420), 276 states have internal predecessors, (420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:38:25,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 420 transitions. [2025-02-05 16:38:25,809 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 420 transitions. Word has length 39 [2025-02-05 16:38:25,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:38:25,809 INFO L471 AbstractCegarLoop]: Abstraction has 277 states and 420 transitions. [2025-02-05 16:38:25,809 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:38:25,809 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 420 transitions. [2025-02-05 16:38:25,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-02-05 16:38:25,810 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:38:25,810 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 16:38:25,810 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 16:38:25,810 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:38:25,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:38:25,811 INFO L85 PathProgramCache]: Analyzing trace with hash -1709576148, now seen corresponding path program 1 times [2025-02-05 16:38:25,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:38:25,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544489337] [2025-02-05 16:38:25,811 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:38:25,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:38:25,821 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-02-05 16:38:25,826 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-02-05 16:38:25,827 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:38:25,827 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:38:25,891 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:38:25,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:38:25,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544489337] [2025-02-05 16:38:25,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [544489337] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:38:25,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:38:25,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:38:25,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33834244] [2025-02-05 16:38:25,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:38:25,892 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:38:25,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:38:25,892 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:38:25,892 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:38:25,893 INFO L87 Difference]: Start difference. First operand 277 states and 420 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:38:25,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:38:25,920 INFO L93 Difference]: Finished difference Result 749 states and 1146 transitions. [2025-02-05 16:38:25,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:38:25,921 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2025-02-05 16:38:25,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:38:25,923 INFO L225 Difference]: With dead ends: 749 [2025-02-05 16:38:25,923 INFO L226 Difference]: Without dead ends: 491 [2025-02-05 16:38:25,924 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-05 16:38:25,924 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 36 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:38:25,924 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 141 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:38:25,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 491 states. [2025-02-05 16:38:25,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 491 to 481. [2025-02-05 16:38:25,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 481 states, 480 states have (on average 1.4916666666666667) internal successors, (716), 480 states have internal predecessors, (716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:38:25,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 481 states and 716 transitions. [2025-02-05 16:38:25,950 INFO L78 Accepts]: Start accepts. Automaton has 481 states and 716 transitions. Word has length 41 [2025-02-05 16:38:25,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:38:25,951 INFO L471 AbstractCegarLoop]: Abstraction has 481 states and 716 transitions. [2025-02-05 16:38:25,951 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:38:25,951 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 716 transitions. [2025-02-05 16:38:25,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-02-05 16:38:25,952 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:38:25,952 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 16:38:25,952 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 16:38:25,952 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:38:25,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:38:25,952 INFO L85 PathProgramCache]: Analyzing trace with hash -1708414299, now seen corresponding path program 1 times [2025-02-05 16:38:25,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:38:25,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350456147] [2025-02-05 16:38:25,953 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:38:25,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:38:25,962 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-02-05 16:38:25,972 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-02-05 16:38:25,972 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:38:25,972 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:38:26,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:38:26,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:38:26,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350456147] [2025-02-05 16:38:26,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [350456147] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:38:26,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:38:26,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 16:38:26,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742888191] [2025-02-05 16:38:26,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:38:26,152 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:38:26,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:38:26,152 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:38:26,152 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:38:26,153 INFO L87 Difference]: Start difference. First operand 481 states and 716 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:38:26,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:38:26,215 INFO L93 Difference]: Finished difference Result 945 states and 1414 transitions. [2025-02-05 16:38:26,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:38:26,215 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2025-02-05 16:38:26,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:38:26,217 INFO L225 Difference]: With dead ends: 945 [2025-02-05 16:38:26,217 INFO L226 Difference]: Without dead ends: 483 [2025-02-05 16:38:26,217 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-02-05 16:38:26,218 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 46 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:38:26,218 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 267 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:38:26,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states. [2025-02-05 16:38:26,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 481. [2025-02-05 16:38:26,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 481 states, 480 states have (on average 1.475) internal successors, (708), 480 states have internal predecessors, (708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:38:26,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 481 states and 708 transitions. [2025-02-05 16:38:26,234 INFO L78 Accepts]: Start accepts. Automaton has 481 states and 708 transitions. Word has length 41 [2025-02-05 16:38:26,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:38:26,235 INFO L471 AbstractCegarLoop]: Abstraction has 481 states and 708 transitions. [2025-02-05 16:38:26,235 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:38:26,235 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 708 transitions. [2025-02-05 16:38:26,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-02-05 16:38:26,237 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:38:26,238 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 16:38:26,238 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 16:38:26,238 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:38:26,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:38:26,238 INFO L85 PathProgramCache]: Analyzing trace with hash -1420280412, now seen corresponding path program 1 times [2025-02-05 16:38:26,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:38:26,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582780512] [2025-02-05 16:38:26,238 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:38:26,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:38:26,253 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-02-05 16:38:26,271 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-02-05 16:38:26,272 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:38:26,272 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:38:26,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:38:26,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:38:26,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582780512] [2025-02-05 16:38:26,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [582780512] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:38:26,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:38:26,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 16:38:26,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529838107] [2025-02-05 16:38:26,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:38:26,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:38:26,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:38:26,407 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:38:26,407 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:38:26,407 INFO L87 Difference]: Start difference. First operand 481 states and 708 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:38:26,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:38:26,426 INFO L93 Difference]: Finished difference Result 499 states and 733 transitions. [2025-02-05 16:38:26,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:38:26,427 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2025-02-05 16:38:26,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:38:26,428 INFO L225 Difference]: With dead ends: 499 [2025-02-05 16:38:26,428 INFO L226 Difference]: Without dead ends: 497 [2025-02-05 16:38:26,429 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:38:26,429 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 0 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 317 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:38:26,429 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 317 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:38:26,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 497 states. [2025-02-05 16:38:26,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 497 to 497. [2025-02-05 16:38:26,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 497 states, 496 states have (on average 1.4516129032258065) internal successors, (720), 496 states have internal predecessors, (720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:38:26,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 497 states to 497 states and 720 transitions. [2025-02-05 16:38:26,450 INFO L78 Accepts]: Start accepts. Automaton has 497 states and 720 transitions. Word has length 42 [2025-02-05 16:38:26,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:38:26,450 INFO L471 AbstractCegarLoop]: Abstraction has 497 states and 720 transitions. [2025-02-05 16:38:26,450 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:38:26,450 INFO L276 IsEmpty]: Start isEmpty. Operand 497 states and 720 transitions. [2025-02-05 16:38:26,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-02-05 16:38:26,451 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:38:26,451 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 16:38:26,451 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 16:38:26,451 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:38:26,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:38:26,452 INFO L85 PathProgramCache]: Analyzing trace with hash 1539887404, now seen corresponding path program 1 times [2025-02-05 16:38:26,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:38:26,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854341772] [2025-02-05 16:38:26,452 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:38:26,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:38:26,460 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-02-05 16:38:26,464 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-02-05 16:38:26,464 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:38:26,464 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:38:26,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:38:26,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:38:26,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854341772] [2025-02-05 16:38:26,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [854341772] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:38:26,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:38:26,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:38:26,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361650188] [2025-02-05 16:38:26,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:38:26,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:38:26,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:38:26,487 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:38:26,487 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:38:26,487 INFO L87 Difference]: Start difference. First operand 497 states and 720 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:38:26,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:38:26,500 INFO L93 Difference]: Finished difference Result 968 states and 1422 transitions. [2025-02-05 16:38:26,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:38:26,501 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2025-02-05 16:38:26,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:38:26,503 INFO L225 Difference]: With dead ends: 968 [2025-02-05 16:38:26,503 INFO L226 Difference]: Without dead ends: 693 [2025-02-05 16:38:26,503 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-05 16:38:26,504 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 53 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:38:26,504 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 188 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:38:26,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 693 states. [2025-02-05 16:38:26,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 693 to 691. [2025-02-05 16:38:26,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 691 states, 690 states have (on average 1.4463768115942028) internal successors, (998), 690 states have internal predecessors, (998), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:38:26,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 691 states to 691 states and 998 transitions. [2025-02-05 16:38:26,515 INFO L78 Accepts]: Start accepts. Automaton has 691 states and 998 transitions. Word has length 42 [2025-02-05 16:38:26,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:38:26,515 INFO L471 AbstractCegarLoop]: Abstraction has 691 states and 998 transitions. [2025-02-05 16:38:26,516 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:38:26,516 INFO L276 IsEmpty]: Start isEmpty. Operand 691 states and 998 transitions. [2025-02-05 16:38:26,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-02-05 16:38:26,516 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:38:26,516 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 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] [2025-02-05 16:38:26,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 16:38:26,516 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:38:26,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:38:26,517 INFO L85 PathProgramCache]: Analyzing trace with hash 547068278, now seen corresponding path program 1 times [2025-02-05 16:38:26,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:38:26,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828550630] [2025-02-05 16:38:26,517 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:38:26,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:38:26,526 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-02-05 16:38:26,532 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-02-05 16:38:26,532 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:38:26,532 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:38:26,650 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-02-05 16:38:26,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:38:26,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828550630] [2025-02-05 16:38:26,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1828550630] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:38:26,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:38:26,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 16:38:26,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182090157] [2025-02-05 16:38:26,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:38:26,650 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:38:26,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:38:26,651 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:38:26,651 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:38:26,651 INFO L87 Difference]: Start difference. First operand 691 states and 998 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:38:26,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:38:26,726 INFO L93 Difference]: Finished difference Result 2835 states and 4114 transitions. [2025-02-05 16:38:26,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:38:26,727 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2025-02-05 16:38:26,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:38:26,734 INFO L225 Difference]: With dead ends: 2835 [2025-02-05 16:38:26,735 INFO L226 Difference]: Without dead ends: 2165 [2025-02-05 16:38:26,736 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-02-05 16:38:26,737 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 224 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 379 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:38:26,737 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 379 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:38:26,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2165 states. [2025-02-05 16:38:26,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2165 to 1359. [2025-02-05 16:38:26,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1359 states, 1358 states have (on average 1.4447717231222386) internal successors, (1962), 1358 states have internal predecessors, (1962), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:38:26,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1359 states to 1359 states and 1962 transitions. [2025-02-05 16:38:26,775 INFO L78 Accepts]: Start accepts. Automaton has 1359 states and 1962 transitions. Word has length 61 [2025-02-05 16:38:26,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:38:26,775 INFO L471 AbstractCegarLoop]: Abstraction has 1359 states and 1962 transitions. [2025-02-05 16:38:26,775 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:38:26,775 INFO L276 IsEmpty]: Start isEmpty. Operand 1359 states and 1962 transitions. [2025-02-05 16:38:26,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-02-05 16:38:26,776 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:38:26,776 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 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] [2025-02-05 16:38:26,776 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 16:38:26,776 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:38:26,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:38:26,777 INFO L85 PathProgramCache]: Analyzing trace with hash 754912534, now seen corresponding path program 1 times [2025-02-05 16:38:26,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:38:26,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911620608] [2025-02-05 16:38:26,777 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:38:26,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:38:26,797 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-02-05 16:38:26,804 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-02-05 16:38:26,804 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:38:26,804 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:38:26,885 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-05 16:38:26,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:38:26,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911620608] [2025-02-05 16:38:26,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911620608] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:38:26,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:38:26,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 16:38:26,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107999919] [2025-02-05 16:38:26,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:38:26,887 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:38:26,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:38:26,887 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:38:26,887 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:38:26,888 INFO L87 Difference]: Start difference. First operand 1359 states and 1962 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:38:26,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:38:26,956 INFO L93 Difference]: Finished difference Result 3503 states and 5078 transitions. [2025-02-05 16:38:26,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:38:26,956 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2025-02-05 16:38:26,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:38:26,963 INFO L225 Difference]: With dead ends: 3503 [2025-02-05 16:38:26,963 INFO L226 Difference]: Without dead ends: 2833 [2025-02-05 16:38:26,966 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-02-05 16:38:26,967 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 231 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 231 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:38:26,967 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [231 Valid, 365 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:38:26,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2833 states. [2025-02-05 16:38:26,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2833 to 2363. [2025-02-05 16:38:27,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2363 states, 2362 states have (on average 1.4386113463166808) internal successors, (3398), 2362 states have internal predecessors, (3398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:38:27,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2363 states to 2363 states and 3398 transitions. [2025-02-05 16:38:27,009 INFO L78 Accepts]: Start accepts. Automaton has 2363 states and 3398 transitions. Word has length 61 [2025-02-05 16:38:27,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:38:27,010 INFO L471 AbstractCegarLoop]: Abstraction has 2363 states and 3398 transitions. [2025-02-05 16:38:27,010 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:38:27,010 INFO L276 IsEmpty]: Start isEmpty. Operand 2363 states and 3398 transitions. [2025-02-05 16:38:27,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-02-05 16:38:27,011 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:38:27,011 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-05 16:38:27,011 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 16:38:27,011 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:38:27,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:38:27,011 INFO L85 PathProgramCache]: Analyzing trace with hash 1180042331, now seen corresponding path program 1 times [2025-02-05 16:38:27,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:38:27,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383422502] [2025-02-05 16:38:27,012 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:38:27,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:38:27,025 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-02-05 16:38:27,032 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-02-05 16:38:27,032 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:38:27,032 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:38:27,108 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-05 16:38:27,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:38:27,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383422502] [2025-02-05 16:38:27,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1383422502] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:38:27,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:38:27,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 16:38:27,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821453966] [2025-02-05 16:38:27,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:38:27,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:38:27,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:38:27,110 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:38:27,110 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:38:27,110 INFO L87 Difference]: Start difference. First operand 2363 states and 3398 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:38:27,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:38:27,168 INFO L93 Difference]: Finished difference Result 3763 states and 5466 transitions. [2025-02-05 16:38:27,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:38:27,168 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2025-02-05 16:38:27,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:38:27,176 INFO L225 Difference]: With dead ends: 3763 [2025-02-05 16:38:27,176 INFO L226 Difference]: Without dead ends: 3297 [2025-02-05 16:38:27,177 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-02-05 16:38:27,178 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 219 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 394 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:38:27,178 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 394 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:38:27,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3297 states. [2025-02-05 16:38:27,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3297 to 2827. [2025-02-05 16:38:27,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2827 states, 2826 states have (on average 1.443029016277424) internal successors, (4078), 2826 states have internal predecessors, (4078), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:38:27,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2827 states to 2827 states and 4078 transitions. [2025-02-05 16:38:27,237 INFO L78 Accepts]: Start accepts. Automaton has 2827 states and 4078 transitions. Word has length 62 [2025-02-05 16:38:27,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:38:27,237 INFO L471 AbstractCegarLoop]: Abstraction has 2827 states and 4078 transitions. [2025-02-05 16:38:27,237 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:38:27,237 INFO L276 IsEmpty]: Start isEmpty. Operand 2827 states and 4078 transitions. [2025-02-05 16:38:27,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-02-05 16:38:27,238 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:38:27,238 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 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] [2025-02-05 16:38:27,238 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 16:38:27,238 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:38:27,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:38:27,239 INFO L85 PathProgramCache]: Analyzing trace with hash 511764370, now seen corresponding path program 1 times [2025-02-05 16:38:27,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:38:27,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734357454] [2025-02-05 16:38:27,239 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:38:27,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:38:27,249 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-02-05 16:38:27,258 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-02-05 16:38:27,258 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:38:27,258 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:38:27,307 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:38:27,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:38:27,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734357454] [2025-02-05 16:38:27,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [734357454] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:38:27,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:38:27,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:38:27,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994566768] [2025-02-05 16:38:27,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:38:27,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:38:27,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:38:27,308 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:38:27,308 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:38:27,309 INFO L87 Difference]: Start difference. First operand 2827 states and 4078 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:38:27,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:38:27,334 INFO L93 Difference]: Finished difference Result 4945 states and 7173 transitions. [2025-02-05 16:38:27,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:38:27,334 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2025-02-05 16:38:27,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:38:27,339 INFO L225 Difference]: With dead ends: 4945 [2025-02-05 16:38:27,339 INFO L226 Difference]: Without dead ends: 2139 [2025-02-05 16:38:27,342 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-05 16:38:27,343 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 40 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 178 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-05 16:38:27,343 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 178 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:38:27,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2139 states. [2025-02-05 16:38:27,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2139 to 2137. [2025-02-05 16:38:27,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2137 states, 2136 states have (on average 1.4410112359550562) internal successors, (3078), 2136 states have internal predecessors, (3078), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:38:27,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2137 states to 2137 states and 3078 transitions. [2025-02-05 16:38:27,376 INFO L78 Accepts]: Start accepts. Automaton has 2137 states and 3078 transitions. Word has length 63 [2025-02-05 16:38:27,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:38:27,377 INFO L471 AbstractCegarLoop]: Abstraction has 2137 states and 3078 transitions. [2025-02-05 16:38:27,377 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:38:27,377 INFO L276 IsEmpty]: Start isEmpty. Operand 2137 states and 3078 transitions. [2025-02-05 16:38:27,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-02-05 16:38:27,378 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:38:27,378 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-05 16:38:27,378 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 16:38:27,378 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:38:27,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:38:27,379 INFO L85 PathProgramCache]: Analyzing trace with hash -1105901695, now seen corresponding path program 1 times [2025-02-05 16:38:27,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:38:27,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489206066] [2025-02-05 16:38:27,379 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:38:27,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:38:27,388 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-02-05 16:38:27,399 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-02-05 16:38:27,399 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:38:27,400 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:38:27,749 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:38:27,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:38:27,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489206066] [2025-02-05 16:38:27,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1489206066] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 16:38:27,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [690194587] [2025-02-05 16:38:27,749 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:38:27,749 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:38:27,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:38:27,752 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-05 16:38:27,753 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-05 16:38:27,806 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-02-05 16:38:27,839 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-02-05 16:38:27,839 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:38:27,839 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:38:27,844 INFO L256 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-02-05 16:38:27,848 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 16:38:28,049 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-05 16:38:28,050 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 16:38:28,209 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-05 16:38:28,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [690194587] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 16:38:28,209 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 16:38:28,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 5, 4] total 19 [2025-02-05 16:38:28,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145842649] [2025-02-05 16:38:28,210 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 16:38:28,210 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-02-05 16:38:28,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:38:28,211 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-02-05 16:38:28,211 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2025-02-05 16:38:28,211 INFO L87 Difference]: Start difference. First operand 2137 states and 3078 transitions. Second operand has 19 states, 19 states have (on average 9.210526315789474) internal successors, (175), 19 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:38:30,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:38:30,048 INFO L93 Difference]: Finished difference Result 16285 states and 23116 transitions. [2025-02-05 16:38:30,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2025-02-05 16:38:30,049 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 9.210526315789474) internal successors, (175), 19 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2025-02-05 16:38:30,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:38:30,093 INFO L225 Difference]: With dead ends: 16285 [2025-02-05 16:38:30,093 INFO L226 Difference]: Without dead ends: 14171 [2025-02-05 16:38:30,102 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2064 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1082, Invalid=5238, Unknown=0, NotChecked=0, Total=6320 [2025-02-05 16:38:30,103 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 2662 mSDsluCounter, 674 mSDsCounter, 0 mSdLazyCounter, 1020 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2662 SdHoareTripleChecker+Valid, 764 SdHoareTripleChecker+Invalid, 1094 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 1020 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 16:38:30,104 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2662 Valid, 764 Invalid, 1094 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 1020 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 16:38:30,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14171 states. [2025-02-05 16:38:30,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14171 to 11203. [2025-02-05 16:38:30,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11203 states, 11202 states have (on average 1.3713622567398678) internal successors, (15362), 11202 states have internal predecessors, (15362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:38:30,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11203 states to 11203 states and 15362 transitions. [2025-02-05 16:38:30,309 INFO L78 Accepts]: Start accepts. Automaton has 11203 states and 15362 transitions. Word has length 63 [2025-02-05 16:38:30,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:38:30,309 INFO L471 AbstractCegarLoop]: Abstraction has 11203 states and 15362 transitions. [2025-02-05 16:38:30,309 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 9.210526315789474) internal successors, (175), 19 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:38:30,309 INFO L276 IsEmpty]: Start isEmpty. Operand 11203 states and 15362 transitions. [2025-02-05 16:38:30,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-02-05 16:38:30,311 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:38:30,311 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-05 16:38:30,318 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-05 16:38:30,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-02-05 16:38:30,515 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:38:30,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:38:30,518 INFO L85 PathProgramCache]: Analyzing trace with hash -1293370985, now seen corresponding path program 1 times [2025-02-05 16:38:30,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:38:30,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438235071] [2025-02-05 16:38:30,518 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:38:30,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:38:30,545 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-02-05 16:38:30,583 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-02-05 16:38:30,583 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:38:30,583 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:38:30,980 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:38:30,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:38:30,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438235071] [2025-02-05 16:38:30,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [438235071] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 16:38:30,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1470919315] [2025-02-05 16:38:30,980 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:38:30,980 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:38:30,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:38:30,982 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-05 16:38:30,983 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-05 16:38:31,024 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-02-05 16:38:31,051 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-02-05 16:38:31,051 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:38:31,051 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:38:31,052 INFO L256 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-02-05 16:38:31,054 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 16:38:31,818 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:38:31,818 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 16:38:32,286 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:38:32,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1470919315] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 16:38:32,286 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 16:38:32,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12, 12] total 30 [2025-02-05 16:38:32,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758736812] [2025-02-05 16:38:32,286 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 16:38:32,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-02-05 16:38:32,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:38:32,287 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-02-05 16:38:32,287 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=781, Unknown=0, NotChecked=0, Total=870 [2025-02-05 16:38:32,287 INFO L87 Difference]: Start difference. First operand 11203 states and 15362 transitions. Second operand has 30 states, 30 states have (on average 5.833333333333333) internal successors, (175), 30 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:38:44,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:38:44,428 INFO L93 Difference]: Finished difference Result 113871 states and 157887 transitions. [2025-02-05 16:38:44,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 291 states. [2025-02-05 16:38:44,429 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 5.833333333333333) internal successors, (175), 30 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2025-02-05 16:38:44,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:38:44,797 INFO L225 Difference]: With dead ends: 113871 [2025-02-05 16:38:44,797 INFO L226 Difference]: Without dead ends: 102702 [2025-02-05 16:38:44,839 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 425 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 317 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43834 ImplicationChecksByTransitivity, 10.4s TimeCoverageRelationStatistics Valid=12022, Invalid=89420, Unknown=0, NotChecked=0, Total=101442 [2025-02-05 16:38:44,839 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 8564 mSDsluCounter, 1597 mSDsCounter, 0 mSdLazyCounter, 2553 mSolverCounterSat, 125 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8564 SdHoareTripleChecker+Valid, 1675 SdHoareTripleChecker+Invalid, 2678 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 125 IncrementalHoareTripleChecker+Valid, 2553 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-02-05 16:38:44,840 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8564 Valid, 1675 Invalid, 2678 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [125 Valid, 2553 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-02-05 16:38:44,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102702 states. [2025-02-05 16:38:45,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102702 to 54818. [2025-02-05 16:38:45,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54818 states, 54817 states have (on average 1.3661272962767024) internal successors, (74887), 54817 states have internal predecessors, (74887), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:38:45,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54818 states to 54818 states and 74887 transitions. [2025-02-05 16:38:45,838 INFO L78 Accepts]: Start accepts. Automaton has 54818 states and 74887 transitions. Word has length 64 [2025-02-05 16:38:45,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:38:45,838 INFO L471 AbstractCegarLoop]: Abstraction has 54818 states and 74887 transitions. [2025-02-05 16:38:45,838 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 5.833333333333333) internal successors, (175), 30 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:38:45,838 INFO L276 IsEmpty]: Start isEmpty. Operand 54818 states and 74887 transitions. [2025-02-05 16:38:45,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-02-05 16:38:45,842 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:38:45,842 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-05 16:38:45,848 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-05 16:38:46,043 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:38:46,044 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:38:46,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:38:46,045 INFO L85 PathProgramCache]: Analyzing trace with hash -1916335568, now seen corresponding path program 1 times [2025-02-05 16:38:46,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:38:46,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904731264] [2025-02-05 16:38:46,049 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:38:46,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:38:46,056 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-02-05 16:38:46,061 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-02-05 16:38:46,061 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:38:46,061 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:38:46,080 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-02-05 16:38:46,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:38:46,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904731264] [2025-02-05 16:38:46,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1904731264] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:38:46,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:38:46,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:38:46,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863614365] [2025-02-05 16:38:46,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:38:46,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:38:46,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:38:46,083 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:38:46,083 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:38:46,084 INFO L87 Difference]: Start difference. First operand 54818 states and 74887 transitions. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:38:46,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:38:46,520 INFO L93 Difference]: Finished difference Result 95352 states and 130353 transitions. [2025-02-05 16:38:46,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:38:46,520 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2025-02-05 16:38:46,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:38:46,568 INFO L225 Difference]: With dead ends: 95352 [2025-02-05 16:38:46,568 INFO L226 Difference]: Without dead ends: 40641 [2025-02-05 16:38:46,601 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-05 16:38:46,602 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 60 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:38:46,602 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 109 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:38:46,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40641 states. [2025-02-05 16:38:47,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40641 to 40641. [2025-02-05 16:38:47,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40641 states, 40640 states have (on average 1.3505413385826772) internal successors, (54886), 40640 states have internal predecessors, (54886), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:38:47,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40641 states to 40641 states and 54886 transitions. [2025-02-05 16:38:47,123 INFO L78 Accepts]: Start accepts. Automaton has 40641 states and 54886 transitions. Word has length 65 [2025-02-05 16:38:47,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:38:47,124 INFO L471 AbstractCegarLoop]: Abstraction has 40641 states and 54886 transitions. [2025-02-05 16:38:47,124 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:38:47,124 INFO L276 IsEmpty]: Start isEmpty. Operand 40641 states and 54886 transitions. [2025-02-05 16:38:47,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-02-05 16:38:47,124 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:38:47,125 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-05 16:38:47,125 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 16:38:47,125 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:38:47,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:38:47,125 INFO L85 PathProgramCache]: Analyzing trace with hash 580925875, now seen corresponding path program 1 times [2025-02-05 16:38:47,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:38:47,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675362716] [2025-02-05 16:38:47,126 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:38:47,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:38:47,135 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-02-05 16:38:47,158 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-02-05 16:38:47,160 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:38:47,160 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:38:47,694 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:38:47,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:38:47,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675362716] [2025-02-05 16:38:47,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [675362716] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 16:38:47,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [247368077] [2025-02-05 16:38:47,694 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:38:47,695 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:38:47,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:38:47,696 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-05 16:38:47,698 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-05 16:38:47,745 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-02-05 16:38:47,772 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-02-05 16:38:47,772 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:38:47,772 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:38:47,773 INFO L256 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-02-05 16:38:47,775 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 16:38:49,751 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:38:49,752 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 16:38:50,913 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:38:50,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [247368077] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 16:38:50,913 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 16:38:50,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 18, 16] total 43 [2025-02-05 16:38:50,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896149968] [2025-02-05 16:38:50,913 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 16:38:50,914 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2025-02-05 16:38:50,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:38:50,914 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2025-02-05 16:38:50,914 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=242, Invalid=1564, Unknown=0, NotChecked=0, Total=1806 [2025-02-05 16:38:50,914 INFO L87 Difference]: Start difference. First operand 40641 states and 54886 transitions. Second operand has 43 states, 43 states have (on average 3.953488372093023) internal successors, (170), 43 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:39:11,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:39:11,237 INFO L93 Difference]: Finished difference Result 336582 states and 450042 transitions. [2025-02-05 16:39:11,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 269 states. [2025-02-05 16:39:11,237 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 3.953488372093023) internal successors, (170), 43 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2025-02-05 16:39:11,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:39:11,831 INFO L225 Difference]: With dead ends: 336582 [2025-02-05 16:39:11,831 INFO L226 Difference]: Without dead ends: 307240 [2025-02-05 16:39:11,891 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 409 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 307 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39430 ImplicationChecksByTransitivity, 18.6s TimeCoverageRelationStatistics Valid=14202, Invalid=80970, Unknown=0, NotChecked=0, Total=95172 [2025-02-05 16:39:11,892 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 7135 mSDsluCounter, 2108 mSDsCounter, 0 mSdLazyCounter, 2243 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7135 SdHoareTripleChecker+Valid, 2209 SdHoareTripleChecker+Invalid, 2321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 2243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-02-05 16:39:11,892 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7135 Valid, 2209 Invalid, 2321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 2243 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-02-05 16:39:12,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307240 states. [2025-02-05 16:39:13,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307240 to 121742. [2025-02-05 16:39:13,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121742 states, 121741 states have (on average 1.3412326167848136) internal successors, (163283), 121741 states have internal predecessors, (163283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:39:14,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121742 states to 121742 states and 163283 transitions. [2025-02-05 16:39:14,088 INFO L78 Accepts]: Start accepts. Automaton has 121742 states and 163283 transitions. Word has length 65 [2025-02-05 16:39:14,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:39:14,088 INFO L471 AbstractCegarLoop]: Abstraction has 121742 states and 163283 transitions. [2025-02-05 16:39:14,088 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 3.953488372093023) internal successors, (170), 43 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:39:14,088 INFO L276 IsEmpty]: Start isEmpty. Operand 121742 states and 163283 transitions. [2025-02-05 16:39:14,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-02-05 16:39:14,090 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:39:14,090 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 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] [2025-02-05 16:39:14,096 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-05 16:39:14,293 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:39:14,294 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:39:14,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:39:14,303 INFO L85 PathProgramCache]: Analyzing trace with hash 1879182249, now seen corresponding path program 1 times [2025-02-05 16:39:14,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:39:14,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725774246] [2025-02-05 16:39:14,303 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:39:14,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:39:14,316 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-02-05 16:39:14,321 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-02-05 16:39:14,322 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:39:14,322 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:39:14,701 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:39:14,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:39:14,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725774246] [2025-02-05 16:39:14,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [725774246] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:39:14,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:39:14,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:39:14,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266523833] [2025-02-05 16:39:14,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:39:14,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:39:14,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:39:14,703 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:39:14,703 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:39:14,703 INFO L87 Difference]: Start difference. First operand 121742 states and 163283 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:39:15,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:39:15,490 INFO L93 Difference]: Finished difference Result 348154 states and 466659 transitions. [2025-02-05 16:39:15,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:39:15,491 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2025-02-05 16:39:15,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:39:15,808 INFO L225 Difference]: With dead ends: 348154 [2025-02-05 16:39:15,808 INFO L226 Difference]: Without dead ends: 229595 [2025-02-05 16:39:15,893 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-05 16:39:15,894 INFO L435 NwaCegarLoop]: 113 mSDtfsCounter, 36 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:39:15,894 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 168 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:39:16,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229595 states. [2025-02-05 16:39:17,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229595 to 179379. [2025-02-05 16:39:18,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179379 states, 179378 states have (on average 1.3330620254434769) internal successors, (239122), 179378 states have internal predecessors, (239122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:39:18,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179379 states to 179379 states and 239122 transitions. [2025-02-05 16:39:18,278 INFO L78 Accepts]: Start accepts. Automaton has 179379 states and 239122 transitions. Word has length 66 [2025-02-05 16:39:18,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:39:18,278 INFO L471 AbstractCegarLoop]: Abstraction has 179379 states and 239122 transitions. [2025-02-05 16:39:18,279 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:39:18,279 INFO L276 IsEmpty]: Start isEmpty. Operand 179379 states and 239122 transitions. [2025-02-05 16:39:18,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-02-05 16:39:18,280 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:39:18,280 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 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] [2025-02-05 16:39:18,281 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-05 16:39:18,281 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:39:18,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:39:18,281 INFO L85 PathProgramCache]: Analyzing trace with hash -1932240182, now seen corresponding path program 1 times [2025-02-05 16:39:18,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:39:18,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59165396] [2025-02-05 16:39:18,281 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:39:18,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:39:18,289 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-02-05 16:39:18,294 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-02-05 16:39:18,294 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:39:18,294 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:39:18,334 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-02-05 16:39:18,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:39:18,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59165396] [2025-02-05 16:39:18,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [59165396] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:39:18,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:39:18,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:39:18,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704610052] [2025-02-05 16:39:18,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:39:18,335 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:39:18,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:39:18,336 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:39:18,336 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:39:18,336 INFO L87 Difference]: Start difference. First operand 179379 states and 239122 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:39:19,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:39:19,562 INFO L93 Difference]: Finished difference Result 233215 states and 311675 transitions. [2025-02-05 16:39:19,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:39:19,563 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2025-02-05 16:39:19,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:39:19,704 INFO L225 Difference]: With dead ends: 233215 [2025-02-05 16:39:19,704 INFO L226 Difference]: Without dead ends: 121742 [2025-02-05 16:39:19,744 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-05 16:39:19,746 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 193 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:39:19,746 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 72 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:39:19,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121742 states. [2025-02-05 16:39:20,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121742 to 121742. [2025-02-05 16:39:20,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121742 states, 121741 states have (on average 1.3240321666488692) internal successors, (161189), 121741 states have internal predecessors, (161189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:39:21,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121742 states to 121742 states and 161189 transitions. [2025-02-05 16:39:21,163 INFO L78 Accepts]: Start accepts. Automaton has 121742 states and 161189 transitions. Word has length 66 [2025-02-05 16:39:21,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:39:21,163 INFO L471 AbstractCegarLoop]: Abstraction has 121742 states and 161189 transitions. [2025-02-05 16:39:21,163 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 4 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:39:21,163 INFO L276 IsEmpty]: Start isEmpty. Operand 121742 states and 161189 transitions. [2025-02-05 16:39:21,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-02-05 16:39:21,164 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:39:21,164 INFO L218 NwaCegarLoop]: trace histogram [2, 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] [2025-02-05 16:39:21,165 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-05 16:39:21,165 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:39:21,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:39:21,166 INFO L85 PathProgramCache]: Analyzing trace with hash -1680714778, now seen corresponding path program 1 times [2025-02-05 16:39:21,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:39:21,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489449727] [2025-02-05 16:39:21,166 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:39:21,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:39:21,172 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-02-05 16:39:21,175 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-02-05 16:39:21,175 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:39:21,175 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:39:21,190 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-02-05 16:39:21,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:39:21,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489449727] [2025-02-05 16:39:21,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [489449727] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:39:21,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:39:21,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:39:21,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205411651] [2025-02-05 16:39:21,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:39:21,192 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:39:21,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:39:21,192 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:39:21,192 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:39:21,192 INFO L87 Difference]: Start difference. First operand 121742 states and 161189 transitions. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:39:21,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:39:21,936 INFO L93 Difference]: Finished difference Result 219462 states and 291093 transitions. [2025-02-05 16:39:21,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:39:21,936 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2025-02-05 16:39:21,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:39:22,045 INFO L225 Difference]: With dead ends: 219462 [2025-02-05 16:39:22,045 INFO L226 Difference]: Without dead ends: 97853 [2025-02-05 16:39:22,095 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-05 16:39:22,095 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 53 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:39:22,095 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 94 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:39:22,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97853 states. [2025-02-05 16:39:22,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97853 to 97853. [2025-02-05 16:39:22,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97853 states, 97852 states have (on average 1.3079957486816824) internal successors, (127990), 97852 states have internal predecessors, (127990), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:39:23,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97853 states to 97853 states and 127990 transitions. [2025-02-05 16:39:23,093 INFO L78 Accepts]: Start accepts. Automaton has 97853 states and 127990 transitions. Word has length 66 [2025-02-05 16:39:23,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:39:23,094 INFO L471 AbstractCegarLoop]: Abstraction has 97853 states and 127990 transitions. [2025-02-05 16:39:23,094 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:39:23,094 INFO L276 IsEmpty]: Start isEmpty. Operand 97853 states and 127990 transitions. [2025-02-05 16:39:23,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-02-05 16:39:23,095 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:39:23,095 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 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] [2025-02-05 16:39:23,095 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-05 16:39:23,095 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:39:23,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:39:23,096 INFO L85 PathProgramCache]: Analyzing trace with hash 415786240, now seen corresponding path program 1 times [2025-02-05 16:39:23,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:39:23,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844225801] [2025-02-05 16:39:23,096 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:39:23,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:39:23,101 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-02-05 16:39:23,105 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-02-05 16:39:23,105 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:39:23,105 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:39:23,118 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-02-05 16:39:23,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:39:23,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844225801] [2025-02-05 16:39:23,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1844225801] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:39:23,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:39:23,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:39:23,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609751383] [2025-02-05 16:39:23,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:39:23,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:39:23,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:39:23,120 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:39:23,120 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:39:23,120 INFO L87 Difference]: Start difference. First operand 97853 states and 127990 transitions. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:39:23,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:39:23,750 INFO L93 Difference]: Finished difference Result 183943 states and 241217 transitions. [2025-02-05 16:39:23,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:39:23,751 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2025-02-05 16:39:23,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:39:23,842 INFO L225 Difference]: With dead ends: 183943 [2025-02-05 16:39:23,842 INFO L226 Difference]: Without dead ends: 86138 [2025-02-05 16:39:23,866 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-05 16:39:23,867 INFO L435 NwaCegarLoop]: 60 mSDtfsCounter, 46 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:39:23,867 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 77 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:39:23,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86138 states. [2025-02-05 16:39:24,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86138 to 86138. [2025-02-05 16:39:24,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86138 states, 86137 states have (on average 1.297456377630983) internal successors, (111759), 86137 states have internal predecessors, (111759), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:39:25,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86138 states to 86138 states and 111759 transitions. [2025-02-05 16:39:25,230 INFO L78 Accepts]: Start accepts. Automaton has 86138 states and 111759 transitions. Word has length 67 [2025-02-05 16:39:25,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:39:25,230 INFO L471 AbstractCegarLoop]: Abstraction has 86138 states and 111759 transitions. [2025-02-05 16:39:25,230 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:39:25,230 INFO L276 IsEmpty]: Start isEmpty. Operand 86138 states and 111759 transitions. [2025-02-05 16:39:25,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-02-05 16:39:25,235 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:39:25,235 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-02-05 16:39:25,235 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-05 16:39:25,235 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:39:25,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:39:25,235 INFO L85 PathProgramCache]: Analyzing trace with hash -683520947, now seen corresponding path program 1 times [2025-02-05 16:39:25,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:39:25,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283640281] [2025-02-05 16:39:25,236 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:39:25,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:39:25,248 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-02-05 16:39:25,262 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-02-05 16:39:25,262 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:39:25,262 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:39:25,365 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 12 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:39:25,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:39:25,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283640281] [2025-02-05 16:39:25,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1283640281] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 16:39:25,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [101989819] [2025-02-05 16:39:25,366 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:39:25,366 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:39:25,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:39:25,372 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-05 16:39:25,372 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-05 16:39:25,433 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-02-05 16:39:25,462 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-02-05 16:39:25,462 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:39:25,462 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:39:25,463 INFO L256 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-05 16:39:25,465 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 16:39:25,649 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 12 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:39:25,649 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 16:39:25,740 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 12 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:39:25,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [101989819] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 16:39:25,740 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 16:39:25,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2025-02-05 16:39:25,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103065869] [2025-02-05 16:39:25,740 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 16:39:25,741 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-05 16:39:25,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:39:25,741 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-05 16:39:25,741 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2025-02-05 16:39:25,741 INFO L87 Difference]: Start difference. First operand 86138 states and 111759 transitions. Second operand has 11 states, 11 states have (on average 14.090909090909092) internal successors, (155), 10 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:39:26,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:39:26,089 INFO L93 Difference]: Finished difference Result 154667 states and 200793 transitions. [2025-02-05 16:39:26,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 16:39:26,090 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 14.090909090909092) internal successors, (155), 10 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 87 [2025-02-05 16:39:26,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:39:26,191 INFO L225 Difference]: With dead ends: 154667 [2025-02-05 16:39:26,192 INFO L226 Difference]: Without dead ends: 92982 [2025-02-05 16:39:26,234 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 164 SyntacticMatches, 5 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2025-02-05 16:39:26,235 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 322 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 322 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:39:26,236 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [322 Valid, 280 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:39:26,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92982 states. [2025-02-05 16:39:27,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92982 to 85838. [2025-02-05 16:39:27,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85838 states, 85837 states have (on average 1.2970513880960426) internal successors, (111335), 85837 states have internal predecessors, (111335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:39:27,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85838 states to 85838 states and 111335 transitions. [2025-02-05 16:39:27,252 INFO L78 Accepts]: Start accepts. Automaton has 85838 states and 111335 transitions. Word has length 87 [2025-02-05 16:39:27,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:39:27,252 INFO L471 AbstractCegarLoop]: Abstraction has 85838 states and 111335 transitions. [2025-02-05 16:39:27,252 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 14.090909090909092) internal successors, (155), 10 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:39:27,253 INFO L276 IsEmpty]: Start isEmpty. Operand 85838 states and 111335 transitions. [2025-02-05 16:39:27,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-02-05 16:39:27,258 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:39:27,258 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-02-05 16:39:27,265 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-02-05 16:39:27,458 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:39:27,458 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:39:27,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:39:27,459 INFO L85 PathProgramCache]: Analyzing trace with hash 1192168562, now seen corresponding path program 1 times [2025-02-05 16:39:27,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:39:27,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858736629] [2025-02-05 16:39:27,459 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:39:27,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:39:27,467 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-02-05 16:39:27,478 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-02-05 16:39:27,478 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:39:27,478 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:39:27,521 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-02-05 16:39:27,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:39:27,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858736629] [2025-02-05 16:39:27,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [858736629] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:39:27,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:39:27,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:39:27,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191229399] [2025-02-05 16:39:27,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:39:27,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:39:27,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:39:27,522 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:39:27,522 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:39:27,522 INFO L87 Difference]: Start difference. First operand 85838 states and 111335 transitions. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:39:27,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:39:27,726 INFO L93 Difference]: Finished difference Result 114811 states and 148085 transitions. [2025-02-05 16:39:27,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:39:27,727 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 109 [2025-02-05 16:39:27,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:39:27,758 INFO L225 Difference]: With dead ends: 114811 [2025-02-05 16:39:27,758 INFO L226 Difference]: Without dead ends: 29860 [2025-02-05 16:39:27,793 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-05 16:39:27,794 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 27 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 150 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-05 16:39:27,794 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 150 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:39:27,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29860 states. [2025-02-05 16:39:28,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29860 to 29858. [2025-02-05 16:39:28,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29858 states, 29857 states have (on average 1.2475801319623538) internal successors, (37249), 29857 states have internal predecessors, (37249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:39:28,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29858 states to 29858 states and 37249 transitions. [2025-02-05 16:39:28,232 INFO L78 Accepts]: Start accepts. Automaton has 29858 states and 37249 transitions. Word has length 109 [2025-02-05 16:39:28,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:39:28,233 INFO L471 AbstractCegarLoop]: Abstraction has 29858 states and 37249 transitions. [2025-02-05 16:39:28,233 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:39:28,233 INFO L276 IsEmpty]: Start isEmpty. Operand 29858 states and 37249 transitions. [2025-02-05 16:39:28,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-02-05 16:39:28,236 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:39:28,236 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-02-05 16:39:28,236 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-05 16:39:28,236 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:39:28,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:39:28,236 INFO L85 PathProgramCache]: Analyzing trace with hash -371229373, now seen corresponding path program 1 times [2025-02-05 16:39:28,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:39:28,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713783281] [2025-02-05 16:39:28,237 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:39:28,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:39:28,248 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-02-05 16:39:28,254 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-02-05 16:39:28,254 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:39:28,254 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:39:28,290 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-05 16:39:28,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:39:28,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713783281] [2025-02-05 16:39:28,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [713783281] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:39:28,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:39:28,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:39:28,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286590249] [2025-02-05 16:39:28,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:39:28,291 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:39:28,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:39:28,291 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:39:28,291 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:39:28,291 INFO L87 Difference]: Start difference. First operand 29858 states and 37249 transitions. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:39:28,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:39:28,357 INFO L93 Difference]: Finished difference Result 41943 states and 52249 transitions. [2025-02-05 16:39:28,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:39:28,357 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 110 [2025-02-05 16:39:28,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:39:28,372 INFO L225 Difference]: With dead ends: 41943 [2025-02-05 16:39:28,372 INFO L226 Difference]: Without dead ends: 12805 [2025-02-05 16:39:28,387 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-05 16:39:28,388 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 24 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 138 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-05 16:39:28,388 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 138 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:39:28,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12805 states. [2025-02-05 16:39:28,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12805 to 12803. [2025-02-05 16:39:28,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12803 states, 12802 states have (on average 1.2230901421652867) internal successors, (15658), 12802 states have internal predecessors, (15658), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:39:28,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12803 states to 12803 states and 15658 transitions. [2025-02-05 16:39:28,490 INFO L78 Accepts]: Start accepts. Automaton has 12803 states and 15658 transitions. Word has length 110 [2025-02-05 16:39:28,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:39:28,491 INFO L471 AbstractCegarLoop]: Abstraction has 12803 states and 15658 transitions. [2025-02-05 16:39:28,491 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:39:28,491 INFO L276 IsEmpty]: Start isEmpty. Operand 12803 states and 15658 transitions. [2025-02-05 16:39:28,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-02-05 16:39:28,492 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:39:28,492 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-02-05 16:39:28,493 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-05 16:39:28,493 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:39:28,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:39:28,493 INFO L85 PathProgramCache]: Analyzing trace with hash 602117795, now seen corresponding path program 1 times [2025-02-05 16:39:28,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:39:28,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789955574] [2025-02-05 16:39:28,494 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:39:28,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:39:28,503 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-02-05 16:39:28,522 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-02-05 16:39:28,522 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:39:28,522 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:39:28,889 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 22 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:39:28,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:39:28,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789955574] [2025-02-05 16:39:28,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [789955574] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 16:39:28,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1662798246] [2025-02-05 16:39:28,890 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:39:28,890 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:39:28,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:39:28,892 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-05 16:39:28,893 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-05 16:39:28,952 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-02-05 16:39:28,987 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-02-05 16:39:28,987 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:39:28,987 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:39:28,989 INFO L256 TraceCheckSpWp]: Trace formula consists of 437 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-02-05 16:39:28,991 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 16:39:29,740 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 24 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:39:29,740 INFO L312 TraceCheckSpWp]: Computing backward predicates...