./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.5.4.ufo.BOUNDED-10.pals.c.p+lhb-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.5.4.ufo.BOUNDED-10.pals.c.p+lhb-reducer.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 ccb4b384bd4c69a839b43af282a0b0d91cff6a81a49dfba5813b9bec4af0bc38 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 06:15:34,478 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 06:15:34,536 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 06:15:34,539 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 06:15:34,539 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 06:15:34,553 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 06:15:34,553 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 06:15:34,554 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 06:15:34,554 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 06:15:34,554 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 06:15:34,554 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 06:15:34,554 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 06:15:34,554 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 06:15:34,554 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 06:15:34,555 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 06:15:34,555 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 06:15:34,555 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 06:15:34,555 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 06:15:34,555 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 06:15:34,555 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 06:15:34,555 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 06:15:34,555 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 06:15:34,555 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 06:15:34,555 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 06:15:34,556 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 06:15:34,556 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 06:15:34,556 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 06:15:34,556 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 06:15:34,556 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 06:15:34,556 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 06:15:34,556 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 06:15:34,556 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 06:15:34,556 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 06:15:34,556 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 06:15:34,556 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 06:15:34,556 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 06:15:34,557 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 06:15:34,557 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 06:15:34,557 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 06:15:34,557 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 06:15:34,557 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 06:15:34,557 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 06:15:34,557 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 06:15:34,557 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/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 -> ccb4b384bd4c69a839b43af282a0b0d91cff6a81a49dfba5813b9bec4af0bc38 [2025-03-08 06:15:34,783 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 06:15:34,791 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 06:15:34,792 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 06:15:34,793 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 06:15:34,793 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 06:15:34,795 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.5.4.ufo.BOUNDED-10.pals.c.p+lhb-reducer.c [2025-03-08 06:15:35,907 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/49907b428/be5352f5774040008c3f24fac33a4d54/FLAGd11a475f5 [2025-03-08 06:15:36,302 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 06:15:36,303 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.5.4.ufo.BOUNDED-10.pals.c.p+lhb-reducer.c [2025-03-08 06:15:36,328 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/49907b428/be5352f5774040008c3f24fac33a4d54/FLAGd11a475f5 [2025-03-08 06:15:36,474 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/49907b428/be5352f5774040008c3f24fac33a4d54 [2025-03-08 06:15:36,476 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 06:15:36,477 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 06:15:36,478 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 06:15:36,478 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 06:15:36,481 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 06:15:36,482 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 06:15:36" (1/1) ... [2025-03-08 06:15:36,484 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@37819be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:15:36, skipping insertion in model container [2025-03-08 06:15:36,484 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 06:15:36" (1/1) ... [2025-03-08 06:15:36,583 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 06:15:37,231 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.5.4.ufo.BOUNDED-10.pals.c.p+lhb-reducer.c[56685,56698] [2025-03-08 06:15:37,316 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.5.4.ufo.BOUNDED-10.pals.c.p+lhb-reducer.c[61645,61658] [2025-03-08 06:15:37,677 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 06:15:37,692 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 06:15:38,122 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.5.4.ufo.BOUNDED-10.pals.c.p+lhb-reducer.c[56685,56698] [2025-03-08 06:15:38,172 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.5.4.ufo.BOUNDED-10.pals.c.p+lhb-reducer.c[61645,61658] [2025-03-08 06:15:38,382 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 06:15:38,400 INFO L204 MainTranslator]: Completed translation [2025-03-08 06:15:38,401 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:15:38 WrapperNode [2025-03-08 06:15:38,402 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 06:15:38,403 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 06:15:38,403 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 06:15:38,403 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 06:15:38,408 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:15:38" (1/1) ... [2025-03-08 06:15:38,450 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:15:38" (1/1) ... [2025-03-08 06:15:38,624 INFO L138 Inliner]: procedures = 24, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 7954 [2025-03-08 06:15:38,625 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 06:15:38,625 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 06:15:38,625 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 06:15:38,625 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 06:15:38,632 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:15:38" (1/1) ... [2025-03-08 06:15:38,632 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:15:38" (1/1) ... [2025-03-08 06:15:38,647 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:15:38" (1/1) ... [2025-03-08 06:15:38,698 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-03-08 06:15:38,699 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:15:38" (1/1) ... [2025-03-08 06:15:38,699 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:15:38" (1/1) ... [2025-03-08 06:15:38,748 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:15:38" (1/1) ... [2025-03-08 06:15:38,756 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:15:38" (1/1) ... [2025-03-08 06:15:38,770 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:15:38" (1/1) ... [2025-03-08 06:15:38,782 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:15:38" (1/1) ... [2025-03-08 06:15:38,803 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 06:15:38,804 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 06:15:38,804 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 06:15:38,804 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 06:15:38,806 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:15:38" (1/1) ... [2025-03-08 06:15:38,810 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 06:15:38,820 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 06:15:38,832 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 06:15:38,836 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 06:15:38,853 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 06:15:38,853 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 06:15:38,853 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 06:15:38,853 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 06:15:39,039 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 06:15:39,041 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 06:15:42,687 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L12125: havoc main_~node3____CPAchecker_TMP_3~8#1;havoc main_~node3____CPAchecker_TMP_2~8#1;havoc main_~node3____CPAchecker_TMP_1~8#1;havoc main_~node3____CPAchecker_TMP_0~8#1; [2025-03-08 06:15:42,688 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3412: havoc main_~main____CPAchecker_TMP_0~7#1;havoc main_~__tmp_8~0#1, main_~assert__arg~7#1;havoc main_~check__tmp~7#1; [2025-03-08 06:15:42,688 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6056: havoc main_~node4____CPAchecker_TMP_3~2#1;havoc main_~node4____CPAchecker_TMP_2~2#1;havoc main_~node4____CPAchecker_TMP_1~2#1;havoc main_~node4____CPAchecker_TMP_0~2#1; [2025-03-08 06:15:42,688 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6587: havoc main_~node1____CPAchecker_TMP_3~2#1;havoc main_~node1____CPAchecker_TMP_2~2#1;havoc main_~node1____CPAchecker_TMP_1~2#1;havoc main_~node1____CPAchecker_TMP_0~2#1; [2025-03-08 06:15:42,688 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6861: havoc main_~node5____CPAchecker_TMP_3~3#1;havoc main_~node5____CPAchecker_TMP_2~3#1;havoc main_~node5____CPAchecker_TMP_1~3#1;havoc main_~node5____CPAchecker_TMP_0~3#1; [2025-03-08 06:15:42,688 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7392: havoc main_~node2____CPAchecker_TMP_3~3#1;havoc main_~node2____CPAchecker_TMP_2~3#1;havoc main_~node2____CPAchecker_TMP_1~3#1;havoc main_~node2____CPAchecker_TMP_0~3#1; [2025-03-08 06:15:42,688 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1846: havoc main_~main____CPAchecker_TMP_0~2#1;havoc main_~__tmp_3~0#1, main_~assert__arg~2#1;havoc main_~check__tmp~2#1; [2025-03-08 06:15:42,688 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L8197: havoc main_~node3____CPAchecker_TMP_3~4#1;havoc main_~node3____CPAchecker_TMP_2~4#1;havoc main_~node3____CPAchecker_TMP_1~4#1;havoc main_~node3____CPAchecker_TMP_0~4#1; [2025-03-08 06:15:42,688 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L9002: havoc main_~node4____CPAchecker_TMP_3~5#1;havoc main_~node4____CPAchecker_TMP_2~5#1;havoc main_~node4____CPAchecker_TMP_1~5#1;havoc main_~node4____CPAchecker_TMP_0~5#1; [2025-03-08 06:15:42,688 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3718: havoc main_~__tmp_9~0#1, main_~assert__arg~8#1;havoc main_~check__tmp~8#1; [2025-03-08 06:15:42,689 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L9533: havoc main_~node1____CPAchecker_TMP_3~5#1;havoc main_~node1____CPAchecker_TMP_2~5#1;havoc main_~node1____CPAchecker_TMP_1~5#1;havoc main_~node1____CPAchecker_TMP_0~5#1; [2025-03-08 06:15:42,689 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L9807: havoc main_~node5____CPAchecker_TMP_3~6#1;havoc main_~node5____CPAchecker_TMP_2~6#1;havoc main_~node5____CPAchecker_TMP_1~6#1;havoc main_~node5____CPAchecker_TMP_0~6#1; [2025-03-08 06:15:42,689 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L10338: havoc main_~node2____CPAchecker_TMP_3~6#1;havoc main_~node2____CPAchecker_TMP_2~6#1;havoc main_~node2____CPAchecker_TMP_1~6#1;havoc main_~node2____CPAchecker_TMP_0~6#1; [2025-03-08 06:15:42,689 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4268: havoc main_~node3____CPAchecker_TMP_3~0#1;havoc main_~node3____CPAchecker_TMP_2~0#1;havoc main_~node3____CPAchecker_TMP_1~0#1;havoc main_~node3____CPAchecker_TMP_0~0#1; [2025-03-08 06:15:42,689 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L11143: havoc main_~node3____CPAchecker_TMP_3~7#1;havoc main_~node3____CPAchecker_TMP_2~7#1;havoc main_~node3____CPAchecker_TMP_1~7#1;havoc main_~node3____CPAchecker_TMP_0~7#1; [2025-03-08 06:15:42,689 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2159: havoc main_~main____CPAchecker_TMP_0~3#1;havoc main_~__tmp_4~0#1, main_~assert__arg~3#1;havoc main_~check__tmp~3#1; [2025-03-08 06:15:42,689 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L5074: havoc main_~node4____CPAchecker_TMP_3~1#1;havoc main_~node4____CPAchecker_TMP_2~1#1;havoc main_~node4____CPAchecker_TMP_1~1#1;havoc main_~node4____CPAchecker_TMP_0~1#1; [2025-03-08 06:15:42,689 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L5605: havoc main_~node1____CPAchecker_TMP_3~1#1;havoc main_~node1____CPAchecker_TMP_2~1#1;havoc main_~node1____CPAchecker_TMP_1~1#1;havoc main_~node1____CPAchecker_TMP_0~1#1; [2025-03-08 06:15:42,689 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L11948: havoc main_~node4____CPAchecker_TMP_3~8#1;havoc main_~node4____CPAchecker_TMP_2~8#1;havoc main_~node4____CPAchecker_TMP_1~8#1;havoc main_~node4____CPAchecker_TMP_0~8#1; [2025-03-08 06:15:42,689 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L12479: havoc main_~node1____CPAchecker_TMP_3~8#1;havoc main_~node1____CPAchecker_TMP_2~8#1;havoc main_~node1____CPAchecker_TMP_1~8#1;havoc main_~node1____CPAchecker_TMP_0~8#1; [2025-03-08 06:15:42,689 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L5879: havoc main_~node5____CPAchecker_TMP_3~2#1;havoc main_~node5____CPAchecker_TMP_2~2#1;havoc main_~node5____CPAchecker_TMP_1~2#1;havoc main_~node5____CPAchecker_TMP_0~2#1; [2025-03-08 06:15:42,689 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6410: havoc main_~node2____CPAchecker_TMP_3~2#1;havoc main_~node2____CPAchecker_TMP_2~2#1;havoc main_~node2____CPAchecker_TMP_1~2#1;havoc main_~node2____CPAchecker_TMP_0~2#1; [2025-03-08 06:15:42,689 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7215: havoc main_~node3____CPAchecker_TMP_3~3#1;havoc main_~node3____CPAchecker_TMP_2~3#1;havoc main_~node3____CPAchecker_TMP_1~3#1;havoc main_~node3____CPAchecker_TMP_0~3#1; [2025-03-08 06:15:42,689 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L8020: havoc main_~node4____CPAchecker_TMP_3~4#1;havoc main_~node4____CPAchecker_TMP_2~4#1;havoc main_~node4____CPAchecker_TMP_1~4#1;havoc main_~node4____CPAchecker_TMP_0~4#1; [2025-03-08 06:15:42,689 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2472: havoc main_~main____CPAchecker_TMP_0~4#1;havoc main_~__tmp_5~0#1, main_~assert__arg~4#1;havoc main_~check__tmp~4#1; [2025-03-08 06:15:42,689 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L8551: havoc main_~node1____CPAchecker_TMP_3~4#1;havoc main_~node1____CPAchecker_TMP_2~4#1;havoc main_~node1____CPAchecker_TMP_1~4#1;havoc main_~node1____CPAchecker_TMP_0~4#1; [2025-03-08 06:15:42,690 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L8825: havoc main_~node5____CPAchecker_TMP_3~5#1;havoc main_~node5____CPAchecker_TMP_2~5#1;havoc main_~node5____CPAchecker_TMP_1~5#1;havoc main_~node5____CPAchecker_TMP_0~5#1; [2025-03-08 06:15:42,690 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L9356: havoc main_~node2____CPAchecker_TMP_3~5#1;havoc main_~node2____CPAchecker_TMP_2~5#1;havoc main_~node2____CPAchecker_TMP_1~5#1;havoc main_~node2____CPAchecker_TMP_0~5#1; [2025-03-08 06:15:42,690 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L10161: havoc main_~node3____CPAchecker_TMP_3~6#1;havoc main_~node3____CPAchecker_TMP_2~6#1;havoc main_~node3____CPAchecker_TMP_1~6#1;havoc main_~node3____CPAchecker_TMP_0~6#1; [2025-03-08 06:15:42,690 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4091: havoc main_~node4____CPAchecker_TMP_3~0#1;havoc main_~node4____CPAchecker_TMP_2~0#1;havoc main_~node4____CPAchecker_TMP_1~0#1;havoc main_~node4____CPAchecker_TMP_0~0#1; [2025-03-08 06:15:42,690 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4622: havoc main_~node1____CPAchecker_TMP_3~0#1;havoc main_~node1____CPAchecker_TMP_2~0#1;havoc main_~node1____CPAchecker_TMP_1~0#1;havoc main_~node1____CPAchecker_TMP_0~0#1; [2025-03-08 06:15:42,690 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L10966: havoc main_~node4____CPAchecker_TMP_3~7#1;havoc main_~node4____CPAchecker_TMP_2~7#1;havoc main_~node4____CPAchecker_TMP_1~7#1;havoc main_~node4____CPAchecker_TMP_0~7#1; [2025-03-08 06:15:42,690 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L11497: havoc main_~node1____CPAchecker_TMP_3~7#1;havoc main_~node1____CPAchecker_TMP_2~7#1;havoc main_~node1____CPAchecker_TMP_1~7#1;havoc main_~node1____CPAchecker_TMP_0~7#1; [2025-03-08 06:15:42,690 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4897: havoc main_~node5____CPAchecker_TMP_3~1#1;havoc main_~node5____CPAchecker_TMP_2~1#1;havoc main_~node5____CPAchecker_TMP_1~1#1;havoc main_~node5____CPAchecker_TMP_0~1#1; [2025-03-08 06:15:42,690 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2785: havoc main_~main____CPAchecker_TMP_0~5#1;havoc main_~__tmp_6~0#1, main_~assert__arg~5#1;havoc main_~check__tmp~5#1; [2025-03-08 06:15:42,690 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L5428: havoc main_~node2____CPAchecker_TMP_3~1#1;havoc main_~node2____CPAchecker_TMP_2~1#1;havoc main_~node2____CPAchecker_TMP_1~1#1;havoc main_~node2____CPAchecker_TMP_0~1#1; [2025-03-08 06:15:42,690 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L11771: havoc main_~node5____CPAchecker_TMP_3~8#1;havoc main_~node5____CPAchecker_TMP_2~8#1;havoc main_~node5____CPAchecker_TMP_1~8#1;havoc main_~node5____CPAchecker_TMP_0~8#1; [2025-03-08 06:15:42,690 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L12302: havoc main_~node2____CPAchecker_TMP_3~8#1;havoc main_~node2____CPAchecker_TMP_2~8#1;havoc main_~node2____CPAchecker_TMP_1~8#1;havoc main_~node2____CPAchecker_TMP_0~8#1; [2025-03-08 06:15:42,690 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6233: havoc main_~node3____CPAchecker_TMP_3~2#1;havoc main_~node3____CPAchecker_TMP_2~2#1;havoc main_~node3____CPAchecker_TMP_1~2#1;havoc main_~node3____CPAchecker_TMP_0~2#1; [2025-03-08 06:15:42,690 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1220: havoc main_~main____CPAchecker_TMP_0~0#1;havoc main_~__tmp_1~0#1, main_~assert__arg~0#1;havoc main_~check__tmp~0#1; [2025-03-08 06:15:42,690 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7038: havoc main_~node4____CPAchecker_TMP_3~3#1;havoc main_~node4____CPAchecker_TMP_2~3#1;havoc main_~node4____CPAchecker_TMP_1~3#1;havoc main_~node4____CPAchecker_TMP_0~3#1; [2025-03-08 06:15:42,691 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7569: havoc main_~node1____CPAchecker_TMP_3~3#1;havoc main_~node1____CPAchecker_TMP_2~3#1;havoc main_~node1____CPAchecker_TMP_1~3#1;havoc main_~node1____CPAchecker_TMP_0~3#1; [2025-03-08 06:15:42,691 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7843: havoc main_~node5____CPAchecker_TMP_3~4#1;havoc main_~node5____CPAchecker_TMP_2~4#1;havoc main_~node5____CPAchecker_TMP_1~4#1;havoc main_~node5____CPAchecker_TMP_0~4#1; [2025-03-08 06:15:42,691 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L8374: havoc main_~node2____CPAchecker_TMP_3~4#1;havoc main_~node2____CPAchecker_TMP_2~4#1;havoc main_~node2____CPAchecker_TMP_1~4#1;havoc main_~node2____CPAchecker_TMP_0~4#1; [2025-03-08 06:15:42,691 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3098: havoc main_~main____CPAchecker_TMP_0~6#1;havoc main_~__tmp_7~0#1, main_~assert__arg~6#1;havoc main_~check__tmp~6#1; [2025-03-08 06:15:42,691 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L9179: havoc main_~node3____CPAchecker_TMP_3~5#1;havoc main_~node3____CPAchecker_TMP_2~5#1;havoc main_~node3____CPAchecker_TMP_1~5#1;havoc main_~node3____CPAchecker_TMP_0~5#1; [2025-03-08 06:15:42,691 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L9984: havoc main_~node4____CPAchecker_TMP_3~6#1;havoc main_~node4____CPAchecker_TMP_2~6#1;havoc main_~node4____CPAchecker_TMP_1~6#1;havoc main_~node4____CPAchecker_TMP_0~6#1; [2025-03-08 06:15:42,691 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L10515: havoc main_~node1____CPAchecker_TMP_3~6#1;havoc main_~node1____CPAchecker_TMP_2~6#1;havoc main_~node1____CPAchecker_TMP_1~6#1;havoc main_~node1____CPAchecker_TMP_0~6#1; [2025-03-08 06:15:42,691 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1533: havoc main_~main____CPAchecker_TMP_0~1#1;havoc main_~__tmp_2~0#1, main_~assert__arg~1#1;havoc main_~check__tmp~1#1; [2025-03-08 06:15:42,691 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3914: havoc main_~node5____CPAchecker_TMP_3~0#1;havoc main_~node5____CPAchecker_TMP_2~0#1;havoc main_~node5____CPAchecker_TMP_1~0#1;havoc main_~node5____CPAchecker_TMP_0~0#1; [2025-03-08 06:15:42,691 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4445: havoc main_~node2____CPAchecker_TMP_3~0#1;havoc main_~node2____CPAchecker_TMP_2~0#1;havoc main_~node2____CPAchecker_TMP_1~0#1;havoc main_~node2____CPAchecker_TMP_0~0#1; [2025-03-08 06:15:42,691 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L10789: havoc main_~node5____CPAchecker_TMP_3~7#1;havoc main_~node5____CPAchecker_TMP_2~7#1;havoc main_~node5____CPAchecker_TMP_1~7#1;havoc main_~node5____CPAchecker_TMP_0~7#1; [2025-03-08 06:15:42,691 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L11320: havoc main_~node2____CPAchecker_TMP_3~7#1;havoc main_~node2____CPAchecker_TMP_2~7#1;havoc main_~node2____CPAchecker_TMP_1~7#1;havoc main_~node2____CPAchecker_TMP_0~7#1; [2025-03-08 06:15:42,692 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L222: havoc main_~init__r121~0#1, main_~init__r131~0#1, main_~init__r141~0#1, main_~init__r151~0#1, main_~init__r211~0#1, main_~init__r231~0#1, main_~init__r241~0#1, main_~init__r251~0#1, main_~init__r311~0#1, main_~init__r321~0#1, main_~init__r341~0#1, main_~init__r351~0#1, main_~init__r411~0#1, main_~init__r421~0#1, main_~init__r431~0#1, main_~init__r451~0#1, main_~init__r511~0#1, main_~init__r521~0#1, main_~init__r531~0#1, main_~init__r541~0#1, main_~init__r122~0#1, main_~init__tmp~0#1, main_~init__r132~0#1, main_~init__tmp___0~0#1, main_~init__r142~0#1, main_~init__tmp___1~0#1, main_~init__r152~0#1, main_~init__tmp___2~0#1, main_~init__r212~0#1, main_~init__tmp___3~0#1, main_~init__r232~0#1, main_~init__tmp___4~0#1, main_~init__r242~0#1, main_~init__tmp___5~0#1, main_~init__r252~0#1, main_~init__tmp___6~0#1, main_~init__r312~0#1, main_~init__tmp___7~0#1, main_~init__r322~0#1, main_~init__tmp___8~0#1, main_~init__r342~0#1, main_~init__tmp___9~0#1, main_~init__r352~0#1, main_~init__tmp___10~0#1, main_~init__r412~0#1, main_~init__tmp___11~0#1, main_~init__r422~0#1, main_~init__tmp___12~0#1, main_~init__r432~0#1, main_~init__tmp___13~0#1, main_~init__r452~0#1, main_~init__tmp___14~0#1, main_~init__r512~0#1, main_~init__tmp___15~0#1, main_~init__r522~0#1, main_~init__tmp___16~0#1, main_~init__r532~0#1, main_~init__tmp___17~0#1, main_~init__r542~0#1, main_~init__tmp___18~0#1, main_~init__r123~0#1, main_~init__tmp___19~0#1, main_~init__r133~0#1, main_~init__tmp___20~0#1, main_~init__r143~0#1, main_~init__tmp___21~0#1, main_~init__r153~0#1, main_~init__tmp___22~0#1, main_~init__r213~0#1, main_~init__tmp___23~0#1, main_~init__r233~0#1, main_~init__tmp___24~0#1, main_~init__r243~0#1, main_~init__tmp___25~0#1, main_~init__r253~0#1, main_~init__tmp___26~0#1, main_~init__r313~0#1, main_~init__tmp___27~0#1, main_~init__r323~0#1, main_~init__tmp___28~0#1, main_~init__r343~0#1, main_~init__tmp___29~0#1, main_~init__r353~0#1, main_~init__tmp___30~0#1, main_~init__r413~0#1, main_~init__tmp___31~0#1, main_~init__r423~0#1, main_~init__tmp___32~0#1, main_~init__r433~0#1, main_~init__tmp___33~0#1, main_~init__r453~0#1, main_~init__tmp___34~0#1, main_~init__r513~0#1, main_~init__tmp___35~0#1, main_~init__r523~0#1, main_~init__tmp___36~0#1, main_~init__r533~0#1, main_~init__tmp___37~0#1, main_~init__r543~0#1, main_~init__tmp___38~0#1, main_~init__r124~0#1, main_~init__tmp___39~0#1, main_~init__r134~0#1, main_~init__tmp___40~0#1, main_~init__r144~0#1, main_~init__tmp___41~0#1, main_~init__r154~0#1, main_~init__tmp___42~0#1, main_~init__r214~0#1, main_~init__tmp___43~0#1, main_~init__r234~0#1, main_~init__tmp___44~0#1, main_~init__r244~0#1, main_~init__tmp___45~0#1, main_~init__r254~0#1, main_~init__tmp___46~0#1, main_~init__r314~0#1, main_~init__tmp___47~0#1, main_~init__r324~0#1, main_~init__tmp___48~0#1, main_~init__r344~0#1, main_~init__tmp___49~0#1, main_~init__r354~0#1, main_~init__tmp___50~0#1, main_~init__r414~0#1, main_~init__tmp___51~0#1, main_~init__r424~0#1, main_~init__tmp___52~0#1, main_~init__r434~0#1, main_~init__tmp___53~0#1, main_~init__r454~0#1, main_~init__tmp___54~0#1, main_~init__r514~0#1, main_~init__tmp___55~0#1, main_~init__r524~0#1, main_~init__tmp___56~0#1, main_~init__r534~0#1, main_~init__tmp___57~0#1, main_~init__r544~0#1, main_~init__tmp___58~0#1, main_~init__tmp___59~0#1; [2025-03-08 06:15:42,692 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L5251: havoc main_~node3____CPAchecker_TMP_3~1#1;havoc main_~node3____CPAchecker_TMP_2~1#1;havoc main_~node3____CPAchecker_TMP_1~1#1;havoc main_~node3____CPAchecker_TMP_0~1#1; [2025-03-08 06:15:43,193 INFO L? ?]: Removed 468 outVars from TransFormulas that were not future-live. [2025-03-08 06:15:43,193 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 06:15:43,249 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 06:15:43,249 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 06:15:43,250 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 06:15:43 BoogieIcfgContainer [2025-03-08 06:15:43,250 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 06:15:43,255 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 06:15:43,255 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 06:15:43,259 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 06:15:43,259 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 06:15:36" (1/3) ... [2025-03-08 06:15:43,259 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77e87201 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 06:15:43, skipping insertion in model container [2025-03-08 06:15:43,260 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:15:38" (2/3) ... [2025-03-08 06:15:43,260 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77e87201 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 06:15:43, skipping insertion in model container [2025-03-08 06:15:43,260 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 06:15:43" (3/3) ... [2025-03-08 06:15:43,261 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_floodmax.5.4.ufo.BOUNDED-10.pals.c.p+lhb-reducer.c [2025-03-08 06:15:43,273 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 06:15:43,276 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_floodmax.5.4.ufo.BOUNDED-10.pals.c.p+lhb-reducer.c that has 1 procedures, 2244 locations, 1 initial locations, 0 loop locations, and 2 error locations. [2025-03-08 06:15:43,368 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 06:15:43,377 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;@2e419f68, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 06:15:43,378 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-08 06:15:43,388 INFO L276 IsEmpty]: Start isEmpty. Operand has 2244 states, 2241 states have (on average 1.7617135207496653) internal successors, (3948), 2243 states have internal predecessors, (3948), 0 states have call successors, (0), 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-03-08 06:15:43,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2025-03-08 06:15:43,424 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:15:43,424 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 06:15:43,425 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:15:43,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:15:43,431 INFO L85 PathProgramCache]: Analyzing trace with hash -1263875680, now seen corresponding path program 1 times [2025-03-08 06:15:43,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:15:43,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296736815] [2025-03-08 06:15:43,439 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:15:43,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:15:43,548 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 286 statements into 1 equivalence classes. [2025-03-08 06:15:43,738 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 286 of 286 statements. [2025-03-08 06:15:43,739 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:15:43,739 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:15:44,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:15:44,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:15:44,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296736815] [2025-03-08 06:15:44,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1296736815] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:15:44,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:15:44,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 06:15:44,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245189760] [2025-03-08 06:15:44,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:15:44,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 06:15:44,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:15:44,369 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 06:15:44,369 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 06:15:44,377 INFO L87 Difference]: Start difference. First operand has 2244 states, 2241 states have (on average 1.7617135207496653) internal successors, (3948), 2243 states have internal predecessors, (3948), 0 states have call successors, (0), 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 4 states, 4 states have (on average 71.5) internal successors, (286), 4 states have internal predecessors, (286), 0 states have call successors, (0), 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-03-08 06:15:44,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:15:44,700 INFO L93 Difference]: Finished difference Result 3947 states and 6875 transitions. [2025-03-08 06:15:44,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 06:15:44,703 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 71.5) internal successors, (286), 4 states have internal predecessors, (286), 0 states have call successors, (0), 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 286 [2025-03-08 06:15:44,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:15:44,727 INFO L225 Difference]: With dead ends: 3947 [2025-03-08 06:15:44,727 INFO L226 Difference]: Without dead ends: 2241 [2025-03-08 06:15:44,736 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 06:15:44,740 INFO L435 NwaCegarLoop]: 3942 mSDtfsCounter, 322 mSDsluCounter, 7472 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 322 SdHoareTripleChecker+Valid, 11414 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 06:15:44,742 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [322 Valid, 11414 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 06:15:44,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2241 states. [2025-03-08 06:15:44,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2241 to 2241. [2025-03-08 06:15:44,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2241 states, 2239 states have (on average 1.7271103171058508) internal successors, (3867), 2240 states have internal predecessors, (3867), 0 states have call successors, (0), 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-03-08 06:15:44,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2241 states to 2241 states and 3867 transitions. [2025-03-08 06:15:44,863 INFO L78 Accepts]: Start accepts. Automaton has 2241 states and 3867 transitions. Word has length 286 [2025-03-08 06:15:44,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:15:44,865 INFO L471 AbstractCegarLoop]: Abstraction has 2241 states and 3867 transitions. [2025-03-08 06:15:44,865 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 71.5) internal successors, (286), 4 states have internal predecessors, (286), 0 states have call successors, (0), 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-03-08 06:15:44,866 INFO L276 IsEmpty]: Start isEmpty. Operand 2241 states and 3867 transitions. [2025-03-08 06:15:44,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 346 [2025-03-08 06:15:44,875 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:15:44,875 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 06:15:44,875 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 06:15:44,876 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:15:44,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:15:44,877 INFO L85 PathProgramCache]: Analyzing trace with hash -999442748, now seen corresponding path program 1 times [2025-03-08 06:15:44,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:15:44,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595218723] [2025-03-08 06:15:44,877 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:15:44,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:15:44,931 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 345 statements into 1 equivalence classes. [2025-03-08 06:15:45,047 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 345 of 345 statements. [2025-03-08 06:15:45,047 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:15:45,048 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:15:45,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:15:45,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:15:45,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595218723] [2025-03-08 06:15:45,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595218723] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:15:45,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:15:45,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:15:45,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656732253] [2025-03-08 06:15:45,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:15:45,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:15:45,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:15:45,295 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:15:45,295 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:15:45,295 INFO L87 Difference]: Start difference. First operand 2241 states and 3867 transitions. Second operand has 3 states, 3 states have (on average 115.0) internal successors, (345), 3 states have internal predecessors, (345), 0 states have call successors, (0), 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-03-08 06:15:45,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:15:45,624 INFO L93 Difference]: Finished difference Result 5460 states and 9352 transitions. [2025-03-08 06:15:45,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:15:45,625 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 115.0) internal successors, (345), 3 states have internal predecessors, (345), 0 states have call successors, (0), 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 345 [2025-03-08 06:15:45,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:15:45,639 INFO L225 Difference]: With dead ends: 5460 [2025-03-08 06:15:45,639 INFO L226 Difference]: Without dead ends: 3797 [2025-03-08 06:15:45,643 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-03-08 06:15:45,644 INFO L435 NwaCegarLoop]: 6122 mSDtfsCounter, 2622 mSDsluCounter, 3666 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2622 SdHoareTripleChecker+Valid, 9788 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 06:15:45,644 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2622 Valid, 9788 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 06:15:45,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3797 states. [2025-03-08 06:15:45,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3797 to 3793. [2025-03-08 06:15:45,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3793 states, 3791 states have (on average 1.704035874439462) internal successors, (6460), 3792 states have internal predecessors, (6460), 0 states have call successors, (0), 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-03-08 06:15:45,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3793 states to 3793 states and 6460 transitions. [2025-03-08 06:15:45,731 INFO L78 Accepts]: Start accepts. Automaton has 3793 states and 6460 transitions. Word has length 345 [2025-03-08 06:15:45,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:15:45,732 INFO L471 AbstractCegarLoop]: Abstraction has 3793 states and 6460 transitions. [2025-03-08 06:15:45,732 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 115.0) internal successors, (345), 3 states have internal predecessors, (345), 0 states have call successors, (0), 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-03-08 06:15:45,732 INFO L276 IsEmpty]: Start isEmpty. Operand 3793 states and 6460 transitions. [2025-03-08 06:15:45,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 350 [2025-03-08 06:15:45,741 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:15:45,741 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 06:15:45,741 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 06:15:45,741 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:15:45,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:15:45,742 INFO L85 PathProgramCache]: Analyzing trace with hash 707478173, now seen corresponding path program 1 times [2025-03-08 06:15:45,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:15:45,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464513502] [2025-03-08 06:15:45,742 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:15:45,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:15:45,777 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 349 statements into 1 equivalence classes. [2025-03-08 06:15:45,857 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 349 of 349 statements. [2025-03-08 06:15:45,857 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:15:45,857 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:15:46,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:15:46,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:15:46,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464513502] [2025-03-08 06:15:46,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [464513502] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:15:46,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:15:46,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:15:46,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157855561] [2025-03-08 06:15:46,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:15:46,078 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:15:46,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:15:46,078 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:15:46,078 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:15:46,079 INFO L87 Difference]: Start difference. First operand 3793 states and 6460 transitions. Second operand has 3 states, 3 states have (on average 116.33333333333333) internal successors, (349), 3 states have internal predecessors, (349), 0 states have call successors, (0), 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-03-08 06:15:46,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:15:46,257 INFO L93 Difference]: Finished difference Result 6366 states and 10867 transitions. [2025-03-08 06:15:46,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:15:46,258 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 116.33333333333333) internal successors, (349), 3 states have internal predecessors, (349), 0 states have call successors, (0), 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 349 [2025-03-08 06:15:46,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:15:46,275 INFO L225 Difference]: With dead ends: 6366 [2025-03-08 06:15:46,275 INFO L226 Difference]: Without dead ends: 4693 [2025-03-08 06:15:46,279 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-03-08 06:15:46,280 INFO L435 NwaCegarLoop]: 5937 mSDtfsCounter, 2421 mSDsluCounter, 3479 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2421 SdHoareTripleChecker+Valid, 9416 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 06:15:46,280 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2421 Valid, 9416 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 06:15:46,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4693 states. [2025-03-08 06:15:46,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4693 to 4689. [2025-03-08 06:15:46,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4689 states, 4687 states have (on average 1.7051418818007253) internal successors, (7992), 4688 states have internal predecessors, (7992), 0 states have call successors, (0), 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-03-08 06:15:46,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4689 states to 4689 states and 7992 transitions. [2025-03-08 06:15:46,374 INFO L78 Accepts]: Start accepts. Automaton has 4689 states and 7992 transitions. Word has length 349 [2025-03-08 06:15:46,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:15:46,374 INFO L471 AbstractCegarLoop]: Abstraction has 4689 states and 7992 transitions. [2025-03-08 06:15:46,375 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 116.33333333333333) internal successors, (349), 3 states have internal predecessors, (349), 0 states have call successors, (0), 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-03-08 06:15:46,375 INFO L276 IsEmpty]: Start isEmpty. Operand 4689 states and 7992 transitions. [2025-03-08 06:15:46,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 354 [2025-03-08 06:15:46,383 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:15:46,383 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 06:15:46,384 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 06:15:46,384 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:15:46,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:15:46,384 INFO L85 PathProgramCache]: Analyzing trace with hash 1440333956, now seen corresponding path program 1 times [2025-03-08 06:15:46,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:15:46,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059548575] [2025-03-08 06:15:46,385 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:15:46,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:15:46,425 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 353 statements into 1 equivalence classes. [2025-03-08 06:15:46,466 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 353 of 353 statements. [2025-03-08 06:15:46,467 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:15:46,467 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:15:46,719 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:15:46,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:15:46,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059548575] [2025-03-08 06:15:46,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1059548575] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:15:46,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:15:46,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:15:46,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152227315] [2025-03-08 06:15:46,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:15:46,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:15:46,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:15:46,721 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:15:46,721 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:15:46,721 INFO L87 Difference]: Start difference. First operand 4689 states and 7992 transitions. Second operand has 3 states, 3 states have (on average 117.66666666666667) internal successors, (353), 3 states have internal predecessors, (353), 0 states have call successors, (0), 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-03-08 06:15:46,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:15:46,972 INFO L93 Difference]: Finished difference Result 12611 states and 21378 transitions. [2025-03-08 06:15:46,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:15:46,973 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 117.66666666666667) internal successors, (353), 3 states have internal predecessors, (353), 0 states have call successors, (0), 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 353 [2025-03-08 06:15:46,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:15:47,001 INFO L225 Difference]: With dead ends: 12611 [2025-03-08 06:15:47,001 INFO L226 Difference]: Without dead ends: 8523 [2025-03-08 06:15:47,010 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-03-08 06:15:47,012 INFO L435 NwaCegarLoop]: 6417 mSDtfsCounter, 2655 mSDsluCounter, 3672 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2655 SdHoareTripleChecker+Valid, 10089 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 06:15:47,013 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2655 Valid, 10089 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 06:15:47,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8523 states. [2025-03-08 06:15:47,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8523 to 8519. [2025-03-08 06:15:47,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8519 states, 8517 states have (on average 1.6927321826934367) internal successors, (14417), 8518 states have internal predecessors, (14417), 0 states have call successors, (0), 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-03-08 06:15:47,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8519 states to 8519 states and 14417 transitions. [2025-03-08 06:15:47,185 INFO L78 Accepts]: Start accepts. Automaton has 8519 states and 14417 transitions. Word has length 353 [2025-03-08 06:15:47,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:15:47,185 INFO L471 AbstractCegarLoop]: Abstraction has 8519 states and 14417 transitions. [2025-03-08 06:15:47,186 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 117.66666666666667) internal successors, (353), 3 states have internal predecessors, (353), 0 states have call successors, (0), 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-03-08 06:15:47,186 INFO L276 IsEmpty]: Start isEmpty. Operand 8519 states and 14417 transitions. [2025-03-08 06:15:47,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 358 [2025-03-08 06:15:47,201 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:15:47,201 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 06:15:47,202 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 06:15:47,204 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:15:47,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:15:47,205 INFO L85 PathProgramCache]: Analyzing trace with hash 540694667, now seen corresponding path program 1 times [2025-03-08 06:15:47,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:15:47,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532515960] [2025-03-08 06:15:47,205 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:15:47,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:15:47,244 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 357 statements into 1 equivalence classes. [2025-03-08 06:15:47,291 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 357 of 357 statements. [2025-03-08 06:15:47,294 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:15:47,294 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:15:47,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:15:47,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:15:47,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532515960] [2025-03-08 06:15:47,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [532515960] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:15:47,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:15:47,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:15:47,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522720243] [2025-03-08 06:15:47,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:15:47,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:15:47,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:15:47,498 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:15:47,498 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:15:47,499 INFO L87 Difference]: Start difference. First operand 8519 states and 14417 transitions. Second operand has 3 states, 3 states have (on average 119.0) internal successors, (357), 3 states have internal predecessors, (357), 0 states have call successors, (0), 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-03-08 06:15:47,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:15:47,682 INFO L93 Difference]: Finished difference Result 15284 states and 25906 transitions. [2025-03-08 06:15:47,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:15:47,683 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 119.0) internal successors, (357), 3 states have internal predecessors, (357), 0 states have call successors, (0), 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 357 [2025-03-08 06:15:47,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:15:47,720 INFO L225 Difference]: With dead ends: 15284 [2025-03-08 06:15:47,720 INFO L226 Difference]: Without dead ends: 11186 [2025-03-08 06:15:47,731 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-03-08 06:15:47,732 INFO L435 NwaCegarLoop]: 5603 mSDtfsCounter, 2392 mSDsluCounter, 3429 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2392 SdHoareTripleChecker+Valid, 9032 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 06:15:47,732 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2392 Valid, 9032 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 06:15:47,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11186 states. [2025-03-08 06:15:47,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11186 to 11182. [2025-03-08 06:15:47,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11182 states, 11180 states have (on average 1.6929338103756708) internal successors, (18927), 11181 states have internal predecessors, (18927), 0 states have call successors, (0), 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-03-08 06:15:47,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11182 states to 11182 states and 18927 transitions. [2025-03-08 06:15:47,958 INFO L78 Accepts]: Start accepts. Automaton has 11182 states and 18927 transitions. Word has length 357 [2025-03-08 06:15:47,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:15:47,958 INFO L471 AbstractCegarLoop]: Abstraction has 11182 states and 18927 transitions. [2025-03-08 06:15:47,959 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 119.0) internal successors, (357), 3 states have internal predecessors, (357), 0 states have call successors, (0), 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-03-08 06:15:47,959 INFO L276 IsEmpty]: Start isEmpty. Operand 11182 states and 18927 transitions. [2025-03-08 06:15:47,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 362 [2025-03-08 06:15:47,976 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:15:47,976 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 06:15:47,976 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 06:15:47,977 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:15:47,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:15:47,977 INFO L85 PathProgramCache]: Analyzing trace with hash -250193212, now seen corresponding path program 1 times [2025-03-08 06:15:47,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:15:47,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973316108] [2025-03-08 06:15:47,977 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:15:47,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:15:48,010 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 361 statements into 1 equivalence classes. [2025-03-08 06:15:48,046 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 361 of 361 statements. [2025-03-08 06:15:48,046 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:15:48,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:15:48,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:15:48,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:15:48,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973316108] [2025-03-08 06:15:48,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [973316108] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:15:48,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:15:48,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:15:48,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66163597] [2025-03-08 06:15:48,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:15:48,287 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:15:48,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:15:48,288 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:15:48,288 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:15:48,288 INFO L87 Difference]: Start difference. First operand 11182 states and 18927 transitions. Second operand has 3 states, 3 states have (on average 120.33333333333333) internal successors, (361), 3 states have internal predecessors, (361), 0 states have call successors, (0), 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-03-08 06:15:48,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:15:48,561 INFO L93 Difference]: Finished difference Result 31560 states and 53189 transitions. [2025-03-08 06:15:48,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:15:48,562 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 120.33333333333333) internal successors, (361), 3 states have internal predecessors, (361), 0 states have call successors, (0), 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 361 [2025-03-08 06:15:48,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:15:48,597 INFO L225 Difference]: With dead ends: 31560 [2025-03-08 06:15:48,597 INFO L226 Difference]: Without dead ends: 21002 [2025-03-08 06:15:48,616 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-03-08 06:15:48,616 INFO L435 NwaCegarLoop]: 6045 mSDtfsCounter, 2624 mSDsluCounter, 3614 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2624 SdHoareTripleChecker+Valid, 9659 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 06:15:48,616 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2624 Valid, 9659 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 06:15:48,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21002 states. [2025-03-08 06:15:48,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21002 to 20998. [2025-03-08 06:15:48,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20998 states, 20996 states have (on average 1.6805105734425605) internal successors, (35284), 20997 states have internal predecessors, (35284), 0 states have call successors, (0), 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-03-08 06:15:49,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20998 states to 20998 states and 35284 transitions. [2025-03-08 06:15:49,053 INFO L78 Accepts]: Start accepts. Automaton has 20998 states and 35284 transitions. Word has length 361 [2025-03-08 06:15:49,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:15:49,053 INFO L471 AbstractCegarLoop]: Abstraction has 20998 states and 35284 transitions. [2025-03-08 06:15:49,054 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 120.33333333333333) internal successors, (361), 3 states have internal predecessors, (361), 0 states have call successors, (0), 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-03-08 06:15:49,054 INFO L276 IsEmpty]: Start isEmpty. Operand 20998 states and 35284 transitions. [2025-03-08 06:15:49,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 366 [2025-03-08 06:15:49,082 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:15:49,082 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 06:15:49,082 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 06:15:49,082 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:15:49,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:15:49,083 INFO L85 PathProgramCache]: Analyzing trace with hash -614421411, now seen corresponding path program 1 times [2025-03-08 06:15:49,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:15:49,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750415179] [2025-03-08 06:15:49,083 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:15:49,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:15:49,117 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 365 statements into 1 equivalence classes. [2025-03-08 06:15:49,150 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 365 of 365 statements. [2025-03-08 06:15:49,150 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:15:49,150 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:15:49,282 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:15:49,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:15:49,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750415179] [2025-03-08 06:15:49,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1750415179] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:15:49,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:15:49,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:15:49,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059695626] [2025-03-08 06:15:49,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:15:49,283 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:15:49,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:15:49,284 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:15:49,284 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:15:49,284 INFO L87 Difference]: Start difference. First operand 20998 states and 35284 transitions. Second operand has 3 states, 3 states have (on average 121.66666666666667) internal successors, (365), 3 states have internal predecessors, (365), 0 states have call successors, (0), 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-03-08 06:15:49,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:15:49,628 INFO L93 Difference]: Finished difference Result 38799 states and 65363 transitions. [2025-03-08 06:15:49,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:15:49,629 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 121.66666666666667) internal successors, (365), 3 states have internal predecessors, (365), 0 states have call successors, (0), 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 365 [2025-03-08 06:15:49,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:15:49,684 INFO L225 Difference]: With dead ends: 38799 [2025-03-08 06:15:49,684 INFO L226 Difference]: Without dead ends: 28231 [2025-03-08 06:15:49,701 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-03-08 06:15:49,702 INFO L435 NwaCegarLoop]: 5786 mSDtfsCounter, 2361 mSDsluCounter, 3371 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2361 SdHoareTripleChecker+Valid, 9157 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 06:15:49,702 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2361 Valid, 9157 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 06:15:49,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28231 states. [2025-03-08 06:15:50,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28231 to 28227. [2025-03-08 06:15:50,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28227 states, 28225 states have (on average 1.6808503100088574) internal successors, (47442), 28226 states have internal predecessors, (47442), 0 states have call successors, (0), 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-03-08 06:15:50,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28227 states to 28227 states and 47442 transitions. [2025-03-08 06:15:50,362 INFO L78 Accepts]: Start accepts. Automaton has 28227 states and 47442 transitions. Word has length 365 [2025-03-08 06:15:50,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:15:50,363 INFO L471 AbstractCegarLoop]: Abstraction has 28227 states and 47442 transitions. [2025-03-08 06:15:50,364 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 121.66666666666667) internal successors, (365), 3 states have internal predecessors, (365), 0 states have call successors, (0), 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-03-08 06:15:50,364 INFO L276 IsEmpty]: Start isEmpty. Operand 28227 states and 47442 transitions. [2025-03-08 06:15:50,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 370 [2025-03-08 06:15:50,406 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:15:50,406 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 06:15:50,406 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 06:15:50,407 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:15:50,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:15:50,407 INFO L85 PathProgramCache]: Analyzing trace with hash -1183560316, now seen corresponding path program 1 times [2025-03-08 06:15:50,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:15:50,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581882828] [2025-03-08 06:15:50,407 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:15:50,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:15:50,452 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 369 statements into 1 equivalence classes. [2025-03-08 06:15:50,496 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 369 of 369 statements. [2025-03-08 06:15:50,497 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:15:50,497 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:15:50,722 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:15:50,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:15:50,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581882828] [2025-03-08 06:15:50,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1581882828] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:15:50,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:15:50,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:15:50,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467391703] [2025-03-08 06:15:50,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:15:50,723 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:15:50,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:15:50,724 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:15:50,724 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:15:50,724 INFO L87 Difference]: Start difference. First operand 28227 states and 47442 transitions. Second operand has 3 states, 3 states have (on average 123.0) internal successors, (369), 3 states have internal predecessors, (369), 0 states have call successors, (0), 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-03-08 06:15:51,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:15:51,162 INFO L93 Difference]: Finished difference Result 81219 states and 135934 transitions. [2025-03-08 06:15:51,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:15:51,163 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 123.0) internal successors, (369), 3 states have internal predecessors, (369), 0 states have call successors, (0), 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 369 [2025-03-08 06:15:51,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:15:51,257 INFO L225 Difference]: With dead ends: 81219 [2025-03-08 06:15:51,257 INFO L226 Difference]: Without dead ends: 53639 [2025-03-08 06:15:51,297 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-03-08 06:15:51,297 INFO L435 NwaCegarLoop]: 6251 mSDtfsCounter, 2593 mSDsluCounter, 3556 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2593 SdHoareTripleChecker+Valid, 9807 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 06:15:51,298 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2593 Valid, 9807 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 06:15:51,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53639 states. [2025-03-08 06:15:51,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53639 to 53635. [2025-03-08 06:15:52,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53635 states, 53633 states have (on average 1.6672384539369418) internal successors, (89419), 53634 states have internal predecessors, (89419), 0 states have call successors, (0), 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-03-08 06:15:52,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53635 states to 53635 states and 89419 transitions. [2025-03-08 06:15:52,119 INFO L78 Accepts]: Start accepts. Automaton has 53635 states and 89419 transitions. Word has length 369 [2025-03-08 06:15:52,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:15:52,120 INFO L471 AbstractCegarLoop]: Abstraction has 53635 states and 89419 transitions. [2025-03-08 06:15:52,120 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 123.0) internal successors, (369), 3 states have internal predecessors, (369), 0 states have call successors, (0), 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-03-08 06:15:52,120 INFO L276 IsEmpty]: Start isEmpty. Operand 53635 states and 89419 transitions. [2025-03-08 06:15:52,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 374 [2025-03-08 06:15:52,174 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:15:52,175 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 06:15:52,175 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 06:15:52,175 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:15:52,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:15:52,176 INFO L85 PathProgramCache]: Analyzing trace with hash 838293451, now seen corresponding path program 1 times [2025-03-08 06:15:52,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:15:52,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154111606] [2025-03-08 06:15:52,176 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:15:52,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:15:52,208 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 373 statements into 1 equivalence classes. [2025-03-08 06:15:52,248 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 373 of 373 statements. [2025-03-08 06:15:52,249 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:15:52,249 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:15:52,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:15:52,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:15:52,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154111606] [2025-03-08 06:15:52,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [154111606] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:15:52,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:15:52,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:15:52,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709680284] [2025-03-08 06:15:52,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:15:52,390 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:15:52,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:15:52,391 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:15:52,391 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:15:52,392 INFO L87 Difference]: Start difference. First operand 53635 states and 89419 transitions. Second operand has 3 states, 3 states have (on average 124.33333333333333) internal successors, (373), 3 states have internal predecessors, (373), 0 states have call successors, (0), 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-03-08 06:15:52,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:15:52,943 INFO L93 Difference]: Finished difference Result 100006 states and 167232 transitions. [2025-03-08 06:15:52,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:15:52,943 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 124.33333333333333) internal successors, (373), 3 states have internal predecessors, (373), 0 states have call successors, (0), 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 373 [2025-03-08 06:15:52,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:15:53,084 INFO L225 Difference]: With dead ends: 100006 [2025-03-08 06:15:53,084 INFO L226 Difference]: Without dead ends: 72416 [2025-03-08 06:15:53,108 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-03-08 06:15:53,110 INFO L435 NwaCegarLoop]: 5439 mSDtfsCounter, 2332 mSDsluCounter, 3313 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2332 SdHoareTripleChecker+Valid, 8752 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 06:15:53,111 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2332 Valid, 8752 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 06:15:53,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72416 states. [2025-03-08 06:15:54,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72416 to 72412. [2025-03-08 06:15:54,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72412 states, 72410 states have (on average 1.6669658886894076) internal successors, (120705), 72411 states have internal predecessors, (120705), 0 states have call successors, (0), 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-03-08 06:15:54,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72412 states to 72412 states and 120705 transitions. [2025-03-08 06:15:54,440 INFO L78 Accepts]: Start accepts. Automaton has 72412 states and 120705 transitions. Word has length 373 [2025-03-08 06:15:54,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:15:54,440 INFO L471 AbstractCegarLoop]: Abstraction has 72412 states and 120705 transitions. [2025-03-08 06:15:54,440 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 124.33333333333333) internal successors, (373), 3 states have internal predecessors, (373), 0 states have call successors, (0), 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-03-08 06:15:54,441 INFO L276 IsEmpty]: Start isEmpty. Operand 72412 states and 120705 transitions. [2025-03-08 06:15:54,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 378 [2025-03-08 06:15:54,490 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:15:54,491 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 06:15:54,491 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 06:15:54,491 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:15:54,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:15:54,498 INFO L85 PathProgramCache]: Analyzing trace with hash 29408964, now seen corresponding path program 1 times [2025-03-08 06:15:54,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:15:54,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899906497] [2025-03-08 06:15:54,498 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:15:54,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:15:54,531 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 377 statements into 1 equivalence classes. [2025-03-08 06:15:54,563 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 377 of 377 statements. [2025-03-08 06:15:54,564 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:15:54,565 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:15:54,800 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:15:54,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:15:54,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899906497] [2025-03-08 06:15:54,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1899906497] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:15:54,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:15:54,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:15:54,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473367182] [2025-03-08 06:15:54,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:15:54,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:15:54,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:15:54,802 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:15:54,802 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:15:54,802 INFO L87 Difference]: Start difference. First operand 72412 states and 120705 transitions. Second operand has 3 states, 3 states have (on average 125.66666666666667) internal successors, (377), 3 states have internal predecessors, (377), 0 states have call successors, (0), 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-03-08 06:15:55,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:15:55,389 INFO L93 Difference]: Finished difference Result 209482 states and 347547 transitions. [2025-03-08 06:15:55,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:15:55,390 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 125.66666666666667) internal successors, (377), 3 states have internal predecessors, (377), 0 states have call successors, (0), 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 377 [2025-03-08 06:15:55,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:15:55,583 INFO L225 Difference]: With dead ends: 209482 [2025-03-08 06:15:55,584 INFO L226 Difference]: Without dead ends: 137740 [2025-03-08 06:15:55,682 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-03-08 06:15:55,682 INFO L435 NwaCegarLoop]: 5881 mSDtfsCounter, 2562 mSDsluCounter, 3498 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2562 SdHoareTripleChecker+Valid, 9379 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 06:15:55,683 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2562 Valid, 9379 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 06:15:55,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137740 states. [2025-03-08 06:15:57,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137740 to 137736. [2025-03-08 06:15:57,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137736 states, 137734 states have (on average 1.6511391522790306) internal successors, (227418), 137735 states have internal predecessors, (227418), 0 states have call successors, (0), 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-03-08 06:15:58,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137736 states to 137736 states and 227418 transitions. [2025-03-08 06:15:58,189 INFO L78 Accepts]: Start accepts. Automaton has 137736 states and 227418 transitions. Word has length 377 [2025-03-08 06:15:58,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:15:58,190 INFO L471 AbstractCegarLoop]: Abstraction has 137736 states and 227418 transitions. [2025-03-08 06:15:58,190 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 125.66666666666667) internal successors, (377), 3 states have internal predecessors, (377), 0 states have call successors, (0), 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-03-08 06:15:58,191 INFO L276 IsEmpty]: Start isEmpty. Operand 137736 states and 227418 transitions. [2025-03-08 06:15:58,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 382 [2025-03-08 06:15:58,328 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:15:58,330 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 06:15:58,330 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 06:15:58,330 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:15:58,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:15:58,334 INFO L85 PathProgramCache]: Analyzing trace with hash 1691182621, now seen corresponding path program 1 times [2025-03-08 06:15:58,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:15:58,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095258483] [2025-03-08 06:15:58,335 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:15:58,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:15:58,370 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 381 statements into 1 equivalence classes. [2025-03-08 06:15:58,397 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 381 of 381 statements. [2025-03-08 06:15:58,397 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:15:58,397 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:15:58,661 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:15:58,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:15:58,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095258483] [2025-03-08 06:15:58,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2095258483] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:15:58,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:15:58,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:15:58,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548041864] [2025-03-08 06:15:58,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:15:58,662 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:15:58,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:15:58,662 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:15:58,662 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:15:58,663 INFO L87 Difference]: Start difference. First operand 137736 states and 227418 transitions. Second operand has 3 states, 3 states have (on average 127.0) internal successors, (381), 3 states have internal predecessors, (381), 0 states have call successors, (0), 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-03-08 06:15:59,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:15:59,480 INFO L93 Difference]: Finished difference Result 256485 states and 424817 transitions. [2025-03-08 06:15:59,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:15:59,480 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 127.0) internal successors, (381), 3 states have internal predecessors, (381), 0 states have call successors, (0), 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 381 [2025-03-08 06:15:59,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:15:59,689 INFO L225 Difference]: With dead ends: 256485 [2025-03-08 06:15:59,689 INFO L226 Difference]: Without dead ends: 184733 [2025-03-08 06:15:59,760 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-03-08 06:15:59,761 INFO L435 NwaCegarLoop]: 5622 mSDtfsCounter, 2301 mSDsluCounter, 3255 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2301 SdHoareTripleChecker+Valid, 8877 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 06:15:59,761 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2301 Valid, 8877 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 06:15:59,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184733 states. [2025-03-08 06:16:01,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184733 to 184729. [2025-03-08 06:16:01,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184729 states, 184727 states have (on average 1.649374482344216) internal successors, (304684), 184728 states have internal predecessors, (304684), 0 states have call successors, (0), 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-03-08 06:16:02,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184729 states to 184729 states and 304684 transitions. [2025-03-08 06:16:02,417 INFO L78 Accepts]: Start accepts. Automaton has 184729 states and 304684 transitions. Word has length 381 [2025-03-08 06:16:02,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:16:02,417 INFO L471 AbstractCegarLoop]: Abstraction has 184729 states and 304684 transitions. [2025-03-08 06:16:02,417 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 127.0) internal successors, (381), 3 states have internal predecessors, (381), 0 states have call successors, (0), 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-03-08 06:16:02,417 INFO L276 IsEmpty]: Start isEmpty. Operand 184729 states and 304684 transitions. [2025-03-08 06:16:02,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 386 [2025-03-08 06:16:02,658 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:16:02,658 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 06:16:02,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 06:16:02,658 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:16:02,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:16:02,659 INFO L85 PathProgramCache]: Analyzing trace with hash 421862020, now seen corresponding path program 1 times [2025-03-08 06:16:02,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:16:02,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464961893] [2025-03-08 06:16:02,659 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:16:02,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:16:02,704 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 385 statements into 1 equivalence classes. [2025-03-08 06:16:02,739 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 385 of 385 statements. [2025-03-08 06:16:02,739 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:16:02,739 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:16:03,264 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:16:03,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:16:03,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464961893] [2025-03-08 06:16:03,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464961893] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:16:03,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:16:03,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 06:16:03,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394595337] [2025-03-08 06:16:03,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:16:03,266 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 06:16:03,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:16:03,266 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 06:16:03,266 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 06:16:03,267 INFO L87 Difference]: Start difference. First operand 184729 states and 304684 transitions. Second operand has 7 states, 7 states have (on average 55.0) internal successors, (385), 7 states have internal predecessors, (385), 0 states have call successors, (0), 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-03-08 06:16:09,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:16:09,922 INFO L93 Difference]: Finished difference Result 1423805 states and 2360418 transitions. [2025-03-08 06:16:09,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-08 06:16:09,923 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 55.0) internal successors, (385), 7 states have internal predecessors, (385), 0 states have call successors, (0), 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 385 [2025-03-08 06:16:09,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:16:12,384 INFO L225 Difference]: With dead ends: 1423805 [2025-03-08 06:16:12,384 INFO L226 Difference]: Without dead ends: 1239749 [2025-03-08 06:16:12,587 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2025-03-08 06:16:12,587 INFO L435 NwaCegarLoop]: 14266 mSDtfsCounter, 16907 mSDsluCounter, 58757 mSDsCounter, 0 mSdLazyCounter, 3562 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16907 SdHoareTripleChecker+Valid, 73023 SdHoareTripleChecker+Invalid, 3601 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 3562 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-03-08 06:16:12,588 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16907 Valid, 73023 Invalid, 3601 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [39 Valid, 3562 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-03-08 06:16:13,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1239749 states. [2025-03-08 06:16:21,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1239749 to 365330. [2025-03-08 06:16:22,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 365330 states, 365328 states have (on average 1.6440267376166076) internal successors, (600609), 365329 states have internal predecessors, (600609), 0 states have call successors, (0), 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-03-08 06:16:23,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365330 states to 365330 states and 600609 transitions. [2025-03-08 06:16:23,066 INFO L78 Accepts]: Start accepts. Automaton has 365330 states and 600609 transitions. Word has length 385 [2025-03-08 06:16:23,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:16:23,066 INFO L471 AbstractCegarLoop]: Abstraction has 365330 states and 600609 transitions. [2025-03-08 06:16:23,067 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 55.0) internal successors, (385), 7 states have internal predecessors, (385), 0 states have call successors, (0), 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-03-08 06:16:23,067 INFO L276 IsEmpty]: Start isEmpty. Operand 365330 states and 600609 transitions. [2025-03-08 06:16:23,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 388 [2025-03-08 06:16:23,287 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:16:23,287 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 06:16:23,287 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 06:16:23,287 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:16:23,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:16:23,288 INFO L85 PathProgramCache]: Analyzing trace with hash 175520329, now seen corresponding path program 1 times [2025-03-08 06:16:23,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:16:23,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709561381] [2025-03-08 06:16:23,288 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:16:23,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:16:23,315 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 387 statements into 1 equivalence classes. [2025-03-08 06:16:23,340 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 387 of 387 statements. [2025-03-08 06:16:23,341 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:16:23,341 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:16:23,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:16:23,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:16:23,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709561381] [2025-03-08 06:16:23,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1709561381] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:16:23,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:16:23,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 06:16:23,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377114029] [2025-03-08 06:16:23,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:16:23,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 06:16:23,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:16:23,809 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 06:16:23,809 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 06:16:23,810 INFO L87 Difference]: Start difference. First operand 365330 states and 600609 transitions. Second operand has 4 states, 4 states have (on average 96.75) internal successors, (387), 4 states have internal predecessors, (387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)