./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+cfa-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+cfa-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 a9066ec9ee7e14c7adf63eb106d945f26321fdd64b3726b0fe14ce5b202a77d4 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 19:23:04,005 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 19:23:04,060 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:04,063 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 19:23:04,064 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 19:23:04,088 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 19:23:04,089 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 19:23:04,089 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 19:23:04,089 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 19:23:04,089 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 19:23:04,089 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 19:23:04,089 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 19:23:04,090 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 19:23:04,090 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 19:23:04,090 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 19:23:04,090 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 19:23:04,090 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 19:23:04,091 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 19:23:04,091 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 19:23:04,091 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 19:23:04,091 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 19:23:04,091 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 19:23:04,091 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 19:23:04,091 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 19:23:04,091 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 19:23:04,091 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 19:23:04,091 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 19:23:04,091 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 19:23:04,091 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 19:23:04,091 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 19:23:04,091 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 19:23:04,091 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 19:23:04,091 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 19:23:04,092 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 19:23:04,092 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 19:23:04,092 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 19:23:04,092 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 19:23:04,092 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 19:23:04,092 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 19:23:04,092 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 19:23:04,092 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 19:23:04,092 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 19:23:04,092 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 19:23:04,092 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 -> a9066ec9ee7e14c7adf63eb106d945f26321fdd64b3726b0fe14ce5b202a77d4 [2025-03-16 19:23:04,316 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 19:23:04,321 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 19:23:04,322 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 19:23:04,323 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 19:23:04,323 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 19:23:04,324 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+cfa-reducer.c [2025-03-16 19:23:05,492 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5852972cc/0fed717641ea47cbbad545b77dad0eb4/FLAGf924391bc [2025-03-16 19:23:05,841 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 19:23:05,843 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.5.2.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2025-03-16 19:23:05,858 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5852972cc/0fed717641ea47cbbad545b77dad0eb4/FLAGf924391bc [2025-03-16 19:23:05,870 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5852972cc/0fed717641ea47cbbad545b77dad0eb4 [2025-03-16 19:23:05,872 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 19:23:05,874 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 19:23:05,875 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 19:23:05,875 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 19:23:05,879 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 19:23:05,879 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 07:23:05" (1/1) ... [2025-03-16 19:23:05,882 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3cbbac62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:23:05, skipping insertion in model container [2025-03-16 19:23:05,882 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 07:23:05" (1/1) ... [2025-03-16 19:23:05,938 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 19:23:06,175 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+cfa-reducer.c[21939,21952] [2025-03-16 19:23:06,254 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 19:23:06,270 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 19:23:06,339 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+cfa-reducer.c[21939,21952] [2025-03-16 19:23:06,391 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 19:23:06,406 INFO L204 MainTranslator]: Completed translation [2025-03-16 19:23:06,407 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:23:06 WrapperNode [2025-03-16 19:23:06,407 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 19:23:06,408 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 19:23:06,408 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 19:23:06,408 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 19:23:06,412 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:06" (1/1) ... [2025-03-16 19:23:06,434 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:06" (1/1) ... [2025-03-16 19:23:06,503 INFO L138 Inliner]: procedures = 25, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 2883 [2025-03-16 19:23:06,503 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 19:23:06,504 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 19:23:06,504 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 19:23:06,505 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 19:23:06,511 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:06" (1/1) ... [2025-03-16 19:23:06,512 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:06" (1/1) ... [2025-03-16 19:23:06,522 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:06" (1/1) ... [2025-03-16 19:23:06,554 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:06,554 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:06" (1/1) ... [2025-03-16 19:23:06,554 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:06" (1/1) ... [2025-03-16 19:23:06,586 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:06" (1/1) ... [2025-03-16 19:23:06,593 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:06" (1/1) ... [2025-03-16 19:23:06,601 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:06" (1/1) ... [2025-03-16 19:23:06,610 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:06" (1/1) ... [2025-03-16 19:23:06,621 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 19:23:06,623 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 19:23:06,623 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 19:23:06,624 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 19:23:06,624 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:23:06" (1/1) ... [2025-03-16 19:23:06,628 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 19:23:06,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:23:06,652 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:06,658 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:06,675 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 19:23:06,675 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 19:23:06,676 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 19:23:06,676 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 19:23:06,843 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 19:23:06,845 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 19:23:08,491 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1160: havoc main_~__tmp_1~0#1, main_~assert__arg~0#1;havoc main_~check__tmp~0#1; [2025-03-16 19:23:08,492 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1360: havoc main_~node5____CPAchecker_TMP_3~0#1;havoc main_~node5____CPAchecker_TMP_2~0#1;havoc main_~node5____CPAchecker_TMP_1~0#1;havoc main_~node5____CPAchecker_TMP_0~0#1; [2025-03-16 19:23:08,492 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L2088: havoc main_~node1____CPAchecker_TMP_3~0#1;havoc main_~node1____CPAchecker_TMP_2~0#1;havoc main_~node1____CPAchecker_TMP_1~0#1;havoc main_~node1____CPAchecker_TMP_0~0#1; [2025-03-16 19:23:08,492 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1906: havoc main_~node2____CPAchecker_TMP_3~0#1;havoc main_~node2____CPAchecker_TMP_2~0#1;havoc main_~node2____CPAchecker_TMP_1~0#1;havoc main_~node2____CPAchecker_TMP_0~0#1; [2025-03-16 19:23:08,492 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1724: havoc main_~node3____CPAchecker_TMP_3~0#1;havoc main_~node3____CPAchecker_TMP_2~0#1;havoc main_~node3____CPAchecker_TMP_1~0#1;havoc main_~node3____CPAchecker_TMP_0~0#1; [2025-03-16 19:23:08,492 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L213: 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:08,492 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1542: havoc main_~node4____CPAchecker_TMP_3~0#1;havoc main_~node4____CPAchecker_TMP_2~0#1;havoc main_~node4____CPAchecker_TMP_1~0#1;havoc main_~node4____CPAchecker_TMP_0~0#1; [2025-03-16 19:23:08,922 INFO L? ?]: Removed 251 outVars from TransFormulas that were not future-live. [2025-03-16 19:23:08,922 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 19:23:08,955 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 19:23:08,959 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 19:23:08,959 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 07:23:08 BoogieIcfgContainer [2025-03-16 19:23:08,959 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 19:23:08,961 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 19:23:08,962 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 19:23:08,965 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 19:23:08,966 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 07:23:05" (1/3) ... [2025-03-16 19:23:08,966 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47ecff55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 07:23:08, skipping insertion in model container [2025-03-16 19:23:08,967 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:23:06" (2/3) ... [2025-03-16 19:23:08,967 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47ecff55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 07:23:08, skipping insertion in model container [2025-03-16 19:23:08,968 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 07:23:08" (3/3) ... [2025-03-16 19:23:08,969 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_floodmax.5.2.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2025-03-16 19:23:08,981 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 19:23:08,984 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_floodmax.5.2.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c that has 1 procedures, 744 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-03-16 19:23:09,044 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 19:23:09,051 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;@3f3785de, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 19:23:09,052 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 19:23:09,057 INFO L276 IsEmpty]: Start isEmpty. Operand has 744 states, 742 states have (on average 1.8382749326145553) internal successors, (1364), 743 states have internal predecessors, (1364), 0 states have call successors, (0), 0 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:09,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2025-03-16 19:23:09,074 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:23:09,075 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] [2025-03-16 19:23:09,075 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:23:09,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:23:09,079 INFO L85 PathProgramCache]: Analyzing trace with hash 633466794, now seen corresponding path program 1 times [2025-03-16 19:23:09,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:23:09,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911281070] [2025-03-16 19:23:09,084 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:23:09,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:23:09,192 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 202 statements into 1 equivalence classes. [2025-03-16 19:23:09,439 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 202 of 202 statements. [2025-03-16 19:23:09,442 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:23:09,442 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:23:09,887 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:09,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:23:09,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911281070] [2025-03-16 19:23:09,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911281070] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:23:09,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:23:09,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:23:09,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428940527] [2025-03-16 19:23:09,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:23:09,893 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:23:09,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:23:09,909 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:23:09,910 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:23:09,912 INFO L87 Difference]: Start difference. First operand has 744 states, 742 states have (on average 1.8382749326145553) internal successors, (1364), 743 states have internal predecessors, (1364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 67.33333333333333) internal successors, (202), 3 states have internal predecessors, (202), 0 states have call successors, (0), 0 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:10,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:23:10,036 INFO L93 Difference]: Finished difference Result 1135 states and 2021 transitions. [2025-03-16 19:23:10,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:23:10,038 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 67.33333333333333) internal successors, (202), 3 states have internal predecessors, (202), 0 states have call successors, (0), 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 202 [2025-03-16 19:23:10,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:23:10,054 INFO L225 Difference]: With dead ends: 1135 [2025-03-16 19:23:10,057 INFO L226 Difference]: Without dead ends: 927 [2025-03-16 19:23:10,061 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:10,063 INFO L435 NwaCegarLoop]: 1359 mSDtfsCounter, 352 mSDsluCounter, 1255 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 352 SdHoareTripleChecker+Valid, 2614 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:23:10,064 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [352 Valid, 2614 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:23:10,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 927 states. [2025-03-16 19:23:10,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 927 to 924. [2025-03-16 19:23:10,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 924 states, 923 states have (on average 1.7388949079089924) internal successors, (1605), 923 states have internal predecessors, (1605), 0 states have call successors, (0), 0 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:10,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 924 states to 924 states and 1605 transitions. [2025-03-16 19:23:10,131 INFO L78 Accepts]: Start accepts. Automaton has 924 states and 1605 transitions. Word has length 202 [2025-03-16 19:23:10,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:23:10,133 INFO L471 AbstractCegarLoop]: Abstraction has 924 states and 1605 transitions. [2025-03-16 19:23:10,134 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 67.33333333333333) internal successors, (202), 3 states have internal predecessors, (202), 0 states have call successors, (0), 0 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:10,134 INFO L276 IsEmpty]: Start isEmpty. Operand 924 states and 1605 transitions. [2025-03-16 19:23:10,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2025-03-16 19:23:10,137 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:23:10,138 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] [2025-03-16 19:23:10,138 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 19:23:10,138 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:23:10,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:23:10,138 INFO L85 PathProgramCache]: Analyzing trace with hash -1405423407, now seen corresponding path program 1 times [2025-03-16 19:23:10,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:23:10,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252294449] [2025-03-16 19:23:10,139 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:23:10,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:23:10,172 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes. [2025-03-16 19:23:10,235 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements. [2025-03-16 19:23:10,236 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:23:10,236 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:23:10,467 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:10,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:23:10,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252294449] [2025-03-16 19:23:10,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [252294449] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:23:10,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:23:10,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:23:10,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812527162] [2025-03-16 19:23:10,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:23:10,468 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:23:10,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:23:10,469 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:23:10,469 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:23:10,469 INFO L87 Difference]: Start difference. First operand 924 states and 1605 transitions. Second operand has 3 states, 3 states have (on average 68.66666666666667) internal successors, (206), 3 states have internal predecessors, (206), 0 states have call successors, (0), 0 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:10,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:23:10,515 INFO L93 Difference]: Finished difference Result 1666 states and 2849 transitions. [2025-03-16 19:23:10,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:23:10,516 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 68.66666666666667) internal successors, (206), 3 states have internal predecessors, (206), 0 states have call successors, (0), 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 206 [2025-03-16 19:23:10,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:23:10,522 INFO L225 Difference]: With dead ends: 1666 [2025-03-16 19:23:10,522 INFO L226 Difference]: Without dead ends: 1284 [2025-03-16 19:23:10,524 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:10,524 INFO L435 NwaCegarLoop]: 1297 mSDtfsCounter, 306 mSDsluCounter, 1247 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 306 SdHoareTripleChecker+Valid, 2544 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:23:10,524 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [306 Valid, 2544 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:23:10,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1284 states. [2025-03-16 19:23:10,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1284 to 1280. [2025-03-16 19:23:10,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1280 states, 1279 states have (on average 1.7193119624706803) internal successors, (2199), 1279 states have internal predecessors, (2199), 0 states have call successors, (0), 0 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:10,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1280 states to 1280 states and 2199 transitions. [2025-03-16 19:23:10,555 INFO L78 Accepts]: Start accepts. Automaton has 1280 states and 2199 transitions. Word has length 206 [2025-03-16 19:23:10,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:23:10,556 INFO L471 AbstractCegarLoop]: Abstraction has 1280 states and 2199 transitions. [2025-03-16 19:23:10,556 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 68.66666666666667) internal successors, (206), 3 states have internal predecessors, (206), 0 states have call successors, (0), 0 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:10,557 INFO L276 IsEmpty]: Start isEmpty. Operand 1280 states and 2199 transitions. [2025-03-16 19:23:10,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2025-03-16 19:23:10,559 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:23:10,560 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] [2025-03-16 19:23:10,560 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 19:23:10,560 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:23:10,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:23:10,565 INFO L85 PathProgramCache]: Analyzing trace with hash -992121526, now seen corresponding path program 1 times [2025-03-16 19:23:10,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:23:10,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884789711] [2025-03-16 19:23:10,565 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:23:10,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:23:10,595 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 210 statements into 1 equivalence classes. [2025-03-16 19:23:10,640 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 210 of 210 statements. [2025-03-16 19:23:10,641 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:23:10,641 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:23:10,830 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:10,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:23:10,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884789711] [2025-03-16 19:23:10,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [884789711] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:23:10,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:23:10,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:23:10,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666231624] [2025-03-16 19:23:10,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:23:10,832 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:23:10,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:23:10,832 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:23:10,832 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:23:10,833 INFO L87 Difference]: Start difference. First operand 1280 states and 2199 transitions. Second operand has 3 states, 3 states have (on average 70.0) internal successors, (210), 3 states have internal predecessors, (210), 0 states have call successors, (0), 0 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:10,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:23:10,931 INFO L93 Difference]: Finished difference Result 2712 states and 4589 transitions. [2025-03-16 19:23:10,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:23:10,932 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 70.0) internal successors, (210), 3 states have internal predecessors, (210), 0 states have call successors, (0), 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 210 [2025-03-16 19:23:10,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:23:10,941 INFO L225 Difference]: With dead ends: 2712 [2025-03-16 19:23:10,941 INFO L226 Difference]: Without dead ends: 1974 [2025-03-16 19:23:10,943 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:10,944 INFO L435 NwaCegarLoop]: 1297 mSDtfsCounter, 299 mSDsluCounter, 1248 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 299 SdHoareTripleChecker+Valid, 2545 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:23:10,945 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [299 Valid, 2545 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:23:10,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1974 states. [2025-03-16 19:23:10,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1974 to 1968. [2025-03-16 19:23:10,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1968 states, 1967 states have (on average 1.697508896797153) internal successors, (3339), 1967 states have internal predecessors, (3339), 0 states have call successors, (0), 0 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:10,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1968 states to 1968 states and 3339 transitions. [2025-03-16 19:23:10,989 INFO L78 Accepts]: Start accepts. Automaton has 1968 states and 3339 transitions. Word has length 210 [2025-03-16 19:23:10,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:23:10,989 INFO L471 AbstractCegarLoop]: Abstraction has 1968 states and 3339 transitions. [2025-03-16 19:23:10,990 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 70.0) internal successors, (210), 3 states have internal predecessors, (210), 0 states have call successors, (0), 0 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:10,990 INFO L276 IsEmpty]: Start isEmpty. Operand 1968 states and 3339 transitions. [2025-03-16 19:23:10,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2025-03-16 19:23:10,994 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:23:10,994 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] [2025-03-16 19:23:10,994 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 19:23:10,995 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:23:10,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:23:10,995 INFO L85 PathProgramCache]: Analyzing trace with hash -1025876047, now seen corresponding path program 1 times [2025-03-16 19:23:10,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:23:10,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887451039] [2025-03-16 19:23:10,996 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:23:10,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:23:11,040 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 214 statements into 1 equivalence classes. [2025-03-16 19:23:11,089 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 214 of 214 statements. [2025-03-16 19:23:11,089 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:23:11,089 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:23:11,282 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:23:11,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:23:11,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887451039] [2025-03-16 19:23:11,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1887451039] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:23:11,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:23:11,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:23:11,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508040688] [2025-03-16 19:23:11,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:23:11,283 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:23:11,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:23:11,284 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:23:11,284 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:23:11,284 INFO L87 Difference]: Start difference. First operand 1968 states and 3339 transitions. Second operand has 3 states, 3 states have (on average 71.33333333333333) internal successors, (214), 3 states have internal predecessors, (214), 0 states have call successors, (0), 0 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:11,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:23:11,349 INFO L93 Difference]: Finished difference Result 4732 states and 7925 transitions. [2025-03-16 19:23:11,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:23:11,349 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 71.33333333333333) internal successors, (214), 3 states have internal predecessors, (214), 0 states have call successors, (0), 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 214 [2025-03-16 19:23:11,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:23:11,360 INFO L225 Difference]: With dead ends: 4732 [2025-03-16 19:23:11,361 INFO L226 Difference]: Without dead ends: 3306 [2025-03-16 19:23:11,365 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:11,367 INFO L435 NwaCegarLoop]: 1297 mSDtfsCounter, 292 mSDsluCounter, 1249 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 292 SdHoareTripleChecker+Valid, 2546 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:23:11,368 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [292 Valid, 2546 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:23:11,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3306 states. [2025-03-16 19:23:11,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3306 to 3296. [2025-03-16 19:23:11,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3296 states, 3295 states have (on average 1.676176024279211) internal successors, (5523), 3295 states have internal predecessors, (5523), 0 states have call successors, (0), 0 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:11,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3296 states to 3296 states and 5523 transitions. [2025-03-16 19:23:11,432 INFO L78 Accepts]: Start accepts. Automaton has 3296 states and 5523 transitions. Word has length 214 [2025-03-16 19:23:11,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:23:11,433 INFO L471 AbstractCegarLoop]: Abstraction has 3296 states and 5523 transitions. [2025-03-16 19:23:11,433 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 71.33333333333333) internal successors, (214), 3 states have internal predecessors, (214), 0 states have call successors, (0), 0 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:11,434 INFO L276 IsEmpty]: Start isEmpty. Operand 3296 states and 5523 transitions. [2025-03-16 19:23:11,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2025-03-16 19:23:11,437 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:23:11,437 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] [2025-03-16 19:23:11,437 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 19:23:11,437 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:23:11,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:23:11,438 INFO L85 PathProgramCache]: Analyzing trace with hash -387435798, now seen corresponding path program 1 times [2025-03-16 19:23:11,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:23:11,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963326085] [2025-03-16 19:23:11,438 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:23:11,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:23:11,472 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 218 statements into 1 equivalence classes. [2025-03-16 19:23:11,504 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 218 of 218 statements. [2025-03-16 19:23:11,505 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:23:11,505 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:23:11,660 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:11,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:23:11,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963326085] [2025-03-16 19:23:11,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1963326085] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:23:11,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:23:11,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:23:11,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367896795] [2025-03-16 19:23:11,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:23:11,661 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:23:11,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:23:11,662 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:23:11,662 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:23:11,662 INFO L87 Difference]: Start difference. First operand 3296 states and 5523 transitions. Second operand has 3 states, 3 states have (on average 72.66666666666667) internal successors, (218), 3 states have internal predecessors, (218), 0 states have call successors, (0), 0 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:11,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:23:11,787 INFO L93 Difference]: Finished difference Result 8628 states and 14309 transitions. [2025-03-16 19:23:11,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:23:11,788 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 72.66666666666667) internal successors, (218), 3 states have internal predecessors, (218), 0 states have call successors, (0), 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 218 [2025-03-16 19:23:11,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:23:11,807 INFO L225 Difference]: With dead ends: 8628 [2025-03-16 19:23:11,807 INFO L226 Difference]: Without dead ends: 5874 [2025-03-16 19:23:11,812 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:11,814 INFO L435 NwaCegarLoop]: 1297 mSDtfsCounter, 285 mSDsluCounter, 1250 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 285 SdHoareTripleChecker+Valid, 2547 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:23:11,814 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [285 Valid, 2547 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:23:11,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5874 states. [2025-03-16 19:23:11,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5874 to 5856. [2025-03-16 19:23:11,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5856 states, 5855 states have (on average 1.656532877882152) internal successors, (9699), 5855 states have internal predecessors, (9699), 0 states have call successors, (0), 0 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:11,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5856 states to 5856 states and 9699 transitions. [2025-03-16 19:23:11,933 INFO L78 Accepts]: Start accepts. Automaton has 5856 states and 9699 transitions. Word has length 218 [2025-03-16 19:23:11,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:23:11,934 INFO L471 AbstractCegarLoop]: Abstraction has 5856 states and 9699 transitions. [2025-03-16 19:23:11,934 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 72.66666666666667) internal successors, (218), 3 states have internal predecessors, (218), 0 states have call successors, (0), 0 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:11,934 INFO L276 IsEmpty]: Start isEmpty. Operand 5856 states and 9699 transitions. [2025-03-16 19:23:11,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2025-03-16 19:23:11,938 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:23:11,938 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] [2025-03-16 19:23:11,938 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 19:23:11,939 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:23:11,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:23:11,940 INFO L85 PathProgramCache]: Analyzing trace with hash -390134127, now seen corresponding path program 1 times [2025-03-16 19:23:11,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:23:11,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174781380] [2025-03-16 19:23:11,941 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:23:11,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:23:11,965 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 222 statements into 1 equivalence classes. [2025-03-16 19:23:12,002 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 222 of 222 statements. [2025-03-16 19:23:12,002 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:23:12,002 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:23:12,305 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:12,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:23:12,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174781380] [2025-03-16 19:23:12,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [174781380] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:23:12,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:23:12,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 19:23:12,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021419528] [2025-03-16 19:23:12,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:23:12,306 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 19:23:12,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:23:12,306 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 19:23:12,307 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-16 19:23:12,307 INFO L87 Difference]: Start difference. First operand 5856 states and 9699 transitions. Second operand has 7 states, 7 states have (on average 31.714285714285715) internal successors, (222), 7 states have internal predecessors, (222), 0 states have call successors, (0), 0 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:12,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:23:12,963 INFO L93 Difference]: Finished difference Result 35860 states and 59453 transitions. [2025-03-16 19:23:12,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-16 19:23:12,964 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 31.714285714285715) internal successors, (222), 7 states have internal predecessors, (222), 0 states have call successors, (0), 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 222 [2025-03-16 19:23:12,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:23:13,048 INFO L225 Difference]: With dead ends: 35860 [2025-03-16 19:23:13,048 INFO L226 Difference]: Without dead ends: 30546 [2025-03-16 19:23:13,061 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2025-03-16 19:23:13,061 INFO L435 NwaCegarLoop]: 1316 mSDtfsCounter, 3587 mSDsluCounter, 12433 mSDsCounter, 0 mSdLazyCounter, 370 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3587 SdHoareTripleChecker+Valid, 13749 SdHoareTripleChecker+Invalid, 373 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 370 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 19:23:13,062 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3587 Valid, 13749 Invalid, 373 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 370 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 19:23:13,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30546 states. [2025-03-16 19:23:13,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30546 to 10973. [2025-03-16 19:23:13,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10973 states, 10972 states have (on average 1.6499270871308787) internal successors, (18103), 10972 states have internal predecessors, (18103), 0 states have call successors, (0), 0 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,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10973 states to 10973 states and 18103 transitions. [2025-03-16 19:23:13,442 INFO L78 Accepts]: Start accepts. Automaton has 10973 states and 18103 transitions. Word has length 222 [2025-03-16 19:23:13,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:23:13,442 INFO L471 AbstractCegarLoop]: Abstraction has 10973 states and 18103 transitions. [2025-03-16 19:23:13,442 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 31.714285714285715) internal successors, (222), 7 states have internal predecessors, (222), 0 states have call successors, (0), 0 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,443 INFO L276 IsEmpty]: Start isEmpty. Operand 10973 states and 18103 transitions. [2025-03-16 19:23:13,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2025-03-16 19:23:13,447 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:23:13,448 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] [2025-03-16 19:23:13,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 19:23:13,449 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:23:13,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:23:13,449 INFO L85 PathProgramCache]: Analyzing trace with hash 792801520, now seen corresponding path program 1 times [2025-03-16 19:23:13,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:23:13,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005713053] [2025-03-16 19:23:13,449 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:23:13,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:23:13,474 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 223 statements into 1 equivalence classes. [2025-03-16 19:23:13,529 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 223 of 223 statements. [2025-03-16 19:23:13,529 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:23:13,529 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:23:13,683 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:13,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:23:13,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005713053] [2025-03-16 19:23:13,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1005713053] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:23:13,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:23:13,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:23:13,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31104423] [2025-03-16 19:23:13,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:23:13,683 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:23:13,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:23:13,684 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:23:13,684 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:23:13,684 INFO L87 Difference]: Start difference. First operand 10973 states and 18103 transitions. Second operand has 4 states, 4 states have (on average 55.75) internal successors, (223), 4 states have internal predecessors, (223), 0 states have call successors, (0), 0 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,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:23:13,898 INFO L93 Difference]: Finished difference Result 32182 states and 53196 transitions. [2025-03-16 19:23:13,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:23:13,902 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 55.75) internal successors, (223), 4 states have internal predecessors, (223), 0 states have call successors, (0), 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 223 [2025-03-16 19:23:13,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:23:13,945 INFO L225 Difference]: With dead ends: 32182 [2025-03-16 19:23:13,946 INFO L226 Difference]: Without dead ends: 21751 [2025-03-16 19:23:13,968 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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:13,969 INFO L435 NwaCegarLoop]: 1303 mSDtfsCounter, 980 mSDsluCounter, 2871 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 980 SdHoareTripleChecker+Valid, 4174 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:23:13,970 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [980 Valid, 4174 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:23:13,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21751 states. [2025-03-16 19:23:14,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21751 to 16329. [2025-03-16 19:23:14,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16329 states, 16328 states have (on average 1.6507839294463498) internal successors, (26954), 16328 states have internal predecessors, (26954), 0 states have call successors, (0), 0 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:14,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16329 states to 16329 states and 26954 transitions. [2025-03-16 19:23:14,305 INFO L78 Accepts]: Start accepts. Automaton has 16329 states and 26954 transitions. Word has length 223 [2025-03-16 19:23:14,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:23:14,306 INFO L471 AbstractCegarLoop]: Abstraction has 16329 states and 26954 transitions. [2025-03-16 19:23:14,306 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 55.75) internal successors, (223), 4 states have internal predecessors, (223), 0 states have call successors, (0), 0 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:14,307 INFO L276 IsEmpty]: Start isEmpty. Operand 16329 states and 26954 transitions. [2025-03-16 19:23:14,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2025-03-16 19:23:14,314 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:23:14,314 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] [2025-03-16 19:23:14,314 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 19:23:14,314 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:23:14,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:23:14,314 INFO L85 PathProgramCache]: Analyzing trace with hash -1190988460, now seen corresponding path program 1 times [2025-03-16 19:23:14,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:23:14,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539907963] [2025-03-16 19:23:14,315 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:23:14,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:23:14,339 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 224 statements into 1 equivalence classes. [2025-03-16 19:23:14,371 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 224 of 224 statements. [2025-03-16 19:23:14,372 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:23:14,372 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:23:14,517 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:14,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:23:14,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539907963] [2025-03-16 19:23:14,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [539907963] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:23:14,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:23:14,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:23:14,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083788807] [2025-03-16 19:23:14,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:23:14,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:23:14,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:23:14,518 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:23:14,518 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:23:14,519 INFO L87 Difference]: Start difference. First operand 16329 states and 26954 transitions. Second operand has 4 states, 4 states have (on average 56.0) internal successors, (224), 4 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:23:14,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:23:14,743 INFO L93 Difference]: Finished difference Result 48154 states and 79554 transitions. [2025-03-16 19:23:14,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:23:14,744 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 56.0) internal successors, (224), 4 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 224 [2025-03-16 19:23:14,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:23:14,802 INFO L225 Difference]: With dead ends: 48154 [2025-03-16 19:23:14,802 INFO L226 Difference]: Without dead ends: 32367 [2025-03-16 19:23:14,831 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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:14,831 INFO L435 NwaCegarLoop]: 1288 mSDtfsCounter, 980 mSDsluCounter, 2678 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 980 SdHoareTripleChecker+Valid, 3966 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:23:14,832 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [980 Valid, 3966 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:23:14,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32367 states. [2025-03-16 19:23:15,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32367 to 24300. [2025-03-16 19:23:15,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24300 states, 24299 states have (on average 1.6491625169760074) internal successors, (40073), 24299 states have internal predecessors, (40073), 0 states have call successors, (0), 0 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:15,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24300 states to 24300 states and 40073 transitions. [2025-03-16 19:23:15,291 INFO L78 Accepts]: Start accepts. Automaton has 24300 states and 40073 transitions. Word has length 224 [2025-03-16 19:23:15,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:23:15,292 INFO L471 AbstractCegarLoop]: Abstraction has 24300 states and 40073 transitions. [2025-03-16 19:23:15,292 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 56.0) internal successors, (224), 4 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:23:15,292 INFO L276 IsEmpty]: Start isEmpty. Operand 24300 states and 40073 transitions. [2025-03-16 19:23:15,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2025-03-16 19:23:15,302 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:23:15,303 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] [2025-03-16 19:23:15,303 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 19:23:15,303 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:23:15,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:23:15,304 INFO L85 PathProgramCache]: Analyzing trace with hash -1229204845, now seen corresponding path program 1 times [2025-03-16 19:23:15,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:23:15,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995026860] [2025-03-16 19:23:15,304 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:23:15,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:23:15,331 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 225 statements into 1 equivalence classes. [2025-03-16 19:23:15,365 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 225 of 225 statements. [2025-03-16 19:23:15,365 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:23:15,365 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:23:15,469 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,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:23:15,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995026860] [2025-03-16 19:23:15,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [995026860] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:23:15,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:23:15,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:23:15,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354837810] [2025-03-16 19:23:15,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:23:15,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:23:15,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:23:15,471 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:23:15,471 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:23:15,471 INFO L87 Difference]: Start difference. First operand 24300 states and 40073 transitions. Second operand has 3 states, 3 states have (on average 75.0) internal successors, (225), 3 states have internal predecessors, (225), 0 states have call successors, (0), 0 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:15,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:23:15,674 INFO L93 Difference]: Finished difference Result 53888 states and 89152 transitions. [2025-03-16 19:23:15,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:23:15,675 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 75.0) internal successors, (225), 3 states have internal predecessors, (225), 0 states have call successors, (0), 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 225 [2025-03-16 19:23:15,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:23:15,744 INFO L225 Difference]: With dead ends: 53888 [2025-03-16 19:23:15,744 INFO L226 Difference]: Without dead ends: 37472 [2025-03-16 19:23:15,769 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:15,769 INFO L435 NwaCegarLoop]: 1567 mSDtfsCounter, 312 mSDsluCounter, 1255 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 312 SdHoareTripleChecker+Valid, 2822 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:23:15,770 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [312 Valid, 2822 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:23:15,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37472 states. [2025-03-16 19:23:16,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37472 to 37470. [2025-03-16 19:23:16,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37470 states, 37469 states have (on average 1.6490965865115161) internal successors, (61790), 37469 states have internal predecessors, (61790), 0 states have call successors, (0), 0 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,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37470 states to 37470 states and 61790 transitions. [2025-03-16 19:23:16,233 INFO L78 Accepts]: Start accepts. Automaton has 37470 states and 61790 transitions. Word has length 225 [2025-03-16 19:23:16,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:23:16,233 INFO L471 AbstractCegarLoop]: Abstraction has 37470 states and 61790 transitions. [2025-03-16 19:23:16,233 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 75.0) internal successors, (225), 3 states have internal predecessors, (225), 0 states have call successors, (0), 0 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,234 INFO L276 IsEmpty]: Start isEmpty. Operand 37470 states and 61790 transitions. [2025-03-16 19:23:16,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2025-03-16 19:23:16,238 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:23:16,238 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,238 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 19:23:16,238 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:23:16,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:23:16,240 INFO L85 PathProgramCache]: Analyzing trace with hash 1268949792, now seen corresponding path program 1 times [2025-03-16 19:23:16,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:23:16,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074788108] [2025-03-16 19:23:16,240 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:23:16,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:23:16,271 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 225 statements into 1 equivalence classes. [2025-03-16 19:23:16,302 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 225 of 225 statements. [2025-03-16 19:23:16,302 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:23:16,302 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:23:16,498 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,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:23:16,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074788108] [2025-03-16 19:23:16,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2074788108] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:23:16,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:23:16,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:23:16,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481200179] [2025-03-16 19:23:16,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:23:16,500 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:23:16,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:23:16,501 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:23:16,501 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:23:16,501 INFO L87 Difference]: Start difference. First operand 37470 states and 61790 transitions. Second operand has 3 states, 3 states have (on average 75.0) internal successors, (225), 3 states have internal predecessors, (225), 0 states have call successors, (0), 0 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,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:23:16,755 INFO L93 Difference]: Finished difference Result 82780 states and 136696 transitions. [2025-03-16 19:23:16,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:23:16,755 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 75.0) internal successors, (225), 3 states have internal predecessors, (225), 0 states have call successors, (0), 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 225 [2025-03-16 19:23:16,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:23:16,864 INFO L225 Difference]: With dead ends: 82780 [2025-03-16 19:23:16,864 INFO L226 Difference]: Without dead ends: 57427 [2025-03-16 19:23:16,904 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,904 INFO L435 NwaCegarLoop]: 1540 mSDtfsCounter, 305 mSDsluCounter, 1256 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 305 SdHoareTripleChecker+Valid, 2796 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:23:16,905 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [305 Valid, 2796 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:23:16,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57427 states. [2025-03-16 19:23:17,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57427 to 57425. [2025-03-16 19:23:17,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57425 states, 57424 states have (on average 1.6464718584563944) internal successors, (94547), 57424 states have internal predecessors, (94547), 0 states have call successors, (0), 0 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,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57425 states to 57425 states and 94547 transitions. [2025-03-16 19:23:17,840 INFO L78 Accepts]: Start accepts. Automaton has 57425 states and 94547 transitions. Word has length 225 [2025-03-16 19:23:17,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:23:17,840 INFO L471 AbstractCegarLoop]: Abstraction has 57425 states and 94547 transitions. [2025-03-16 19:23:17,840 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 75.0) internal successors, (225), 3 states have internal predecessors, (225), 0 states have call successors, (0), 0 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,841 INFO L276 IsEmpty]: Start isEmpty. Operand 57425 states and 94547 transitions. [2025-03-16 19:23:17,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2025-03-16 19:23:17,844 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:23:17,844 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,845 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 19:23:17,845 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:23:17,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:23:17,846 INFO L85 PathProgramCache]: Analyzing trace with hash 331720499, now seen corresponding path program 1 times [2025-03-16 19:23:17,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:23:17,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786120783] [2025-03-16 19:23:17,847 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:23:17,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:23:17,882 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 225 statements into 1 equivalence classes. [2025-03-16 19:23:17,919 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 225 of 225 statements. [2025-03-16 19:23:17,919 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:23:17,919 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:23:18,028 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,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:23:18,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786120783] [2025-03-16 19:23:18,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [786120783] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:23:18,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:23:18,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:23:18,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333920586] [2025-03-16 19:23:18,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:23:18,030 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:23:18,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:23:18,030 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:23:18,031 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:23:18,031 INFO L87 Difference]: Start difference. First operand 57425 states and 94547 transitions. Second operand has 3 states, 3 states have (on average 75.0) internal successors, (225), 3 states have internal predecessors, (225), 0 states have call successors, (0), 0 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,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:23:18,426 INFO L93 Difference]: Finished difference Result 110853 states and 182946 transitions. [2025-03-16 19:23:18,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:23:18,427 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 75.0) internal successors, (225), 3 states have internal predecessors, (225), 0 states have call successors, (0), 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 225 [2025-03-16 19:23:18,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:23:18,592 INFO L225 Difference]: With dead ends: 110853 [2025-03-16 19:23:18,593 INFO L226 Difference]: Without dead ends: 80650 [2025-03-16 19:23:18,636 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,638 INFO L435 NwaCegarLoop]: 1506 mSDtfsCounter, 298 mSDsluCounter, 1257 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 298 SdHoareTripleChecker+Valid, 2763 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:23:18,638 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [298 Valid, 2763 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:23:18,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80650 states. [2025-03-16 19:23:19,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80650 to 80648. [2025-03-16 19:23:19,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80648 states, 80647 states have (on average 1.6449712946544819) internal successors, (132662), 80647 states have internal predecessors, (132662), 0 states have call successors, (0), 0 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,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80648 states to 80648 states and 132662 transitions. [2025-03-16 19:23:19,696 INFO L78 Accepts]: Start accepts. Automaton has 80648 states and 132662 transitions. Word has length 225 [2025-03-16 19:23:19,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:23:19,696 INFO L471 AbstractCegarLoop]: Abstraction has 80648 states and 132662 transitions. [2025-03-16 19:23:19,696 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 75.0) internal successors, (225), 3 states have internal predecessors, (225), 0 states have call successors, (0), 0 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,696 INFO L276 IsEmpty]: Start isEmpty. Operand 80648 states and 132662 transitions. [2025-03-16 19:23:19,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2025-03-16 19:23:19,698 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:23:19,698 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] [2025-03-16 19:23:19,699 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-16 19:23:19,699 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:23:19,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:23:19,699 INFO L85 PathProgramCache]: Analyzing trace with hash -371584045, now seen corresponding path program 1 times [2025-03-16 19:23:19,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:23:19,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044546892] [2025-03-16 19:23:19,699 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:23:19,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:23:19,721 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 225 statements into 1 equivalence classes. [2025-03-16 19:23:19,744 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 225 of 225 statements. [2025-03-16 19:23:19,745 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:23:19,745 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:23:19,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:23:19,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:23:19,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044546892] [2025-03-16 19:23:19,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2044546892] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:23:19,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:23:19,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:23:19,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299542461] [2025-03-16 19:23:19,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:23:19,821 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:23:19,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:23:19,821 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:23:19,821 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:23:19,821 INFO L87 Difference]: Start difference. First operand 80648 states and 132662 transitions. Second operand has 3 states, 3 states have (on average 75.0) internal successors, (225), 3 states have internal predecessors, (225), 0 states have call successors, (0), 0 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,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:23:20,462 INFO L93 Difference]: Finished difference Result 155017 states and 255707 transitions. [2025-03-16 19:23:20,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:23:20,463 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 75.0) internal successors, (225), 3 states have internal predecessors, (225), 0 states have call successors, (0), 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 225 [2025-03-16 19:23:20,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:23:20,663 INFO L225 Difference]: With dead ends: 155017 [2025-03-16 19:23:20,663 INFO L226 Difference]: Without dead ends: 112612 [2025-03-16 19:23:20,718 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,718 INFO L435 NwaCegarLoop]: 1412 mSDtfsCounter, 284 mSDsluCounter, 1259 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 284 SdHoareTripleChecker+Valid, 2671 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:23:20,718 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [284 Valid, 2671 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:23:20,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112612 states. [2025-03-16 19:23:22,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112612 to 112610. [2025-03-16 19:23:22,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112610 states, 112609 states have (on average 1.6435542452201866) internal successors, (185079), 112609 states have internal predecessors, (185079), 0 states have call successors, (0), 0 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,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112610 states to 112610 states and 185079 transitions. [2025-03-16 19:23:22,341 INFO L78 Accepts]: Start accepts. Automaton has 112610 states and 185079 transitions. Word has length 225 [2025-03-16 19:23:22,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:23:22,342 INFO L471 AbstractCegarLoop]: Abstraction has 112610 states and 185079 transitions. [2025-03-16 19:23:22,342 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 75.0) internal successors, (225), 3 states have internal predecessors, (225), 0 states have call successors, (0), 0 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,342 INFO L276 IsEmpty]: Start isEmpty. Operand 112610 states and 185079 transitions. [2025-03-16 19:23:22,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2025-03-16 19:23:22,519 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:23:22,520 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] [2025-03-16 19:23:22,520 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-16 19:23:22,520 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:23:22,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:23:22,521 INFO L85 PathProgramCache]: Analyzing trace with hash 1735942227, now seen corresponding path program 1 times [2025-03-16 19:23:22,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:23:22,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349926246] [2025-03-16 19:23:22,521 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:23:22,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:23:22,545 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 225 statements into 1 equivalence classes. [2025-03-16 19:23:22,571 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 225 of 225 statements. [2025-03-16 19:23:22,571 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:23:22,571 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:23:22,741 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,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:23:22,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349926246] [2025-03-16 19:23:22,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1349926246] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:23:22,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:23:22,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:23:22,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412725866] [2025-03-16 19:23:22,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:23:22,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:23:22,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:23:22,743 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:23:22,744 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:23:22,744 INFO L87 Difference]: Start difference. First operand 112610 states and 185079 transitions. Second operand has 4 states, 4 states have (on average 56.25) internal successors, (225), 4 states have internal predecessors, (225), 0 states have call successors, (0), 0 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,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:23:23,917 INFO L93 Difference]: Finished difference Result 368799 states and 607278 transitions. [2025-03-16 19:23:23,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:23:23,917 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 56.25) internal successors, (225), 4 states have internal predecessors, (225), 0 states have call successors, (0), 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 225 [2025-03-16 19:23:23,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:23:24,351 INFO L225 Difference]: With dead ends: 368799 [2025-03-16 19:23:24,351 INFO L226 Difference]: Without dead ends: 256840 [2025-03-16 19:23:24,449 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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:24,450 INFO L435 NwaCegarLoop]: 1289 mSDtfsCounter, 978 mSDsluCounter, 2875 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 978 SdHoareTripleChecker+Valid, 4164 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:23:24,450 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [978 Valid, 4164 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:23:24,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256840 states. [2025-03-16 19:23:26,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256840 to 184432. [2025-03-16 19:23:26,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184432 states, 184431 states have (on average 1.6415244725669762) internal successors, (302748), 184431 states have internal predecessors, (302748), 0 states have call successors, (0), 0 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:27,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184432 states to 184432 states and 302748 transitions. [2025-03-16 19:23:27,232 INFO L78 Accepts]: Start accepts. Automaton has 184432 states and 302748 transitions. Word has length 225 [2025-03-16 19:23:27,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:23:27,233 INFO L471 AbstractCegarLoop]: Abstraction has 184432 states and 302748 transitions. [2025-03-16 19:23:27,233 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 56.25) internal successors, (225), 4 states have internal predecessors, (225), 0 states have call successors, (0), 0 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:27,233 INFO L276 IsEmpty]: Start isEmpty. Operand 184432 states and 302748 transitions. [2025-03-16 19:23:27,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2025-03-16 19:23:27,234 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:23:27,234 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] [2025-03-16 19:23:27,235 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-16 19:23:27,235 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:23:27,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:23:27,235 INFO L85 PathProgramCache]: Analyzing trace with hash 582533760, now seen corresponding path program 1 times [2025-03-16 19:23:27,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:23:27,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725955757] [2025-03-16 19:23:27,235 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:23:27,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:23:27,261 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 225 statements into 1 equivalence classes. [2025-03-16 19:23:27,297 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 225 of 225 statements. [2025-03-16 19:23:27,297 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:23:27,298 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:23:27,455 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,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:23:27,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725955757] [2025-03-16 19:23:27,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1725955757] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:23:27,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:23:27,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:23:27,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816737537] [2025-03-16 19:23:27,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:23:27,457 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:23:27,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:23:27,457 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:23:27,457 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:23:27,458 INFO L87 Difference]: Start difference. First operand 184432 states and 302748 transitions. Second operand has 3 states, 3 states have (on average 75.0) internal successors, (225), 3 states have internal predecessors, (225), 0 states have call successors, (0), 0 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:28,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:23:28,666 INFO L93 Difference]: Finished difference Result 354286 states and 583400 transitions. [2025-03-16 19:23:28,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:23:28,667 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 75.0) internal successors, (225), 3 states have internal predecessors, (225), 0 states have call successors, (0), 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 225 [2025-03-16 19:23:28,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:23:29,406 INFO L225 Difference]: With dead ends: 354286 [2025-03-16 19:23:29,406 INFO L226 Difference]: Without dead ends: 256218 [2025-03-16 19:23:29,477 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:29,477 INFO L435 NwaCegarLoop]: 1471 mSDtfsCounter, 291 mSDsluCounter, 1258 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 291 SdHoareTripleChecker+Valid, 2729 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:23:29,477 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [291 Valid, 2729 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:23:29,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256218 states. [2025-03-16 19:23:31,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256218 to 256216. [2025-03-16 19:23:31,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256216 states, 256215 states have (on average 1.6399156958023535) internal successors, (420171), 256215 states have internal predecessors, (420171), 0 states have call successors, (0), 0 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:32,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256216 states to 256216 states and 420171 transitions. [2025-03-16 19:23:32,913 INFO L78 Accepts]: Start accepts. Automaton has 256216 states and 420171 transitions. Word has length 225 [2025-03-16 19:23:32,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:23:32,914 INFO L471 AbstractCegarLoop]: Abstraction has 256216 states and 420171 transitions. [2025-03-16 19:23:32,914 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 75.0) internal successors, (225), 3 states have internal predecessors, (225), 0 states have call successors, (0), 0 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:32,914 INFO L276 IsEmpty]: Start isEmpty. Operand 256216 states and 420171 transitions. [2025-03-16 19:23:32,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2025-03-16 19:23:32,915 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:23:32,915 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] [2025-03-16 19:23:32,915 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-16 19:23:32,915 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:23:32,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:23:32,916 INFO L85 PathProgramCache]: Analyzing trace with hash -2018576361, now seen corresponding path program 1 times [2025-03-16 19:23:32,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:23:32,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200306937] [2025-03-16 19:23:32,916 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:23:32,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:23:32,951 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 226 statements into 1 equivalence classes. [2025-03-16 19:23:32,972 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 226 of 226 statements. [2025-03-16 19:23:32,972 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:23:32,972 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:23:33,111 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:33,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:23:33,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200306937] [2025-03-16 19:23:33,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [200306937] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:23:33,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:23:33,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:23:33,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100469389] [2025-03-16 19:23:33,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:23:33,112 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:23:33,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:23:33,113 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:23:33,113 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:23:33,113 INFO L87 Difference]: Start difference. First operand 256216 states and 420171 transitions. Second operand has 4 states, 4 states have (on average 56.5) internal successors, (226), 4 states have internal predecessors, (226), 0 states have call successors, (0), 0 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:36,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:23:36,031 INFO L93 Difference]: Finished difference Result 838811 states and 1378557 transitions. [2025-03-16 19:23:36,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:23:36,032 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 56.5) internal successors, (226), 4 states have internal predecessors, (226), 0 states have call successors, (0), 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 226 [2025-03-16 19:23:36,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:23:37,168 INFO L225 Difference]: With dead ends: 838811 [2025-03-16 19:23:37,169 INFO L226 Difference]: Without dead ends: 583230 [2025-03-16 19:23:37,353 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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:37,354 INFO L435 NwaCegarLoop]: 1289 mSDtfsCounter, 976 mSDsluCounter, 2877 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 976 SdHoareTripleChecker+Valid, 4166 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:23:37,354 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [976 Valid, 4166 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:23:37,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583230 states. [2025-03-16 19:23:42,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583230 to 418998. [2025-03-16 19:23:43,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 418998 states, 418997 states have (on average 1.6377539695988277) internal successors, (686214), 418997 states have internal predecessors, (686214), 0 states have call successors, (0), 0 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:44,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418998 states to 418998 states and 686214 transitions. [2025-03-16 19:23:44,320 INFO L78 Accepts]: Start accepts. Automaton has 418998 states and 686214 transitions. Word has length 226 [2025-03-16 19:23:44,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:23:44,321 INFO L471 AbstractCegarLoop]: Abstraction has 418998 states and 686214 transitions. [2025-03-16 19:23:44,321 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 56.5) internal successors, (226), 4 states have internal predecessors, (226), 0 states have call successors, (0), 0 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:44,322 INFO L276 IsEmpty]: Start isEmpty. Operand 418998 states and 686214 transitions. [2025-03-16 19:23:44,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2025-03-16 19:23:44,322 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:23:44,323 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] [2025-03-16 19:23:44,323 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-16 19:23:44,323 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:23:44,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:23:44,326 INFO L85 PathProgramCache]: Analyzing trace with hash 1850342326, now seen corresponding path program 1 times [2025-03-16 19:23:44,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:23:44,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464932524] [2025-03-16 19:23:44,326 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:23:44,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:23:44,362 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 227 statements into 1 equivalence classes. [2025-03-16 19:23:44,392 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 227 of 227 statements. [2025-03-16 19:23:44,392 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:23:44,392 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:23:44,558 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:44,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:23:44,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464932524] [2025-03-16 19:23:44,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464932524] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:23:44,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:23:44,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 19:23:44,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625631865] [2025-03-16 19:23:44,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:23:44,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 19:23:44,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:23:44,561 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 19:23:44,561 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 19:23:44,561 INFO L87 Difference]: Start difference. First operand 418998 states and 686214 transitions. Second operand has 4 states, 4 states have (on average 56.75) internal successors, (227), 4 states have internal predecessors, (227), 0 states have call successors, (0), 0 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,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:23:49,974 INFO L93 Difference]: Finished difference Result 1362091 states and 2235711 transitions. [2025-03-16 19:23:49,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:23:49,974 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 56.75) internal successors, (227), 4 states have internal predecessors, (227), 0 states have call successors, (0), 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 227 [2025-03-16 19:23:49,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:23:51,887 INFO L225 Difference]: With dead ends: 1362091 [2025-03-16 19:23:51,887 INFO L226 Difference]: Without dead ends: 943728