./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.5.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 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.2.ufo.UNBOUNDED.pals.c.v+nlh-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 c65c198ec72496bb5b04d5e41e47edaf1b306731824d389c2c0c2e76409cd0bf --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 19:23:06,475 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 19:23:06,528 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 19:23:06,532 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 19:23:06,532 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 19:23:06,556 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 19:23:06,556 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 19:23:06,557 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 19:23:06,557 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 19:23:06,557 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 19:23:06,558 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 19:23:06,558 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 19:23:06,558 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 19:23:06,558 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 19:23:06,558 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 19:23:06,558 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 19:23:06,558 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 19:23:06,559 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 19:23:06,559 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 19:23:06,559 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 19:23:06,559 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 19:23:06,559 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 19:23:06,559 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 19:23:06,559 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 19:23:06,559 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 19:23:06,559 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 19:23:06,559 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 19:23:06,559 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 19:23:06,559 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 19:23:06,559 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 19:23:06,559 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 19:23:06,559 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 19:23:06,559 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 19:23:06,559 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 19:23:06,559 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 19:23:06,559 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 19:23:06,559 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 19:23:06,559 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 19:23:06,560 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 19:23:06,560 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 19:23:06,560 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 19:23:06,560 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 19:23:06,560 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 19:23:06,560 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 -> c65c198ec72496bb5b04d5e41e47edaf1b306731824d389c2c0c2e76409cd0bf [2025-03-16 19:23:06,786 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 19:23:06,794 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 19:23:06,796 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 19:23:06,798 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 19:23:06,798 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 19:23:06,800 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.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2025-03-16 19:23:07,943 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/53316c313/b0ab49dd8c9c460e8dfa0d1be2b2e156/FLAGe8268351f [2025-03-16 19:23:08,327 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 19:23:08,331 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.5.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2025-03-16 19:23:08,349 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/53316c313/b0ab49dd8c9c460e8dfa0d1be2b2e156/FLAGe8268351f [2025-03-16 19:23:08,515 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/53316c313/b0ab49dd8c9c460e8dfa0d1be2b2e156 [2025-03-16 19:23:08,517 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 19:23:08,518 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 19:23:08,519 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 19:23:08,519 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 19:23:08,524 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 19:23:08,525 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 07:23:08" (1/1) ... [2025-03-16 19:23:08,525 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d912b9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:23:08, skipping insertion in model container [2025-03-16 19:23:08,526 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 07:23:08" (1/1) ... [2025-03-16 19:23:08,591 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 19:23:09,054 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.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c[50207,50220] [2025-03-16 19:23:09,220 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 19:23:09,236 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 19:23:09,470 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.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c[50207,50220] [2025-03-16 19:23:09,595 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 19:23:09,612 INFO L204 MainTranslator]: Completed translation [2025-03-16 19:23:09,613 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:23:09 WrapperNode [2025-03-16 19:23:09,613 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 19:23:09,614 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 19:23:09,614 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 19:23:09,614 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 19:23:09,619 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:23:09" (1/1) ... [2025-03-16 19:23:09,643 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:23:09" (1/1) ... [2025-03-16 19:23:09,756 INFO L138 Inliner]: procedures = 25, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 5008 [2025-03-16 19:23:09,757 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 19:23:09,757 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 19:23:09,758 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 19:23:09,758 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 19:23:09,764 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:23:09" (1/1) ... [2025-03-16 19:23:09,766 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:23:09" (1/1) ... [2025-03-16 19:23:09,779 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:23:09" (1/1) ... [2025-03-16 19:23:09,829 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-16 19:23:09,829 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:23:09" (1/1) ... [2025-03-16 19:23:09,830 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:23:09" (1/1) ... [2025-03-16 19:23:09,868 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:23:09" (1/1) ... [2025-03-16 19:23:09,877 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:23:09" (1/1) ... [2025-03-16 19:23:09,888 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:23:09" (1/1) ... [2025-03-16 19:23:09,898 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:23:09" (1/1) ... [2025-03-16 19:23:09,915 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 19:23:09,917 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 19:23:09,917 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 19:23:09,917 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 19:23:09,917 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:23:09" (1/1) ... [2025-03-16 19:23:09,921 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 19:23:09,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:23:09,943 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-16 19:23:09,946 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-16 19:23:09,963 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 19:23:09,963 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 19:23:09,963 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 19:23:09,963 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 19:23:10,131 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 19:23:10,132 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 19:23:12,695 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3429: 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-16 19:23:12,696 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2913: havoc main_~__tmp_6~0#1, main_~assert__arg~5#1;havoc main_~check__tmp~5#1;havoc main_~__tmp_5~0#1, main_~assert__arg~4#1;havoc main_~check__tmp~4#1;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;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;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;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;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;havoc main_~__tmp_4~0#1, main_~assert__arg~3#1;havoc main_~check__tmp~3#1;havoc main_~__tmp_3~0#1, main_~assert__arg~2#1;havoc main_~check__tmp~2#1;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;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;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;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;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;havoc main_~__tmp_2~0#1, main_~assert__arg~1#1;havoc main_~check__tmp~1#1;havoc main_~__tmp_1~0#1, main_~assert__arg~0#1;havoc main_~check__tmp~0#1;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;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;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;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;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;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-16 19:23:12,696 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3975: 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-16 19:23:12,696 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3205: havoc main_~check__tmp~6#1; [2025-03-16 19:23:12,696 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3611: 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-16 19:23:12,696 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4157: 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-16 19:23:12,697 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3793: 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-16 19:23:13,137 INFO L? ?]: Removed 337 outVars from TransFormulas that were not future-live. [2025-03-16 19:23:13,137 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 19:23:13,173 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 19:23:13,173 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 19:23:13,173 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 07:23:13 BoogieIcfgContainer [2025-03-16 19:23:13,173 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 19:23:13,179 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 19:23:13,179 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 19:23:13,183 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 19:23:13,183 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 07:23:08" (1/3) ... [2025-03-16 19:23:13,183 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40134d4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 07:23:13, skipping insertion in model container [2025-03-16 19:23:13,184 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:23:09" (2/3) ... [2025-03-16 19:23:13,184 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40134d4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 07:23:13, skipping insertion in model container [2025-03-16 19:23:13,184 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 07:23:13" (3/3) ... [2025-03-16 19:23:13,185 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_floodmax.5.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2025-03-16 19:23:13,196 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 19:23:13,199 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_floodmax.5.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c that has 1 procedures, 1334 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-03-16 19:23:13,274 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 19:23:13,284 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;@27d53e82, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 19:23:13,284 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 19:23:13,292 INFO L276 IsEmpty]: Start isEmpty. Operand has 1334 states, 1332 states have (on average 1.8063063063063063) internal successors, (2406), 1333 states have internal predecessors, (2406), 0 states have call successors, (0), 0 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-16 19:23:13,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 472 [2025-03-16 19:23:13,318 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:23:13,319 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:23:13,319 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:23:13,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:23:13,323 INFO L85 PathProgramCache]: Analyzing trace with hash -1288455551, now seen corresponding path program 1 times [2025-03-16 19:23:13,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:23:13,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28127477] [2025-03-16 19:23:13,329 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:23:13,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:23:13,441 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 471 statements into 1 equivalence classes. [2025-03-16 19:23:14,303 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 471 of 471 statements. [2025-03-16 19:23:14,304 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:23:14,304 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:23:15,615 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-16 19:23:15,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:23:15,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28127477] [2025-03-16 19:23:15,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [28127477] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:23:15,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:23:15,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:23:15,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494821997] [2025-03-16 19:23:15,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:23:15,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:23:15,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:23:15,644 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:23:15,645 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:23:15,650 INFO L87 Difference]: Start difference. First operand has 1334 states, 1332 states have (on average 1.8063063063063063) internal successors, (2406), 1333 states have internal predecessors, (2406), 0 states have call successors, (0), 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 117.75) internal successors, (471), 3 states have internal predecessors, (471), 0 states have call successors, (0), 0 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-16 19:23:16,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:23:16,006 INFO L93 Difference]: Finished difference Result 5175 states and 9336 transitions. [2025-03-16 19:23:16,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:23:16,008 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 117.75) internal successors, (471), 3 states have internal predecessors, (471), 0 states have call successors, (0), 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 471 [2025-03-16 19:23:16,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:23:16,039 INFO L225 Difference]: With dead ends: 5175 [2025-03-16 19:23:16,039 INFO L226 Difference]: Without dead ends: 3910 [2025-03-16 19:23:16,046 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:23:16,051 INFO L435 NwaCegarLoop]: 3697 mSDtfsCounter, 5393 mSDsluCounter, 4600 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5393 SdHoareTripleChecker+Valid, 8297 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:23:16,052 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5393 Valid, 8297 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 19:23:16,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3910 states. [2025-03-16 19:23:16,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3910 to 2629. [2025-03-16 19:23:16,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2629 states, 2628 states have (on average 1.64117199391172) internal successors, (4313), 2628 states have internal predecessors, (4313), 0 states have call successors, (0), 0 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-16 19:23:16,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2629 states to 2629 states and 4313 transitions. [2025-03-16 19:23:16,200 INFO L78 Accepts]: Start accepts. Automaton has 2629 states and 4313 transitions. Word has length 471 [2025-03-16 19:23:16,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:23:16,201 INFO L471 AbstractCegarLoop]: Abstraction has 2629 states and 4313 transitions. [2025-03-16 19:23:16,202 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 117.75) internal successors, (471), 3 states have internal predecessors, (471), 0 states have call successors, (0), 0 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-16 19:23:16,202 INFO L276 IsEmpty]: Start isEmpty. Operand 2629 states and 4313 transitions. [2025-03-16 19:23:16,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 474 [2025-03-16 19:23:16,213 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:23:16,213 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:23:16,213 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 19:23:16,213 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:23:16,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:23:16,215 INFO L85 PathProgramCache]: Analyzing trace with hash 1977678813, now seen corresponding path program 1 times [2025-03-16 19:23:16,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:23:16,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565974105] [2025-03-16 19:23:16,216 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:23:16,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:23:16,262 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 473 statements into 1 equivalence classes. [2025-03-16 19:23:16,314 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 473 of 473 statements. [2025-03-16 19:23:16,314 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:23:16,314 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:23:16,593 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-16 19:23:16,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:23:16,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565974105] [2025-03-16 19:23:16,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [565974105] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:23:16,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:23:16,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:23:16,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746182315] [2025-03-16 19:23:16,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:23:16,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:23:16,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:23:16,597 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:23:16,597 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:23:16,597 INFO L87 Difference]: Start difference. First operand 2629 states and 4313 transitions. Second operand has 3 states, 3 states have (on average 157.66666666666666) internal successors, (473), 3 states have internal predecessors, (473), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:23:16,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:23:16,735 INFO L93 Difference]: Finished difference Result 7627 states and 12466 transitions. [2025-03-16 19:23:16,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:23:16,736 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 157.66666666666666) internal successors, (473), 3 states have internal predecessors, (473), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 473 [2025-03-16 19:23:16,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:23:16,759 INFO L225 Difference]: With dead ends: 7627 [2025-03-16 19:23:16,759 INFO L226 Difference]: Without dead ends: 5207 [2025-03-16 19:23:16,768 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-16 19:23:16,769 INFO L435 NwaCegarLoop]: 4224 mSDtfsCounter, 1949 mSDsluCounter, 2125 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1949 SdHoareTripleChecker+Valid, 6349 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:23:16,769 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1949 Valid, 6349 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:23:16,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5207 states. [2025-03-16 19:23:16,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5207 to 5205. [2025-03-16 19:23:16,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5205 states, 5204 states have (on average 1.6350883935434282) internal successors, (8509), 5204 states have internal predecessors, (8509), 0 states have call successors, (0), 0 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-16 19:23:16,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5205 states to 5205 states and 8509 transitions. [2025-03-16 19:23:16,898 INFO L78 Accepts]: Start accepts. Automaton has 5205 states and 8509 transitions. Word has length 473 [2025-03-16 19:23:16,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:23:16,899 INFO L471 AbstractCegarLoop]: Abstraction has 5205 states and 8509 transitions. [2025-03-16 19:23:16,899 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 157.66666666666666) internal successors, (473), 3 states have internal predecessors, (473), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:23:16,899 INFO L276 IsEmpty]: Start isEmpty. Operand 5205 states and 8509 transitions. [2025-03-16 19:23:16,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 475 [2025-03-16 19:23:16,911 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:23:16,911 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:23:16,912 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 19:23:16,912 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:23:16,913 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:23:16,913 INFO L85 PathProgramCache]: Analyzing trace with hash -2013319955, now seen corresponding path program 1 times [2025-03-16 19:23:16,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:23:16,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79893286] [2025-03-16 19:23:16,913 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:23:16,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:23:16,959 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 474 statements into 1 equivalence classes. [2025-03-16 19:23:16,973 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 474 of 474 statements. [2025-03-16 19:23:16,973 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:23:16,973 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:23:17,148 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-16 19:23:17,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:23:17,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79893286] [2025-03-16 19:23:17,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [79893286] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:23:17,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:23:17,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:23:17,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475380653] [2025-03-16 19:23:17,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:23:17,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:23:17,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:23:17,150 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:23:17,150 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:23:17,150 INFO L87 Difference]: Start difference. First operand 5205 states and 8509 transitions. Second operand has 3 states, 3 states have (on average 158.0) internal successors, (474), 3 states have internal predecessors, (474), 0 states have call successors, (0), 0 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-16 19:23:17,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:23:17,363 INFO L93 Difference]: Finished difference Result 15520 states and 25348 transitions. [2025-03-16 19:23:17,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:23:17,364 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 158.0) internal successors, (474), 3 states have internal predecessors, (474), 0 states have call successors, (0), 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 474 [2025-03-16 19:23:17,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:23:17,399 INFO L225 Difference]: With dead ends: 15520 [2025-03-16 19:23:17,399 INFO L226 Difference]: Without dead ends: 10362 [2025-03-16 19:23:17,407 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-16 19:23:17,409 INFO L435 NwaCegarLoop]: 4339 mSDtfsCounter, 2168 mSDsluCounter, 2171 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2168 SdHoareTripleChecker+Valid, 6510 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:23:17,409 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2168 Valid, 6510 Invalid, 14 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [4 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:23:17,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10362 states. [2025-03-16 19:23:17,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10362 to 5252. [2025-03-16 19:23:17,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5252 states, 5251 states have (on average 1.635117120548467) internal successors, (8586), 5251 states have internal predecessors, (8586), 0 states have call successors, (0), 0 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-16 19:23:17,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5252 states to 5252 states and 8586 transitions. [2025-03-16 19:23:17,559 INFO L78 Accepts]: Start accepts. Automaton has 5252 states and 8586 transitions. Word has length 474 [2025-03-16 19:23:17,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:23:17,559 INFO L471 AbstractCegarLoop]: Abstraction has 5252 states and 8586 transitions. [2025-03-16 19:23:17,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 158.0) internal successors, (474), 3 states have internal predecessors, (474), 0 states have call successors, (0), 0 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-16 19:23:17,559 INFO L276 IsEmpty]: Start isEmpty. Operand 5252 states and 8586 transitions. [2025-03-16 19:23:17,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 476 [2025-03-16 19:23:17,571 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:23:17,571 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:23:17,571 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 19:23:17,571 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:23:17,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:23:17,572 INFO L85 PathProgramCache]: Analyzing trace with hash -1376318151, now seen corresponding path program 1 times [2025-03-16 19:23:17,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:23:17,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451693971] [2025-03-16 19:23:17,573 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:23:17,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:23:17,606 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 475 statements into 1 equivalence classes. [2025-03-16 19:23:17,636 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 475 of 475 statements. [2025-03-16 19:23:17,637 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:23:17,637 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:23:17,924 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-16 19:23:17,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:23:17,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451693971] [2025-03-16 19:23:17,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1451693971] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:23:17,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:23:17,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:23:17,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663287018] [2025-03-16 19:23:17,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:23:17,925 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:23:17,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:23:17,926 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:23:17,926 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:23:17,927 INFO L87 Difference]: Start difference. First operand 5252 states and 8586 transitions. Second operand has 3 states, 3 states have (on average 158.33333333333334) internal successors, (475), 3 states have internal predecessors, (475), 0 states have call successors, (0), 0 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-16 19:23:18,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:23:18,145 INFO L93 Difference]: Finished difference Result 15107 states and 24586 transitions. [2025-03-16 19:23:18,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:23:18,146 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 158.33333333333334) internal successors, (475), 3 states have internal predecessors, (475), 0 states have call successors, (0), 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 475 [2025-03-16 19:23:18,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:23:18,179 INFO L225 Difference]: With dead ends: 15107 [2025-03-16 19:23:18,180 INFO L226 Difference]: Without dead ends: 10249 [2025-03-16 19:23:18,189 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-16 19:23:18,190 INFO L435 NwaCegarLoop]: 4305 mSDtfsCounter, 1941 mSDsluCounter, 2125 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1941 SdHoareTripleChecker+Valid, 6430 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:23:18,190 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1941 Valid, 6430 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:23:18,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10249 states. [2025-03-16 19:23:18,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10249 to 10247. [2025-03-16 19:23:18,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10247 states, 10246 states have (on average 1.6259027913332031) internal successors, (16659), 10246 states have internal predecessors, (16659), 0 states have call successors, (0), 0 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-16 19:23:18,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10247 states to 10247 states and 16659 transitions. [2025-03-16 19:23:18,428 INFO L78 Accepts]: Start accepts. Automaton has 10247 states and 16659 transitions. Word has length 475 [2025-03-16 19:23:18,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:23:18,428 INFO L471 AbstractCegarLoop]: Abstraction has 10247 states and 16659 transitions. [2025-03-16 19:23:18,429 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 158.33333333333334) internal successors, (475), 3 states have internal predecessors, (475), 0 states have call successors, (0), 0 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-16 19:23:18,429 INFO L276 IsEmpty]: Start isEmpty. Operand 10247 states and 16659 transitions. [2025-03-16 19:23:18,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 476 [2025-03-16 19:23:18,451 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:23:18,451 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:23:18,451 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 19:23:18,451 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:23:18,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:23:18,452 INFO L85 PathProgramCache]: Analyzing trace with hash 367369780, now seen corresponding path program 1 times [2025-03-16 19:23:18,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:23:18,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438295509] [2025-03-16 19:23:18,453 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:23:18,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:23:18,505 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 475 statements into 1 equivalence classes. [2025-03-16 19:23:18,518 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 475 of 475 statements. [2025-03-16 19:23:18,518 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:23:18,518 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:23:18,641 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-16 19:23:18,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:23:18,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438295509] [2025-03-16 19:23:18,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [438295509] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:23:18,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:23:18,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:23:18,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271857772] [2025-03-16 19:23:18,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:23:18,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:23:18,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:23:18,642 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:23:18,642 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:23:18,643 INFO L87 Difference]: Start difference. First operand 10247 states and 16659 transitions. Second operand has 3 states, 3 states have (on average 158.33333333333334) internal successors, (475), 3 states have internal predecessors, (475), 0 states have call successors, (0), 0 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-16 19:23:18,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:23:18,818 INFO L93 Difference]: Finished difference Result 30495 states and 49528 transitions. [2025-03-16 19:23:18,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:23:18,819 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 158.33333333333334) internal successors, (475), 3 states have internal predecessors, (475), 0 states have call successors, (0), 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 475 [2025-03-16 19:23:18,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:23:18,859 INFO L225 Difference]: With dead ends: 30495 [2025-03-16 19:23:18,859 INFO L226 Difference]: Without dead ends: 20387 [2025-03-16 19:23:18,878 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-16 19:23:18,880 INFO L435 NwaCegarLoop]: 4343 mSDtfsCounter, 2167 mSDsluCounter, 2171 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2167 SdHoareTripleChecker+Valid, 6514 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:23:18,880 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2167 Valid, 6514 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:23:18,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20387 states. [2025-03-16 19:23:19,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20387 to 10345. [2025-03-16 19:23:19,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10345 states, 10344 states have (on average 1.6254833720030937) internal successors, (16814), 10344 states have internal predecessors, (16814), 0 states have call successors, (0), 0 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-16 19:23:19,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10345 states to 10345 states and 16814 transitions. [2025-03-16 19:23:19,200 INFO L78 Accepts]: Start accepts. Automaton has 10345 states and 16814 transitions. Word has length 475 [2025-03-16 19:23:19,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:23:19,201 INFO L471 AbstractCegarLoop]: Abstraction has 10345 states and 16814 transitions. [2025-03-16 19:23:19,201 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 158.33333333333334) internal successors, (475), 3 states have internal predecessors, (475), 0 states have call successors, (0), 0 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-16 19:23:19,201 INFO L276 IsEmpty]: Start isEmpty. Operand 10345 states and 16814 transitions. [2025-03-16 19:23:19,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2025-03-16 19:23:19,217 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:23:19,217 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:23:19,217 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 19:23:19,217 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:23:19,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:23:19,218 INFO L85 PathProgramCache]: Analyzing trace with hash -360830232, now seen corresponding path program 1 times [2025-03-16 19:23:19,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:23:19,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373509973] [2025-03-16 19:23:19,218 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:23:19,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:23:19,248 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 476 statements into 1 equivalence classes. [2025-03-16 19:23:19,255 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 476 of 476 statements. [2025-03-16 19:23:19,256 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:23:19,256 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:23:19,359 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-16 19:23:19,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:23:19,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373509973] [2025-03-16 19:23:19,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [373509973] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:23:19,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:23:19,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:23:19,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228146457] [2025-03-16 19:23:19,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:23:19,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:23:19,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:23:19,365 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:23:19,365 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:23:19,366 INFO L87 Difference]: Start difference. First operand 10345 states and 16814 transitions. Second operand has 3 states, 3 states have (on average 158.66666666666666) internal successors, (476), 3 states have internal predecessors, (476), 0 states have call successors, (0), 0 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-16 19:23:19,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:23:19,485 INFO L93 Difference]: Finished difference Result 20588 states and 33422 transitions. [2025-03-16 19:23:19,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:23:19,486 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 158.66666666666666) internal successors, (476), 3 states have internal predecessors, (476), 0 states have call successors, (0), 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 476 [2025-03-16 19:23:19,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:23:19,504 INFO L225 Difference]: With dead ends: 20588 [2025-03-16 19:23:19,505 INFO L226 Difference]: Without dead ends: 10462 [2025-03-16 19:23:19,517 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-16 19:23:19,518 INFO L435 NwaCegarLoop]: 2215 mSDtfsCounter, 18 mSDsluCounter, 2183 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 4398 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:23:19,518 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 4398 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:23:19,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10462 states. [2025-03-16 19:23:19,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10462 to 10462. [2025-03-16 19:23:19,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10462 states, 10461 states have (on average 1.6215466972564765) internal successors, (16963), 10461 states have internal predecessors, (16963), 0 states have call successors, (0), 0 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-16 19:23:19,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10462 states to 10462 states and 16963 transitions. [2025-03-16 19:23:19,734 INFO L78 Accepts]: Start accepts. Automaton has 10462 states and 16963 transitions. Word has length 476 [2025-03-16 19:23:19,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:23:19,735 INFO L471 AbstractCegarLoop]: Abstraction has 10462 states and 16963 transitions. [2025-03-16 19:23:19,735 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 158.66666666666666) internal successors, (476), 3 states have internal predecessors, (476), 0 states have call successors, (0), 0 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-16 19:23:19,735 INFO L276 IsEmpty]: Start isEmpty. Operand 10462 states and 16963 transitions. [2025-03-16 19:23:19,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 478 [2025-03-16 19:23:19,751 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:23:19,751 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:23:19,752 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 19:23:19,752 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:23:19,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:23:19,752 INFO L85 PathProgramCache]: Analyzing trace with hash 1783222230, now seen corresponding path program 1 times [2025-03-16 19:23:19,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:23:19,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225644430] [2025-03-16 19:23:19,753 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:23:19,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:23:19,784 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 477 statements into 1 equivalence classes. [2025-03-16 19:23:19,810 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 477 of 477 statements. [2025-03-16 19:23:19,810 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:23:19,810 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:23:19,976 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-16 19:23:19,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:23:19,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225644430] [2025-03-16 19:23:19,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1225644430] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:23:19,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:23:19,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:23:19,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683185073] [2025-03-16 19:23:19,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:23:19,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:23:19,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:23:19,977 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:23:19,977 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:23:19,978 INFO L87 Difference]: Start difference. First operand 10462 states and 16963 transitions. Second operand has 3 states, 3 states have (on average 159.0) internal successors, (477), 3 states have internal predecessors, (477), 0 states have call successors, (0), 0 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-16 19:23:20,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:23:20,140 INFO L93 Difference]: Finished difference Result 29713 states and 48015 transitions. [2025-03-16 19:23:20,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:23:20,141 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 159.0) internal successors, (477), 3 states have internal predecessors, (477), 0 states have call successors, (0), 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 477 [2025-03-16 19:23:20,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:23:20,175 INFO L225 Difference]: With dead ends: 29713 [2025-03-16 19:23:20,175 INFO L226 Difference]: Without dead ends: 20215 [2025-03-16 19:23:20,192 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-16 19:23:20,192 INFO L435 NwaCegarLoop]: 4305 mSDtfsCounter, 1934 mSDsluCounter, 2125 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1934 SdHoareTripleChecker+Valid, 6430 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:23:20,192 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1934 Valid, 6430 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:23:20,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20215 states. [2025-03-16 19:23:20,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20215 to 20213. [2025-03-16 19:23:20,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20213 states, 20212 states have (on average 1.6131506036018206) internal successors, (32605), 20212 states have internal predecessors, (32605), 0 states have call successors, (0), 0 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-16 19:23:20,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20213 states to 20213 states and 32605 transitions. [2025-03-16 19:23:20,538 INFO L78 Accepts]: Start accepts. Automaton has 20213 states and 32605 transitions. Word has length 477 [2025-03-16 19:23:20,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:23:20,539 INFO L471 AbstractCegarLoop]: Abstraction has 20213 states and 32605 transitions. [2025-03-16 19:23:20,539 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 159.0) internal successors, (477), 3 states have internal predecessors, (477), 0 states have call successors, (0), 0 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-16 19:23:20,539 INFO L276 IsEmpty]: Start isEmpty. Operand 20213 states and 32605 transitions. [2025-03-16 19:23:20,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 478 [2025-03-16 19:23:20,570 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:23:20,570 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:23:20,570 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 19:23:20,570 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:23:20,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:23:20,571 INFO L85 PathProgramCache]: Analyzing trace with hash -1604930284, now seen corresponding path program 1 times [2025-03-16 19:23:20,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:23:20,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993213404] [2025-03-16 19:23:20,571 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:23:20,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:23:20,607 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 477 statements into 1 equivalence classes. [2025-03-16 19:23:20,870 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 477 of 477 statements. [2025-03-16 19:23:20,870 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:23:20,870 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:23:21,835 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-16 19:23:21,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:23:21,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993213404] [2025-03-16 19:23:21,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1993213404] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:23:21,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:23:21,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:23:21,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126123791] [2025-03-16 19:23:21,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:23:21,836 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:23:21,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:23:21,837 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:23:21,837 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:23:21,837 INFO L87 Difference]: Start difference. First operand 20213 states and 32605 transitions. Second operand has 4 states, 4 states have (on average 119.25) internal successors, (477), 4 states have internal predecessors, (477), 0 states have call successors, (0), 0 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-16 19:23:22,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:23:22,015 INFO L93 Difference]: Finished difference Result 56998 states and 91371 transitions. [2025-03-16 19:23:22,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:23:22,016 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 119.25) internal successors, (477), 4 states have internal predecessors, (477), 0 states have call successors, (0), 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 477 [2025-03-16 19:23:22,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:23:22,147 INFO L225 Difference]: With dead ends: 56998 [2025-03-16 19:23:22,148 INFO L226 Difference]: Without dead ends: 39060 [2025-03-16 19:23:22,161 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-16 19:23:22,161 INFO L435 NwaCegarLoop]: 3716 mSDtfsCounter, 2119 mSDsluCounter, 5890 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2119 SdHoareTripleChecker+Valid, 9606 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:23:22,161 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2119 Valid, 9606 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:23:22,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39060 states. [2025-03-16 19:23:22,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39060 to 21506. [2025-03-16 19:23:22,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21506 states, 21505 states have (on average 1.6223668914205998) internal successors, (34889), 21505 states have internal predecessors, (34889), 0 states have call successors, (0), 0 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-16 19:23:22,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21506 states to 21506 states and 34889 transitions. [2025-03-16 19:23:22,474 INFO L78 Accepts]: Start accepts. Automaton has 21506 states and 34889 transitions. Word has length 477 [2025-03-16 19:23:22,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:23:22,475 INFO L471 AbstractCegarLoop]: Abstraction has 21506 states and 34889 transitions. [2025-03-16 19:23:22,475 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 119.25) internal successors, (477), 4 states have internal predecessors, (477), 0 states have call successors, (0), 0 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-16 19:23:22,475 INFO L276 IsEmpty]: Start isEmpty. Operand 21506 states and 34889 transitions. [2025-03-16 19:23:22,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 481 [2025-03-16 19:23:22,506 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:23:22,506 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:23:22,506 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 19:23:22,506 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:23:22,507 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:23:22,507 INFO L85 PathProgramCache]: Analyzing trace with hash -136588187, now seen corresponding path program 1 times [2025-03-16 19:23:22,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:23:22,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925268923] [2025-03-16 19:23:22,507 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:23:22,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:23:22,540 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 480 statements into 1 equivalence classes. [2025-03-16 19:23:22,552 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 480 of 480 statements. [2025-03-16 19:23:22,552 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:23:22,552 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:23:22,645 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-16 19:23:22,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:23:22,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925268923] [2025-03-16 19:23:22,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [925268923] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:23:22,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:23:22,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:23:22,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925883190] [2025-03-16 19:23:22,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:23:22,647 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:23:22,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:23:22,647 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:23:22,647 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:23:22,647 INFO L87 Difference]: Start difference. First operand 21506 states and 34889 transitions. Second operand has 3 states, 3 states have (on average 160.0) internal successors, (480), 3 states have internal predecessors, (480), 0 states have call successors, (0), 0 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-16 19:23:22,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:23:22,821 INFO L93 Difference]: Finished difference Result 57465 states and 92054 transitions. [2025-03-16 19:23:22,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:23:22,822 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 160.0) internal successors, (480), 3 states have internal predecessors, (480), 0 states have call successors, (0), 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 480 [2025-03-16 19:23:22,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:23:22,877 INFO L225 Difference]: With dead ends: 57465 [2025-03-16 19:23:22,878 INFO L226 Difference]: Without dead ends: 39507 [2025-03-16 19:23:22,907 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-16 19:23:22,909 INFO L435 NwaCegarLoop]: 4039 mSDtfsCounter, 1868 mSDsluCounter, 2170 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1868 SdHoareTripleChecker+Valid, 6209 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:23:22,909 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1868 Valid, 6209 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:23:22,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39507 states. [2025-03-16 19:23:23,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39507 to 21953. [2025-03-16 19:23:23,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21953 states, 21952 states have (on average 1.6200801749271136) internal successors, (35564), 21952 states have internal predecessors, (35564), 0 states have call successors, (0), 0 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-16 19:23:23,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21953 states to 21953 states and 35564 transitions. [2025-03-16 19:23:23,399 INFO L78 Accepts]: Start accepts. Automaton has 21953 states and 35564 transitions. Word has length 480 [2025-03-16 19:23:23,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:23:23,400 INFO L471 AbstractCegarLoop]: Abstraction has 21953 states and 35564 transitions. [2025-03-16 19:23:23,400 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 160.0) internal successors, (480), 3 states have internal predecessors, (480), 0 states have call successors, (0), 0 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-16 19:23:23,400 INFO L276 IsEmpty]: Start isEmpty. Operand 21953 states and 35564 transitions. [2025-03-16 19:23:23,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 482 [2025-03-16 19:23:23,418 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:23:23,418 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:23:23,418 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 19:23:23,419 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:23:23,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:23:23,421 INFO L85 PathProgramCache]: Analyzing trace with hash -1387675065, now seen corresponding path program 1 times [2025-03-16 19:23:23,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:23:23,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401182767] [2025-03-16 19:23:23,421 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:23:23,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:23:23,458 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 481 statements into 1 equivalence classes. [2025-03-16 19:23:23,470 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 481 of 481 statements. [2025-03-16 19:23:23,470 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:23:23,470 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:23:23,571 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-16 19:23:23,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:23:23,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401182767] [2025-03-16 19:23:23,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1401182767] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:23:23,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:23:23,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:23:23,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933598972] [2025-03-16 19:23:23,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:23:23,572 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:23:23,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:23:23,572 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:23:23,572 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:23:23,573 INFO L87 Difference]: Start difference. First operand 21953 states and 35564 transitions. Second operand has 3 states, 3 states have (on average 160.33333333333334) internal successors, (481), 3 states have internal predecessors, (481), 0 states have call successors, (0), 0 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-16 19:23:23,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:23:23,718 INFO L93 Difference]: Finished difference Result 58226 states and 93167 transitions. [2025-03-16 19:23:23,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:23:23,718 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 160.33333333333334) internal successors, (481), 3 states have internal predecessors, (481), 0 states have call successors, (0), 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 481 [2025-03-16 19:23:23,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:23:23,776 INFO L225 Difference]: With dead ends: 58226 [2025-03-16 19:23:23,776 INFO L226 Difference]: Without dead ends: 40154 [2025-03-16 19:23:23,798 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-16 19:23:23,799 INFO L435 NwaCegarLoop]: 4043 mSDtfsCounter, 1867 mSDsluCounter, 2170 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1867 SdHoareTripleChecker+Valid, 6213 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:23:23,799 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1867 Valid, 6213 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:23:23,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40154 states. [2025-03-16 19:23:24,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40154 to 22600. [2025-03-16 19:23:24,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22600 states, 22599 states have (on average 1.6152927120669056) internal successors, (36504), 22599 states have internal predecessors, (36504), 0 states have call successors, (0), 0 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-16 19:23:24,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22600 states to 22600 states and 36504 transitions. [2025-03-16 19:23:24,098 INFO L78 Accepts]: Start accepts. Automaton has 22600 states and 36504 transitions. Word has length 481 [2025-03-16 19:23:24,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:23:24,098 INFO L471 AbstractCegarLoop]: Abstraction has 22600 states and 36504 transitions. [2025-03-16 19:23:24,098 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 160.33333333333334) internal successors, (481), 3 states have internal predecessors, (481), 0 states have call successors, (0), 0 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-16 19:23:24,098 INFO L276 IsEmpty]: Start isEmpty. Operand 22600 states and 36504 transitions. [2025-03-16 19:23:24,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 483 [2025-03-16 19:23:24,115 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:23:24,116 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:23:24,116 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 19:23:24,116 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:23:24,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:23:24,117 INFO L85 PathProgramCache]: Analyzing trace with hash -336104411, now seen corresponding path program 1 times [2025-03-16 19:23:24,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:23:24,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862762482] [2025-03-16 19:23:24,117 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:23:24,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:23:24,147 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 482 statements into 1 equivalence classes. [2025-03-16 19:23:24,157 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 482 of 482 statements. [2025-03-16 19:23:24,157 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:23:24,158 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:23:24,331 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-16 19:23:24,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:23:24,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862762482] [2025-03-16 19:23:24,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [862762482] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:23:24,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:23:24,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:23:24,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251366829] [2025-03-16 19:23:24,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:23:24,333 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:23:24,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:23:24,333 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:23:24,333 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:23:24,334 INFO L87 Difference]: Start difference. First operand 22600 states and 36504 transitions. Second operand has 3 states, 3 states have (on average 160.66666666666666) internal successors, (482), 3 states have internal predecessors, (482), 0 states have call successors, (0), 0 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-16 19:23:24,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:23:24,503 INFO L93 Difference]: Finished difference Result 41584 states and 66502 transitions. [2025-03-16 19:23:24,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:23:24,504 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 160.66666666666666) internal successors, (482), 3 states have internal predecessors, (482), 0 states have call successors, (0), 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 482 [2025-03-16 19:23:24,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:23:24,533 INFO L225 Difference]: With dead ends: 41584 [2025-03-16 19:23:24,533 INFO L226 Difference]: Without dead ends: 23454 [2025-03-16 19:23:24,551 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-16 19:23:24,552 INFO L435 NwaCegarLoop]: 2215 mSDtfsCounter, 18 mSDsluCounter, 2182 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 4397 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:23:24,552 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 4397 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:23:24,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23454 states. [2025-03-16 19:23:24,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23454 to 23454. [2025-03-16 19:23:24,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23454 states, 23453 states have (on average 1.60175670489916) internal successors, (37566), 23453 states have internal predecessors, (37566), 0 states have call successors, (0), 0 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-16 19:23:24,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23454 states to 23454 states and 37566 transitions. [2025-03-16 19:23:24,776 INFO L78 Accepts]: Start accepts. Automaton has 23454 states and 37566 transitions. Word has length 482 [2025-03-16 19:23:24,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:23:24,776 INFO L471 AbstractCegarLoop]: Abstraction has 23454 states and 37566 transitions. [2025-03-16 19:23:24,777 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 160.66666666666666) internal successors, (482), 3 states have internal predecessors, (482), 0 states have call successors, (0), 0 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-16 19:23:24,777 INFO L276 IsEmpty]: Start isEmpty. Operand 23454 states and 37566 transitions. [2025-03-16 19:23:24,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 484 [2025-03-16 19:23:24,795 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:23:24,795 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:23:24,795 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-16 19:23:24,795 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:23:24,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:23:24,796 INFO L85 PathProgramCache]: Analyzing trace with hash 808728757, now seen corresponding path program 1 times [2025-03-16 19:23:24,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:23:24,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038289190] [2025-03-16 19:23:24,796 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:23:24,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:23:24,826 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 483 statements into 1 equivalence classes. [2025-03-16 19:23:25,078 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 483 of 483 statements. [2025-03-16 19:23:25,079 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:23:25,079 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:23:27,933 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-16 19:23:27,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:23:27,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038289190] [2025-03-16 19:23:27,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2038289190] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:23:27,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:23:27,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-03-16 19:23:27,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358318776] [2025-03-16 19:23:27,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:23:27,935 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-16 19:23:27,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:23:27,936 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-16 19:23:27,936 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2025-03-16 19:23:27,937 INFO L87 Difference]: Start difference. First operand 23454 states and 37566 transitions. Second operand has 17 states, 17 states have (on average 28.41176470588235) internal successors, (483), 17 states have internal predecessors, (483), 0 states have call successors, (0), 0 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-16 19:23:30,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:23:30,261 INFO L93 Difference]: Finished difference Result 54287 states and 86441 transitions. [2025-03-16 19:23:30,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-16 19:23:30,261 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 28.41176470588235) internal successors, (483), 17 states have internal predecessors, (483), 0 states have call successors, (0), 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 483 [2025-03-16 19:23:30,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:23:30,324 INFO L225 Difference]: With dead ends: 54287 [2025-03-16 19:23:30,324 INFO L226 Difference]: Without dead ends: 52357 [2025-03-16 19:23:30,346 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=375, Invalid=957, Unknown=0, NotChecked=0, Total=1332 [2025-03-16 19:23:30,346 INFO L435 NwaCegarLoop]: 3076 mSDtfsCounter, 16841 mSDsluCounter, 29253 mSDsCounter, 0 mSdLazyCounter, 3130 mSolverCounterSat, 161 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16841 SdHoareTripleChecker+Valid, 32329 SdHoareTripleChecker+Invalid, 3291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 161 IncrementalHoareTripleChecker+Valid, 3130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-16 19:23:30,346 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16841 Valid, 32329 Invalid, 3291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [161 Valid, 3130 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-16 19:23:30,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52357 states. [2025-03-16 19:23:30,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52357 to 31074. [2025-03-16 19:23:30,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31074 states, 31073 states have (on average 1.5920574131882985) internal successors, (49470), 31073 states have internal predecessors, (49470), 0 states have call successors, (0), 0 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-16 19:23:30,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31074 states to 31074 states and 49470 transitions. [2025-03-16 19:23:30,767 INFO L78 Accepts]: Start accepts. Automaton has 31074 states and 49470 transitions. Word has length 483 [2025-03-16 19:23:30,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:23:30,768 INFO L471 AbstractCegarLoop]: Abstraction has 31074 states and 49470 transitions. [2025-03-16 19:23:30,768 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 28.41176470588235) internal successors, (483), 17 states have internal predecessors, (483), 0 states have call successors, (0), 0 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-16 19:23:30,769 INFO L276 IsEmpty]: Start isEmpty. Operand 31074 states and 49470 transitions. [2025-03-16 19:23:30,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 484 [2025-03-16 19:23:30,793 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:23:30,793 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:23:30,794 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-16 19:23:30,794 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:23:30,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:23:30,794 INFO L85 PathProgramCache]: Analyzing trace with hash -220630541, now seen corresponding path program 1 times [2025-03-16 19:23:30,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:23:30,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153188875] [2025-03-16 19:23:30,795 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:23:30,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:23:30,823 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 483 statements into 1 equivalence classes. [2025-03-16 19:23:31,068 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 483 of 483 statements. [2025-03-16 19:23:31,069 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:23:31,069 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:23:32,520 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-16 19:23:32,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:23:32,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153188875] [2025-03-16 19:23:32,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1153188875] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:23:32,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:23:32,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-16 19:23:32,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146615171] [2025-03-16 19:23:32,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:23:32,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-16 19:23:32,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:23:32,523 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-16 19:23:32,523 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2025-03-16 19:23:32,523 INFO L87 Difference]: Start difference. First operand 31074 states and 49470 transitions. Second operand has 13 states, 13 states have (on average 37.15384615384615) internal successors, (483), 13 states have internal predecessors, (483), 0 states have call successors, (0), 0 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-16 19:23:34,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:23:34,002 INFO L93 Difference]: Finished difference Result 40742 states and 64567 transitions. [2025-03-16 19:23:34,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-16 19:23:34,003 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 37.15384615384615) internal successors, (483), 13 states have internal predecessors, (483), 0 states have call successors, (0), 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 483 [2025-03-16 19:23:34,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:23:34,045 INFO L225 Difference]: With dead ends: 40742 [2025-03-16 19:23:34,045 INFO L226 Difference]: Without dead ends: 35668 [2025-03-16 19:23:34,062 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=142, Invalid=508, Unknown=0, NotChecked=0, Total=650 [2025-03-16 19:23:34,063 INFO L435 NwaCegarLoop]: 2277 mSDtfsCounter, 11131 mSDsluCounter, 21657 mSDsCounter, 0 mSdLazyCounter, 2250 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11131 SdHoareTripleChecker+Valid, 23934 SdHoareTripleChecker+Invalid, 2373 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 2250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:23:34,063 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11131 Valid, 23934 Invalid, 2373 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 2250 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-16 19:23:34,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35668 states. [2025-03-16 19:23:34,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35668 to 26002. [2025-03-16 19:23:34,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26002 states, 26001 states have (on average 1.5892465674397138) internal successors, (41322), 26001 states have internal predecessors, (41322), 0 states have call successors, (0), 0 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-16 19:23:34,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26002 states to 26002 states and 41322 transitions. [2025-03-16 19:23:34,391 INFO L78 Accepts]: Start accepts. Automaton has 26002 states and 41322 transitions. Word has length 483 [2025-03-16 19:23:34,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:23:34,392 INFO L471 AbstractCegarLoop]: Abstraction has 26002 states and 41322 transitions. [2025-03-16 19:23:34,392 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 37.15384615384615) internal successors, (483), 13 states have internal predecessors, (483), 0 states have call successors, (0), 0 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-16 19:23:34,392 INFO L276 IsEmpty]: Start isEmpty. Operand 26002 states and 41322 transitions. [2025-03-16 19:23:34,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 484 [2025-03-16 19:23:34,413 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:23:34,413 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:23:34,414 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-16 19:23:34,414 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:23:34,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:23:34,415 INFO L85 PathProgramCache]: Analyzing trace with hash 1219339123, now seen corresponding path program 1 times [2025-03-16 19:23:34,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:23:34,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510000081] [2025-03-16 19:23:34,415 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:23:34,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:23:34,448 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 483 statements into 1 equivalence classes. [2025-03-16 19:23:34,828 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 483 of 483 statements. [2025-03-16 19:23:34,828 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:23:34,829 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:23:36,191 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-16 19:23:36,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:23:36,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510000081] [2025-03-16 19:23:36,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1510000081] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:23:36,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:23:36,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-16 19:23:36,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278061839] [2025-03-16 19:23:36,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:23:36,192 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-16 19:23:36,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:23:36,193 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-16 19:23:36,193 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2025-03-16 19:23:36,193 INFO L87 Difference]: Start difference. First operand 26002 states and 41322 transitions. Second operand has 13 states, 13 states have (on average 37.15384615384615) internal successors, (483), 13 states have internal predecessors, (483), 0 states have call successors, (0), 0 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-16 19:23:37,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:23:37,474 INFO L93 Difference]: Finished difference Result 38766 states and 61339 transitions. [2025-03-16 19:23:37,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-16 19:23:37,474 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 37.15384615384615) internal successors, (483), 13 states have internal predecessors, (483), 0 states have call successors, (0), 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 483 [2025-03-16 19:23:37,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:23:37,510 INFO L225 Difference]: With dead ends: 38766 [2025-03-16 19:23:37,510 INFO L226 Difference]: Without dead ends: 36836 [2025-03-16 19:23:37,521 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=142, Invalid=508, Unknown=0, NotChecked=0, Total=650 [2025-03-16 19:23:37,521 INFO L435 NwaCegarLoop]: 2277 mSDtfsCounter, 11048 mSDsluCounter, 21660 mSDsCounter, 0 mSdLazyCounter, 2256 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11048 SdHoareTripleChecker+Valid, 23937 SdHoareTripleChecker+Invalid, 2379 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 2256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:23:37,521 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11048 Valid, 23937 Invalid, 2379 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 2256 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-16 19:23:37,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36836 states. [2025-03-16 19:23:37,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36836 to 28662. [2025-03-16 19:23:37,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28662 states, 28661 states have (on average 1.5786608980845052) internal successors, (45246), 28661 states have internal predecessors, (45246), 0 states have call successors, (0), 0 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-16 19:23:37,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28662 states to 28662 states and 45246 transitions. [2025-03-16 19:23:37,817 INFO L78 Accepts]: Start accepts. Automaton has 28662 states and 45246 transitions. Word has length 483 [2025-03-16 19:23:37,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:23:37,818 INFO L471 AbstractCegarLoop]: Abstraction has 28662 states and 45246 transitions. [2025-03-16 19:23:37,818 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 37.15384615384615) internal successors, (483), 13 states have internal predecessors, (483), 0 states have call successors, (0), 0 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-16 19:23:37,818 INFO L276 IsEmpty]: Start isEmpty. Operand 28662 states and 45246 transitions. [2025-03-16 19:23:37,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 484 [2025-03-16 19:23:37,846 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:23:37,846 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:23:37,846 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-16 19:23:37,846 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:23:37,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:23:37,847 INFO L85 PathProgramCache]: Analyzing trace with hash 189979825, now seen corresponding path program 1 times [2025-03-16 19:23:37,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:23:37,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267914878] [2025-03-16 19:23:37,847 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:23:37,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:23:37,875 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 483 statements into 1 equivalence classes. [2025-03-16 19:23:38,092 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 483 of 483 statements. [2025-03-16 19:23:38,092 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:23:38,092 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:23:38,546 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-16 19:23:38,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:23:38,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267914878] [2025-03-16 19:23:38,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1267914878] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:23:38,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:23:38,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:23:38,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17955615] [2025-03-16 19:23:38,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:23:38,547 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:23:38,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:23:38,548 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:23:38,548 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:23:38,548 INFO L87 Difference]: Start difference. First operand 28662 states and 45246 transitions. Second operand has 4 states, 4 states have (on average 120.75) internal successors, (483), 3 states have internal predecessors, (483), 0 states have call successors, (0), 0 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-16 19:23:38,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:23:38,889 INFO L93 Difference]: Finished difference Result 139415 states and 219848 transitions. [2025-03-16 19:23:38,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:23:38,890 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 120.75) internal successors, (483), 3 states have internal predecessors, (483), 0 states have call successors, (0), 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 483 [2025-03-16 19:23:38,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:23:39,021 INFO L225 Difference]: With dead ends: 139415 [2025-03-16 19:23:39,021 INFO L226 Difference]: Without dead ends: 111011 [2025-03-16 19:23:39,077 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:23:39,077 INFO L435 NwaCegarLoop]: 3329 mSDtfsCounter, 6996 mSDsluCounter, 5385 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6996 SdHoareTripleChecker+Valid, 8714 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:23:39,077 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6996 Valid, 8714 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:23:39,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111011 states. [2025-03-16 19:23:39,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111011 to 55780. [2025-03-16 19:23:40,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55780 states, 55779 states have (on average 1.5701608132092724) internal successors, (87582), 55779 states have internal predecessors, (87582), 0 states have call successors, (0), 0 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-16 19:23:40,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55780 states to 55780 states and 87582 transitions. [2025-03-16 19:23:40,086 INFO L78 Accepts]: Start accepts. Automaton has 55780 states and 87582 transitions. Word has length 483 [2025-03-16 19:23:40,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:23:40,086 INFO L471 AbstractCegarLoop]: Abstraction has 55780 states and 87582 transitions. [2025-03-16 19:23:40,086 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 120.75) internal successors, (483), 3 states have internal predecessors, (483), 0 states have call successors, (0), 0 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-16 19:23:40,086 INFO L276 IsEmpty]: Start isEmpty. Operand 55780 states and 87582 transitions. [2025-03-16 19:23:40,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 486 [2025-03-16 19:23:40,164 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:23:40,165 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:23:40,165 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-16 19:23:40,165 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:23:40,165 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:23:40,166 INFO L85 PathProgramCache]: Analyzing trace with hash -93025139, now seen corresponding path program 1 times [2025-03-16 19:23:40,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:23:40,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470807712] [2025-03-16 19:23:40,166 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:23:40,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:23:40,202 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 485 statements into 1 equivalence classes. [2025-03-16 19:23:40,230 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 485 of 485 statements. [2025-03-16 19:23:40,230 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:23:40,230 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:23:40,400 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-16 19:23:40,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:23:40,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470807712] [2025-03-16 19:23:40,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1470807712] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:23:40,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:23:40,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:23:40,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510680145] [2025-03-16 19:23:40,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:23:40,403 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:23:40,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:23:40,404 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:23:40,404 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:23:40,404 INFO L87 Difference]: Start difference. First operand 55780 states and 87582 transitions. Second operand has 3 states, 3 states have (on average 161.66666666666666) internal successors, (485), 3 states have internal predecessors, (485), 0 states have call successors, (0), 0 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-16 19:23:40,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:23:40,776 INFO L93 Difference]: Finished difference Result 161158 states and 251952 transitions. [2025-03-16 19:23:40,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:23:40,777 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 161.66666666666666) internal successors, (485), 3 states have internal predecessors, (485), 0 states have call successors, (0), 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 485 [2025-03-16 19:23:40,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:23:40,927 INFO L225 Difference]: With dead ends: 161158 [2025-03-16 19:23:40,927 INFO L226 Difference]: Without dead ends: 108941 [2025-03-16 19:23:40,994 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-16 19:23:40,996 INFO L435 NwaCegarLoop]: 4242 mSDtfsCounter, 1932 mSDsluCounter, 2125 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1932 SdHoareTripleChecker+Valid, 6367 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:23:40,996 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1932 Valid, 6367 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:23:41,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108941 states. [2025-03-16 19:23:42,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108941 to 108939. [2025-03-16 19:23:42,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108939 states, 108938 states have (on average 1.5606399970625493) internal successors, (170013), 108938 states have internal predecessors, (170013), 0 states have call successors, (0), 0 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-16 19:23:42,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108939 states to 108939 states and 170013 transitions. [2025-03-16 19:23:42,713 INFO L78 Accepts]: Start accepts. Automaton has 108939 states and 170013 transitions. Word has length 485 [2025-03-16 19:23:42,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:23:42,714 INFO L471 AbstractCegarLoop]: Abstraction has 108939 states and 170013 transitions. [2025-03-16 19:23:42,714 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 161.66666666666666) internal successors, (485), 3 states have internal predecessors, (485), 0 states have call successors, (0), 0 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-16 19:23:42,714 INFO L276 IsEmpty]: Start isEmpty. Operand 108939 states and 170013 transitions. [2025-03-16 19:23:42,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 486 [2025-03-16 19:23:42,787 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:23:42,787 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:23:42,788 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-16 19:23:42,788 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:23:42,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:23:42,788 INFO L85 PathProgramCache]: Analyzing trace with hash 398622757, now seen corresponding path program 1 times [2025-03-16 19:23:42,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:23:42,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586343650] [2025-03-16 19:23:42,789 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:23:42,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:23:42,815 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 485 statements into 1 equivalence classes. [2025-03-16 19:23:42,834 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 485 of 485 statements. [2025-03-16 19:23:42,835 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:23:42,836 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:23:43,055 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-16 19:23:43,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:23:43,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586343650] [2025-03-16 19:23:43,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1586343650] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:23:43,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:23:43,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:23:43,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293263975] [2025-03-16 19:23:43,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:23:43,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:23:43,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:23:43,057 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:23:43,057 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:23:43,057 INFO L87 Difference]: Start difference. First operand 108939 states and 170013 transitions. Second operand has 3 states, 3 states have (on average 161.66666666666666) internal successors, (485), 3 states have internal predecessors, (485), 0 states have call successors, (0), 0 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-16 19:23:43,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:23:43,839 INFO L93 Difference]: Finished difference Result 319219 states and 497206 transitions. [2025-03-16 19:23:43,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:23:43,840 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 161.66666666666666) internal successors, (485), 3 states have internal predecessors, (485), 0 states have call successors, (0), 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 485 [2025-03-16 19:23:43,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:23:44,116 INFO L225 Difference]: With dead ends: 319219 [2025-03-16 19:23:44,116 INFO L226 Difference]: Without dead ends: 214289 [2025-03-16 19:23:44,202 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-16 19:23:44,202 INFO L435 NwaCegarLoop]: 4247 mSDtfsCounter, 1916 mSDsluCounter, 2125 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1916 SdHoareTripleChecker+Valid, 6372 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:23:44,202 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1916 Valid, 6372 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:23:44,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214289 states. [2025-03-16 19:23:46,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214289 to 214287. [2025-03-16 19:23:46,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214287 states, 214286 states have (on average 1.5535312619583175) internal successors, (332900), 214286 states have internal predecessors, (332900), 0 states have call successors, (0), 0 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-16 19:23:47,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214287 states to 214287 states and 332900 transitions. [2025-03-16 19:23:47,001 INFO L78 Accepts]: Start accepts. Automaton has 214287 states and 332900 transitions. Word has length 485 [2025-03-16 19:23:47,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:23:47,001 INFO L471 AbstractCegarLoop]: Abstraction has 214287 states and 332900 transitions. [2025-03-16 19:23:47,002 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 161.66666666666666) internal successors, (485), 3 states have internal predecessors, (485), 0 states have call successors, (0), 0 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-16 19:23:47,002 INFO L276 IsEmpty]: Start isEmpty. Operand 214287 states and 332900 transitions. [2025-03-16 19:23:47,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 488 [2025-03-16 19:23:47,209 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:23:47,209 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:23:47,210 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-16 19:23:47,210 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:23:47,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:23:47,210 INFO L85 PathProgramCache]: Analyzing trace with hash -2117088382, now seen corresponding path program 1 times [2025-03-16 19:23:47,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:23:47,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080263203] [2025-03-16 19:23:47,210 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:23:47,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:23:47,441 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 487 statements into 1 equivalence classes. [2025-03-16 19:23:47,459 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 487 of 487 statements. [2025-03-16 19:23:47,461 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:23:47,461 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:23:47,573 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-16 19:23:47,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:23:47,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080263203] [2025-03-16 19:23:47,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2080263203] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:23:47,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:23:47,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:23:47,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091212677] [2025-03-16 19:23:47,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:23:47,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:23:47,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:23:47,575 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:23:47,575 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:23:47,575 INFO L87 Difference]: Start difference. First operand 214287 states and 332900 transitions. Second operand has 3 states, 3 states have (on average 162.33333333333334) internal successors, (487), 3 states have internal predecessors, (487), 0 states have call successors, (0), 0 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-16 19:23:49,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:23:49,037 INFO L93 Difference]: Finished difference Result 623486 states and 965719 transitions. [2025-03-16 19:23:49,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:23:49,038 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 162.33333333333334) internal successors, (487), 3 states have internal predecessors, (487), 0 states have call successors, (0), 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 487 [2025-03-16 19:23:49,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:23:49,559 INFO L225 Difference]: With dead ends: 623486 [2025-03-16 19:23:49,559 INFO L226 Difference]: Without dead ends: 420870 [2025-03-16 19:23:49,686 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-16 19:23:49,687 INFO L435 NwaCegarLoop]: 4284 mSDtfsCounter, 1908 mSDsluCounter, 2125 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1908 SdHoareTripleChecker+Valid, 6409 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:23:49,687 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1908 Valid, 6409 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:23:50,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420870 states. [2025-03-16 19:23:53,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420870 to 420868. [2025-03-16 19:23:54,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 420868 states, 420867 states have (on average 1.5454074565123899) internal successors, (650411), 420867 states have internal predecessors, (650411), 0 states have call successors, (0), 0 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-16 19:23:55,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420868 states to 420868 states and 650411 transitions. [2025-03-16 19:23:55,290 INFO L78 Accepts]: Start accepts. Automaton has 420868 states and 650411 transitions. Word has length 487 [2025-03-16 19:23:55,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:23:55,291 INFO L471 AbstractCegarLoop]: Abstraction has 420868 states and 650411 transitions. [2025-03-16 19:23:55,291 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 162.33333333333334) internal successors, (487), 3 states have internal predecessors, (487), 0 states have call successors, (0), 0 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-16 19:23:55,291 INFO L276 IsEmpty]: Start isEmpty. Operand 420868 states and 650411 transitions. [2025-03-16 19:23:56,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 488 [2025-03-16 19:23:56,056 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:23:56,056 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 19:23:56,056 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-16 19:23:56,056 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:23:56,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:23:56,057 INFO L85 PathProgramCache]: Analyzing trace with hash 1884021184, now seen corresponding path program 1 times [2025-03-16 19:23:56,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:23:56,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789690471] [2025-03-16 19:23:56,057 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:23:56,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:23:56,107 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 487 statements into 1 equivalence classes. [2025-03-16 19:23:56,259 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 487 of 487 statements. [2025-03-16 19:23:56,259 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:23:56,259 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:23:57,060 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-16 19:23:57,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:23:57,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789690471] [2025-03-16 19:23:57,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [789690471] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:23:57,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:23:57,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:23:57,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525003978] [2025-03-16 19:23:57,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:23:57,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:23:57,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:23:57,062 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:23:57,062 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:23:57,062 INFO L87 Difference]: Start difference. First operand 420868 states and 650411 transitions. Second operand has 4 states, 4 states have (on average 121.75) internal successors, (487), 4 states have internal predecessors, (487), 0 states have call successors, (0), 0 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-16 19:24:00,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:24:00,077 INFO L93 Difference]: Finished difference Result 1090632 states and 1667299 transitions. [2025-03-16 19:24:00,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:24:00,078 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 121.75) internal successors, (487), 4 states have internal predecessors, (487), 0 states have call successors, (0), 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 487 [2025-03-16 19:24:00,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:24:01,459 INFO L225 Difference]: With dead ends: 1090632 [2025-03-16 19:24:01,459 INFO L226 Difference]: Without dead ends: 776134 [2025-03-16 19:24:01,586 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-16 19:24:01,586 INFO L435 NwaCegarLoop]: 4019 mSDtfsCounter, 1819 mSDsluCounter, 6193 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1819 SdHoareTripleChecker+Valid, 10212 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:24:01,586 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1819 Valid, 10212 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:24:01,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 776134 states. [2025-03-16 19:24:07,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 776134 to 467780. [2025-03-16 19:24:07,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 467780 states, 467779 states have (on average 1.5593709850164288) internal successors, (729441), 467779 states have internal predecessors, (729441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)