./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.UNBOUNDED.pals.c.v+lhb-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.UNBOUNDED.pals.c.v+lhb-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 34aba2e0444cf7168338399e1c016871ad9a3305ff2dee9e611b86f3cad834b5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 16:31:24,403 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 16:31:24,450 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:24,453 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 16:31:24,453 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 16:31:24,469 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 16:31:24,470 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 16:31:24,470 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 16:31:24,470 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 16:31:24,470 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 16:31:24,471 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 16:31:24,471 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 16:31:24,471 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 16:31:24,471 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 16:31:24,471 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 16:31:24,471 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 16:31:24,471 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 16:31:24,471 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 16:31:24,471 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 16:31:24,472 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 16:31:24,472 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 16:31:24,472 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 16:31:24,472 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 16:31:24,472 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 16:31:24,472 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 16:31:24,472 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 16:31:24,472 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 16:31:24,472 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 16:31:24,472 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 16:31:24,472 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 16:31:24,472 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 16:31:24,472 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 16:31:24,473 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 16:31:24,473 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 16:31:24,473 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 16:31:24,473 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 16:31:24,473 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 16:31:24,473 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 16:31:24,473 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 16:31:24,473 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 16:31:24,473 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 16:31:24,473 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 16:31:24,473 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 16:31:24,473 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 -> 34aba2e0444cf7168338399e1c016871ad9a3305ff2dee9e611b86f3cad834b5 [2025-02-05 16:31:24,669 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 16:31:24,675 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 16:31:24,676 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 16:31:24,677 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 16:31:24,677 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 16:31:24,679 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.UNBOUNDED.pals.c.v+lhb-reducer.c [2025-02-05 16:31:25,799 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0369b90a7/c96d66db349641f4aba29e6a0bee941c/FLAGc5ca1c7f0 [2025-02-05 16:31:26,181 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 16:31:26,182 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2025-02-05 16:31:26,214 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0369b90a7/c96d66db349641f4aba29e6a0bee941c/FLAGc5ca1c7f0 [2025-02-05 16:31:26,394 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0369b90a7/c96d66db349641f4aba29e6a0bee941c [2025-02-05 16:31:26,397 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 16:31:26,399 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 16:31:26,400 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 16:31:26,400 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 16:31:26,403 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 16:31:26,404 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 04:31:26" (1/1) ... [2025-02-05 16:31:26,405 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@339da571 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:31:26, skipping insertion in model container [2025-02-05 16:31:26,405 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 04:31:26" (1/1) ... [2025-02-05 16:31:26,474 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 16:31:26,661 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.UNBOUNDED.pals.c.v+lhb-reducer.c[8127,8140] [2025-02-05 16:31:26,699 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.UNBOUNDED.pals.c.v+lhb-reducer.c[14997,15010] [2025-02-05 16:31:26,708 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.UNBOUNDED.pals.c.v+lhb-reducer.c[17084,17097] [2025-02-05 16:31:26,712 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.UNBOUNDED.pals.c.v+lhb-reducer.c[18108,18121] [2025-02-05 16:31:26,816 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 16:31:26,830 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 16:31:26,874 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.UNBOUNDED.pals.c.v+lhb-reducer.c[8127,8140] [2025-02-05 16:31:26,891 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.UNBOUNDED.pals.c.v+lhb-reducer.c[14997,15010] [2025-02-05 16:31:26,900 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.UNBOUNDED.pals.c.v+lhb-reducer.c[17084,17097] [2025-02-05 16:31:26,902 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.UNBOUNDED.pals.c.v+lhb-reducer.c[18108,18121] [2025-02-05 16:31:26,974 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 16:31:26,991 INFO L204 MainTranslator]: Completed translation [2025-02-05 16:31:26,992 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:31:26 WrapperNode [2025-02-05 16:31:26,992 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 16:31:26,993 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 16:31:26,993 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 16:31:26,993 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 16:31:26,997 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:26" (1/1) ... [2025-02-05 16:31:27,020 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:26" (1/1) ... [2025-02-05 16:31:27,095 INFO L138 Inliner]: procedures = 23, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 2620 [2025-02-05 16:31:27,095 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 16:31:27,095 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 16:31:27,095 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 16:31:27,095 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 16:31:27,101 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:26" (1/1) ... [2025-02-05 16:31:27,102 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:26" (1/1) ... [2025-02-05 16:31:27,113 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:26" (1/1) ... [2025-02-05 16:31:27,149 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:27,150 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:26" (1/1) ... [2025-02-05 16:31:27,150 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:26" (1/1) ... [2025-02-05 16:31:27,187 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:26" (1/1) ... [2025-02-05 16:31:27,192 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:26" (1/1) ... [2025-02-05 16:31:27,196 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:26" (1/1) ... [2025-02-05 16:31:27,206 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:26" (1/1) ... [2025-02-05 16:31:27,217 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 16:31:27,218 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 16:31:27,218 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 16:31:27,218 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 16:31:27,219 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:31:26" (1/1) ... [2025-02-05 16:31:27,223 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 16:31:27,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:31:27,246 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:27,251 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:27,270 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 16:31:27,271 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 16:31:27,271 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 16:31:27,271 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 16:31:27,395 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 16:31:27,397 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 16:31:28,706 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1621: havoc main_~__tmp_13~0#1, main_~assert__arg~12#1;havoc main_~check__tmp~13#1; [2025-02-05 16:31:28,706 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2150: havoc main_~__tmp_22~0#1, main_~assert__arg~21#1;havoc main_~check__tmp~22#1; [2025-02-05 16:31:28,706 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3868: havoc main_~__tmp_50~0#1, main_~assert__arg~49#1;havoc main_~check__tmp~50#1; [2025-02-05 16:31:28,706 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L235: havoc main_~node3____CPAchecker_TMP_0~0#1; [2025-02-05 16:31:28,706 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L699: havoc main_~node2____CPAchecker_TMP_0~1#1; [2025-02-05 16:31:28,706 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1492: havoc main_~__tmp_11~0#1, main_~assert__arg~10#1;havoc main_~check__tmp~11#1;havoc main_~node3____CPAchecker_TMP_1~1#1; [2025-02-05 16:31:28,706 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1096: havoc main_~node2__m2~3#1; [2025-02-05 16:31:28,707 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2021: havoc main_~__tmp_20~0#1, main_~assert__arg~19#1;havoc main_~check__tmp~20#1; [2025-02-05 16:31:28,707 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3739: havoc main_~__tmp_48~0#1, main_~assert__arg~47#1;havoc main_~check__tmp~48#1; [2025-02-05 16:31:28,707 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3343: havoc main_~__tmp_41~0#1, main_~assert__arg~40#1;havoc main_~check__tmp~41#1; [2025-02-05 16:31:28,707 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2882: havoc main_~__tmp_34~0#1, main_~assert__arg~33#1;havoc main_~check__tmp~34#1; [2025-02-05 16:31:28,707 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L504: havoc main_~node1____CPAchecker_TMP_0~1#1; [2025-02-05 16:31:28,707 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826: havoc main_~node3__m3~7#1;havoc main_~node2____CPAchecker_TMP_1~1#1; [2025-02-05 16:31:28,708 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3544: havoc main_~node3__m3~14#1; [2025-02-05 16:31:28,708 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2753: havoc main_~__tmp_32~0#1, main_~assert__arg~31#1;havoc main_~check__tmp~32#1; [2025-02-05 16:31:28,708 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2357: havoc main_~__tmp_25~0#1, main_~assert__arg~24#1;havoc main_~check__tmp~25#1; [2025-02-05 16:31:28,708 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L641: havoc main_~node3____CPAchecker_TMP_1~0#1; [2025-02-05 16:31:28,708 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2558: havoc main_~node3__m3~10#1; [2025-02-05 16:31:28,708 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L312: havoc main_~node3__m3~1#1; [2025-02-05 16:31:28,708 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L973: havoc main_~__tmp_5~0#1, main_~assert__arg~4#1;havoc main_~check__tmp~4#1; [2025-02-05 16:31:28,708 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L446: havoc main_~node1__m1~3#1;havoc main_~__tmp_3~0#1, main_~assert__arg~2#1;havoc main_~check__tmp~2#1; [2025-02-05 16:31:28,708 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1437: havoc main_~__tmp_10~0#1, main_~assert__arg~9#1;havoc main_~check__tmp~10#1; [2025-02-05 16:31:28,708 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L380: havoc main_~node2__m2~2#1; [2025-02-05 16:31:28,709 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1966: havoc main_~__tmp_19~0#1, main_~assert__arg~18#1;havoc main_~check__tmp~19#1;havoc main_~node3____CPAchecker_TMP_1~3#1; [2025-02-05 16:31:28,709 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3684: havoc main_~__tmp_47~0#1, main_~assert__arg~46#1;havoc main_~check__tmp~47#1;havoc main_~node3____CPAchecker_TMP_1~10#1; [2025-02-05 16:31:28,709 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2099: havoc main_~__tmp_21~0#1, main_~assert__arg~20#1;havoc main_~check__tmp~21#1; [2025-02-05 16:31:28,709 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3817: havoc main_~__tmp_49~0#1, main_~assert__arg~48#1;havoc main_~check__tmp~49#1; [2025-02-05 16:31:28,709 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1307: havoc main_~check__tmp~9#1; [2025-02-05 16:31:28,709 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1836: havoc main_~node3____CPAchecker_TMP_0~3#1; [2025-02-05 16:31:28,709 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3554: havoc main_~node3____CPAchecker_TMP_0~10#1; [2025-02-05 16:31:28,709 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3290: havoc main_~node2__m2~5#1;havoc main_~node1____CPAchecker_TMP_1~2#1; [2025-02-05 16:31:28,709 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1243: havoc main_~node3__m3~5#1; [2025-02-05 16:31:28,709 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L186: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2025-02-05 16:31:28,710 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4217: havoc main_~__tmp_56~0#1, main_~assert__arg~55#1;havoc main_~check__tmp~56#1; [2025-02-05 16:31:28,710 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2698: havoc main_~__tmp_31~0#1, main_~assert__arg~30#1;havoc main_~check__tmp~31#1;havoc main_~node3____CPAchecker_TMP_1~6#1; [2025-02-05 16:31:28,710 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1113: havoc main_~node3__m3~4#1; [2025-02-05 16:31:28,710 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2831: havoc main_~__tmp_33~0#1, main_~assert__arg~32#1;havoc main_~check__tmp~33#1; [2025-02-05 16:31:28,710 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2568: havoc main_~node3____CPAchecker_TMP_0~6#1; [2025-02-05 16:31:28,710 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2304: havoc main_~node2__m2~4#1; [2025-02-05 16:31:28,710 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4022: havoc main_~node3__m3~16#1; [2025-02-05 16:31:28,710 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3231: havoc main_~__tmp_40~0#1, main_~assert__arg~39#1;havoc main_~check__tmp~40#1; [2025-02-05 16:31:28,710 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1911: havoc main_~__tmp_18~0#1, main_~assert__arg~17#1;havoc main_~check__tmp~18#1; [2025-02-05 16:31:28,710 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3629: havoc main_~__tmp_46~0#1, main_~assert__arg~45#1;havoc main_~check__tmp~46#1; [2025-02-05 16:31:28,710 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3300: havoc main_~node2____CPAchecker_TMP_0~3#1; [2025-02-05 16:31:28,710 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3036: havoc main_~node3__m3~12#1; [2025-02-05 16:31:28,710 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L196: havoc main_~node1____CPAchecker_TMP_0~0#1; [2025-02-05 16:31:28,710 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L791: havoc main_~node1____CPAchecker_TMP_0~2#1; [2025-02-05 16:31:28,711 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1782: havoc main_~__tmp_16~0#1, main_~assert__arg~15#1;havoc main_~check__tmp~16#1; [2025-02-05 16:31:28,711 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4162: havoc main_~__tmp_55~0#1, main_~assert__arg~54#1;havoc main_~check__tmp~55#1;havoc main_~node3____CPAchecker_TMP_1~12#1; [2025-02-05 16:31:28,711 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L727: havoc main_~node2____CPAchecker_TMP_1~0#1; [2025-02-05 16:31:28,711 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2643: havoc main_~__tmp_30~0#1, main_~assert__arg~29#1;havoc main_~check__tmp~30#1; [2025-02-05 16:31:28,711 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1587: havoc main_~node3__m3~6#1; [2025-02-05 16:31:28,711 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L398: havoc main_~node3__m3~2#1; [2025-02-05 16:31:28,711 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2314: havoc main_~node2____CPAchecker_TMP_0~2#1; [2025-02-05 16:31:28,711 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4032: havoc main_~node3____CPAchecker_TMP_0~12#1; [2025-02-05 16:31:28,712 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3504: havoc main_~__tmp_44~0#1, main_~assert__arg~43#1;havoc main_~check__tmp~44#1; [2025-02-05 16:31:28,712 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L532: havoc main_~node1____CPAchecker_TMP_1~0#1; [2025-02-05 16:31:28,712 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1194: havoc main_~__tmp_8~0#1, main_~assert__arg~7#1;havoc main_~check__tmp~7#1; [2025-02-05 16:31:28,712 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3176: havoc main_~__tmp_39~0#1, main_~assert__arg~38#1;havoc main_~check__tmp~39#1;havoc main_~node3____CPAchecker_TMP_1~8#1; [2025-02-05 16:31:28,712 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3309: havoc main_~node3__m3~13#1; [2025-02-05 16:31:28,712 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L271: havoc main_~node1__m1~1#1;havoc main_~__tmp_1~0#1, main_~assert__arg~0#1;havoc main_~check__tmp~0#1; [2025-02-05 16:31:28,712 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3046: havoc main_~node3____CPAchecker_TMP_0~8#1; [2025-02-05 16:31:28,712 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2518: havoc main_~__tmp_28~0#1, main_~assert__arg~27#1;havoc main_~check__tmp~28#1; [2025-02-05 16:31:28,712 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L206: havoc main_~node2__m2~0#1; [2025-02-05 16:31:28,712 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1727: havoc main_~__tmp_15~0#1, main_~assert__arg~14#1;havoc main_~check__tmp~15#1;havoc main_~node3____CPAchecker_TMP_1~2#1; [2025-02-05 16:31:28,712 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1860: havoc main_~__tmp_17~0#1, main_~assert__arg~16#1;havoc main_~check__tmp~17#1; [2025-02-05 16:31:28,712 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3578: havoc main_~__tmp_45~0#1, main_~assert__arg~44#1;havoc main_~check__tmp~45#1; [2025-02-05 16:31:28,713 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2323: havoc main_~node3__m3~9#1; [2025-02-05 16:31:28,713 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4107: havoc main_~__tmp_54~0#1, main_~assert__arg~53#1;havoc main_~check__tmp~54#1; [2025-02-05 16:31:28,713 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1597: havoc main_~node3____CPAchecker_TMP_0~2#1; [2025-02-05 16:31:28,713 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3449: havoc main_~__tmp_43~0#1, main_~assert__arg~42#1;havoc main_~check__tmp~43#1;havoc main_~node3____CPAchecker_TMP_1~9#1; [2025-02-05 16:31:28,713 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2260: havoc main_~__tmp_24~0#1, main_~assert__arg~23#1;havoc main_~check__tmp~24#1; [2025-02-05 16:31:28,713 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3978: havoc main_~__tmp_52~0#1, main_~assert__arg~51#1;havoc main_~check__tmp~52#1; [2025-02-05 16:31:28,713 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2592: havoc main_~__tmp_29~0#1, main_~assert__arg~28#1;havoc main_~check__tmp~29#1; [2025-02-05 16:31:28,713 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3319: havoc main_~node3____CPAchecker_TMP_0~9#1; [2025-02-05 16:31:28,713 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3121: havoc main_~__tmp_38~0#1, main_~assert__arg~37#1;havoc main_~check__tmp~38#1; [2025-02-05 16:31:28,713 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L941: havoc main_~node3__m3~3#1; [2025-02-05 16:31:28,713 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2065: havoc main_~node3__m3~8#1; [2025-02-05 16:31:28,713 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3783: havoc main_~node3__m3~15#1;havoc main_~node2____CPAchecker_TMP_1~3#1; [2025-02-05 16:31:28,713 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L216: havoc main_~node2____CPAchecker_TMP_0~0#1; [2025-02-05 16:31:28,713 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L613: havoc main_~node3____CPAchecker_TMP_0~1#1; [2025-02-05 16:31:28,713 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2463: havoc main_~__tmp_27~0#1, main_~assert__arg~26#1;havoc main_~check__tmp~27#1;havoc main_~node3____CPAchecker_TMP_1~5#1; [2025-02-05 16:31:28,714 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2992: havoc main_~__tmp_36~0#1, main_~assert__arg~35#1;havoc main_~check__tmp~36#1; [2025-02-05 16:31:28,714 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1672: havoc main_~__tmp_14~0#1, main_~assert__arg~13#1;havoc main_~check__tmp~14#1; [2025-02-05 16:31:28,714 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2333: havoc main_~node3____CPAchecker_TMP_0~5#1; [2025-02-05 16:31:28,714 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1277: havoc main_~__tmp_9~0#1, main_~assert__arg~8#1;havoc main_~check__tmp~8#1; [2025-02-05 16:31:28,714 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1145: havoc main_~__tmp_7~0#1, main_~assert__arg~6#1;havoc main_~check__tmp~6#1; [2025-02-05 16:31:28,714 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2797: havoc main_~node3__m3~11#1;havoc main_~node2____CPAchecker_TMP_1~2#1; [2025-02-05 16:31:28,714 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3394: havoc main_~__tmp_42~0#1, main_~assert__arg~41#1;havoc main_~check__tmp~42#1; [2025-02-05 16:31:28,714 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2205: havoc main_~__tmp_23~0#1, main_~assert__arg~22#1;havoc main_~check__tmp~23#1;havoc main_~node3____CPAchecker_TMP_1~4#1; [2025-02-05 16:31:28,714 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L884: havoc main_~__tmp_4~0#1, main_~assert__arg~3#1;havoc main_~check__tmp~3#1; [2025-02-05 16:31:28,714 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3923: havoc main_~__tmp_51~0#1, main_~assert__arg~50#1;havoc main_~check__tmp~51#1;havoc main_~node3____CPAchecker_TMP_1~11#1; [2025-02-05 16:31:28,714 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L356: havoc main_~node1__m1~2#1;havoc main_~__tmp_2~0#1, main_~assert__arg~1#1;havoc main_~check__tmp~1#1; [2025-02-05 16:31:28,714 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4056: havoc main_~__tmp_53~0#1, main_~assert__arg~52#1;havoc main_~check__tmp~53#1; [2025-02-05 16:31:28,714 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L819: havoc main_~node1____CPAchecker_TMP_1~1#1; [2025-02-05 16:31:28,714 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L225: havoc main_~node3__m3~0#1; [2025-02-05 16:31:28,714 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2075: havoc main_~node3____CPAchecker_TMP_0~4#1; [2025-02-05 16:31:28,714 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3793: havoc main_~node3____CPAchecker_TMP_0~11#1; [2025-02-05 16:31:28,714 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1547: havoc main_~__tmp_12~0#1, main_~assert__arg~11#1;havoc main_~check__tmp~12#1; [2025-02-05 16:31:28,714 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2408: havoc main_~__tmp_26~0#1, main_~assert__arg~25#1;havoc main_~check__tmp~26#1; [2025-02-05 16:31:28,714 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2937: havoc main_~__tmp_35~0#1, main_~assert__arg~34#1;havoc main_~check__tmp~35#1;havoc main_~node3____CPAchecker_TMP_1~7#1; [2025-02-05 16:31:28,714 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L295: havoc main_~node2__m2~1#1; [2025-02-05 16:31:28,714 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3070: havoc main_~__tmp_37~0#1, main_~assert__arg~36#1;havoc main_~check__tmp~37#1; [2025-02-05 16:31:28,714 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1022: havoc main_~__tmp_6~0#1, main_~assert__arg~5#1;havoc main_~check__tmp~5#1; [2025-02-05 16:31:28,714 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2807: havoc main_~node3____CPAchecker_TMP_0~7#1; [2025-02-05 16:31:28,789 INFO L? ?]: Removed 426 outVars from TransFormulas that were not future-live. [2025-02-05 16:31:28,790 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 16:31:28,808 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 16:31:28,808 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 16:31:28,809 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 04:31:28 BoogieIcfgContainer [2025-02-05 16:31:28,809 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 16:31:28,814 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 16:31:28,815 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 16:31:28,818 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 16:31:28,819 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 04:31:26" (1/3) ... [2025-02-05 16:31:28,819 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10776b7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 04:31:28, skipping insertion in model container [2025-02-05 16:31:28,819 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 04:31:26" (2/3) ... [2025-02-05 16:31:28,820 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10776b7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 04:31:28, skipping insertion in model container [2025-02-05 16:31:28,820 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 04:31:28" (3/3) ... [2025-02-05 16:31:28,821 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2025-02-05 16:31:28,833 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 16:31:28,836 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr-var-start-time.3.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c that has 1 procedures, 456 locations, 1 initial locations, 0 loop locations, and 4 error locations. [2025-02-05 16:31:28,889 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 16:31:28,897 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;@5888b521, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 16:31:28,898 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-02-05 16:31:28,902 INFO L276 IsEmpty]: Start isEmpty. Operand has 456 states, 451 states have (on average 1.8492239467849223) internal successors, (834), 455 states have internal predecessors, (834), 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:28,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-02-05 16:31:28,932 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:31:28,932 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, 1, 1, 1, 1, 1, 1] [2025-02-05 16:31:28,933 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-02-05 16:31:28,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:31:28,938 INFO L85 PathProgramCache]: Analyzing trace with hash 1635900914, now seen corresponding path program 1 times [2025-02-05 16:31:28,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:31:28,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126703753] [2025-02-05 16:31:28,944 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:31:28,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:31:29,016 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-02-05 16:31:29,115 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-02-05 16:31:29,115 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:31:29,115 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:31:29,372 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:29,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:31:29,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126703753] [2025-02-05 16:31:29,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1126703753] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:31:29,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:31:29,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:31:29,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998905715] [2025-02-05 16:31:29,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:31:29,381 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:31:29,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:31:29,395 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:31:29,396 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:31:29,398 INFO L87 Difference]: Start difference. First operand has 456 states, 451 states have (on average 1.8492239467849223) internal successors, (834), 455 states have internal predecessors, (834), 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 5 states, 5 states have (on average 10.0) internal successors, (50), 4 states have internal predecessors, (50), 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:29,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:31:29,781 INFO L93 Difference]: Finished difference Result 834 states and 1473 transitions. [2025-02-05 16:31:29,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:31:29,783 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 4 states have internal predecessors, (50), 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 50 [2025-02-05 16:31:29,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:31:29,796 INFO L225 Difference]: With dead ends: 834 [2025-02-05 16:31:29,796 INFO L226 Difference]: Without dead ends: 485 [2025-02-05 16:31:29,799 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-05 16:31:29,801 INFO L435 NwaCegarLoop]: 444 mSDtfsCounter, 2298 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 298 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2298 SdHoareTripleChecker+Valid, 577 SdHoareTripleChecker+Invalid, 312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 298 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 16:31:29,801 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2298 Valid, 577 Invalid, 312 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 298 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 16:31:29,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states. [2025-02-05 16:31:29,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 479. [2025-02-05 16:31:29,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 479 states, 475 states have (on average 1.3747368421052633) internal successors, (653), 478 states have internal predecessors, (653), 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:29,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 479 states and 653 transitions. [2025-02-05 16:31:29,858 INFO L78 Accepts]: Start accepts. Automaton has 479 states and 653 transitions. Word has length 50 [2025-02-05 16:31:29,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:31:29,859 INFO L471 AbstractCegarLoop]: Abstraction has 479 states and 653 transitions. [2025-02-05 16:31:29,859 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 4 states have internal predecessors, (50), 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:29,859 INFO L276 IsEmpty]: Start isEmpty. Operand 479 states and 653 transitions. [2025-02-05 16:31:29,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-02-05 16:31:29,863 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:31:29,863 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, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:31:29,866 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 16:31:29,866 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-02-05 16:31:29,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:31:29,867 INFO L85 PathProgramCache]: Analyzing trace with hash 1349761922, now seen corresponding path program 1 times [2025-02-05 16:31:29,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:31:29,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517314360] [2025-02-05 16:31:29,867 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:31:29,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:31:29,888 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-02-05 16:31:29,909 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-02-05 16:31:29,913 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:31:29,913 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:31:29,993 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:29,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:31:29,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517314360] [2025-02-05 16:31:29,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [517314360] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:31:29,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:31:29,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:31:29,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560821568] [2025-02-05 16:31:29,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:31:29,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:31:29,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:31:29,995 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:31:29,995 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:31:29,995 INFO L87 Difference]: Start difference. First operand 479 states and 653 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 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:30,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:31:30,040 INFO L93 Difference]: Finished difference Result 922 states and 1308 transitions. [2025-02-05 16:31:30,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:31:30,040 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 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 51 [2025-02-05 16:31:30,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:31:30,043 INFO L225 Difference]: With dead ends: 922 [2025-02-05 16:31:30,043 INFO L226 Difference]: Without dead ends: 698 [2025-02-05 16:31:30,043 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:30,044 INFO L435 NwaCegarLoop]: 508 mSDtfsCounter, 268 mSDsluCounter, 346 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 268 SdHoareTripleChecker+Valid, 854 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:31:30,044 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [268 Valid, 854 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:31:30,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 698 states. [2025-02-05 16:31:30,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 698 to 691. [2025-02-05 16:31:30,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 691 states, 687 states have (on average 1.4046579330422124) internal successors, (965), 690 states have internal predecessors, (965), 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:30,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 691 states to 691 states and 965 transitions. [2025-02-05 16:31:30,074 INFO L78 Accepts]: Start accepts. Automaton has 691 states and 965 transitions. Word has length 51 [2025-02-05 16:31:30,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:31:30,074 INFO L471 AbstractCegarLoop]: Abstraction has 691 states and 965 transitions. [2025-02-05 16:31:30,074 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 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:30,075 INFO L276 IsEmpty]: Start isEmpty. Operand 691 states and 965 transitions. [2025-02-05 16:31:30,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-02-05 16:31:30,076 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:31:30,076 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, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:31:30,076 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 16:31:30,076 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-02-05 16:31:30,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:31:30,077 INFO L85 PathProgramCache]: Analyzing trace with hash 36178946, now seen corresponding path program 1 times [2025-02-05 16:31:30,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:31:30,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275311460] [2025-02-05 16:31:30,077 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:31:30,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:31:30,103 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-02-05 16:31:30,121 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-02-05 16:31:30,121 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:31:30,121 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:31:30,179 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:30,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:31:30,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275311460] [2025-02-05 16:31:30,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [275311460] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:31:30,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:31:30,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:31:30,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300537315] [2025-02-05 16:31:30,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:31:30,180 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:31:30,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:31:30,181 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:31:30,181 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:31:30,181 INFO L87 Difference]: Start difference. First operand 691 states and 965 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 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:30,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:31:30,219 INFO L93 Difference]: Finished difference Result 1596 states and 2282 transitions. [2025-02-05 16:31:30,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:31:30,221 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 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 51 [2025-02-05 16:31:30,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:31:30,226 INFO L225 Difference]: With dead ends: 1596 [2025-02-05 16:31:30,226 INFO L226 Difference]: Without dead ends: 1120 [2025-02-05 16:31:30,228 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:30,228 INFO L435 NwaCegarLoop]: 599 mSDtfsCounter, 366 mSDsluCounter, 337 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 366 SdHoareTripleChecker+Valid, 936 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:31:30,228 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [366 Valid, 936 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:31:30,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1120 states. [2025-02-05 16:31:30,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1120 to 1110. [2025-02-05 16:31:30,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1110 states, 1106 states have (on average 1.403254972875226) internal successors, (1552), 1109 states have internal predecessors, (1552), 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:30,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1110 states to 1110 states and 1552 transitions. [2025-02-05 16:31:30,258 INFO L78 Accepts]: Start accepts. Automaton has 1110 states and 1552 transitions. Word has length 51 [2025-02-05 16:31:30,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:31:30,258 INFO L471 AbstractCegarLoop]: Abstraction has 1110 states and 1552 transitions. [2025-02-05 16:31:30,258 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 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:30,258 INFO L276 IsEmpty]: Start isEmpty. Operand 1110 states and 1552 transitions. [2025-02-05 16:31:30,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-02-05 16:31:30,260 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:31:30,260 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, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:31:30,260 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 16:31:30,260 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-02-05 16:31:30,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:31:30,261 INFO L85 PathProgramCache]: Analyzing trace with hash 1154325020, now seen corresponding path program 1 times [2025-02-05 16:31:30,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:31:30,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621734547] [2025-02-05 16:31:30,261 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:31:30,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:31:30,276 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-02-05 16:31:30,289 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-02-05 16:31:30,289 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:31:30,289 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:31:30,390 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:30,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:31:30,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621734547] [2025-02-05 16:31:30,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [621734547] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:31:30,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:31:30,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:31:30,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118946369] [2025-02-05 16:31:30,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:31:30,391 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:31:30,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:31:30,392 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:31:30,392 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:31:30,392 INFO L87 Difference]: Start difference. First operand 1110 states and 1552 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 4 states have internal predecessors, (51), 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:30,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:31:30,655 INFO L93 Difference]: Finished difference Result 2275 states and 3231 transitions. [2025-02-05 16:31:30,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:31:30,656 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 4 states have internal predecessors, (51), 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 51 [2025-02-05 16:31:30,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:31:30,660 INFO L225 Difference]: With dead ends: 2275 [2025-02-05 16:31:30,660 INFO L226 Difference]: Without dead ends: 1375 [2025-02-05 16:31:30,661 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-05 16:31:30,662 INFO L435 NwaCegarLoop]: 256 mSDtfsCounter, 1526 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1526 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 16:31:30,662 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1526 Valid, 363 Invalid, 266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 16:31:30,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1375 states. [2025-02-05 16:31:30,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1375 to 1364. [2025-02-05 16:31:30,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1364 states, 1360 states have (on average 1.4044117647058822) internal successors, (1910), 1363 states have internal predecessors, (1910), 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:30,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1364 states to 1364 states and 1910 transitions. [2025-02-05 16:31:30,698 INFO L78 Accepts]: Start accepts. Automaton has 1364 states and 1910 transitions. Word has length 51 [2025-02-05 16:31:30,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:31:30,699 INFO L471 AbstractCegarLoop]: Abstraction has 1364 states and 1910 transitions. [2025-02-05 16:31:30,699 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 4 states have internal predecessors, (51), 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:30,699 INFO L276 IsEmpty]: Start isEmpty. Operand 1364 states and 1910 transitions. [2025-02-05 16:31:30,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-02-05 16:31:30,701 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:31:30,701 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:31:30,701 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 16:31:30,701 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-02-05 16:31:30,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:31:30,702 INFO L85 PathProgramCache]: Analyzing trace with hash 1125487601, now seen corresponding path program 1 times [2025-02-05 16:31:30,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:31:30,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380790018] [2025-02-05 16:31:30,702 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:31:30,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:31:30,723 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-02-05 16:31:30,737 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-02-05 16:31:30,739 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:31:30,740 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:31:30,840 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:30,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:31:30,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380790018] [2025-02-05 16:31:30,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [380790018] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:31:30,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:31:30,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 16:31:30,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474235253] [2025-02-05 16:31:30,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:31:30,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:31:30,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:31:30,842 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:31:30,842 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:31:30,842 INFO L87 Difference]: Start difference. First operand 1364 states and 1910 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 4 states have internal predecessors, (52), 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:31,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:31:31,075 INFO L93 Difference]: Finished difference Result 3431 states and 4926 transitions. [2025-02-05 16:31:31,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:31:31,076 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 4 states have internal predecessors, (52), 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 52 [2025-02-05 16:31:31,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:31:31,084 INFO L225 Difference]: With dead ends: 3431 [2025-02-05 16:31:31,084 INFO L226 Difference]: Without dead ends: 2220 [2025-02-05 16:31:31,089 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-05 16:31:31,089 INFO L435 NwaCegarLoop]: 244 mSDtfsCounter, 1469 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1469 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 16:31:31,090 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1469 Valid, 359 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 16:31:31,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2220 states. [2025-02-05 16:31:31,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2220 to 2214. [2025-02-05 16:31:31,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2214 states, 2210 states have (on average 1.430316742081448) internal successors, (3161), 2213 states have internal predecessors, (3161), 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:31,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2214 states to 2214 states and 3161 transitions. [2025-02-05 16:31:31,135 INFO L78 Accepts]: Start accepts. Automaton has 2214 states and 3161 transitions. Word has length 52 [2025-02-05 16:31:31,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:31:31,135 INFO L471 AbstractCegarLoop]: Abstraction has 2214 states and 3161 transitions. [2025-02-05 16:31:31,136 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 4 states have internal predecessors, (52), 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:31,136 INFO L276 IsEmpty]: Start isEmpty. Operand 2214 states and 3161 transitions. [2025-02-05 16:31:31,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-02-05 16:31:31,138 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:31:31,139 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:31:31,139 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 16:31:31,139 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-02-05 16:31:31,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:31:31,139 INFO L85 PathProgramCache]: Analyzing trace with hash 1744937554, now seen corresponding path program 1 times [2025-02-05 16:31:31,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:31:31,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208727949] [2025-02-05 16:31:31,140 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:31:31,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:31:31,175 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-02-05 16:31:31,182 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-02-05 16:31:31,183 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:31:31,183 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:31:31,229 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:31,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:31:31,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208727949] [2025-02-05 16:31:31,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1208727949] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:31:31,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:31:31,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:31:31,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550974670] [2025-02-05 16:31:31,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:31:31,229 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:31:31,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:31:31,230 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:31:31,230 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:31:31,230 INFO L87 Difference]: Start difference. First operand 2214 states and 3161 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 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:31,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:31:31,269 INFO L93 Difference]: Finished difference Result 4626 states and 6688 transitions. [2025-02-05 16:31:31,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:31:31,269 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 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 52 [2025-02-05 16:31:31,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:31:31,281 INFO L225 Difference]: With dead ends: 4626 [2025-02-05 16:31:31,282 INFO L226 Difference]: Without dead ends: 2983 [2025-02-05 16:31:31,285 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:31,285 INFO L435 NwaCegarLoop]: 426 mSDtfsCounter, 247 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 714 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:31:31,286 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 714 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:31:31,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2983 states. [2025-02-05 16:31:31,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2983 to 2965. [2025-02-05 16:31:31,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2965 states, 2961 states have (on average 1.414724755150287) internal successors, (4189), 2964 states have internal predecessors, (4189), 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:31,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2965 states to 2965 states and 4189 transitions. [2025-02-05 16:31:31,346 INFO L78 Accepts]: Start accepts. Automaton has 2965 states and 4189 transitions. Word has length 52 [2025-02-05 16:31:31,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:31:31,347 INFO L471 AbstractCegarLoop]: Abstraction has 2965 states and 4189 transitions. [2025-02-05 16:31:31,347 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 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:31,348 INFO L276 IsEmpty]: Start isEmpty. Operand 2965 states and 4189 transitions. [2025-02-05 16:31:31,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-02-05 16:31:31,350 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:31:31,350 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:31:31,350 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 16:31:31,350 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-02-05 16:31:31,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:31:31,351 INFO L85 PathProgramCache]: Analyzing trace with hash 278429490, now seen corresponding path program 1 times [2025-02-05 16:31:31,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:31:31,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895961959] [2025-02-05 16:31:31,351 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:31:31,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:31:31,363 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-02-05 16:31:31,376 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-02-05 16:31:31,377 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:31:31,377 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:31:31,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:31:31,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:31:31,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895961959] [2025-02-05 16:31:31,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [895961959] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:31:31,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:31:31,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 16:31:31,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829863294] [2025-02-05 16:31:31,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:31:31,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 16:31:31,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:31:31,488 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 16:31:31,488 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-05 16:31:31,488 INFO L87 Difference]: Start difference. First operand 2965 states and 4189 transitions. Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 6 states have internal predecessors, (53), 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:31,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:31:31,817 INFO L93 Difference]: Finished difference Result 5848 states and 8347 transitions. [2025-02-05 16:31:31,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 16:31:31,817 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 6 states have internal predecessors, (53), 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 53 [2025-02-05 16:31:31,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:31:31,832 INFO L225 Difference]: With dead ends: 5848 [2025-02-05 16:31:31,832 INFO L226 Difference]: Without dead ends: 4545 [2025-02-05 16:31:31,835 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2025-02-05 16:31:31,836 INFO L435 NwaCegarLoop]: 236 mSDtfsCounter, 1723 mSDsluCounter, 352 mSDsCounter, 0 mSdLazyCounter, 389 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1723 SdHoareTripleChecker+Valid, 588 SdHoareTripleChecker+Invalid, 442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 389 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 16:31:31,836 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1723 Valid, 588 Invalid, 442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 389 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 16:31:31,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4545 states. [2025-02-05 16:31:31,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4545 to 2979. [2025-02-05 16:31:31,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2979 states, 2975 states have (on average 1.4141176470588235) internal successors, (4207), 2978 states have internal predecessors, (4207), 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:31,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2979 states to 2979 states and 4207 transitions. [2025-02-05 16:31:31,929 INFO L78 Accepts]: Start accepts. Automaton has 2979 states and 4207 transitions. Word has length 53 [2025-02-05 16:31:31,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:31:31,930 INFO L471 AbstractCegarLoop]: Abstraction has 2979 states and 4207 transitions. [2025-02-05 16:31:31,931 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 6 states have internal predecessors, (53), 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:31,931 INFO L276 IsEmpty]: Start isEmpty. Operand 2979 states and 4207 transitions. [2025-02-05 16:31:31,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-02-05 16:31:31,933 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:31:31,933 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:31:31,933 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 16:31:31,933 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-02-05 16:31:31,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:31:31,934 INFO L85 PathProgramCache]: Analyzing trace with hash 1626342041, now seen corresponding path program 1 times [2025-02-05 16:31:31,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:31:31,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21194934] [2025-02-05 16:31:31,934 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:31:31,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:31:31,950 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-02-05 16:31:31,961 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-02-05 16:31:31,962 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:31:31,962 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:31:32,120 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:32,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:31:32,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21194934] [2025-02-05 16:31:32,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [21194934] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:31:32,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:31:32,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 16:31:32,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412607186] [2025-02-05 16:31:32,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:31:32,121 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 16:31:32,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:31:32,122 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 16:31:32,123 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-05 16:31:32,123 INFO L87 Difference]: Start difference. First operand 2979 states and 4207 transitions. Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 6 states have internal predecessors, (53), 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:32,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:31:32,574 INFO L93 Difference]: Finished difference Result 6531 states and 9328 transitions. [2025-02-05 16:31:32,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 16:31:32,575 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 6 states have internal predecessors, (53), 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 53 [2025-02-05 16:31:32,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:31:32,599 INFO L225 Difference]: With dead ends: 6531 [2025-02-05 16:31:32,599 INFO L226 Difference]: Without dead ends: 5419 [2025-02-05 16:31:32,605 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2025-02-05 16:31:32,605 INFO L435 NwaCegarLoop]: 229 mSDtfsCounter, 1848 mSDsluCounter, 394 mSDsCounter, 0 mSdLazyCounter, 455 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1848 SdHoareTripleChecker+Valid, 623 SdHoareTripleChecker+Invalid, 513 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 455 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 16:31:32,606 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1848 Valid, 623 Invalid, 513 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 455 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 16:31:32,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5419 states. [2025-02-05 16:31:32,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5419 to 3001. [2025-02-05 16:31:32,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3001 states, 2997 states have (on average 1.4140807474140809) internal successors, (4238), 3000 states have internal predecessors, (4238), 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:32,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3001 states to 3001 states and 4238 transitions. [2025-02-05 16:31:32,741 INFO L78 Accepts]: Start accepts. Automaton has 3001 states and 4238 transitions. Word has length 53 [2025-02-05 16:31:32,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:31:32,741 INFO L471 AbstractCegarLoop]: Abstraction has 3001 states and 4238 transitions. [2025-02-05 16:31:32,741 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 6 states have internal predecessors, (53), 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:32,742 INFO L276 IsEmpty]: Start isEmpty. Operand 3001 states and 4238 transitions. [2025-02-05 16:31:32,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-02-05 16:31:32,745 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:31:32,745 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:31:32,746 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 16:31:32,746 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-02-05 16:31:32,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:31:32,746 INFO L85 PathProgramCache]: Analyzing trace with hash -836391518, now seen corresponding path program 1 times [2025-02-05 16:31:32,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:31:32,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527586755] [2025-02-05 16:31:32,746 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:31:32,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:31:32,765 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-02-05 16:31:32,778 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-02-05 16:31:32,778 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:31:32,778 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:31:32,925 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:32,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:31:32,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527586755] [2025-02-05 16:31:32,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [527586755] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:31:32,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:31:32,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 16:31:32,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419719785] [2025-02-05 16:31:32,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:31:32,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 16:31:32,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:31:32,927 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 16:31:32,927 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-05 16:31:32,927 INFO L87 Difference]: Start difference. First operand 3001 states and 4238 transitions. Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 6 states have internal predecessors, (53), 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:33,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:31:33,375 INFO L93 Difference]: Finished difference Result 7211 states and 10289 transitions. [2025-02-05 16:31:33,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 16:31:33,376 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 6 states have internal predecessors, (53), 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 53 [2025-02-05 16:31:33,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:31:33,397 INFO L225 Difference]: With dead ends: 7211 [2025-02-05 16:31:33,397 INFO L226 Difference]: Without dead ends: 6243 [2025-02-05 16:31:33,401 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2025-02-05 16:31:33,401 INFO L435 NwaCegarLoop]: 237 mSDtfsCounter, 1962 mSDsluCounter, 398 mSDsCounter, 0 mSdLazyCounter, 438 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1962 SdHoareTripleChecker+Valid, 635 SdHoareTripleChecker+Invalid, 496 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 438 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 16:31:33,402 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1962 Valid, 635 Invalid, 496 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 438 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 16:31:33,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6243 states. [2025-02-05 16:31:33,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6243 to 3035. [2025-02-05 16:31:33,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3035 states, 3031 states have (on average 1.4127350709336852) internal successors, (4282), 3034 states have internal predecessors, (4282), 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:33,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3035 states to 3035 states and 4282 transitions. [2025-02-05 16:31:33,508 INFO L78 Accepts]: Start accepts. Automaton has 3035 states and 4282 transitions. Word has length 53 [2025-02-05 16:31:33,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:31:33,509 INFO L471 AbstractCegarLoop]: Abstraction has 3035 states and 4282 transitions. [2025-02-05 16:31:33,509 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 6 states have internal predecessors, (53), 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:33,509 INFO L276 IsEmpty]: Start isEmpty. Operand 3035 states and 4282 transitions. [2025-02-05 16:31:33,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-02-05 16:31:33,511 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:31:33,511 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:31:33,511 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 16:31:33,511 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-02-05 16:31:33,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:31:33,512 INFO L85 PathProgramCache]: Analyzing trace with hash -1103212080, now seen corresponding path program 1 times [2025-02-05 16:31:33,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:31:33,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064992090] [2025-02-05 16:31:33,512 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:31:33,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:31:33,526 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-02-05 16:31:33,550 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-02-05 16:31:33,551 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:31:33,551 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:31:33,755 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:33,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:31:33,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064992090] [2025-02-05 16:31:33,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064992090] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:31:33,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:31:33,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 16:31:33,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247281499] [2025-02-05 16:31:33,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:31:33,756 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 16:31:33,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:31:33,756 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 16:31:33,756 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-05 16:31:33,756 INFO L87 Difference]: Start difference. First operand 3035 states and 4282 transitions. Second operand has 8 states, 8 states have (on average 6.75) internal successors, (54), 7 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:31:34,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:31:34,170 INFO L93 Difference]: Finished difference Result 6201 states and 8913 transitions. [2025-02-05 16:31:34,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 16:31:34,170 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 7 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-02-05 16:31:34,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:31:34,179 INFO L225 Difference]: With dead ends: 6201 [2025-02-05 16:31:34,179 INFO L226 Difference]: Without dead ends: 4252 [2025-02-05 16:31:34,182 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2025-02-05 16:31:34,183 INFO L435 NwaCegarLoop]: 232 mSDtfsCounter, 1677 mSDsluCounter, 730 mSDsCounter, 0 mSdLazyCounter, 704 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1677 SdHoareTripleChecker+Valid, 962 SdHoareTripleChecker+Invalid, 714 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 704 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 16:31:34,183 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1677 Valid, 962 Invalid, 714 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 704 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 16:31:34,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4252 states. [2025-02-05 16:31:34,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4252 to 2945. [2025-02-05 16:31:34,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2945 states, 2941 states have (on average 1.4124447466848011) internal successors, (4154), 2944 states have internal predecessors, (4154), 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:34,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2945 states to 2945 states and 4154 transitions. [2025-02-05 16:31:34,271 INFO L78 Accepts]: Start accepts. Automaton has 2945 states and 4154 transitions. Word has length 54 [2025-02-05 16:31:34,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:31:34,272 INFO L471 AbstractCegarLoop]: Abstraction has 2945 states and 4154 transitions. [2025-02-05 16:31:34,272 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 7 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:31:34,272 INFO L276 IsEmpty]: Start isEmpty. Operand 2945 states and 4154 transitions. [2025-02-05 16:31:34,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-02-05 16:31:34,274 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:31:34,274 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:31:34,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 16:31:34,275 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-02-05 16:31:34,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:31:34,275 INFO L85 PathProgramCache]: Analyzing trace with hash 1878172240, now seen corresponding path program 1 times [2025-02-05 16:31:34,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:31:34,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738725598] [2025-02-05 16:31:34,275 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:31:34,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:31:34,290 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-02-05 16:31:34,312 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-02-05 16:31:34,313 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:31:34,313 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:31:34,527 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:34,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:31:34,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738725598] [2025-02-05 16:31:34,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [738725598] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:31:34,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:31:34,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:31:34,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245139429] [2025-02-05 16:31:34,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:31:34,528 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:31:34,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:31:34,529 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:31:34,529 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:31:34,529 INFO L87 Difference]: Start difference. First operand 2945 states and 4154 transitions. Second operand has 9 states, 9 states have (on average 6.0) internal successors, (54), 8 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:31:35,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:31:35,059 INFO L93 Difference]: Finished difference Result 4406 states and 6238 transitions. [2025-02-05 16:31:35,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-05 16:31:35,060 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.0) internal successors, (54), 8 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-02-05 16:31:35,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:31:35,067 INFO L225 Difference]: With dead ends: 4406 [2025-02-05 16:31:35,067 INFO L226 Difference]: Without dead ends: 4401 [2025-02-05 16:31:35,069 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2025-02-05 16:31:35,069 INFO L435 NwaCegarLoop]: 249 mSDtfsCounter, 1775 mSDsluCounter, 996 mSDsCounter, 0 mSdLazyCounter, 898 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1775 SdHoareTripleChecker+Valid, 1245 SdHoareTripleChecker+Invalid, 913 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 898 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 16:31:35,070 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1775 Valid, 1245 Invalid, 913 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 898 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 16:31:35,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4401 states. [2025-02-05 16:31:35,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4401 to 2945. [2025-02-05 16:31:35,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2945 states, 2941 states have (on average 1.411764705882353) internal successors, (4152), 2944 states have internal predecessors, (4152), 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:35,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2945 states to 2945 states and 4152 transitions. [2025-02-05 16:31:35,117 INFO L78 Accepts]: Start accepts. Automaton has 2945 states and 4152 transitions. Word has length 54 [2025-02-05 16:31:35,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:31:35,117 INFO L471 AbstractCegarLoop]: Abstraction has 2945 states and 4152 transitions. [2025-02-05 16:31:35,117 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.0) internal successors, (54), 8 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:31:35,118 INFO L276 IsEmpty]: Start isEmpty. Operand 2945 states and 4152 transitions. [2025-02-05 16:31:35,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-02-05 16:31:35,119 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:31:35,119 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:31:35,119 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 16:31:35,119 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-02-05 16:31:35,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:31:35,120 INFO L85 PathProgramCache]: Analyzing trace with hash 1612994887, now seen corresponding path program 1 times [2025-02-05 16:31:35,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:31:35,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901294878] [2025-02-05 16:31:35,120 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:31:35,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:31:35,130 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-02-05 16:31:35,142 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-02-05 16:31:35,142 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:31:35,142 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:31:35,308 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:35,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:31:35,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901294878] [2025-02-05 16:31:35,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1901294878] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:31:35,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:31:35,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:31:35,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736534645] [2025-02-05 16:31:35,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:31:35,309 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:31:35,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:31:35,309 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:31:35,310 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:31:35,310 INFO L87 Difference]: Start difference. First operand 2945 states and 4152 transitions. Second operand has 9 states, 9 states have (on average 6.0) internal successors, (54), 8 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:31:35,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:31:35,782 INFO L93 Difference]: Finished difference Result 5899 states and 8419 transitions. [2025-02-05 16:31:35,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-05 16:31:35,782 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.0) internal successors, (54), 8 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2025-02-05 16:31:35,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:31:35,789 INFO L225 Difference]: With dead ends: 5899 [2025-02-05 16:31:35,789 INFO L226 Difference]: Without dead ends: 4110 [2025-02-05 16:31:35,792 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=212, Unknown=0, NotChecked=0, Total=306 [2025-02-05 16:31:35,793 INFO L435 NwaCegarLoop]: 236 mSDtfsCounter, 1532 mSDsluCounter, 729 mSDsCounter, 0 mSdLazyCounter, 731 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1532 SdHoareTripleChecker+Valid, 965 SdHoareTripleChecker+Invalid, 755 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 731 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 16:31:35,793 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1532 Valid, 965 Invalid, 755 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 731 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 16:31:35,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4110 states. [2025-02-05 16:31:35,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4110 to 2916. [2025-02-05 16:31:35,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2916 states, 2912 states have (on average 1.4117445054945055) internal successors, (4111), 2915 states have internal predecessors, (4111), 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:35,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2916 states to 2916 states and 4111 transitions. [2025-02-05 16:31:35,839 INFO L78 Accepts]: Start accepts. Automaton has 2916 states and 4111 transitions. Word has length 54 [2025-02-05 16:31:35,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:31:35,840 INFO L471 AbstractCegarLoop]: Abstraction has 2916 states and 4111 transitions. [2025-02-05 16:31:35,840 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.0) internal successors, (54), 8 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:31:35,840 INFO L276 IsEmpty]: Start isEmpty. Operand 2916 states and 4111 transitions. [2025-02-05 16:31:35,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-02-05 16:31:35,844 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:31:35,844 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:31:35,844 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 16:31:35,844 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-02-05 16:31:35,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:31:35,845 INFO L85 PathProgramCache]: Analyzing trace with hash 1846893268, now seen corresponding path program 1 times [2025-02-05 16:31:35,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:31:35,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500288456] [2025-02-05 16:31:35,845 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:31:35,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:31:35,857 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-02-05 16:31:35,864 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-02-05 16:31:35,864 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:31:35,864 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:31:35,892 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:35,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:31:35,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500288456] [2025-02-05 16:31:35,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500288456] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:31:35,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:31:35,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:31:35,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759256133] [2025-02-05 16:31:35,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:31:35,893 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:31:35,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:31:35,894 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:31:35,894 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:31:35,895 INFO L87 Difference]: Start difference. First operand 2916 states and 4111 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:31:35,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:31:35,918 INFO L93 Difference]: Finished difference Result 3997 states and 5647 transitions. [2025-02-05 16:31:35,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:31:35,918 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2025-02-05 16:31:35,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:31:35,922 INFO L225 Difference]: With dead ends: 3997 [2025-02-05 16:31:35,923 INFO L226 Difference]: Without dead ends: 2907 [2025-02-05 16:31:35,924 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:31:35,924 INFO L435 NwaCegarLoop]: 504 mSDtfsCounter, 261 mSDsluCounter, 312 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 261 SdHoareTripleChecker+Valid, 816 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:31:35,924 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [261 Valid, 816 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:31:35,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2907 states. [2025-02-05 16:31:35,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2907 to 2901. [2025-02-05 16:31:35,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2901 states, 2897 states have (on average 1.3845357266137384) internal successors, (4011), 2900 states have internal predecessors, (4011), 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:35,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2901 states to 2901 states and 4011 transitions. [2025-02-05 16:31:35,954 INFO L78 Accepts]: Start accepts. Automaton has 2901 states and 4011 transitions. Word has length 55 [2025-02-05 16:31:35,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:31:35,954 INFO L471 AbstractCegarLoop]: Abstraction has 2901 states and 4011 transitions. [2025-02-05 16:31:35,954 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:31:35,954 INFO L276 IsEmpty]: Start isEmpty. Operand 2901 states and 4011 transitions. [2025-02-05 16:31:35,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-02-05 16:31:35,956 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:31:35,956 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:31:35,956 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 16:31:35,956 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-02-05 16:31:35,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:31:35,956 INFO L85 PathProgramCache]: Analyzing trace with hash 369294256, now seen corresponding path program 1 times [2025-02-05 16:31:35,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:31:35,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155192394] [2025-02-05 16:31:35,956 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:31:35,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:31:35,967 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-02-05 16:31:35,972 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-02-05 16:31:35,972 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:31:35,972 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:31:36,000 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:36,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:31:36,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155192394] [2025-02-05 16:31:36,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1155192394] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:31:36,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:31:36,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:31:36,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298285401] [2025-02-05 16:31:36,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:31:36,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:31:36,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:31:36,001 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:31:36,001 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:31:36,001 INFO L87 Difference]: Start difference. First operand 2901 states and 4011 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:31:36,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:31:36,024 INFO L93 Difference]: Finished difference Result 4235 states and 5905 transitions. [2025-02-05 16:31:36,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:31:36,025 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2025-02-05 16:31:36,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:31:36,028 INFO L225 Difference]: With dead ends: 4235 [2025-02-05 16:31:36,029 INFO L226 Difference]: Without dead ends: 2907 [2025-02-05 16:31:36,030 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:36,030 INFO L435 NwaCegarLoop]: 526 mSDtfsCounter, 242 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 242 SdHoareTripleChecker+Valid, 814 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:31:36,031 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [242 Valid, 814 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:31:36,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2907 states. [2025-02-05 16:31:36,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2907 to 2901. [2025-02-05 16:31:36,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2901 states, 2897 states have (on average 1.372109078356921) internal successors, (3975), 2900 states have internal predecessors, (3975), 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:36,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2901 states to 2901 states and 3975 transitions. [2025-02-05 16:31:36,075 INFO L78 Accepts]: Start accepts. Automaton has 2901 states and 3975 transitions. Word has length 55 [2025-02-05 16:31:36,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:31:36,075 INFO L471 AbstractCegarLoop]: Abstraction has 2901 states and 3975 transitions. [2025-02-05 16:31:36,076 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:31:36,076 INFO L276 IsEmpty]: Start isEmpty. Operand 2901 states and 3975 transitions. [2025-02-05 16:31:36,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-02-05 16:31:36,077 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:31:36,077 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:31:36,077 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 16:31:36,078 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-02-05 16:31:36,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:31:36,078 INFO L85 PathProgramCache]: Analyzing trace with hash -1865506764, now seen corresponding path program 1 times [2025-02-05 16:31:36,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:31:36,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644627130] [2025-02-05 16:31:36,078 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:31:36,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:31:36,088 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-02-05 16:31:36,094 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-02-05 16:31:36,094 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:31:36,094 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:31:36,119 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:36,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:31:36,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644627130] [2025-02-05 16:31:36,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1644627130] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:31:36,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:31:36,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:31:36,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404530881] [2025-02-05 16:31:36,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:31:36,120 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:31:36,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:31:36,120 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:31:36,120 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:31:36,120 INFO L87 Difference]: Start difference. First operand 2901 states and 3975 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:31:36,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:31:36,152 INFO L93 Difference]: Finished difference Result 4156 states and 5743 transitions. [2025-02-05 16:31:36,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:31:36,153 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2025-02-05 16:31:36,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:31:36,156 INFO L225 Difference]: With dead ends: 4156 [2025-02-05 16:31:36,156 INFO L226 Difference]: Without dead ends: 2908 [2025-02-05 16:31:36,157 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:36,158 INFO L435 NwaCegarLoop]: 514 mSDtfsCounter, 226 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 813 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:31:36,158 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [226 Valid, 813 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:31:36,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2908 states. [2025-02-05 16:31:36,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2908 to 2901. [2025-02-05 16:31:36,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2901 states, 2897 states have (on average 1.3583016914049015) internal successors, (3935), 2900 states have internal predecessors, (3935), 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:36,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2901 states to 2901 states and 3935 transitions. [2025-02-05 16:31:36,180 INFO L78 Accepts]: Start accepts. Automaton has 2901 states and 3935 transitions. Word has length 55 [2025-02-05 16:31:36,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:31:36,180 INFO L471 AbstractCegarLoop]: Abstraction has 2901 states and 3935 transitions. [2025-02-05 16:31:36,180 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:31:36,181 INFO L276 IsEmpty]: Start isEmpty. Operand 2901 states and 3935 transitions. [2025-02-05 16:31:36,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-02-05 16:31:36,182 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:31:36,182 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:31:36,182 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-05 16:31:36,182 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-02-05 16:31:36,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:31:36,183 INFO L85 PathProgramCache]: Analyzing trace with hash 183411245, now seen corresponding path program 1 times [2025-02-05 16:31:36,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:31:36,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958349762] [2025-02-05 16:31:36,183 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:31:36,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:31:36,193 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-02-05 16:31:36,197 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-02-05 16:31:36,197 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:31:36,197 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:31:36,215 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:36,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:31:36,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958349762] [2025-02-05 16:31:36,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [958349762] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:31:36,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:31:36,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:31:36,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260954910] [2025-02-05 16:31:36,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:31:36,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:31:36,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:31:36,216 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:31:36,216 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:31:36,216 INFO L87 Difference]: Start difference. First operand 2901 states and 3935 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 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:36,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:31:36,263 INFO L93 Difference]: Finished difference Result 4576 states and 6264 transitions. [2025-02-05 16:31:36,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:31:36,264 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 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 56 [2025-02-05 16:31:36,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:31:36,268 INFO L225 Difference]: With dead ends: 4576 [2025-02-05 16:31:36,268 INFO L226 Difference]: Without dead ends: 3319 [2025-02-05 16:31:36,270 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:36,270 INFO L435 NwaCegarLoop]: 369 mSDtfsCounter, 326 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 326 SdHoareTripleChecker+Valid, 524 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:31:36,270 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [326 Valid, 524 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:31:36,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3319 states. [2025-02-05 16:31:36,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3319 to 2719. [2025-02-05 16:31:36,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2719 states, 2715 states have (on average 1.3624309392265193) internal successors, (3699), 2718 states have internal predecessors, (3699), 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:36,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2719 states to 2719 states and 3699 transitions. [2025-02-05 16:31:36,291 INFO L78 Accepts]: Start accepts. Automaton has 2719 states and 3699 transitions. Word has length 56 [2025-02-05 16:31:36,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:31:36,292 INFO L471 AbstractCegarLoop]: Abstraction has 2719 states and 3699 transitions. [2025-02-05 16:31:36,292 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 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:36,292 INFO L276 IsEmpty]: Start isEmpty. Operand 2719 states and 3699 transitions. [2025-02-05 16:31:36,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-02-05 16:31:36,293 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:31:36,293 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:31:36,293 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-05 16:31:36,294 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-02-05 16:31:36,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:31:36,294 INFO L85 PathProgramCache]: Analyzing trace with hash 1497731430, now seen corresponding path program 1 times [2025-02-05 16:31:36,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:31:36,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317606875] [2025-02-05 16:31:36,294 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:31:36,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:31:36,304 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-02-05 16:31:36,309 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-02-05 16:31:36,309 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:31:36,309 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:31:36,327 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:36,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:31:36,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317606875] [2025-02-05 16:31:36,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1317606875] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:31:36,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:31:36,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:31:36,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831944617] [2025-02-05 16:31:36,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:31:36,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:31:36,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:31:36,328 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:31:36,328 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:31:36,328 INFO L87 Difference]: Start difference. First operand 2719 states and 3699 transitions. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 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:36,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:31:36,387 INFO L93 Difference]: Finished difference Result 4995 states and 6854 transitions. [2025-02-05 16:31:36,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:31:36,388 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 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 57 [2025-02-05 16:31:36,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:31:36,393 INFO L225 Difference]: With dead ends: 4995 [2025-02-05 16:31:36,393 INFO L226 Difference]: Without dead ends: 3334 [2025-02-05 16:31:36,395 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:36,395 INFO L435 NwaCegarLoop]: 312 mSDtfsCounter, 302 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 302 SdHoareTripleChecker+Valid, 462 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:31:36,395 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [302 Valid, 462 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:31:36,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3334 states. [2025-02-05 16:31:36,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3334 to 2583. [2025-02-05 16:31:36,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2583 states, 2579 states have (on average 1.3660333462582397) internal successors, (3523), 2582 states have internal predecessors, (3523), 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:36,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2583 states to 2583 states and 3523 transitions. [2025-02-05 16:31:36,418 INFO L78 Accepts]: Start accepts. Automaton has 2583 states and 3523 transitions. Word has length 57 [2025-02-05 16:31:36,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:31:36,418 INFO L471 AbstractCegarLoop]: Abstraction has 2583 states and 3523 transitions. [2025-02-05 16:31:36,418 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 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:36,418 INFO L276 IsEmpty]: Start isEmpty. Operand 2583 states and 3523 transitions. [2025-02-05 16:31:36,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-02-05 16:31:36,419 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:31:36,419 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:31:36,420 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-05 16:31:36,420 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-02-05 16:31:36,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:31:36,420 INFO L85 PathProgramCache]: Analyzing trace with hash -1733812780, now seen corresponding path program 1 times [2025-02-05 16:31:36,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:31:36,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014148154] [2025-02-05 16:31:36,420 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:31:36,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:31:36,431 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-02-05 16:31:36,457 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-02-05 16:31:36,457 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:31:36,457 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:31:37,204 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:37,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:31:37,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014148154] [2025-02-05 16:31:37,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2014148154] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:31:37,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:31:37,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2025-02-05 16:31:37,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155906734] [2025-02-05 16:31:37,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:31:37,206 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-02-05 16:31:37,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:31:37,206 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-02-05 16:31:37,206 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=298, Unknown=0, NotChecked=0, Total=342 [2025-02-05 16:31:37,206 INFO L87 Difference]: Start difference. First operand 2583 states and 3523 transitions. Second operand has 19 states, 19 states have (on average 3.0) internal successors, (57), 19 states have internal predecessors, (57), 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:38,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:31:38,862 INFO L93 Difference]: Finished difference Result 4480 states and 6151 transitions. [2025-02-05 16:31:38,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-02-05 16:31:38,862 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 3.0) internal successors, (57), 19 states have internal predecessors, (57), 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 57 [2025-02-05 16:31:38,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:31:38,871 INFO L225 Difference]: With dead ends: 4480 [2025-02-05 16:31:38,871 INFO L226 Difference]: Without dead ends: 4476 [2025-02-05 16:31:38,874 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=225, Invalid=1035, Unknown=0, NotChecked=0, Total=1260 [2025-02-05 16:31:38,874 INFO L435 NwaCegarLoop]: 313 mSDtfsCounter, 2401 mSDsluCounter, 3446 mSDsCounter, 0 mSdLazyCounter, 1984 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2401 SdHoareTripleChecker+Valid, 3759 SdHoareTripleChecker+Invalid, 1995 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1984 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:31:38,874 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2401 Valid, 3759 Invalid, 1995 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1984 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-02-05 16:31:38,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4476 states. [2025-02-05 16:31:38,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4476 to 2583. [2025-02-05 16:31:38,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2583 states, 2579 states have (on average 1.3656455990694067) internal successors, (3522), 2582 states have internal predecessors, (3522), 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:38,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2583 states to 2583 states and 3522 transitions. [2025-02-05 16:31:38,915 INFO L78 Accepts]: Start accepts. Automaton has 2583 states and 3522 transitions. Word has length 57 [2025-02-05 16:31:38,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:31:38,915 INFO L471 AbstractCegarLoop]: Abstraction has 2583 states and 3522 transitions. [2025-02-05 16:31:38,915 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 3.0) internal successors, (57), 19 states have internal predecessors, (57), 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:38,916 INFO L276 IsEmpty]: Start isEmpty. Operand 2583 states and 3522 transitions. [2025-02-05 16:31:38,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-02-05 16:31:38,918 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:31:38,918 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:31:38,918 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-05 16:31:38,918 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-02-05 16:31:38,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:31:38,919 INFO L85 PathProgramCache]: Analyzing trace with hash -598436944, now seen corresponding path program 1 times [2025-02-05 16:31:38,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:31:38,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408247397] [2025-02-05 16:31:38,919 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:31:38,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:31:38,933 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-02-05 16:31:38,954 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-02-05 16:31:38,954 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:31:38,954 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:31:39,796 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:39,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:31:39,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408247397] [2025-02-05 16:31:39,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408247397] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:31:39,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:31:39,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2025-02-05 16:31:39,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448558046] [2025-02-05 16:31:39,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:31:39,797 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-02-05 16:31:39,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:31:39,797 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-02-05 16:31:39,797 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=297, Unknown=0, NotChecked=0, Total=342 [2025-02-05 16:31:39,797 INFO L87 Difference]: Start difference. First operand 2583 states and 3522 transitions. Second operand has 19 states, 19 states have (on average 3.0) internal successors, (57), 19 states have internal predecessors, (57), 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:41,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:31:41,227 INFO L93 Difference]: Finished difference Result 3278 states and 4469 transitions. [2025-02-05 16:31:41,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-02-05 16:31:41,228 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 3.0) internal successors, (57), 19 states have internal predecessors, (57), 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 57 [2025-02-05 16:31:41,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:31:41,235 INFO L225 Difference]: With dead ends: 3278 [2025-02-05 16:31:41,235 INFO L226 Difference]: Without dead ends: 3274 [2025-02-05 16:31:41,236 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=235, Invalid=887, Unknown=0, NotChecked=0, Total=1122 [2025-02-05 16:31:41,237 INFO L435 NwaCegarLoop]: 316 mSDtfsCounter, 2020 mSDsluCounter, 3233 mSDsCounter, 0 mSdLazyCounter, 1922 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2020 SdHoareTripleChecker+Valid, 3549 SdHoareTripleChecker+Invalid, 1933 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1922 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-05 16:31:41,237 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2020 Valid, 3549 Invalid, 1933 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1922 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-05 16:31:41,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3274 states. [2025-02-05 16:31:41,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3274 to 2590. [2025-02-05 16:31:41,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2590 states, 2586 states have (on average 1.365429234338747) internal successors, (3531), 2589 states have internal predecessors, (3531), 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:41,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2590 states to 2590 states and 3531 transitions. [2025-02-05 16:31:41,269 INFO L78 Accepts]: Start accepts. Automaton has 2590 states and 3531 transitions. Word has length 57 [2025-02-05 16:31:41,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:31:41,269 INFO L471 AbstractCegarLoop]: Abstraction has 2590 states and 3531 transitions. [2025-02-05 16:31:41,270 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 3.0) internal successors, (57), 19 states have internal predecessors, (57), 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:41,270 INFO L276 IsEmpty]: Start isEmpty. Operand 2590 states and 3531 transitions. [2025-02-05 16:31:41,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-02-05 16:31:41,272 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:31:41,272 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:31:41,273 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-05 16:31:41,273 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-02-05 16:31:41,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:31:41,273 INFO L85 PathProgramCache]: Analyzing trace with hash -802999756, now seen corresponding path program 1 times [2025-02-05 16:31:41,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:31:41,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026243248] [2025-02-05 16:31:41,274 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:31:41,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:31:41,293 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-02-05 16:31:41,321 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-02-05 16:31:41,322 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:31:41,322 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:31:42,029 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:42,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:31:42,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026243248] [2025-02-05 16:31:42,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1026243248] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:31:42,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:31:42,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2025-02-05 16:31:42,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120950260] [2025-02-05 16:31:42,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:31:42,030 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-02-05 16:31:42,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:31:42,030 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-02-05 16:31:42,030 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=302, Unknown=0, NotChecked=0, Total=342 [2025-02-05 16:31:42,030 INFO L87 Difference]: Start difference. First operand 2590 states and 3531 transitions. Second operand has 19 states, 19 states have (on average 3.0) internal successors, (57), 19 states have internal predecessors, (57), 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:43,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:31:43,583 INFO L93 Difference]: Finished difference Result 3119 states and 4253 transitions. [2025-02-05 16:31:43,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-02-05 16:31:43,584 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 3.0) internal successors, (57), 19 states have internal predecessors, (57), 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 57 [2025-02-05 16:31:43,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:31:43,587 INFO L225 Difference]: With dead ends: 3119 [2025-02-05 16:31:43,587 INFO L226 Difference]: Without dead ends: 3113 [2025-02-05 16:31:43,588 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=285, Invalid=975, Unknown=0, NotChecked=0, Total=1260 [2025-02-05 16:31:43,588 INFO L435 NwaCegarLoop]: 290 mSDtfsCounter, 2267 mSDsluCounter, 2973 mSDsCounter, 0 mSdLazyCounter, 1557 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2267 SdHoareTripleChecker+Valid, 3263 SdHoareTripleChecker+Invalid, 1569 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1557 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-05 16:31:43,589 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2267 Valid, 3263 Invalid, 1569 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1557 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-05 16:31:43,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3113 states. [2025-02-05 16:31:43,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3113 to 2590. [2025-02-05 16:31:43,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2590 states, 2586 states have (on average 1.3650425367362722) internal successors, (3530), 2589 states have internal predecessors, (3530), 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:43,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2590 states to 2590 states and 3530 transitions. [2025-02-05 16:31:43,611 INFO L78 Accepts]: Start accepts. Automaton has 2590 states and 3530 transitions. Word has length 57 [2025-02-05 16:31:43,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:31:43,611 INFO L471 AbstractCegarLoop]: Abstraction has 2590 states and 3530 transitions. [2025-02-05 16:31:43,611 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 3.0) internal successors, (57), 19 states have internal predecessors, (57), 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:43,612 INFO L276 IsEmpty]: Start isEmpty. Operand 2590 states and 3530 transitions. [2025-02-05 16:31:43,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-02-05 16:31:43,613 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:31:43,613 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:31:43,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-05 16:31:43,613 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-02-05 16:31:43,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:31:43,614 INFO L85 PathProgramCache]: Analyzing trace with hash -538961198, now seen corresponding path program 1 times [2025-02-05 16:31:43,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:31:43,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390733462] [2025-02-05 16:31:43,614 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:31:43,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:31:43,625 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-02-05 16:31:43,643 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-02-05 16:31:43,643 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:31:43,643 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:31:43,963 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:43,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:31:43,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390733462] [2025-02-05 16:31:43,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1390733462] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:31:43,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:31:43,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-05 16:31:43,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588108478] [2025-02-05 16:31:43,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:31:43,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-05 16:31:43,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:31:43,966 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-05 16:31:43,966 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2025-02-05 16:31:43,966 INFO L87 Difference]: Start difference. First operand 2590 states and 3530 transitions. Second operand has 11 states, 11 states have (on average 5.181818181818182) internal successors, (57), 11 states have internal predecessors, (57), 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,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:31:44,471 INFO L93 Difference]: Finished difference Result 4522 states and 6229 transitions. [2025-02-05 16:31:44,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-05 16:31:44,471 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.181818181818182) internal successors, (57), 11 states have internal predecessors, (57), 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 57 [2025-02-05 16:31:44,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:31:44,479 INFO L225 Difference]: With dead ends: 4522 [2025-02-05 16:31:44,480 INFO L226 Difference]: Without dead ends: 4149 [2025-02-05 16:31:44,482 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=130, Invalid=290, Unknown=0, NotChecked=0, Total=420 [2025-02-05 16:31:44,483 INFO L435 NwaCegarLoop]: 250 mSDtfsCounter, 2682 mSDsluCounter, 1183 mSDsCounter, 0 mSdLazyCounter, 424 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2682 SdHoareTripleChecker+Valid, 1433 SdHoareTripleChecker+Invalid, 439 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 424 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 16:31:44,484 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2682 Valid, 1433 Invalid, 439 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 424 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 16:31:44,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4149 states. [2025-02-05 16:31:44,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4149 to 2520. [2025-02-05 16:31:44,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2520 states, 2518 states have (on average 1.368546465448769) internal successors, (3446), 2519 states have internal predecessors, (3446), 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,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2520 states to 2520 states and 3446 transitions. [2025-02-05 16:31:44,538 INFO L78 Accepts]: Start accepts. Automaton has 2520 states and 3446 transitions. Word has length 57 [2025-02-05 16:31:44,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:31:44,538 INFO L471 AbstractCegarLoop]: Abstraction has 2520 states and 3446 transitions. [2025-02-05 16:31:44,538 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.181818181818182) internal successors, (57), 11 states have internal predecessors, (57), 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,539 INFO L276 IsEmpty]: Start isEmpty. Operand 2520 states and 3446 transitions. [2025-02-05 16:31:44,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-02-05 16:31:44,540 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:31:44,540 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 16:31:44,540 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-05 16:31:44,540 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-02-05 16:31:44,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:31:44,541 INFO L85 PathProgramCache]: Analyzing trace with hash -297803795, now seen corresponding path program 1 times [2025-02-05 16:31:44,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:31:44,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894446703] [2025-02-05 16:31:44,541 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:31:44,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:31:44,552 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-02-05 16:31:44,565 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-02-05 16:31:44,565 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:31:44,565 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:31:44,973 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:44,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:31:44,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894446703] [2025-02-05 16:31:44,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [894446703] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:31:44,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:31:44,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-02-05 16:31:44,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428345910] [2025-02-05 16:31:44,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:31:44,974 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-05 16:31:44,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:31:44,975 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-05 16:31:44,975 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2025-02-05 16:31:44,975 INFO L87 Difference]: Start difference. First operand 2520 states and 3446 transitions. Second operand has 14 states, 14 states have (on average 4.142857142857143) internal successors, (58), 14 states have internal predecessors, (58), 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:45,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:31:45,730 INFO L93 Difference]: Finished difference Result 3122 states and 4293 transitions. [2025-02-05 16:31:45,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-02-05 16:31:45,732 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.142857142857143) internal successors, (58), 14 states have internal predecessors, (58), 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 58 [2025-02-05 16:31:45,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:31:45,738 INFO L225 Difference]: With dead ends: 3122 [2025-02-05 16:31:45,738 INFO L226 Difference]: Without dead ends: 2716 [2025-02-05 16:31:45,740 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=153, Invalid=399, Unknown=0, NotChecked=0, Total=552 [2025-02-05 16:31:45,742 INFO L435 NwaCegarLoop]: 238 mSDtfsCounter, 944 mSDsluCounter, 1696 mSDsCounter, 0 mSdLazyCounter, 769 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 944 SdHoareTripleChecker+Valid, 1934 SdHoareTripleChecker+Invalid, 783 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 769 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 16:31:45,743 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [944 Valid, 1934 Invalid, 783 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 769 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 16:31:45,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2716 states. [2025-02-05 16:31:45,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2716 to 2474. [2025-02-05 16:31:45,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2474 states, 2473 states have (on average 1.3708046906591185) internal successors, (3390), 2473 states have internal predecessors, (3390), 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:45,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2474 states to 2474 states and 3390 transitions. [2025-02-05 16:31:45,773 INFO L78 Accepts]: Start accepts. Automaton has 2474 states and 3390 transitions. Word has length 58 [2025-02-05 16:31:45,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:31:45,774 INFO L471 AbstractCegarLoop]: Abstraction has 2474 states and 3390 transitions. [2025-02-05 16:31:45,774 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.142857142857143) internal successors, (58), 14 states have internal predecessors, (58), 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:45,774 INFO L276 IsEmpty]: Start isEmpty. Operand 2474 states and 3390 transitions. [2025-02-05 16:31:45,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-02-05 16:31:45,778 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:31:45,778 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, 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:45,778 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-05 16:31:45,778 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-02-05 16:31:45,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:31:45,780 INFO L85 PathProgramCache]: Analyzing trace with hash -609093425, now seen corresponding path program 1 times [2025-02-05 16:31:45,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:31:45,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484084517] [2025-02-05 16:31:45,780 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:31:45,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:31:45,794 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-02-05 16:31:45,800 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-02-05 16:31:45,800 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:31:45,800 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:31:45,862 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:45,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:31:45,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484084517] [2025-02-05 16:31:45,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [484084517] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:31:45,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:31:45,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 16:31:45,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032274217] [2025-02-05 16:31:45,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:31:45,864 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:31:45,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:31:45,864 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:31:45,864 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:31:45,865 INFO L87 Difference]: Start difference. First operand 2474 states and 3390 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:31:45,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:31:45,948 INFO L93 Difference]: Finished difference Result 5976 states and 8396 transitions. [2025-02-05 16:31:45,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:31:45,948 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2025-02-05 16:31:45,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:31:45,953 INFO L225 Difference]: With dead ends: 5976 [2025-02-05 16:31:45,954 INFO L226 Difference]: Without dead ends: 4465 [2025-02-05 16:31:45,957 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:45,959 INFO L435 NwaCegarLoop]: 272 mSDtfsCounter, 1050 mSDsluCounter, 398 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1050 SdHoareTripleChecker+Valid, 670 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:31:45,959 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1050 Valid, 670 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:31:45,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4465 states. [2025-02-05 16:31:45,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4465 to 3822. [2025-02-05 16:31:46,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3822 states, 3821 states have (on average 1.3726773096048155) internal successors, (5245), 3821 states have internal predecessors, (5245), 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:46,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3822 states to 3822 states and 5245 transitions. [2025-02-05 16:31:46,010 INFO L78 Accepts]: Start accepts. Automaton has 3822 states and 5245 transitions. Word has length 66 [2025-02-05 16:31:46,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:31:46,010 INFO L471 AbstractCegarLoop]: Abstraction has 3822 states and 5245 transitions. [2025-02-05 16:31:46,010 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:31:46,011 INFO L276 IsEmpty]: Start isEmpty. Operand 3822 states and 5245 transitions. [2025-02-05 16:31:46,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-02-05 16:31:46,015 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:31:46,015 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, 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:46,015 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-02-05 16:31:46,015 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-02-05 16:31:46,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:31:46,016 INFO L85 PathProgramCache]: Analyzing trace with hash -1672441053, now seen corresponding path program 1 times [2025-02-05 16:31:46,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:31:46,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853913977] [2025-02-05 16:31:46,016 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:31:46,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:31:46,035 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-02-05 16:31:46,045 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-02-05 16:31:46,045 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:31:46,045 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:31:46,113 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:46,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:31:46,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853913977] [2025-02-05 16:31:46,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [853913977] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:31:46,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:31:46,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 16:31:46,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765238548] [2025-02-05 16:31:46,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:31:46,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:31:46,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:31:46,115 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:31:46,115 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:31:46,115 INFO L87 Difference]: Start difference. First operand 3822 states and 5245 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 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:46,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:31:46,204 INFO L93 Difference]: Finished difference Result 3828 states and 5248 transitions. [2025-02-05 16:31:46,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:31:46,204 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 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 67 [2025-02-05 16:31:46,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:31:46,208 INFO L225 Difference]: With dead ends: 3828 [2025-02-05 16:31:46,208 INFO L226 Difference]: Without dead ends: 3357 [2025-02-05 16:31:46,210 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:46,211 INFO L435 NwaCegarLoop]: 437 mSDtfsCounter, 647 mSDsluCounter, 381 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 647 SdHoareTripleChecker+Valid, 818 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:31:46,211 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [647 Valid, 818 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:31:46,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3357 states. [2025-02-05 16:31:46,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3357 to 3353. [2025-02-05 16:31:46,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3353 states, 3352 states have (on average 1.3767899761336515) internal successors, (4615), 3352 states have internal predecessors, (4615), 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:46,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3353 states to 3353 states and 4615 transitions. [2025-02-05 16:31:46,258 INFO L78 Accepts]: Start accepts. Automaton has 3353 states and 4615 transitions. Word has length 67 [2025-02-05 16:31:46,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:31:46,259 INFO L471 AbstractCegarLoop]: Abstraction has 3353 states and 4615 transitions. [2025-02-05 16:31:46,259 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 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:46,259 INFO L276 IsEmpty]: Start isEmpty. Operand 3353 states and 4615 transitions. [2025-02-05 16:31:46,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-02-05 16:31:46,263 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:31:46,263 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, 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:46,263 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-02-05 16:31:46,263 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-02-05 16:31:46,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:31:46,264 INFO L85 PathProgramCache]: Analyzing trace with hash 1642128403, now seen corresponding path program 1 times [2025-02-05 16:31:46,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:31:46,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405455610] [2025-02-05 16:31:46,264 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:31:46,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:31:46,279 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-02-05 16:31:46,290 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-02-05 16:31:46,290 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:31:46,290 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:31:46,353 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:46,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:31:46,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405455610] [2025-02-05 16:31:46,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405455610] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:31:46,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:31:46,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:31:46,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812953674] [2025-02-05 16:31:46,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:31:46,354 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:31:46,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:31:46,354 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:31:46,354 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:31:46,354 INFO L87 Difference]: Start difference. First operand 3353 states and 4615 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:46,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:31:46,387 INFO L93 Difference]: Finished difference Result 7961 states and 11093 transitions. [2025-02-05 16:31:46,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:31:46,387 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 68 [2025-02-05 16:31:46,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:31:46,393 INFO L225 Difference]: With dead ends: 7961 [2025-02-05 16:31:46,393 INFO L226 Difference]: Without dead ends: 5557 [2025-02-05 16:31:46,396 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:46,397 INFO L435 NwaCegarLoop]: 350 mSDtfsCounter, 125 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 561 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:31:46,397 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 561 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:31:46,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5557 states. [2025-02-05 16:31:46,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5557 to 5187. [2025-02-05 16:31:46,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5187 states, 5186 states have (on average 1.3831469340532203) internal successors, (7173), 5186 states have internal predecessors, (7173), 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:46,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5187 states to 5187 states and 7173 transitions. [2025-02-05 16:31:46,462 INFO L78 Accepts]: Start accepts. Automaton has 5187 states and 7173 transitions. Word has length 68 [2025-02-05 16:31:46,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:31:46,462 INFO L471 AbstractCegarLoop]: Abstraction has 5187 states and 7173 transitions. [2025-02-05 16:31:46,462 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:31:46,462 INFO L276 IsEmpty]: Start isEmpty. Operand 5187 states and 7173 transitions. [2025-02-05 16:31:46,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-02-05 16:31:46,465 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:31:46,465 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, 1, 1, 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:46,465 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-02-05 16:31:46,465 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-02-05 16:31:46,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:31:46,466 INFO L85 PathProgramCache]: Analyzing trace with hash 866585800, now seen corresponding path program 1 times [2025-02-05 16:31:46,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:31:46,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85479243] [2025-02-05 16:31:46,466 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:31:46,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:31:46,476 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-02-05 16:31:46,480 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-02-05 16:31:46,480 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:31:46,480 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:31:46,504 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:46,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:31:46,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85479243] [2025-02-05 16:31:46,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [85479243] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:31:46,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:31:46,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:31:46,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436426561] [2025-02-05 16:31:46,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:31:46,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:31:46,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:31:46,505 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:31:46,505 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:31:46,506 INFO L87 Difference]: Start difference. First operand 5187 states and 7173 transitions. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 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:46,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:31:46,549 INFO L93 Difference]: Finished difference Result 13285 states and 18463 transitions. [2025-02-05 16:31:46,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:31:46,550 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 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:46,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:31:46,558 INFO L225 Difference]: With dead ends: 13285 [2025-02-05 16:31:46,558 INFO L226 Difference]: Without dead ends: 8853 [2025-02-05 16:31:46,563 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:46,563 INFO L435 NwaCegarLoop]: 293 mSDtfsCounter, 213 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 428 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:31:46,564 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 428 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:31:46,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8853 states. [2025-02-05 16:31:46,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8853 to 8739. [2025-02-05 16:31:46,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8739 states, 8738 states have (on average 1.3580910963607233) internal successors, (11867), 8738 states have internal predecessors, (11867), 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:46,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8739 states to 8739 states and 11867 transitions. [2025-02-05 16:31:46,645 INFO L78 Accepts]: Start accepts. Automaton has 8739 states and 11867 transitions. Word has length 70 [2025-02-05 16:31:46,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:31:46,645 INFO L471 AbstractCegarLoop]: Abstraction has 8739 states and 11867 transitions. [2025-02-05 16:31:46,645 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 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:46,646 INFO L276 IsEmpty]: Start isEmpty. Operand 8739 states and 11867 transitions. [2025-02-05 16:31:46,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-02-05 16:31:46,648 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:31:46,648 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, 1, 1, 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:46,649 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-02-05 16:31:46,649 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-02-05 16:31:46,649 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:31:46,649 INFO L85 PathProgramCache]: Analyzing trace with hash 48937350, now seen corresponding path program 1 times [2025-02-05 16:31:46,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:31:46,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966481998] [2025-02-05 16:31:46,649 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:31:46,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:31:46,659 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-02-05 16:31:46,665 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-02-05 16:31:46,665 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:31:46,665 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:31:46,714 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:46,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:31:46,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966481998] [2025-02-05 16:31:46,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1966481998] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:31:46,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:31:46,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:31:46,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115141688] [2025-02-05 16:31:46,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:31:46,715 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:31:46,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:31:46,715 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:31:46,715 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:31:46,715 INFO L87 Difference]: Start difference. First operand 8739 states and 11867 transitions. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 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:46,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:31:46,772 INFO L93 Difference]: Finished difference Result 21163 states and 28913 transitions. [2025-02-05 16:31:46,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:31:46,773 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 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:46,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:31:46,787 INFO L225 Difference]: With dead ends: 21163 [2025-02-05 16:31:46,787 INFO L226 Difference]: Without dead ends: 13145 [2025-02-05 16:31:46,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:46,797 INFO L435 NwaCegarLoop]: 348 mSDtfsCounter, 120 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 554 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:31:46,797 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 554 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:31:46,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13145 states. [2025-02-05 16:31:46,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13145 to 11879. [2025-02-05 16:31:46,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11879 states, 11878 states have (on average 1.3526687994611888) internal successors, (16067), 11878 states have internal predecessors, (16067), 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:46,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11879 states to 11879 states and 16067 transitions. [2025-02-05 16:31:46,969 INFO L78 Accepts]: Start accepts. Automaton has 11879 states and 16067 transitions. Word has length 70 [2025-02-05 16:31:46,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:31:46,970 INFO L471 AbstractCegarLoop]: Abstraction has 11879 states and 16067 transitions. [2025-02-05 16:31:46,970 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 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:46,970 INFO L276 IsEmpty]: Start isEmpty. Operand 11879 states and 16067 transitions. [2025-02-05 16:31:46,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-02-05 16:31:46,973 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:31:46,973 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, 1, 1, 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:46,973 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-02-05 16:31:46,973 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-02-05 16:31:46,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:31:46,974 INFO L85 PathProgramCache]: Analyzing trace with hash -816914873, now seen corresponding path program 1 times [2025-02-05 16:31:46,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:31:46,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552976318] [2025-02-05 16:31:46,974 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:31:46,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:31:46,987 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-02-05 16:31:46,994 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-02-05 16:31:46,994 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:31:46,995 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:31:47,049 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:47,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:31:47,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552976318] [2025-02-05 16:31:47,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [552976318] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:31:47,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:31:47,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:31:47,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171078756] [2025-02-05 16:31:47,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:31:47,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:31:47,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:31:47,050 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:31:47,050 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:31:47,050 INFO L87 Difference]: Start difference. First operand 11879 states and 16067 transitions. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 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,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:31:47,153 INFO L93 Difference]: Finished difference Result 32995 states and 44685 transitions. [2025-02-05 16:31:47,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:31:47,154 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 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,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:31:47,177 INFO L225 Difference]: With dead ends: 32995 [2025-02-05 16:31:47,177 INFO L226 Difference]: Without dead ends: 21837 [2025-02-05 16:31:47,191 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:47,192 INFO L435 NwaCegarLoop]: 315 mSDtfsCounter, 99 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 528 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:31:47,193 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 528 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:31:47,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21837 states. [2025-02-05 16:31:47,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21837 to 20011. [2025-02-05 16:31:47,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20011 states, 20010 states have (on average 1.3428785607196403) internal successors, (26871), 20010 states have internal predecessors, (26871), 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,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20011 states to 20011 states and 26871 transitions. [2025-02-05 16:31:47,396 INFO L78 Accepts]: Start accepts. Automaton has 20011 states and 26871 transitions. Word has length 70 [2025-02-05 16:31:47,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:31:47,397 INFO L471 AbstractCegarLoop]: Abstraction has 20011 states and 26871 transitions. [2025-02-05 16:31:47,397 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 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,397 INFO L276 IsEmpty]: Start isEmpty. Operand 20011 states and 26871 transitions. [2025-02-05 16:31:47,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-02-05 16:31:47,399 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:31:47,399 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, 1, 1, 1, 1, 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:47,399 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-02-05 16:31:47,399 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-02-05 16:31:47,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:31:47,399 INFO L85 PathProgramCache]: Analyzing trace with hash 1356488778, now seen corresponding path program 1 times [2025-02-05 16:31:47,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:31:47,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142926833] [2025-02-05 16:31:47,400 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:31:47,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:31:47,410 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-02-05 16:31:47,416 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-02-05 16:31:47,417 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:31:47,417 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:31:47,634 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:47,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:31:47,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142926833] [2025-02-05 16:31:47,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1142926833] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:31:47,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:31:47,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 16:31:47,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89514107] [2025-02-05 16:31:47,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:31:47,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 16:31:47,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:31:47,636 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 16:31:47,636 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 16:31:47,636 INFO L87 Difference]: Start difference. First operand 20011 states and 26871 transitions. Second operand has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 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,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:31:47,703 INFO L93 Difference]: Finished difference Result 21021 states and 28216 transitions. [2025-02-05 16:31:47,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 16:31:47,704 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 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 72 [2025-02-05 16:31:47,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:31:47,729 INFO L225 Difference]: With dead ends: 21021 [2025-02-05 16:31:47,729 INFO L226 Difference]: Without dead ends: 21019 [2025-02-05 16:31:47,737 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 16:31:47,738 INFO L435 NwaCegarLoop]: 263 mSDtfsCounter, 0 mSDsluCounter, 1042 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1305 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:31:47,738 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1305 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:31:47,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21019 states. [2025-02-05 16:31:47,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21019 to 21019. [2025-02-05 16:31:47,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21019 states, 21018 states have (on average 1.310448187268056) internal successors, (27543), 21018 states have internal predecessors, (27543), 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,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21019 states to 21019 states and 27543 transitions. [2025-02-05 16:31:47,985 INFO L78 Accepts]: Start accepts. Automaton has 21019 states and 27543 transitions. Word has length 72 [2025-02-05 16:31:47,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:31:47,986 INFO L471 AbstractCegarLoop]: Abstraction has 21019 states and 27543 transitions. [2025-02-05 16:31:47,986 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 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,986 INFO L276 IsEmpty]: Start isEmpty. Operand 21019 states and 27543 transitions. [2025-02-05 16:31:47,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-02-05 16:31:47,989 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:31:47,989 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, 1, 1, 1, 1, 1, 1, 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:47,989 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-02-05 16:31:47,989 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-02-05 16:31:47,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:31:47,990 INFO L85 PathProgramCache]: Analyzing trace with hash -282315558, now seen corresponding path program 1 times [2025-02-05 16:31:47,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:31:47,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581702705] [2025-02-05 16:31:47,990 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:31:47,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:31:48,005 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-02-05 16:31:48,012 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-02-05 16:31:48,013 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:31:48,013 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:31:48,084 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:48,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:31:48,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581702705] [2025-02-05 16:31:48,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1581702705] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:31:48,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:31:48,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 16:31:48,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394044301] [2025-02-05 16:31:48,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:31:48,086 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:31:48,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:31:48,086 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:31:48,086 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:31:48,087 INFO L87 Difference]: Start difference. First operand 21019 states and 27543 transitions. Second operand has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 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:48,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:31:48,211 INFO L93 Difference]: Finished difference Result 31051 states and 40923 transitions. [2025-02-05 16:31:48,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 16:31:48,216 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 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 74 [2025-02-05 16:31:48,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:31:48,248 INFO L225 Difference]: With dead ends: 31051 [2025-02-05 16:31:48,248 INFO L226 Difference]: Without dead ends: 26381 [2025-02-05 16:31:48,265 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:48,266 INFO L435 NwaCegarLoop]: 358 mSDtfsCounter, 639 mSDsluCounter, 454 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 639 SdHoareTripleChecker+Valid, 812 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:31:48,266 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [639 Valid, 812 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:31:48,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26381 states. [2025-02-05 16:31:48,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26381 to 24035. [2025-02-05 16:31:48,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24035 states, 24034 states have (on average 1.307605891653491) internal successors, (31427), 24034 states have internal predecessors, (31427), 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:48,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24035 states to 24035 states and 31427 transitions. [2025-02-05 16:31:48,558 INFO L78 Accepts]: Start accepts. Automaton has 24035 states and 31427 transitions. Word has length 74 [2025-02-05 16:31:48,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:31:48,558 INFO L471 AbstractCegarLoop]: Abstraction has 24035 states and 31427 transitions. [2025-02-05 16:31:48,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 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:48,559 INFO L276 IsEmpty]: Start isEmpty. Operand 24035 states and 31427 transitions. [2025-02-05 16:31:48,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-02-05 16:31:48,565 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:31:48,565 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48,565 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-02-05 16:31:48,565 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-02-05 16:31:48,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:31:48,566 INFO L85 PathProgramCache]: Analyzing trace with hash 1463758469, now seen corresponding path program 1 times [2025-02-05 16:31:48,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:31:48,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453590068] [2025-02-05 16:31:48,566 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:31:48,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:31:48,579 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-02-05 16:31:48,599 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-02-05 16:31:48,599 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:31:48,599 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:31:48,743 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-02-05 16:31:48,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:31:48,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453590068] [2025-02-05 16:31:48,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [453590068] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:31:48,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:31:48,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:31:48,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578211100] [2025-02-05 16:31:48,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:31:48,744 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:31:48,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:31:48,744 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:31:48,744 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:31:48,744 INFO L87 Difference]: Start difference. First operand 24035 states and 31427 transitions. Second operand has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 8 states have internal predecessors, (86), 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:49,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:31:49,313 INFO L93 Difference]: Finished difference Result 46105 states and 60087 transitions. [2025-02-05 16:31:49,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-05 16:31:49,314 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 8 states have internal predecessors, (86), 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 92 [2025-02-05 16:31:49,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:31:49,343 INFO L225 Difference]: With dead ends: 46105 [2025-02-05 16:31:49,343 INFO L226 Difference]: Without dead ends: 30379 [2025-02-05 16:31:49,358 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=93, Invalid=249, Unknown=0, NotChecked=0, Total=342 [2025-02-05 16:31:49,358 INFO L435 NwaCegarLoop]: 168 mSDtfsCounter, 1119 mSDsluCounter, 687 mSDsCounter, 0 mSdLazyCounter, 680 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1119 SdHoareTripleChecker+Valid, 855 SdHoareTripleChecker+Invalid, 698 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 680 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 16:31:49,358 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1119 Valid, 855 Invalid, 698 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 680 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 16:31:49,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30379 states. [2025-02-05 16:31:49,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30379 to 23919. [2025-02-05 16:31:49,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23919 states, 23918 states have (on average 1.3079270842043649) internal successors, (31283), 23918 states have internal predecessors, (31283), 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:49,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23919 states to 23919 states and 31283 transitions. [2025-02-05 16:31:49,595 INFO L78 Accepts]: Start accepts. Automaton has 23919 states and 31283 transitions. Word has length 92 [2025-02-05 16:31:49,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:31:49,595 INFO L471 AbstractCegarLoop]: Abstraction has 23919 states and 31283 transitions. [2025-02-05 16:31:49,595 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 8 states have internal predecessors, (86), 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:49,595 INFO L276 IsEmpty]: Start isEmpty. Operand 23919 states and 31283 transitions. [2025-02-05 16:31:49,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-02-05 16:31:49,601 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:31:49,602 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49,602 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-02-05 16:31:49,602 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-02-05 16:31:49,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:31:49,603 INFO L85 PathProgramCache]: Analyzing trace with hash -1178164118, now seen corresponding path program 1 times [2025-02-05 16:31:49,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:31:49,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643393967] [2025-02-05 16:31:49,603 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:31:49,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:31:49,614 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-02-05 16:31:49,634 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-02-05 16:31:49,635 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:31:49,636 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:31:49,886 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-02-05 16:31:49,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:31:49,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643393967] [2025-02-05 16:31:49,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [643393967] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:31:49,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:31:49,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 16:31:49,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385325735] [2025-02-05 16:31:49,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:31:49,887 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 16:31:49,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:31:49,888 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 16:31:49,888 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-05 16:31:49,888 INFO L87 Difference]: Start difference. First operand 23919 states and 31283 transitions. Second operand has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 8 states have internal predecessors, (86), 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:50,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:31:50,445 INFO L93 Difference]: Finished difference Result 46653 states and 60846 transitions. [2025-02-05 16:31:50,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-05 16:31:50,446 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 8 states have internal predecessors, (86), 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 92 [2025-02-05 16:31:50,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:31:50,487 INFO L225 Difference]: With dead ends: 46653 [2025-02-05 16:31:50,487 INFO L226 Difference]: Without dead ends: 36323 [2025-02-05 16:31:50,503 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=93, Invalid=249, Unknown=0, NotChecked=0, Total=342 [2025-02-05 16:31:50,503 INFO L435 NwaCegarLoop]: 196 mSDtfsCounter, 1184 mSDsluCounter, 770 mSDsCounter, 0 mSdLazyCounter, 721 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1184 SdHoareTripleChecker+Valid, 966 SdHoareTripleChecker+Invalid, 735 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 721 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 16:31:50,503 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1184 Valid, 966 Invalid, 735 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 721 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 16:31:50,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36323 states. [2025-02-05 16:31:50,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36323 to 23873. [2025-02-05 16:31:50,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23873 states, 23872 states have (on average 1.3079758713136729) internal successors, (31224), 23872 states have internal predecessors, (31224), 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:50,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23873 states to 23873 states and 31224 transitions. [2025-02-05 16:31:50,902 INFO L78 Accepts]: Start accepts. Automaton has 23873 states and 31224 transitions. Word has length 92 [2025-02-05 16:31:50,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:31:50,903 INFO L471 AbstractCegarLoop]: Abstraction has 23873 states and 31224 transitions. [2025-02-05 16:31:50,903 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 8 states have internal predecessors, (86), 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:50,903 INFO L276 IsEmpty]: Start isEmpty. Operand 23873 states and 31224 transitions. [2025-02-05 16:31:50,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-02-05 16:31:50,910 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:31:50,910 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50,910 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-02-05 16:31:50,911 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-02-05 16:31:50,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:31:50,911 INFO L85 PathProgramCache]: Analyzing trace with hash -523041338, now seen corresponding path program 1 times [2025-02-05 16:31:50,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:31:50,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539058868] [2025-02-05 16:31:50,911 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:31:50,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:31:50,927 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-02-05 16:31:50,946 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-02-05 16:31:50,947 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:31:50,947 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:31:51,154 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:51,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:31:51,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539058868] [2025-02-05 16:31:51,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [539058868] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 16:31:51,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [322733065] [2025-02-05 16:31:51,155 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:31:51,155 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:31:51,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:31:51,157 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:51,159 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:51,300 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-02-05 16:31:51,353 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-02-05 16:31:51,353 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:31:51,353 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:31:51,361 INFO L256 TraceCheckSpWp]: Trace formula consists of 537 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-02-05 16:31:51,367 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 16:31:52,483 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:52,484 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 16:31:53,628 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:53,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [322733065] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 16:31:53,628 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 16:31:53,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12, 13] total 29 [2025-02-05 16:31:53,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199800038] [2025-02-05 16:31:53,629 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 16:31:53,630 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-02-05 16:31:53,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:31:53,631 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-02-05 16:31:53,631 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=727, Unknown=0, NotChecked=0, Total=870 [2025-02-05 16:31:53,631 INFO L87 Difference]: Start difference. First operand 23873 states and 31224 transitions. Second operand has 30 states, 30 states have (on average 7.766666666666667) internal successors, (233), 29 states have internal predecessors, (233), 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,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:32:00,902 INFO L93 Difference]: Finished difference Result 140755 states and 180990 transitions. [2025-02-05 16:32:00,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 119 states. [2025-02-05 16:32:00,903 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 7.766666666666667) internal successors, (233), 29 states have internal predecessors, (233), 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 93 [2025-02-05 16:32:00,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:32:01,053 INFO L225 Difference]: With dead ends: 140755 [2025-02-05 16:32:01,053 INFO L226 Difference]: Without dead ends: 132137 [2025-02-05 16:32:01,082 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 310 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7388 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=4110, Invalid=17352, Unknown=0, NotChecked=0, Total=21462 [2025-02-05 16:32:01,083 INFO L435 NwaCegarLoop]: 356 mSDtfsCounter, 4014 mSDsluCounter, 5802 mSDsCounter, 0 mSdLazyCounter, 6130 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4014 SdHoareTripleChecker+Valid, 6158 SdHoareTripleChecker+Invalid, 6228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 6130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2025-02-05 16:32:01,083 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4014 Valid, 6158 Invalid, 6228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 6130 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2025-02-05 16:32:01,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132137 states. [2025-02-05 16:32:01,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132137 to 24141. [2025-02-05 16:32:01,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24141 states, 24140 states have (on average 1.307456503728252) internal successors, (31562), 24140 states have internal predecessors, (31562), 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:01,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24141 states to 24141 states and 31562 transitions. [2025-02-05 16:32:01,887 INFO L78 Accepts]: Start accepts. Automaton has 24141 states and 31562 transitions. Word has length 93 [2025-02-05 16:32:01,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:32:01,887 INFO L471 AbstractCegarLoop]: Abstraction has 24141 states and 31562 transitions. [2025-02-05 16:32:01,888 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 7.766666666666667) internal successors, (233), 29 states have internal predecessors, (233), 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:01,888 INFO L276 IsEmpty]: Start isEmpty. Operand 24141 states and 31562 transitions. [2025-02-05 16:32:01,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-02-05 16:32:01,895 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:32:01,895 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:01,903 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:32:02,096 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2025-02-05 16:32:02,096 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-02-05 16:32:02,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:32:02,097 INFO L85 PathProgramCache]: Analyzing trace with hash -904352171, now seen corresponding path program 1 times [2025-02-05 16:32:02,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:32:02,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277682182] [2025-02-05 16:32:02,098 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:32:02,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:32:02,114 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-02-05 16:32:02,131 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-02-05 16:32:02,132 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:32:02,132 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:32:02,345 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:32:02,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:32:02,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277682182] [2025-02-05 16:32:02,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [277682182] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 16:32:02,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1055596003] [2025-02-05 16:32:02,391 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:32:02,392 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:32:02,392 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:32:02,396 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:32:02,401 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:32:02,630 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-02-05 16:32:02,694 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-02-05 16:32:02,694 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:32:02,695 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:32:02,702 INFO L256 TraceCheckSpWp]: Trace formula consists of 537 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-02-05 16:32:02,706 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 16:32:03,407 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:32:03,407 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 16:32:04,173 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:32:04,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1055596003] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 16:32:04,174 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 16:32:04,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12, 13] total 28 [2025-02-05 16:32:04,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850527359] [2025-02-05 16:32:04,174 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 16:32:04,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-02-05 16:32:04,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:32:04,175 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-02-05 16:32:04,175 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=691, Unknown=0, NotChecked=0, Total=812 [2025-02-05 16:32:04,175 INFO L87 Difference]: Start difference. First operand 24141 states and 31562 transitions. Second operand has 29 states, 29 states have (on average 8.310344827586206) internal successors, (241), 28 states have internal predecessors, (241), 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:13,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:32:13,643 INFO L93 Difference]: Finished difference Result 184357 states and 237151 transitions. [2025-02-05 16:32:13,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 201 states. [2025-02-05 16:32:13,644 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 8.310344827586206) internal successors, (241), 28 states have internal predecessors, (241), 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 93 [2025-02-05 16:32:13,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:32:13,920 INFO L225 Difference]: With dead ends: 184357 [2025-02-05 16:32:13,921 INFO L226 Difference]: Without dead ends: 174111 [2025-02-05 16:32:13,945 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 391 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 225 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20788 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=7493, Invalid=43809, Unknown=0, NotChecked=0, Total=51302 [2025-02-05 16:32:13,946 INFO L435 NwaCegarLoop]: 447 mSDtfsCounter, 6102 mSDsluCounter, 6602 mSDsCounter, 0 mSdLazyCounter, 6394 mSolverCounterSat, 156 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6102 SdHoareTripleChecker+Valid, 7049 SdHoareTripleChecker+Invalid, 6550 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 156 IncrementalHoareTripleChecker+Valid, 6394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-02-05 16:32:13,946 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6102 Valid, 7049 Invalid, 6550 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [156 Valid, 6394 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-02-05 16:32:14,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174111 states. [2025-02-05 16:32:15,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174111 to 46469. [2025-02-05 16:32:15,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46469 states, 46468 states have (on average 1.3058233623138504) internal successors, (60679), 46468 states have internal predecessors, (60679), 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:15,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46469 states to 46469 states and 60679 transitions. [2025-02-05 16:32:15,109 INFO L78 Accepts]: Start accepts. Automaton has 46469 states and 60679 transitions. Word has length 93 [2025-02-05 16:32:15,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:32:15,110 INFO L471 AbstractCegarLoop]: Abstraction has 46469 states and 60679 transitions. [2025-02-05 16:32:15,110 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 8.310344827586206) internal successors, (241), 28 states have internal predecessors, (241), 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:15,110 INFO L276 IsEmpty]: Start isEmpty. Operand 46469 states and 60679 transitions. [2025-02-05 16:32:15,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-02-05 16:32:15,119 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:32:15,119 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15,126 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-05 16:32:15,319 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:32:15,320 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-02-05 16:32:15,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:32:15,320 INFO L85 PathProgramCache]: Analyzing trace with hash -2100594860, now seen corresponding path program 1 times [2025-02-05 16:32:15,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:32:15,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881804117] [2025-02-05 16:32:15,320 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:32:15,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:32:15,331 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-02-05 16:32:15,340 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-02-05 16:32:15,340 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:32:15,340 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:32:15,585 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:32:15,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:32:15,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881804117] [2025-02-05 16:32:15,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1881804117] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:32:15,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:32:15,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-05 16:32:15,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221810154] [2025-02-05 16:32:15,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:32:15,586 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-05 16:32:15,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:32:15,586 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-05 16:32:15,587 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-02-05 16:32:15,587 INFO L87 Difference]: Start difference. First operand 46469 states and 60679 transitions. Second operand has 10 states, 10 states have (on average 9.3) internal successors, (93), 9 states have internal predecessors, (93), 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:16,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:32:16,086 INFO L93 Difference]: Finished difference Result 95629 states and 124150 transitions. [2025-02-05 16:32:16,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-05 16:32:16,086 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.3) internal successors, (93), 9 states have internal predecessors, (93), 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 93 [2025-02-05 16:32:16,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:32:16,165 INFO L225 Difference]: With dead ends: 95629 [2025-02-05 16:32:16,165 INFO L226 Difference]: Without dead ends: 77086 [2025-02-05 16:32:16,195 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=123, Invalid=339, Unknown=0, NotChecked=0, Total=462 [2025-02-05 16:32:16,195 INFO L435 NwaCegarLoop]: 208 mSDtfsCounter, 1091 mSDsluCounter, 817 mSDsCounter, 0 mSdLazyCounter, 758 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1091 SdHoareTripleChecker+Valid, 1025 SdHoareTripleChecker+Invalid, 775 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 758 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 16:32:16,195 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1091 Valid, 1025 Invalid, 775 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 758 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 16:32:16,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77086 states. [2025-02-05 16:32:16,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77086 to 67617. [2025-02-05 16:32:16,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67617 states, 67616 states have (on average 1.3039221486038808) internal successors, (88166), 67616 states have internal predecessors, (88166), 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:16,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67617 states to 67617 states and 88166 transitions. [2025-02-05 16:32:16,959 INFO L78 Accepts]: Start accepts. Automaton has 67617 states and 88166 transitions. Word has length 93 [2025-02-05 16:32:16,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:32:16,959 INFO L471 AbstractCegarLoop]: Abstraction has 67617 states and 88166 transitions. [2025-02-05 16:32:16,959 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.3) internal successors, (93), 9 states have internal predecessors, (93), 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:16,959 INFO L276 IsEmpty]: Start isEmpty. Operand 67617 states and 88166 transitions. [2025-02-05 16:32:16,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-02-05 16:32:16,968 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:32:16,968 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:16,968 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-02-05 16:32:16,968 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-02-05 16:32:16,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:32:16,969 INFO L85 PathProgramCache]: Analyzing trace with hash -1070789706, now seen corresponding path program 1 times [2025-02-05 16:32:16,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:32:16,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243243765] [2025-02-05 16:32:16,969 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:32:16,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:32:16,979 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-02-05 16:32:16,986 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-02-05 16:32:16,986 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:32:16,986 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:32:17,146 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:32:17,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:32:17,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243243765] [2025-02-05 16:32:17,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1243243765] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:32:17,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:32:17,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:32:17,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892302778] [2025-02-05 16:32:17,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:32:17,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:32:17,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:32:17,148 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:32:17,148 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:32:17,148 INFO L87 Difference]: Start difference. First operand 67617 states and 88166 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 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:17,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:32:17,402 INFO L93 Difference]: Finished difference Result 132137 states and 172565 transitions. [2025-02-05 16:32:17,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:32:17,402 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 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 94 [2025-02-05 16:32:17,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:32:17,604 INFO L225 Difference]: With dead ends: 132137 [2025-02-05 16:32:17,604 INFO L226 Difference]: Without dead ends: 65771 [2025-02-05 16:32:17,627 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:32:17,627 INFO L435 NwaCegarLoop]: 282 mSDtfsCounter, 144 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 443 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:32:17,628 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 443 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:32:17,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65771 states. [2025-02-05 16:32:18,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65771 to 65693. [2025-02-05 16:32:18,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65693 states, 65692 states have (on average 1.289304633745357) internal successors, (84697), 65692 states have internal predecessors, (84697), 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:18,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65693 states to 65693 states and 84697 transitions. [2025-02-05 16:32:18,322 INFO L78 Accepts]: Start accepts. Automaton has 65693 states and 84697 transitions. Word has length 94 [2025-02-05 16:32:18,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:32:18,323 INFO L471 AbstractCegarLoop]: Abstraction has 65693 states and 84697 transitions. [2025-02-05 16:32:18,323 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 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:18,323 INFO L276 IsEmpty]: Start isEmpty. Operand 65693 states and 84697 transitions. [2025-02-05 16:32:18,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-02-05 16:32:18,331 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:32:18,331 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18,332 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-02-05 16:32:18,332 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-02-05 16:32:18,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:32:18,332 INFO L85 PathProgramCache]: Analyzing trace with hash -1046676125, now seen corresponding path program 1 times [2025-02-05 16:32:18,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:32:18,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843725660] [2025-02-05 16:32:18,332 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:32:18,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:32:18,350 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-02-05 16:32:18,365 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-02-05 16:32:18,365 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:32:18,365 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:32:18,449 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:32:18,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:32:18,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843725660] [2025-02-05 16:32:18,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1843725660] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 16:32:18,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [334694201] [2025-02-05 16:32:18,450 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:32:18,450 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:32:18,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:32:18,452 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:32:18,454 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:32:18,583 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-02-05 16:32:18,629 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-02-05 16:32:18,629 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:32:18,629 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:32:18,632 INFO L256 TraceCheckSpWp]: Trace formula consists of 540 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-02-05 16:32:18,635 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 16:32:18,744 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:32:18,744 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 16:32:19,023 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:32:19,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [334694201] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 16:32:19,023 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 16:32:19,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 8] total 13 [2025-02-05 16:32:19,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596531116] [2025-02-05 16:32:19,023 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 16:32:19,023 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-05 16:32:19,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:32:19,024 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-05 16:32:19,024 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2025-02-05 16:32:19,024 INFO L87 Difference]: Start difference. First operand 65693 states and 84697 transitions. Second operand has 13 states, 13 states have (on average 15.076923076923077) internal successors, (196), 13 states have internal predecessors, (196), 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:20,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:32:20,006 INFO L93 Difference]: Finished difference Result 344720 states and 444482 transitions. [2025-02-05 16:32:20,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-02-05 16:32:20,006 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 15.076923076923077) internal successors, (196), 13 states have internal predecessors, (196), 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 94 [2025-02-05 16:32:20,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:32:20,376 INFO L225 Difference]: With dead ends: 344720 [2025-02-05 16:32:20,376 INFO L226 Difference]: Without dead ends: 280202 [2025-02-05 16:32:20,794 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 179 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=110, Invalid=232, Unknown=0, NotChecked=0, Total=342 [2025-02-05 16:32:20,794 INFO L435 NwaCegarLoop]: 580 mSDtfsCounter, 1766 mSDsluCounter, 1609 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1766 SdHoareTripleChecker+Valid, 2189 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:32:20,795 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1766 Valid, 2189 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:32:20,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280202 states. [2025-02-05 16:32:22,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280202 to 255260. [2025-02-05 16:32:23,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 255260 states, 255259 states have (on average 1.2729227960620388) internal successors, (324925), 255259 states have internal predecessors, (324925), 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:23,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255260 states to 255260 states and 324925 transitions. [2025-02-05 16:32:23,543 INFO L78 Accepts]: Start accepts. Automaton has 255260 states and 324925 transitions. Word has length 94 [2025-02-05 16:32:23,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:32:23,543 INFO L471 AbstractCegarLoop]: Abstraction has 255260 states and 324925 transitions. [2025-02-05 16:32:23,543 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 15.076923076923077) internal successors, (196), 13 states have internal predecessors, (196), 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:23,543 INFO L276 IsEmpty]: Start isEmpty. Operand 255260 states and 324925 transitions. [2025-02-05 16:32:23,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-02-05 16:32:23,552 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:32:23,552 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, 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:23,559 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-05 16:32:23,752 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:32:23,753 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-02-05 16:32:23,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:32:23,753 INFO L85 PathProgramCache]: Analyzing trace with hash 1492839694, now seen corresponding path program 1 times [2025-02-05 16:32:23,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:32:23,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617174420] [2025-02-05 16:32:23,753 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:32:23,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:32:23,767 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-02-05 16:32:23,772 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-02-05 16:32:23,772 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:32:23,772 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:32:23,795 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-02-05 16:32:23,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:32:23,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617174420] [2025-02-05 16:32:23,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1617174420] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:32:23,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:32:23,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:32:23,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428282364] [2025-02-05 16:32:23,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:32:23,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:32:23,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:32:23,796 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:32:23,796 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:32:23,796 INFO L87 Difference]: Start difference. First operand 255260 states and 324925 transitions. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 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:25,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:32:25,563 INFO L93 Difference]: Finished difference Result 482607 states and 615277 transitions. [2025-02-05 16:32:25,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:32:25,564 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 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 94 [2025-02-05 16:32:25,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:32:26,097 INFO L225 Difference]: With dead ends: 482607 [2025-02-05 16:32:26,098 INFO L226 Difference]: Without dead ends: 228235 [2025-02-05 16:32:26,160 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:32:26,160 INFO L435 NwaCegarLoop]: 193 mSDtfsCounter, 198 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 16:32:26,160 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 240 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 16:32:26,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228235 states. [2025-02-05 16:32:28,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228235 to 221707. [2025-02-05 16:32:28,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221707 states, 221706 states have (on average 1.2610078211685747) internal successors, (279573), 221706 states have internal predecessors, (279573), 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:28,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221707 states to 221707 states and 279573 transitions. [2025-02-05 16:32:28,869 INFO L78 Accepts]: Start accepts. Automaton has 221707 states and 279573 transitions. Word has length 94 [2025-02-05 16:32:28,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:32:28,869 INFO L471 AbstractCegarLoop]: Abstraction has 221707 states and 279573 transitions. [2025-02-05 16:32:28,869 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 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:28,869 INFO L276 IsEmpty]: Start isEmpty. Operand 221707 states and 279573 transitions. [2025-02-05 16:32:28,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-02-05 16:32:28,875 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:32:28,875 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28,875 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-02-05 16:32:28,875 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-02-05 16:32:28,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:32:28,876 INFO L85 PathProgramCache]: Analyzing trace with hash 2099658977, now seen corresponding path program 1 times [2025-02-05 16:32:28,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:32:28,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677950456] [2025-02-05 16:32:28,876 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:32:28,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:32:28,885 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-02-05 16:32:28,889 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-02-05 16:32:28,889 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:32:28,889 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:32:28,931 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:32:28,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:32:28,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677950456] [2025-02-05 16:32:28,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [677950456] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 16:32:28,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [262555921] [2025-02-05 16:32:28,931 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:32:28,931 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 16:32:28,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 16:32:28,938 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:32:28,939 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:32:29,112 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-02-05 16:32:29,154 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-02-05 16:32:29,154 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:32:29,154 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:32:29,156 INFO L256 TraceCheckSpWp]: Trace formula consists of 535 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-05 16:32:29,162 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 16:32:29,341 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:32:29,342 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 16:32:29,423 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:32:29,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [262555921] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 16:32:29,423 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 16:32:29,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 14 [2025-02-05 16:32:29,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607906873] [2025-02-05 16:32:29,423 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 16:32:29,423 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-05 16:32:29,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:32:29,424 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-05 16:32:29,424 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2025-02-05 16:32:29,424 INFO L87 Difference]: Start difference. First operand 221707 states and 279573 transitions. Second operand has 14 states, 14 states have (on average 17.857142857142858) internal successors, (250), 14 states have internal predecessors, (250), 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:30,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:32:30,931 INFO L93 Difference]: Finished difference Result 505633 states and 635553 transitions. [2025-02-05 16:32:30,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 16:32:30,931 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 17.857142857142858) internal successors, (250), 14 states have internal predecessors, (250), 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 94 [2025-02-05 16:32:30,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:32:31,683 INFO L225 Difference]: With dead ends: 505633 [2025-02-05 16:32:31,684 INFO L226 Difference]: Without dead ends: 284869 [2025-02-05 16:32:31,744 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 180 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=253, Unknown=0, NotChecked=0, Total=342 [2025-02-05 16:32:31,744 INFO L435 NwaCegarLoop]: 174 mSDtfsCounter, 2016 mSDsluCounter, 786 mSDsCounter, 0 mSdLazyCounter, 673 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2016 SdHoareTripleChecker+Valid, 960 SdHoareTripleChecker+Invalid, 731 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 673 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 16:32:31,744 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2016 Valid, 960 Invalid, 731 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 673 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 16:32:31,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284869 states. [2025-02-05 16:32:33,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284869 to 237713. [2025-02-05 16:32:34,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237713 states, 237712 states have (on average 1.2318099212492428) internal successors, (292816), 237712 states have internal predecessors, (292816), 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:34,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237713 states to 237713 states and 292816 transitions. [2025-02-05 16:32:34,462 INFO L78 Accepts]: Start accepts. Automaton has 237713 states and 292816 transitions. Word has length 94 [2025-02-05 16:32:34,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:32:34,462 INFO L471 AbstractCegarLoop]: Abstraction has 237713 states and 292816 transitions. [2025-02-05 16:32:34,462 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 17.857142857142858) internal successors, (250), 14 states have internal predecessors, (250), 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:34,462 INFO L276 IsEmpty]: Start isEmpty. Operand 237713 states and 292816 transitions. [2025-02-05 16:32:34,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-02-05 16:32:34,470 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:32:34,470 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, 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:34,476 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:32:34,670 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,SelfDestructingSolverStorable38 [2025-02-05 16:32:34,670 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-02-05 16:32:34,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:32:34,671 INFO L85 PathProgramCache]: Analyzing trace with hash 633025819, now seen corresponding path program 1 times [2025-02-05 16:32:34,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:32:34,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253622443] [2025-02-05 16:32:34,671 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:32:34,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:32:34,685 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-02-05 16:32:34,690 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-02-05 16:32:34,691 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:32:34,691 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:32:34,740 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:32:34,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:32:34,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253622443] [2025-02-05 16:32:34,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253622443] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:32:34,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:32:34,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 16:32:34,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993973663] [2025-02-05 16:32:34,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:32:34,741 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 16:32:34,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:32:34,741 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 16:32:34,741 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 16:32:34,742 INFO L87 Difference]: Start difference. First operand 237713 states and 292816 transitions. Second operand has 5 states, 5 states have (on average 19.0) internal successors, (95), 5 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:32:36,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:32:36,005 INFO L93 Difference]: Finished difference Result 468740 states and 576347 transitions. [2025-02-05 16:32:36,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 16:32:36,006 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.0) internal successors, (95), 5 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 95 [2025-02-05 16:32:36,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:32:36,306 INFO L225 Difference]: With dead ends: 468740 [2025-02-05 16:32:36,306 INFO L226 Difference]: Without dead ends: 231939 [2025-02-05 16:32:36,425 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-05 16:32:36,425 INFO L435 NwaCegarLoop]: 183 mSDtfsCounter, 461 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 461 SdHoareTripleChecker+Valid, 469 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 16:32:36,425 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [461 Valid, 469 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 16:32:36,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231939 states. [2025-02-05 16:32:38,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231939 to 219407. [2025-02-05 16:32:38,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219407 states, 219406 states have (on average 1.2047892947321404) internal successors, (264338), 219406 states have internal predecessors, (264338), 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:39,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219407 states to 219407 states and 264338 transitions. [2025-02-05 16:32:39,170 INFO L78 Accepts]: Start accepts. Automaton has 219407 states and 264338 transitions. Word has length 95 [2025-02-05 16:32:39,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 16:32:39,170 INFO L471 AbstractCegarLoop]: Abstraction has 219407 states and 264338 transitions. [2025-02-05 16:32:39,170 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.0) internal successors, (95), 5 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 16:32:39,170 INFO L276 IsEmpty]: Start isEmpty. Operand 219407 states and 264338 transitions. [2025-02-05 16:32:39,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-02-05 16:32:39,178 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 16:32:39,178 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39,178 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2025-02-05 16:32:39,178 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2025-02-05 16:32:39,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 16:32:39,178 INFO L85 PathProgramCache]: Analyzing trace with hash 225460487, now seen corresponding path program 1 times [2025-02-05 16:32:39,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 16:32:39,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770660220] [2025-02-05 16:32:39,178 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 16:32:39,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 16:32:39,191 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-02-05 16:32:39,196 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-02-05 16:32:39,197 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 16:32:39,197 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 16:32:39,224 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 16:32:39,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 16:32:39,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770660220] [2025-02-05 16:32:39,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [770660220] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 16:32:39,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 16:32:39,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 16:32:39,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19887577] [2025-02-05 16:32:39,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 16:32:39,225 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 16:32:39,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 16:32:39,225 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 16:32:39,225 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 16:32:39,225 INFO L87 Difference]: Start difference. First operand 219407 states and 264338 transitions. Second operand has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 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:40,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 16:32:40,254 INFO L93 Difference]: Finished difference Result 342955 states and 412362 transitions. [2025-02-05 16:32:40,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 16:32:40,254 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 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 98 [2025-02-05 16:32:40,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 16:32:40,554 INFO L225 Difference]: With dead ends: 342955 [2025-02-05 16:32:40,554 INFO L226 Difference]: Without dead ends: 256303 [2025-02-05 16:32:40,627 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:32:40,627 INFO L435 NwaCegarLoop]: 351 mSDtfsCounter, 105 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 567 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 16:32:40,627 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 567 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 16:32:40,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256303 states.