./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.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-var-start-time.3.1.ufo.BOUNDED-6.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 3da1085986a33686aa7ffc74caa759bc9bd987d241f97554ff5ad69a436a7e40 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 16:31:02,329 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 16:31:02,384 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:31:02,391 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 16:31:02,393 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 16:31:02,413 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 16:31:02,414 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 16:31:02,414 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 16:31:02,414 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 16:31:02,414 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 16:31:02,415 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 16:31:02,415 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 16:31:02,415 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 16:31:02,415 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 16:31:02,416 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 16:31:02,416 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 16:31:02,416 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 16:31:02,416 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 16:31:02,416 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 16:31:02,417 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 16:31:02,417 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 16:31:02,417 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 16:31:02,417 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 16:31:02,417 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 16:31:02,417 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 16:31:02,417 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 16:31:02,417 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 16:31:02,417 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 16:31:02,417 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 16:31:02,417 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 16:31:02,417 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 16:31:02,417 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 16:31:02,417 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 16:31:02,417 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 16:31:02,417 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 16:31:02,417 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 16:31:02,417 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 16:31:02,417 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 16:31:02,418 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 16:31:02,418 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 16:31:02,418 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 16:31:02,418 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 16:31:02,418 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 16:31:02,418 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 -> 3da1085986a33686aa7ffc74caa759bc9bd987d241f97554ff5ad69a436a7e40 [2025-02-05 16:31:02,613 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 16:31:02,618 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 16:31:02,619 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 16:31:02,620 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 16:31:02,620 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 16:31:02,621 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-var-start-time.3.1.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c [2025-02-05 16:31:03,728 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/daa518635/808482e7ae3a4742ac6ff6ff22f8a0f1/FLAG8567d8d97 [2025-02-05 16:31:03,998 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 16:31:03,998 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c [2025-02-05 16:31:04,005 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/daa518635/808482e7ae3a4742ac6ff6ff22f8a0f1/FLAG8567d8d97 [2025-02-05 16:31:04,316 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/daa518635/808482e7ae3a4742ac6ff6ff22f8a0f1 [2025-02-05 16:31:04,318 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 16:31:04,319 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 16:31:04,320 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 16:31:04,320 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 16:31:04,323 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 16:31:04,324 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 04:31:04" (1/1) ... [2025-02-05 16:31:04,325 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5bf97972 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:31:04, skipping insertion in model container [2025-02-05 16:31:04,325 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 04:31:04" (1/1) ... [2025-02-05 16:31:04,340 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 16:31:04,472 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-var-start-time.3.1.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c[4373,4386] [2025-02-05 16:31:04,489 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 16:31:04,504 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 16:31:04,534 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-var-start-time.3.1.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c[4373,4386] [2025-02-05 16:31:04,546 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 16:31:04,562 INFO L204 MainTranslator]: Completed translation [2025-02-05 16:31:04,563 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:31:04 WrapperNode [2025-02-05 16:31:04,563 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 16:31:04,564 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 16:31:04,564 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 16:31:04,564 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 16:31:04,569 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:31:04" (1/1) ... [2025-02-05 16:31:04,579 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:31:04" (1/1) ... [2025-02-05 16:31:04,603 INFO L138 Inliner]: procedures = 22, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 367 [2025-02-05 16:31:04,607 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 16:31:04,608 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 16:31:04,608 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 16:31:04,608 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 16:31:04,618 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:31:04" (1/1) ... [2025-02-05 16:31:04,618 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:31:04" (1/1) ... [2025-02-05 16:31:04,619 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:31:04" (1/1) ... [2025-02-05 16:31:04,637 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:31:04,638 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:31:04" (1/1) ... [2025-02-05 16:31:04,638 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:31:04" (1/1) ... [2025-02-05 16:31:04,646 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:31:04" (1/1) ... [2025-02-05 16:31:04,647 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:31:04" (1/1) ... [2025-02-05 16:31:04,647 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:31:04" (1/1) ... [2025-02-05 16:31:04,648 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:31:04" (1/1) ... [2025-02-05 16:31:04,653 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 16:31:04,653 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 16:31:04,653 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 16:31:04,653 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 16:31:04,654 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:31:04" (1/1) ... [2025-02-05 16:31:04,664 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 16:31:04,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:31:04,685 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:31:04,687 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:31:04,703 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 16:31:04,703 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 16:31:04,703 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 16:31:04,703 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 16:31:04,781 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 16:31:04,782 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 16:31:05,078 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L152: havoc main_~node2__m2~0#1; [2025-02-05 16:31:05,079 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L170: havoc main_~node3__m3~0#1; [2025-02-05 16:31:05,079 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L385: havoc main_~node2____CPAchecker_TMP_1~0#1; [2025-02-05 16:31:05,079 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L444: havoc main_~node1____CPAchecker_TMP_0~0#1; [2025-02-05 16:31:05,079 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L271: havoc main_~node3____CPAchecker_TMP_0~0#1; [2025-02-05 16:31:05,079 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L133: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2025-02-05 16:31:05,079 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L216: havoc main_~main____CPAchecker_TMP_0~0#1;havoc main_~__tmp_1~0#1, main_~assert__arg~0#1;havoc main_~check__tmp~0#1; [2025-02-05 16:31:05,079 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L472: havoc main_~node1____CPAchecker_TMP_1~0#1; [2025-02-05 16:31:05,079 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L299: havoc main_~node3____CPAchecker_TMP_1~0#1; [2025-02-05 16:31:05,079 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L357: havoc main_~node2____CPAchecker_TMP_0~0#1; [2025-02-05 16:31:05,096 INFO L? ?]: Removed 36 outVars from TransFormulas that were not future-live. [2025-02-05 16:31:05,096 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 16:31:05,104 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 16:31:05,105 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 16:31:05,105 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 04:31:05 BoogieIcfgContainer [2025-02-05 16:31:05,105 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 16:31:05,111 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 16:31:05,111 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 16:31:05,114 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 16:31:05,119 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 04:31:04" (1/3) ... [2025-02-05 16:31:05,119 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f8c0c3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 04:31:05, skipping insertion in model container [2025-02-05 16:31:05,119 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:31:04" (2/3) ... [2025-02-05 16:31:05,120 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f8c0c3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 04:31:05, skipping insertion in model container [2025-02-05 16:31:05,120 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 04:31:05" (3/3) ... [2025-02-05 16:31:05,121 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c [2025-02-05 16:31:05,137 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 16:31:05,138 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c that has 1 procedures, 85 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-02-05 16:31:05,190 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 16:31:05,200 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;@61d66ce4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 16:31:05,200 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 16:31:05,203 INFO L276 IsEmpty]: Start isEmpty. Operand has 85 states, 83 states have (on average 1.6867469879518073) internal successors, (140), 84 states have internal predecessors, (140), 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:31:05,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-02-05 16:31:05,208 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:31:05,208 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:31:05,209 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:31:05,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:31:05,212 INFO L85 PathProgramCache]: Analyzing trace with hash -1417554623, now seen corresponding path program 1 times [2025-02-05 16:31:05,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:31:05,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198954468] [2025-02-05 16:31:05,219 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:31:05,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:31:05,287 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-02-05 16:31:05,332 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-02-05 16:31:05,332 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:31:05,333 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:31:05,514 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:31:05,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:31:05,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198954468] [2025-02-05 16:31:05,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1198954468] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:31:05,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:31:05,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:31:05,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132834253] [2025-02-05 16:31:05,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:31:05,523 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:31:05,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:31:05,536 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:31:05,536 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:31:05,538 INFO L87 Difference]: Start difference. First operand has 85 states, 83 states have (on average 1.6867469879518073) internal successors, (140), 84 states have internal predecessors, (140), 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:31:05,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:31:05,582 INFO L93 Difference]: Finished difference Result 199 states and 318 transitions. [2025-02-05 16:31:05,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:31:05,584 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:31:05,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:31:05,589 INFO L225 Difference]: With dead ends: 199 [2025-02-05 16:31:05,591 INFO L226 Difference]: Without dead ends: 128 [2025-02-05 16:31:05,594 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:31:05,596 INFO L435 NwaCegarLoop]: 209 mSDtfsCounter, 101 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 300 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:31:05,597 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 300 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:31:05,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2025-02-05 16:31:05,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 126. [2025-02-05 16:31:05,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 125 states have (on average 1.504) internal successors, (188), 125 states have internal predecessors, (188), 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:31:05,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 188 transitions. [2025-02-05 16:31:05,619 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 188 transitions. Word has length 37 [2025-02-05 16:31:05,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:31:05,620 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 188 transitions. [2025-02-05 16:31:05,620 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:31:05,620 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 188 transitions. [2025-02-05 16:31:05,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-02-05 16:31:05,621 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:31:05,621 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:31:05,621 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 16:31:05,621 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:31:05,622 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:31:05,622 INFO L85 PathProgramCache]: Analyzing trace with hash -1872438142, now seen corresponding path program 1 times [2025-02-05 16:31:05,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:31:05,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235505047] [2025-02-05 16:31:05,622 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:31:05,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:31:05,634 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-02-05 16:31:05,644 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-02-05 16:31:05,645 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:31:05,645 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:31:05,698 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:31:05,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:31:05,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235505047] [2025-02-05 16:31:05,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1235505047] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:31:05,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:31:05,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:31:05,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532076312] [2025-02-05 16:31:05,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:31:05,699 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:31:05,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:31:05,700 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:31:05,700 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:31:05,700 INFO L87 Difference]: Start difference. First operand 126 states and 188 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:31:05,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:31:05,722 INFO L93 Difference]: Finished difference Result 306 states and 472 transitions. [2025-02-05 16:31:05,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:31:05,723 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:31:05,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:31:05,724 INFO L225 Difference]: With dead ends: 306 [2025-02-05 16:31:05,724 INFO L226 Difference]: Without dead ends: 200 [2025-02-05 16:31:05,724 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:31:05,725 INFO L435 NwaCegarLoop]: 167 mSDtfsCounter, 81 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 254 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:31:05,725 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 254 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:31:05,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2025-02-05 16:31:05,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 198. [2025-02-05 16:31:05,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 197 states have (on average 1.5279187817258884) internal successors, (301), 197 states have internal predecessors, (301), 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:31:05,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 301 transitions. [2025-02-05 16:31:05,734 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 301 transitions. Word has length 38 [2025-02-05 16:31:05,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:31:05,734 INFO L471 AbstractCegarLoop]: Abstraction has 198 states and 301 transitions. [2025-02-05 16:31:05,734 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:31:05,734 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 301 transitions. [2025-02-05 16:31:05,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-02-05 16:31:05,735 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:31:05,735 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:31:05,735 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 16:31:05,735 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:31:05,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:31:05,736 INFO L85 PathProgramCache]: Analyzing trace with hash -492649925, now seen corresponding path program 1 times [2025-02-05 16:31:05,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:31:05,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477948047] [2025-02-05 16:31:05,736 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:31:05,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:31:05,748 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-02-05 16:31:05,760 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-02-05 16:31:05,761 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:31:05,761 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:31:05,820 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:31:05,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:31:05,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477948047] [2025-02-05 16:31:05,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477948047] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:31:05,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:31:05,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:31:05,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535514286] [2025-02-05 16:31:05,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:31:05,821 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:31:05,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:31:05,821 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:31:05,821 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:31:05,821 INFO L87 Difference]: Start difference. First operand 198 states and 301 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 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:31:05,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:31:05,844 INFO L93 Difference]: Finished difference Result 490 states and 759 transitions. [2025-02-05 16:31:05,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:31:05,845 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 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:31:05,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:31:05,847 INFO L225 Difference]: With dead ends: 490 [2025-02-05 16:31:05,847 INFO L226 Difference]: Without dead ends: 312 [2025-02-05 16:31:05,847 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:31:05,848 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 76 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 239 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:31:05,848 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 239 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:31:05,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2025-02-05 16:31:05,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 310. [2025-02-05 16:31:05,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 310 states, 309 states have (on average 1.5307443365695792) internal successors, (473), 309 states have internal predecessors, (473), 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:31:05,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 473 transitions. [2025-02-05 16:31:05,863 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 473 transitions. Word has length 39 [2025-02-05 16:31:05,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:31:05,863 INFO L471 AbstractCegarLoop]: Abstraction has 310 states and 473 transitions. [2025-02-05 16:31:05,863 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 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:31:05,864 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 473 transitions. [2025-02-05 16:31:05,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-02-05 16:31:05,864 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:31:05,864 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] [2025-02-05 16:31:05,865 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 16:31:05,865 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:31:05,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:31:05,865 INFO L85 PathProgramCache]: Analyzing trace with hash 17438076, now seen corresponding path program 1 times [2025-02-05 16:31:05,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:31:05,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679652360] [2025-02-05 16:31:05,866 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:31:05,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:31:05,882 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-02-05 16:31:05,907 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-02-05 16:31:05,907 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:31:05,907 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:31:06,065 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:31:06,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:31:06,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679652360] [2025-02-05 16:31:06,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [679652360] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:31:06,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:31:06,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 16:31:06,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366487585] [2025-02-05 16:31:06,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:31:06,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:31:06,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:31:06,067 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:31:06,067 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:31:06,067 INFO L87 Difference]: Start difference. First operand 310 states and 473 transitions. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 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:31:06,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:31:06,184 INFO L93 Difference]: Finished difference Result 1470 states and 2285 transitions. [2025-02-05 16:31:06,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:31:06,184 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 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 40 [2025-02-05 16:31:06,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:31:06,189 INFO L225 Difference]: With dead ends: 1470 [2025-02-05 16:31:06,189 INFO L226 Difference]: Without dead ends: 1180 [2025-02-05 16:31:06,190 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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:31:06,190 INFO L435 NwaCegarLoop]: 116 mSDtfsCounter, 486 mSDsluCounter, 544 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 486 SdHoareTripleChecker+Valid, 660 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:31:06,191 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [486 Valid, 660 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:31:06,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1180 states. [2025-02-05 16:31:06,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1180 to 598. [2025-02-05 16:31:06,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 598 states, 597 states have (on average 1.5226130653266332) internal successors, (909), 597 states have internal predecessors, (909), 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:31:06,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 909 transitions. [2025-02-05 16:31:06,223 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 909 transitions. Word has length 40 [2025-02-05 16:31:06,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:31:06,223 INFO L471 AbstractCegarLoop]: Abstraction has 598 states and 909 transitions. [2025-02-05 16:31:06,224 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 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:31:06,224 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 909 transitions. [2025-02-05 16:31:06,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-02-05 16:31:06,224 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:31:06,225 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:31:06,225 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 16:31:06,225 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:31:06,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:31:06,225 INFO L85 PathProgramCache]: Analyzing trace with hash 541535723, now seen corresponding path program 1 times [2025-02-05 16:31:06,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:31:06,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815904798] [2025-02-05 16:31:06,226 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:31:06,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:31:06,237 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-02-05 16:31:06,262 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-02-05 16:31:06,263 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:31:06,264 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:31:06,407 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:31:06,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:31:06,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815904798] [2025-02-05 16:31:06,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1815904798] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:31:06,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:31:06,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 16:31:06,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550319165] [2025-02-05 16:31:06,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:31:06,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:31:06,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:31:06,409 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:31:06,409 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:31:06,409 INFO L87 Difference]: Start difference. First operand 598 states and 909 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:31:06,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:31:06,466 INFO L93 Difference]: Finished difference Result 2068 states and 3144 transitions. [2025-02-05 16:31:06,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:31:06,466 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:31:06,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:31:06,472 INFO L225 Difference]: With dead ends: 2068 [2025-02-05 16:31:06,473 INFO L226 Difference]: Without dead ends: 1490 [2025-02-05 16:31:06,475 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:31:06,475 INFO L435 NwaCegarLoop]: 139 mSDtfsCounter, 408 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 408 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:31:06,475 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [408 Valid, 286 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:31:06,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1490 states. [2025-02-05 16:31:06,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1490 to 1486. [2025-02-05 16:31:06,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1486 states, 1485 states have (on average 1.5063973063973064) internal successors, (2237), 1485 states have internal predecessors, (2237), 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:31:06,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1486 states to 1486 states and 2237 transitions. [2025-02-05 16:31:06,522 INFO L78 Accepts]: Start accepts. Automaton has 1486 states and 2237 transitions. Word has length 41 [2025-02-05 16:31:06,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:31:06,522 INFO L471 AbstractCegarLoop]: Abstraction has 1486 states and 2237 transitions. [2025-02-05 16:31:06,523 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:31:06,523 INFO L276 IsEmpty]: Start isEmpty. Operand 1486 states and 2237 transitions. [2025-02-05 16:31:06,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-02-05 16:31:06,525 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:31:06,526 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, 1] [2025-02-05 16:31:06,526 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 16:31:06,526 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:31:06,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:31:06,527 INFO L85 PathProgramCache]: Analyzing trace with hash 728310349, now seen corresponding path program 1 times [2025-02-05 16:31:06,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:31:06,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188926002] [2025-02-05 16:31:06,528 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:31:06,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:31:06,543 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-02-05 16:31:06,592 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-02-05 16:31:06,594 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:31:06,594 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:31:06,754 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:31:06,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:31:06,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188926002] [2025-02-05 16:31:06,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [188926002] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:31:06,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:31:06,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 16:31:06,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029000059] [2025-02-05 16:31:06,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:31:06,755 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:31:06,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:31:06,755 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:31:06,756 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:31:06,756 INFO L87 Difference]: Start difference. First operand 1486 states and 2237 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 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:31:06,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:31:06,784 INFO L93 Difference]: Finished difference Result 1584 states and 2382 transitions. [2025-02-05 16:31:06,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:31:06,785 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 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 43 [2025-02-05 16:31:06,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:31:06,790 INFO L225 Difference]: With dead ends: 1584 [2025-02-05 16:31:06,790 INFO L226 Difference]: Without dead ends: 1582 [2025-02-05 16:31:06,790 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:31:06,791 INFO L435 NwaCegarLoop]: 115 mSDtfsCounter, 0 mSDsluCounter, 334 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 449 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:31:06,794 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 449 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:31:06,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1582 states. [2025-02-05 16:31:06,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1582 to 1582. [2025-02-05 16:31:06,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1582 states, 1581 states have (on average 1.4756483238456672) internal successors, (2333), 1581 states have internal predecessors, (2333), 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:31:06,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1582 states to 1582 states and 2333 transitions. [2025-02-05 16:31:06,853 INFO L78 Accepts]: Start accepts. Automaton has 1582 states and 2333 transitions. Word has length 43 [2025-02-05 16:31:06,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:31:06,853 INFO L471 AbstractCegarLoop]: Abstraction has 1582 states and 2333 transitions. [2025-02-05 16:31:06,853 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 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:31:06,853 INFO L276 IsEmpty]: Start isEmpty. Operand 1582 states and 2333 transitions. [2025-02-05 16:31:06,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-02-05 16:31:06,857 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:31:06,857 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, 1, 1] [2025-02-05 16:31:06,857 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 16:31:06,857 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:31:06,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:31:06,859 INFO L85 PathProgramCache]: Analyzing trace with hash 1107552954, now seen corresponding path program 1 times [2025-02-05 16:31:06,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:31:06,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642496875] [2025-02-05 16:31:06,859 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:31:06,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:31:06,871 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-02-05 16:31:06,878 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-02-05 16:31:06,880 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:31:06,880 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:31:06,923 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:31:06,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:31:06,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642496875] [2025-02-05 16:31:06,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [642496875] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:31:06,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:31:06,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:31:06,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474815115] [2025-02-05 16:31:06,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:31:06,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:31:06,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:31:06,924 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:31:06,924 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:31:06,924 INFO L87 Difference]: Start difference. First operand 1582 states and 2333 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 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:31:06,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:31:06,985 INFO L93 Difference]: Finished difference Result 3816 states and 5637 transitions. [2025-02-05 16:31:06,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:31:06,986 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 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 44 [2025-02-05 16:31:06,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:31:06,996 INFO L225 Difference]: With dead ends: 3816 [2025-02-05 16:31:07,000 INFO L226 Difference]: Without dead ends: 2254 [2025-02-05 16:31:07,002 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:31:07,005 INFO L435 NwaCegarLoop]: 139 mSDtfsCounter, 66 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:31:07,007 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 234 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:31:07,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2254 states. [2025-02-05 16:31:07,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2254 to 2252. [2025-02-05 16:31:07,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2252 states, 2251 states have (on average 1.4673478454020434) internal successors, (3303), 2251 states have internal predecessors, (3303), 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:31:07,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2252 states to 2252 states and 3303 transitions. [2025-02-05 16:31:07,054 INFO L78 Accepts]: Start accepts. Automaton has 2252 states and 3303 transitions. Word has length 44 [2025-02-05 16:31:07,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:31:07,055 INFO L471 AbstractCegarLoop]: Abstraction has 2252 states and 3303 transitions. [2025-02-05 16:31:07,055 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 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:31:07,055 INFO L276 IsEmpty]: Start isEmpty. Operand 2252 states and 3303 transitions. [2025-02-05 16:31:07,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-02-05 16:31:07,057 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:31:07,057 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] [2025-02-05 16:31:07,058 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 16:31:07,058 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:31:07,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:31:07,058 INFO L85 PathProgramCache]: Analyzing trace with hash 235630635, now seen corresponding path program 1 times [2025-02-05 16:31:07,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:31:07,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538978602] [2025-02-05 16:31:07,058 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:31:07,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:31:07,071 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-02-05 16:31:07,089 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-02-05 16:31:07,090 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:31:07,090 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:31:07,251 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-05 16:31:07,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:31:07,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538978602] [2025-02-05 16:31:07,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1538978602] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 16:31:07,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [476322938] [2025-02-05 16:31:07,252 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:31:07,252 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:31:07,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:31:07,258 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:31:07,259 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:31:07,328 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-02-05 16:31:07,374 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-02-05 16:31:07,375 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:31:07,375 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:31:07,378 INFO L256 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-02-05 16:31:07,384 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 16:31:07,917 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:31:07,919 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 16:31:08,414 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:31:08,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [476322938] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 16:31:08,416 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 16:31:08,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 8, 7] total 15 [2025-02-05 16:31:08,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958966343] [2025-02-05 16:31:08,416 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 16:31:08,417 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-02-05 16:31:08,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:31:08,417 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-02-05 16:31:08,417 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2025-02-05 16:31:08,417 INFO L87 Difference]: Start difference. First operand 2252 states and 3303 transitions. Second operand has 15 states, 15 states have (on average 11.4) internal successors, (171), 15 states have internal predecessors, (171), 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:31:09,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:31:09,015 INFO L93 Difference]: Finished difference Result 7952 states and 11665 transitions. [2025-02-05 16:31:09,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-02-05 16:31:09,016 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 11.4) internal successors, (171), 15 states have internal predecessors, (171), 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:31:09,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:31:09,031 INFO L225 Difference]: With dead ends: 7952 [2025-02-05 16:31:09,031 INFO L226 Difference]: Without dead ends: 5722 [2025-02-05 16:31:09,034 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 258 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=268, Invalid=602, Unknown=0, NotChecked=0, Total=870 [2025-02-05 16:31:09,035 INFO L435 NwaCegarLoop]: 170 mSDtfsCounter, 1944 mSDsluCounter, 1143 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1944 SdHoareTripleChecker+Valid, 1313 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 16:31:09,035 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1944 Valid, 1313 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 16:31:09,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5722 states. [2025-02-05 16:31:09,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5722 to 5430. [2025-02-05 16:31:09,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5430 states, 5429 states have (on average 1.4490698102781359) internal successors, (7867), 5429 states have internal predecessors, (7867), 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:31:09,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5430 states to 5430 states and 7867 transitions. [2025-02-05 16:31:09,114 INFO L78 Accepts]: Start accepts. Automaton has 5430 states and 7867 transitions. Word has length 61 [2025-02-05 16:31:09,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:31:09,115 INFO L471 AbstractCegarLoop]: Abstraction has 5430 states and 7867 transitions. [2025-02-05 16:31:09,115 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 11.4) internal successors, (171), 15 states have internal predecessors, (171), 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:31:09,115 INFO L276 IsEmpty]: Start isEmpty. Operand 5430 states and 7867 transitions. [2025-02-05 16:31:09,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-02-05 16:31:09,116 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:31:09,116 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:31:09,123 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:31:09,321 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:31:09,321 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:31:09,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:31:09,322 INFO L85 PathProgramCache]: Analyzing trace with hash 1283027785, now seen corresponding path program 1 times [2025-02-05 16:31:09,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:31:09,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750109875] [2025-02-05 16:31:09,322 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:31:09,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:31:09,333 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-02-05 16:31:09,343 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-02-05 16:31:09,343 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:31:09,343 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:31:09,388 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:31:09,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:31:09,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750109875] [2025-02-05 16:31:09,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [750109875] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:31:09,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:31:09,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:31:09,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832116286] [2025-02-05 16:31:09,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:31:09,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:31:09,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:31:09,390 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:31:09,390 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:31:09,390 INFO L87 Difference]: Start difference. First operand 5430 states and 7867 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:31:09,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:31:09,431 INFO L93 Difference]: Finished difference Result 12381 states and 17894 transitions. [2025-02-05 16:31:09,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:31:09,432 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 62 [2025-02-05 16:31:09,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:31:09,455 INFO L225 Difference]: With dead ends: 12381 [2025-02-05 16:31:09,455 INFO L226 Difference]: Without dead ends: 8525 [2025-02-05 16:31:09,461 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:31:09,464 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 63 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:31:09,464 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 222 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:31:09,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8525 states. [2025-02-05 16:31:09,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8525 to 8523. [2025-02-05 16:31:09,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8523 states, 8522 states have (on average 1.4275991551279041) internal successors, (12166), 8522 states have internal predecessors, (12166), 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:31:09,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8523 states to 8523 states and 12166 transitions. [2025-02-05 16:31:09,678 INFO L78 Accepts]: Start accepts. Automaton has 8523 states and 12166 transitions. Word has length 62 [2025-02-05 16:31:09,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:31:09,678 INFO L471 AbstractCegarLoop]: Abstraction has 8523 states and 12166 transitions. [2025-02-05 16:31:09,678 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:31:09,679 INFO L276 IsEmpty]: Start isEmpty. Operand 8523 states and 12166 transitions. [2025-02-05 16:31:09,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-02-05 16:31:09,683 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:31:09,683 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:31:09,683 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 16:31:09,683 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:31:09,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:31:09,683 INFO L85 PathProgramCache]: Analyzing trace with hash 948315491, now seen corresponding path program 1 times [2025-02-05 16:31:09,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:31:09,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014114094] [2025-02-05 16:31:09,684 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:31:09,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:31:09,692 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-02-05 16:31:09,698 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-02-05 16:31:09,699 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:31:09,699 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:31:09,728 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:31:09,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:31:09,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014114094] [2025-02-05 16:31:09,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2014114094] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:31:09,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:31:09,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:31:09,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857106107] [2025-02-05 16:31:09,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:31:09,730 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:31:09,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:31:09,730 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:31:09,730 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:31:09,730 INFO L87 Difference]: Start difference. First operand 8523 states and 12166 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:31:09,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:31:09,771 INFO L93 Difference]: Finished difference Result 19537 states and 27729 transitions. [2025-02-05 16:31:09,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:31:09,771 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 62 [2025-02-05 16:31:09,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:31:09,806 INFO L225 Difference]: With dead ends: 19537 [2025-02-05 16:31:09,806 INFO L226 Difference]: Without dead ends: 12680 [2025-02-05 16:31:09,816 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:31:09,817 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 64 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:31:09,817 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 251 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:31:09,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12680 states. [2025-02-05 16:31:09,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12680 to 12316. [2025-02-05 16:31:09,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12316 states, 12315 states have (on average 1.4032480714575721) internal successors, (17281), 12315 states have internal predecessors, (17281), 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:31:09,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12316 states to 12316 states and 17281 transitions. [2025-02-05 16:31:09,980 INFO L78 Accepts]: Start accepts. Automaton has 12316 states and 17281 transitions. Word has length 62 [2025-02-05 16:31:09,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:31:09,980 INFO L471 AbstractCegarLoop]: Abstraction has 12316 states and 17281 transitions. [2025-02-05 16:31:09,981 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:31:09,981 INFO L276 IsEmpty]: Start isEmpty. Operand 12316 states and 17281 transitions. [2025-02-05 16:31:09,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-02-05 16:31:09,982 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:31:09,982 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:31:09,982 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 16:31:09,982 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:31:09,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:31:09,983 INFO L85 PathProgramCache]: Analyzing trace with hash 346289277, now seen corresponding path program 1 times [2025-02-05 16:31:09,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:31:09,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632749331] [2025-02-05 16:31:09,983 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:31:09,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:31:09,995 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-02-05 16:31:10,000 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-02-05 16:31:10,001 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:31:10,001 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:31:10,100 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-05 16:31:10,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:31:10,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632749331] [2025-02-05 16:31:10,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1632749331] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:31:10,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:31:10,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 16:31:10,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647554741] [2025-02-05 16:31:10,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:31:10,101 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:31:10,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:31:10,102 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:31:10,102 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:31:10,102 INFO L87 Difference]: Start difference. First operand 12316 states and 17281 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 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:31:10,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:31:10,187 INFO L93 Difference]: Finished difference Result 24277 states and 34285 transitions. [2025-02-05 16:31:10,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:31:10,187 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 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:31:10,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:31:10,222 INFO L225 Difference]: With dead ends: 24277 [2025-02-05 16:31:10,222 INFO L226 Difference]: Without dead ends: 20719 [2025-02-05 16:31:10,231 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:31:10,232 INFO L435 NwaCegarLoop]: 204 mSDtfsCounter, 342 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 342 SdHoareTripleChecker+Valid, 548 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:31:10,232 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [342 Valid, 548 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:31:10,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20719 states. [2025-02-05 16:31:10,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20719 to 15730. [2025-02-05 16:31:10,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15730 states, 15729 states have (on average 1.3969737427681352) internal successors, (21973), 15729 states have internal predecessors, (21973), 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:31:10,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15730 states to 15730 states and 21973 transitions. [2025-02-05 16:31:10,502 INFO L78 Accepts]: Start accepts. Automaton has 15730 states and 21973 transitions. Word has length 62 [2025-02-05 16:31:10,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:31:10,502 INFO L471 AbstractCegarLoop]: Abstraction has 15730 states and 21973 transitions. [2025-02-05 16:31:10,503 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 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:31:10,503 INFO L276 IsEmpty]: Start isEmpty. Operand 15730 states and 21973 transitions. [2025-02-05 16:31:10,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-02-05 16:31:10,505 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:31:10,505 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:31:10,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 16:31:10,505 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:31:10,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:31:10,506 INFO L85 PathProgramCache]: Analyzing trace with hash 1227232871, now seen corresponding path program 1 times [2025-02-05 16:31:10,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:31:10,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910096078] [2025-02-05 16:31:10,506 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:31:10,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:31:10,515 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-02-05 16:31:10,520 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-02-05 16:31:10,520 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:31:10,520 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:31:10,586 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 16:31:10,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:31:10,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910096078] [2025-02-05 16:31:10,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [910096078] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:31:10,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:31:10,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 16:31:10,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053908105] [2025-02-05 16:31:10,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:31:10,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:31:10,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:31:10,587 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:31:10,587 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:31:10,587 INFO L87 Difference]: Start difference. First operand 15730 states and 21973 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 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:31:10,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:31:10,664 INFO L93 Difference]: Finished difference Result 29001 states and 40889 transitions. [2025-02-05 16:31:10,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:31:10,665 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 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 62 [2025-02-05 16:31:10,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:31:10,702 INFO L225 Difference]: With dead ends: 29001 [2025-02-05 16:31:10,702 INFO L226 Difference]: Without dead ends: 24047 [2025-02-05 16:31:10,759 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:31:10,760 INFO L435 NwaCegarLoop]: 216 mSDtfsCounter, 340 mSDsluCounter, 374 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 340 SdHoareTripleChecker+Valid, 590 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:31:10,760 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [340 Valid, 590 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:31:10,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24047 states. [2025-02-05 16:31:10,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24047 to 20507. [2025-02-05 16:31:10,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20507 states, 20506 states have (on average 1.3947625085340876) internal successors, (28601), 20506 states have internal predecessors, (28601), 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:31:10,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20507 states to 20507 states and 28601 transitions. [2025-02-05 16:31:10,943 INFO L78 Accepts]: Start accepts. Automaton has 20507 states and 28601 transitions. Word has length 62 [2025-02-05 16:31:10,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:31:10,943 INFO L471 AbstractCegarLoop]: Abstraction has 20507 states and 28601 transitions. [2025-02-05 16:31:10,943 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 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:31:10,943 INFO L276 IsEmpty]: Start isEmpty. Operand 20507 states and 28601 transitions. [2025-02-05 16:31:10,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2025-02-05 16:31:10,945 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:31:10,945 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:31:10,945 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 16:31:10,945 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:31:10,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:31:10,946 INFO L85 PathProgramCache]: Analyzing trace with hash 513504713, now seen corresponding path program 1 times [2025-02-05 16:31:10,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:31:10,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173544150] [2025-02-05 16:31:10,946 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:31:10,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:31:10,953 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-02-05 16:31:10,958 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-02-05 16:31:10,958 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:31:10,958 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:31:11,014 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:31:11,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:31:11,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173544150] [2025-02-05 16:31:11,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1173544150] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:31:11,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:31:11,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 16:31:11,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561850863] [2025-02-05 16:31:11,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:31:11,015 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:31:11,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:31:11,016 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:31:11,016 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:31:11,016 INFO L87 Difference]: Start difference. First operand 20507 states and 28601 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:31:11,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:31:11,119 INFO L93 Difference]: Finished difference Result 34695 states and 48820 transitions. [2025-02-05 16:31:11,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:31:11,119 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:31:11,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:31:11,287 INFO L225 Difference]: With dead ends: 34695 [2025-02-05 16:31:11,287 INFO L226 Difference]: Without dead ends: 28794 [2025-02-05 16:31:11,294 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:31:11,295 INFO L435 NwaCegarLoop]: 214 mSDtfsCounter, 338 mSDsluCounter, 345 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 338 SdHoareTripleChecker+Valid, 559 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:31:11,296 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [338 Valid, 559 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:31:11,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28794 states. [2025-02-05 16:31:11,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28794 to 24414. [2025-02-05 16:31:11,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24414 states, 24413 states have (on average 1.393192151722443) internal successors, (34012), 24413 states have internal predecessors, (34012), 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:31:11,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24414 states to 24414 states and 34012 transitions. [2025-02-05 16:31:11,542 INFO L78 Accepts]: Start accepts. Automaton has 24414 states and 34012 transitions. Word has length 62 [2025-02-05 16:31:11,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:31:11,542 INFO L471 AbstractCegarLoop]: Abstraction has 24414 states and 34012 transitions. [2025-02-05 16:31:11,542 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:31:11,543 INFO L276 IsEmpty]: Start isEmpty. Operand 24414 states and 34012 transitions. [2025-02-05 16:31:11,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-02-05 16:31:11,545 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:31:11,545 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:31:11,546 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 16:31:11,546 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:31:11,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:31:11,547 INFO L85 PathProgramCache]: Analyzing trace with hash 135478049, now seen corresponding path program 1 times [2025-02-05 16:31:11,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:31:11,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423494836] [2025-02-05 16:31:11,547 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:31:11,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:31:11,556 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-02-05 16:31:11,561 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-02-05 16:31:11,562 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:31:11,562 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:31:11,589 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:31:11,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:31:11,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423494836] [2025-02-05 16:31:11,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [423494836] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:31:11,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:31:11,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:31:11,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996878415] [2025-02-05 16:31:11,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:31:11,590 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:31:11,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:31:11,590 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:31:11,590 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:31:11,590 INFO L87 Difference]: Start difference. First operand 24414 states and 34012 transitions. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 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:31:11,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:31:11,739 INFO L93 Difference]: Finished difference Result 43890 states and 60805 transitions. [2025-02-05 16:31:11,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:31:11,740 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 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:31:11,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:31:11,783 INFO L225 Difference]: With dead ends: 43890 [2025-02-05 16:31:11,783 INFO L226 Difference]: Without dead ends: 24803 [2025-02-05 16:31:11,797 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:31:11,797 INFO L435 NwaCegarLoop]: 180 mSDtfsCounter, 64 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:31:11,797 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 283 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:31:11,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24803 states. [2025-02-05 16:31:11,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24803 to 23128. [2025-02-05 16:31:12,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23128 states, 23127 states have (on average 1.3769619924763263) internal successors, (31845), 23127 states have internal predecessors, (31845), 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:31:12,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23128 states to 23128 states and 31845 transitions. [2025-02-05 16:31:12,031 INFO L78 Accepts]: Start accepts. Automaton has 23128 states and 31845 transitions. Word has length 65 [2025-02-05 16:31:12,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:31:12,031 INFO L471 AbstractCegarLoop]: Abstraction has 23128 states and 31845 transitions. [2025-02-05 16:31:12,032 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 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:31:12,032 INFO L276 IsEmpty]: Start isEmpty. Operand 23128 states and 31845 transitions. [2025-02-05 16:31:12,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-02-05 16:31:12,034 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:31:12,034 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, 1, 1] [2025-02-05 16:31:12,034 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 16:31:12,034 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:31:12,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:31:12,035 INFO L85 PathProgramCache]: Analyzing trace with hash -1056408957, now seen corresponding path program 1 times [2025-02-05 16:31:12,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:31:12,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556010014] [2025-02-05 16:31:12,035 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:31:12,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:31:12,098 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-02-05 16:31:12,104 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-02-05 16:31:12,105 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:31:12,105 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:31:12,188 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:31:12,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:31:12,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556010014] [2025-02-05 16:31:12,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [556010014] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 16:31:12,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [89429424] [2025-02-05 16:31:12,189 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:31:12,189 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:31:12,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:31:12,192 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:31:12,193 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:31:12,246 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-02-05 16:31:12,277 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-02-05 16:31:12,278 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:31:12,278 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:31:12,279 INFO L256 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-05 16:31:12,281 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 16:31:12,441 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:31:12,441 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 16:31:12,524 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:31:12,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [89429424] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 16:31:12,525 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 16:31:12,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2025-02-05 16:31:12,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628591949] [2025-02-05 16:31:12,525 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 16:31:12,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-05 16:31:12,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:31:12,526 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-05 16:31:12,526 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2025-02-05 16:31:12,526 INFO L87 Difference]: Start difference. First operand 23128 states and 31845 transitions. Second operand has 11 states, 11 states have (on average 10.272727272727273) internal successors, (113), 10 states have internal predecessors, (113), 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:31:12,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:31:12,862 INFO L93 Difference]: Finished difference Result 61728 states and 85482 transitions. [2025-02-05 16:31:12,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 16:31:12,863 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 10.272727272727273) internal successors, (113), 10 states have internal predecessors, (113), 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:31:12,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:31:12,923 INFO L225 Difference]: With dead ends: 61728 [2025-02-05 16:31:12,923 INFO L226 Difference]: Without dead ends: 40935 [2025-02-05 16:31:12,949 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 124 SyntacticMatches, 5 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2025-02-05 16:31:12,950 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 905 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 271 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 905 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 16:31:12,950 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [905 Valid, 355 Invalid, 283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 271 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 16:31:12,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40935 states. [2025-02-05 16:31:13,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40935 to 27379. [2025-02-05 16:31:13,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27379 states, 27378 states have (on average 1.376981518007159) internal successors, (37699), 27378 states have internal predecessors, (37699), 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:31:13,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27379 states to 27379 states and 37699 transitions. [2025-02-05 16:31:13,406 INFO L78 Accepts]: Start accepts. Automaton has 27379 states and 37699 transitions. Word has length 67 [2025-02-05 16:31:13,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:31:13,406 INFO L471 AbstractCegarLoop]: Abstraction has 27379 states and 37699 transitions. [2025-02-05 16:31:13,406 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.272727272727273) internal successors, (113), 10 states have internal predecessors, (113), 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:31:13,406 INFO L276 IsEmpty]: Start isEmpty. Operand 27379 states and 37699 transitions. [2025-02-05 16:31:13,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-02-05 16:31:13,409 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:31:13,409 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, 1, 1] [2025-02-05 16:31:13,417 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:31:13,609 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-02-05 16:31:13,610 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:31:13,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:31:13,610 INFO L85 PathProgramCache]: Analyzing trace with hash 492312289, now seen corresponding path program 1 times [2025-02-05 16:31:13,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:31:13,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524019839] [2025-02-05 16:31:13,610 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:31:13,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:31:13,619 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-02-05 16:31:13,627 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-02-05 16:31:13,627 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:31:13,627 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:31:13,778 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:31:13,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:31:13,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524019839] [2025-02-05 16:31:13,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [524019839] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 16:31:13,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [122636958] [2025-02-05 16:31:13,778 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:31:13,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:31:13,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:31:13,781 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:31:13,790 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:31:13,837 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-02-05 16:31:13,867 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-02-05 16:31:13,867 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:31:13,867 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:31:13,870 INFO L256 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-05 16:31:13,872 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 16:31:14,048 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:31:14,048 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 16:31:14,138 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:31:14,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [122636958] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 16:31:14,138 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 16:31:14,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2025-02-05 16:31:14,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187932694] [2025-02-05 16:31:14,139 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 16:31:14,139 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-05 16:31:14,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:31:14,139 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-05 16:31:14,139 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2025-02-05 16:31:14,140 INFO L87 Difference]: Start difference. First operand 27379 states and 37699 transitions. Second operand has 11 states, 11 states have (on average 10.545454545454545) internal successors, (116), 10 states have internal predecessors, (116), 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:31:14,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:31:14,523 INFO L93 Difference]: Finished difference Result 59474 states and 82198 transitions. [2025-02-05 16:31:14,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 16:31:14,523 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 10.545454545454545) internal successors, (116), 10 states have internal predecessors, (116), 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:31:14,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:31:14,570 INFO L225 Difference]: With dead ends: 59474 [2025-02-05 16:31:14,570 INFO L226 Difference]: Without dead ends: 40576 [2025-02-05 16:31:14,587 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 124 SyntacticMatches, 5 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2025-02-05 16:31:14,589 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 1046 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 281 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1046 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 16:31:14,589 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1046 Valid, 332 Invalid, 297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 281 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 16:31:14,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40576 states. [2025-02-05 16:31:14,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40576 to 32036. [2025-02-05 16:31:14,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32036 states, 32035 states have (on average 1.3742469174340566) internal successors, (44024), 32035 states have internal predecessors, (44024), 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:31:14,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32036 states to 32036 states and 44024 transitions. [2025-02-05 16:31:14,913 INFO L78 Accepts]: Start accepts. Automaton has 32036 states and 44024 transitions. Word has length 67 [2025-02-05 16:31:14,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:31:14,913 INFO L471 AbstractCegarLoop]: Abstraction has 32036 states and 44024 transitions. [2025-02-05 16:31:14,913 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.545454545454545) internal successors, (116), 10 states have internal predecessors, (116), 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:31:14,913 INFO L276 IsEmpty]: Start isEmpty. Operand 32036 states and 44024 transitions. [2025-02-05 16:31:14,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-02-05 16:31:14,915 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:31:14,916 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, 1, 1] [2025-02-05 16:31:14,922 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-05 16:31:15,117 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:31:15,118 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:31:15,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:31:15,118 INFO L85 PathProgramCache]: Analyzing trace with hash -439711677, now seen corresponding path program 1 times [2025-02-05 16:31:15,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:31:15,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839728366] [2025-02-05 16:31:15,118 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:31:15,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:31:15,140 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-02-05 16:31:15,147 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-02-05 16:31:15,147 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:31:15,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:31:15,215 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:31:15,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:31:15,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839728366] [2025-02-05 16:31:15,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1839728366] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 16:31:15,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [678644062] [2025-02-05 16:31:15,215 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:31:15,216 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:31:15,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:31:15,217 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:31:15,219 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:31:15,270 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-02-05 16:31:15,296 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-02-05 16:31:15,296 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:31:15,296 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:31:15,298 INFO L256 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-05 16:31:15,299 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 16:31:15,436 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:31:15,436 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 16:31:15,507 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:31:15,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [678644062] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 16:31:15,508 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 16:31:15,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2025-02-05 16:31:15,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878411950] [2025-02-05 16:31:15,508 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 16:31:15,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-05 16:31:15,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:31:15,509 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-05 16:31:15,509 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2025-02-05 16:31:15,509 INFO L87 Difference]: Start difference. First operand 32036 states and 44024 transitions. Second operand has 11 states, 11 states have (on average 10.272727272727273) internal successors, (113), 10 states have internal predecessors, (113), 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:31:15,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:31:15,775 INFO L93 Difference]: Finished difference Result 64650 states and 88725 transitions. [2025-02-05 16:31:15,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 16:31:15,776 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 10.272727272727273) internal successors, (113), 10 states have internal predecessors, (113), 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:31:15,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:31:15,819 INFO L225 Difference]: With dead ends: 64650 [2025-02-05 16:31:15,819 INFO L226 Difference]: Without dead ends: 37047 [2025-02-05 16:31:15,841 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 124 SyntacticMatches, 5 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2025-02-05 16:31:15,842 INFO L435 NwaCegarLoop]: 74 mSDtfsCounter, 563 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 563 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:31:15,842 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [563 Valid, 290 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 208 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:31:15,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37047 states. [2025-02-05 16:31:16,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37047 to 32480. [2025-02-05 16:31:16,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32480 states, 32479 states have (on average 1.369038455617476) internal successors, (44465), 32479 states have internal predecessors, (44465), 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:31:16,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32480 states to 32480 states and 44465 transitions. [2025-02-05 16:31:16,279 INFO L78 Accepts]: Start accepts. Automaton has 32480 states and 44465 transitions. Word has length 67 [2025-02-05 16:31:16,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:31:16,279 INFO L471 AbstractCegarLoop]: Abstraction has 32480 states and 44465 transitions. [2025-02-05 16:31:16,279 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.272727272727273) internal successors, (113), 10 states have internal predecessors, (113), 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:31:16,279 INFO L276 IsEmpty]: Start isEmpty. Operand 32480 states and 44465 transitions. [2025-02-05 16:31:16,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-02-05 16:31:16,282 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:31:16,282 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, 1, 1, 1, 1] [2025-02-05 16:31:16,292 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-05 16:31:16,486 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-02-05 16:31:16,486 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:31:16,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:31:16,487 INFO L85 PathProgramCache]: Analyzing trace with hash -890218715, now seen corresponding path program 1 times [2025-02-05 16:31:16,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:31:16,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482491846] [2025-02-05 16:31:16,487 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:31:16,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:31:16,497 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-02-05 16:31:16,505 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-02-05 16:31:16,505 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:31:16,505 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:31:16,672 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:31:16,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:31:16,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482491846] [2025-02-05 16:31:16,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [482491846] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 16:31:16,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1200168932] [2025-02-05 16:31:16,672 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:31:16,672 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:31:16,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:31:16,675 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:31:16,682 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:31:16,733 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-02-05 16:31:16,763 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-02-05 16:31:16,763 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:31:16,763 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:31:16,765 INFO L256 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-02-05 16:31:16,766 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 16:31:17,084 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:31:17,084 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 16:31:17,532 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:31:17,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1200168932] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 16:31:17,532 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 16:31:17,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 22 [2025-02-05 16:31:17,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769752780] [2025-02-05 16:31:17,533 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 16:31:17,533 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-02-05 16:31:17,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:31:17,533 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-02-05 16:31:17,533 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=412, Unknown=0, NotChecked=0, Total=506 [2025-02-05 16:31:17,534 INFO L87 Difference]: Start difference. First operand 32480 states and 44465 transitions. Second operand has 23 states, 23 states have (on average 7.173913043478261) internal successors, (165), 22 states have internal predecessors, (165), 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:31:18,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:31:18,655 INFO L93 Difference]: Finished difference Result 150766 states and 206125 transitions. [2025-02-05 16:31:18,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-02-05 16:31:18,655 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 7.173913043478261) internal successors, (165), 22 states have internal predecessors, (165), 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 69 [2025-02-05 16:31:18,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:31:18,813 INFO L225 Difference]: With dead ends: 150766 [2025-02-05 16:31:18,813 INFO L226 Difference]: Without dead ends: 118395 [2025-02-05 16:31:18,870 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 413 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=494, Invalid=1486, Unknown=0, NotChecked=0, Total=1980 [2025-02-05 16:31:18,870 INFO L435 NwaCegarLoop]: 129 mSDtfsCounter, 1158 mSDsluCounter, 886 mSDsCounter, 0 mSdLazyCounter, 1039 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1158 SdHoareTripleChecker+Valid, 1015 SdHoareTripleChecker+Invalid, 1060 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 1039 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 16:31:18,871 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1158 Valid, 1015 Invalid, 1060 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 1039 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 16:31:18,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118395 states. [2025-02-05 16:31:19,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118395 to 72042. [2025-02-05 16:31:19,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72042 states, 72041 states have (on average 1.3575741591593675) internal successors, (97801), 72041 states have internal predecessors, (97801), 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:31:20,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72042 states to 72042 states and 97801 transitions. [2025-02-05 16:31:20,052 INFO L78 Accepts]: Start accepts. Automaton has 72042 states and 97801 transitions. Word has length 69 [2025-02-05 16:31:20,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:31:20,052 INFO L471 AbstractCegarLoop]: Abstraction has 72042 states and 97801 transitions. [2025-02-05 16:31:20,052 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 7.173913043478261) internal successors, (165), 22 states have internal predecessors, (165), 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:31:20,052 INFO L276 IsEmpty]: Start isEmpty. Operand 72042 states and 97801 transitions. [2025-02-05 16:31:20,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-02-05 16:31:20,059 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:31:20,060 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, 1, 1, 1, 1] [2025-02-05 16:31:20,066 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-02-05 16:31:20,260 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-02-05 16:31:20,260 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:31:20,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:31:20,261 INFO L85 PathProgramCache]: Analyzing trace with hash -1492244929, now seen corresponding path program 1 times [2025-02-05 16:31:20,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:31:20,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254638071] [2025-02-05 16:31:20,261 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:31:20,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:31:20,275 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-02-05 16:31:20,302 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-02-05 16:31:20,302 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:31:20,302 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:31:20,703 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:31:20,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:31:20,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254638071] [2025-02-05 16:31:20,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1254638071] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 16:31:20,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [932176517] [2025-02-05 16:31:20,703 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:31:20,704 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:31:20,704 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:31:20,706 INFO L229 MonitoredProcess]: Starting monitored process 7 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:31:20,711 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-05 16:31:20,779 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-02-05 16:31:20,839 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-02-05 16:31:20,839 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:31:20,839 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:31:20,841 INFO L256 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-02-05 16:31:20,842 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 16:31:21,799 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:31:21,799 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 16:31:22,239 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:31:22,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [932176517] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 16:31:22,239 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 16:31:22,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 11] total 28 [2025-02-05 16:31:22,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476875332] [2025-02-05 16:31:22,240 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 16:31:22,240 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-02-05 16:31:22,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:31:22,240 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-02-05 16:31:22,241 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=676, Unknown=0, NotChecked=0, Total=756 [2025-02-05 16:31:22,241 INFO L87 Difference]: Start difference. First operand 72042 states and 97801 transitions. Second operand has 28 states, 28 states have (on average 6.928571428571429) internal successors, (194), 28 states have internal predecessors, (194), 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:31:37,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:31:37,498 INFO L93 Difference]: Finished difference Result 738814 states and 1001276 transitions. [2025-02-05 16:31:37,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 206 states. [2025-02-05 16:31:37,499 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 6.928571428571429) internal successors, (194), 28 states have internal predecessors, (194), 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 69 [2025-02-05 16:31:37,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:31:38,766 INFO L225 Difference]: With dead ends: 738814 [2025-02-05 16:31:38,767 INFO L226 Difference]: Without dead ends: 666561 [2025-02-05 16:31:38,887 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 349 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 229 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21669 ImplicationChecksByTransitivity, 9.6s TimeCoverageRelationStatistics Valid=7045, Invalid=46085, Unknown=0, NotChecked=0, Total=53130 [2025-02-05 16:31:38,888 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 6353 mSDsluCounter, 3144 mSDsCounter, 0 mSdLazyCounter, 5747 mSolverCounterSat, 120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6353 SdHoareTripleChecker+Valid, 3268 SdHoareTripleChecker+Invalid, 5867 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 5747 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2025-02-05 16:31:38,888 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6353 Valid, 3268 Invalid, 5867 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [120 Valid, 5747 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2025-02-05 16:31:39,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 666561 states. [2025-02-05 16:31:43,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 666561 to 333456. [2025-02-05 16:31:44,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 333456 states, 333455 states have (on average 1.3515916690408) internal successors, (450695), 333455 states have internal predecessors, (450695), 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:31:44,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333456 states to 333456 states and 450695 transitions. [2025-02-05 16:31:44,903 INFO L78 Accepts]: Start accepts. Automaton has 333456 states and 450695 transitions. Word has length 69 [2025-02-05 16:31:44,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:31:44,903 INFO L471 AbstractCegarLoop]: Abstraction has 333456 states and 450695 transitions. [2025-02-05 16:31:44,904 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 6.928571428571429) internal successors, (194), 28 states have internal predecessors, (194), 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:31:44,904 INFO L276 IsEmpty]: Start isEmpty. Operand 333456 states and 450695 transitions. [2025-02-05 16:31:44,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-02-05 16:31:44,908 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:31:44,908 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, 1, 1, 1, 1, 1] [2025-02-05 16:31:44,916 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-02-05 16:31:45,112 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:31:45,113 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:31:45,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:31:45,113 INFO L85 PathProgramCache]: Analyzing trace with hash -1831237465, now seen corresponding path program 1 times [2025-02-05 16:31:45,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:31:45,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084301006] [2025-02-05 16:31:45,113 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:31:45,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:31:45,123 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-02-05 16:31:45,127 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-02-05 16:31:45,127 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:31:45,127 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:31:45,143 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-05 16:31:45,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:31:45,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084301006] [2025-02-05 16:31:45,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2084301006] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:31:45,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:31:45,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:31:45,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603852483] [2025-02-05 16:31:45,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:31:45,144 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:31:45,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:31:45,144 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:31:45,144 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:31:45,144 INFO L87 Difference]: Start difference. First operand 333456 states and 450695 transitions. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 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:31:47,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:31:47,027 INFO L93 Difference]: Finished difference Result 624976 states and 844702 transitions. [2025-02-05 16:31:47,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:31:47,028 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 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 70 [2025-02-05 16:31:47,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:31:48,022 INFO L225 Difference]: With dead ends: 624976 [2025-02-05 16:31:48,022 INFO L226 Difference]: Without dead ends: 292756 [2025-02-05 16:31:48,101 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:31:48,102 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 82 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:31:48,102 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 124 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:31:48,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292756 states. [2025-02-05 16:31:50,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292756 to 290238. [2025-02-05 16:31:50,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290238 states, 290237 states have (on average 1.3326763989429329) internal successors, (386792), 290237 states have internal predecessors, (386792), 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:31:51,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290238 states to 290238 states and 386792 transitions. [2025-02-05 16:31:51,460 INFO L78 Accepts]: Start accepts. Automaton has 290238 states and 386792 transitions. Word has length 70 [2025-02-05 16:31:51,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:31:51,460 INFO L471 AbstractCegarLoop]: Abstraction has 290238 states and 386792 transitions. [2025-02-05 16:31:51,461 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 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:31:51,461 INFO L276 IsEmpty]: Start isEmpty. Operand 290238 states and 386792 transitions. [2025-02-05 16:31:51,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-02-05 16:31:51,465 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:31:51,465 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:31:51,465 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-05 16:31:51,465 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:31:51,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:31:51,466 INFO L85 PathProgramCache]: Analyzing trace with hash 896900768, now seen corresponding path program 1 times [2025-02-05 16:31:51,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:31:51,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494960921] [2025-02-05 16:31:51,466 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:31:51,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:31:51,474 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-02-05 16:31:51,479 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-02-05 16:31:51,479 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:31:51,479 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:31:51,994 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-05 16:31:51,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:31:51,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494960921] [2025-02-05 16:31:51,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [494960921] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:31:51,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:31:51,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:31:51,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069723785] [2025-02-05 16:31:51,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:31:51,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:31:51,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:31:51,999 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:31:51,999 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:31:51,999 INFO L87 Difference]: Start difference. First operand 290238 states and 386792 transitions. Second operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 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:31:53,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:31:53,882 INFO L93 Difference]: Finished difference Result 605703 states and 806186 transitions. [2025-02-05 16:31:53,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:31:53,883 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 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 71 [2025-02-05 16:31:53,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:31:54,677 INFO L225 Difference]: With dead ends: 605703 [2025-02-05 16:31:54,677 INFO L226 Difference]: Without dead ends: 557373 [2025-02-05 16:31:54,738 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:31:54,739 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 70 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:31:54,739 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 203 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:31:55,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557373 states. [2025-02-05 16:31:58,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557373 to 315626. [2025-02-05 16:31:59,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 315626 states, 315625 states have (on average 1.328069702970297) internal successors, (419172), 315625 states have internal predecessors, (419172), 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:32:00,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315626 states to 315626 states and 419172 transitions. [2025-02-05 16:32:00,130 INFO L78 Accepts]: Start accepts. Automaton has 315626 states and 419172 transitions. Word has length 71 [2025-02-05 16:32:00,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:32:00,130 INFO L471 AbstractCegarLoop]: Abstraction has 315626 states and 419172 transitions. [2025-02-05 16:32:00,130 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 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:32:00,130 INFO L276 IsEmpty]: Start isEmpty. Operand 315626 states and 419172 transitions. [2025-02-05 16:32:00,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-02-05 16:32:00,133 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:32:00,134 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, 1, 1, 1, 1, 1, 1] [2025-02-05 16:32:00,134 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-05 16:32:00,134 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 16:32:00,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:32:00,134 INFO L85 PathProgramCache]: Analyzing trace with hash 1411171868, now seen corresponding path program 1 times [2025-02-05 16:32:00,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:32:00,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252784618] [2025-02-05 16:32:00,134 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:32:00,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:32:00,142 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-02-05 16:32:00,159 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-02-05 16:32:00,160 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:32:00,160 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:32:01,101 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:32:01,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:32:01,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252784618] [2025-02-05 16:32:01,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [252784618] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 16:32:01,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1489489329] [2025-02-05 16:32:01,101 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:32:01,102 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:32:01,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:32:01,104 INFO L229 MonitoredProcess]: Starting monitored process 8 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:32:01,105 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-05 16:32:01,167 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-02-05 16:32:01,196 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-02-05 16:32:01,196 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:32:01,196 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:32:01,197 INFO L256 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-02-05 16:32:01,199 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 16:32:01,815 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:32:01,815 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 16:32:02,797 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:32:02,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1489489329] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 16:32:02,797 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 16:32:02,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 12, 12] total 43 [2025-02-05 16:32:02,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420764950] [2025-02-05 16:32:02,797 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 16:32:02,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2025-02-05 16:32:02,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:32:02,799 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2025-02-05 16:32:02,800 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=1683, Unknown=0, NotChecked=0, Total=1806 [2025-02-05 16:32:02,801 INFO L87 Difference]: Start difference. First operand 315626 states and 419172 transitions. Second operand has 43 states, 43 states have (on average 4.325581395348837) internal successors, (186), 43 states have internal predecessors, (186), 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)